The Community for Technology Leaders
Green Image
<p>Simple transforms for obtaining canonical representation of multiple-valued (MV) functions in polarity k, k in (0, 1,. . ., p/sup n/-1), are presented, where p and n denote the radix and the number of variables of a function. The coefficients in a canonical representation are called spectral coefficients. Various relationships between the functional values of a function and its spectral coefficients are given. Fault detection in an arbitrary MV network is considered using test patterns and spectral techniques. Upper bounds on the number of test patterns for detection of stuck-at and bridging faults at the input lines are shown to be pn and n-1, respectively. Fault detection by spectral techniques is done based on the number of spectral coefficients affected by a fault, and hence it is independent of the technology used for construction of networks and the type of fault. Test set generation for detection of any fault in (E), where (E) denotes all faults in the network, is given. An upper bound on the number of test patterns required to detect all faults in (E) is obtained.</p>
generalised transforms; simple transforms; multiple valued functions; multiple value network; stuck at faults; test set generation; multiple valued circuits; fault detection; canonical representation; radix; spectral coefficients; test patterns; bridging faults; upper bound; fault location; logic circuits; many-valued logics; transforms; VLSI.
T. Damarla, "Generalized Transforms for Multiple Valued Circuits and Their Fault Detection", IEEE Transactions on Computers, vol. 41, no. , pp. 1101-1109, September 1992, doi:10.1109/12.165392
97 ms
(Ver 3.3 (11022016))