This Article 
 Bibliographic References 
 Add to: 
Efficient Modular Design of TSC Checkers for M-out-of-2M-Codes
March 1988 (vol. 37 no. 3)
pp. 301-309
A design method of totally self-checking (TSC) m-out-of-2m code checkers is presented. The design is composed basically of two full-adder/half-adder trees, each summing up the ones received on m input lines, and a k-variable two-pair two-rail code tree that compares the outputs of the two-adder tree. The only modules used are full-adders, half-adders, and two-variable TSC two-rail code checkers

[1] W. C. Carter and P. R. Schneider, "Design of dynamically checked computers," inProc. IFIP Congr. 68, vol. 2, Edinburg, Scotland, 1968, pp. 878-883.
[2] D. A. Anderson and G. Metze, "Design of totally self-checking check circuits form-out-of-ncodes,"IEEE Trans. Comput., vol. 22, pp. 263-269, Mar. 1973.
[3] J. F. Wakerly,Error Detecting Codes, Self-Checking Circuits and Applications, New York: Elsevier-North Holland, 1978.
[4] S. M. Reddy, "A note on self-checking checkers,"IEEE Trans. Comput., vol. 23, pp. 1100-1102, Oct. 1974.
[5] 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. 23, pp. 98-100, Jan. 1974.
[6] J. E. Smith, "Design of totally self-checking check circuits for a class of unordered codes,"Design Automat. Fault-Tolerant Comput., pp. 321-343, Oct. 1977.
[7] N. Gaitanis and C. Halatsis, "A new design method form-out-of-nTSC checkers,"IEEE Trans. Comput., vol. 32, pp. 273-283, Mar. 1983.
[8] C. Efstathiou and C. Halatsis, "Efficient modular design ofm-out-of- 2m TSC checkers, form = 2k- 1,k≥2,"Electron. Lett., vol. 21, pp. 1083-1084, Nov. 7, 1985.
[9] Y. Crouzet and C. Landrault, "Design of self-checking MOS-LSI circuits: Application to a four-bit microprocessor,"IEEE Trans. Comput., vol. 29, pp. 532-537, June 1980.
[10] N. Jha and J. Abraham, "Techniques for efficient MOS implementation of totally self-checking checkers," inProc. 15th FTCS, June 1985, pp. 430-436.
[11] J. Galiay, Y. Crouzet, and M. Vergniault, "Physical versus logical fault models in MOS LSI circuits: Impact on their testability,"IEEE Trans. Comput., vol. 29, pp. 527-531, June 1980.
[12] N. Jha and J. Abraham, "Totally self-checking MOS circuits under realistic physical failures, " inProc. Int. Conf. Comput. Design, Port Chester, NY, Oct. 1984.
[13] D. A. Anderson, "Design of self-checking digital networks using coding techniques," Coordinated Science Lab., Rep. R-527, Univ. Illinois, Urbana, Oct. 1971.
[14] P. Banerjee and J. A. Abraham, "Fault characterization of VLSI circuits," inProc. IEEE Int. Conf. Circuits Comput., Sept. 1982, pp. 564-568.
[15] M. Marouf and A. Friedman, "Design of self-checking checkers for Berger codes," inProc. 8th FTCS, June 1978, pp. 179-184.
[16] Y. Tamir and C. Sequin, "Design and application of self-testing comparators implemented with MOS PLA's,"IEEE Trans. Comput., vol. 33, pp. 493-506, June 1984.
[17] M. A. Breuer and A. D. Friedman,Diagnosis and Reliable Design of Digital Systems, London, England: Pitman, 1976.
[18] S. K. Jain and V. D. Agrawal, "Test generation for MOS circuits using D-algorithm," inProc. Design Automat. Conf., Miami Beach, FL, June 1983, pp. 64-70.

Index Terms:
totally self-checking checkers; modular design; codes; full-adder; half-adder; trees; VLSI MOS implementation; adders; codes; logic design.
A.M. Paschalis, D. Nikolos, C. Halatsis, "Efficient Modular Design of TSC Checkers for M-out-of-2M-Codes," IEEE Transactions on Computers, vol. 37, no. 3, pp. 301-309, March 1988, doi:10.1109/12.2167
Usage of this product signifies your acceptance of the Terms of Use.