This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Minimal Test Set for Multioutput Threshold Circuits Implemented as Sorting Networks
June 1993 (vol. 42 no. 6)
pp. 700-712

It is shown that an n-input sorting network (SN) can be used to implement an n-variable symmetric threshold functions using the least amount of hardware. An algorithm to derive Boolean functions implemented on any line of any n-input threshold circuit T/sup n/ implemented as a SN is given. A heuristic procedure for generating the minimal test set for any threshold circuit T/sup n/ implemented as a Batcher's SN or any other SN is presented. The number of tests required to detect all stuck-at faults in an n-input SN is determined. A highly regular structure using only one type of simple cell and a suitability for low-level pipelining are other advantages of the circuit T/sup n/. The circuit T/sup n/ can be used as a basic building block of various circuitry supporting the use of all known unidirectional error detecting codes.

[1] R. C. Bose and R. J. Nelson, "A sorting problem,"J. ACM, vol. 9, pp. 282-296, Apr. 1962.
[2] K. E. Batcher, "Sorting networks and their applications," inProc. 1968 SJCC, AFIPS, vol. 32, 1968, pp. 307-314.
[3] M. W. Green, "Some improvements in non-adaptive sorting algorithms," inProc. 6th Princeton Conf. Inform. Sci. and Syst., 1972, pp. 387-391.
[4] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[5] R. W. Floyd and D. E. Knuth, "The Bose-Nelson sorting problem," inA Survey of Combinatorial Theory, J. N. Shrivastavaet al., Eds. Amsterdam: North-Holland, 1973, ch. 15, pp. 163-172.
[6] R. L. (Scot) Drysdale and F. H. Young, "Improved divide/sort/merge sorting networks,"SIAM J. Comput., vol. 4, pp. 264-270, Sept. 1975.
[7] D. C. Van Voorhis, "An economical construction for sorting networks," inProc. AFIPS NCC, 1974, pp. 921-927.
[8] E. A. Lamagna, "The complexity of monotone networks for certain bilinear forms, routing problems, sorting, and merging,"IEEE Trans. Comput., vol. C-28, pp. 773-782, Oct. 1979.
[9] S. L. Hurst, "Digital-summation threshold-logic gates: A new circuit element,"Proc. IEE, vol. 120, no. 11, pp. 1301-1307, 1973.
[10] S. M. Reddy and J. R. Wilson, "Easily testable cellular realizations for the (exactlyp)-out-of-nand (por more)-out-of-nlogic functions,"IEEE Trans. Comput., vol. C-23, pp. 98-100, Jan. 1974.
[11] C. R. Edwards, "Some improved designs for the digital summation threshold logic (DSTL) gate,"Comput. J., vol. 21, no. 1, pp. 73-78, 1978.
[12] S. L. Hurst, "Application of multioutput threshold-logic gates to digital-network design,"Proc. IEE, vol. 123, no. 2, pp. 128-134, 1976.
[13] A. Pal, "Logic design using digital summation threshold-logic gates,"IEE Proc., vol. 130, pt. E, pp. 32-36, Jan. 1983.
[14] S. J. Piestrak, "The minimal test set for sorting networks and the use of sorting networks in self-testing checkers for unordered codes," inDig. Papers 20th Int. Fault-Tolerant Comput. Symp., Newcastle upon Tyne, U.K., June 26-28, 1990, pp. 467-474.
[15] S. J. Piestrak, "Efficient encoding/decoding circuitry for systematic unidirectional error-detecting codes," inProc. 5th Int. Conf. Fault-Tolerant Comput. Syst., Nürnberg, FRG, Springer-Verlag, Sept. 25-27, 1991, pp. 181-193.
[16] S. J. Piestrak, "Design of a self-testing checker for Borden code," inProc. ICCD'91, Int. Conf. Computer Design: VLSI in Comput., Cambridge, MA, Oct. 14-16, 1991, pp. 582-585.
[17] D. A. Anderson and G. Metze, "Design of totally self-checking check circuits form-out-of-ncodes,"IEEE Trans. Comput., vol. C-22, pp. 263-269, Mar. 1973.
[18] S. M. Reddy, "A note on self-checking checkers,"IEEE Trans. Comput., vol. C-23, pp. 1100-1102, Oct. 1974.
[19] M. A. Marouf and A. D. Friedman, "Efficient design of self-checking checker for anym-out-of-ncode,"IEEE Trans. Comput., vol. C-27, pp. 482-490, June 1978.
[20] N. Gaitanis and C. Halatsis, "A new design method form-out-of-ncheckers,"IEEE Trans. Comput., vol. C-32, pp. 273-283, Mar. 1983.
[21] S. J. Piestrak, "Design method of totally self-checking checkers form- out-of-ncodes," inDig. Papers 13th Int. FTC Symp., Milan, Italy, June 28-30, 1983, pp. 162-168.
[22] J.-Ch. Lo and S. Thanawastien, "The design of fast totally self-checking Berger code checkers," inDig. Papers 18th Int. FTC Symp., Tokyo, Japan, July 1988, pp. 226-231.

Index Terms:
minimal test set; multioutput threshold circuits; sorting networks; n-input; symmetric threshold functions; Boolean functions; threshold circuit; unidirectional error detecting codes; Boolean functions; logic circuits; logic testing; threshold logic.
Citation:
S.J. Piestrak, "The Minimal Test Set for Multioutput Threshold Circuits Implemented as Sorting Networks," IEEE Transactions on Computers, vol. 42, no. 6, pp. 700-712, June 1993, doi:10.1109/12.277288
Usage of this product signifies your acceptance of the Terms of Use.