Low-Cost Modular Totally Self-Checking Checker Design for m-out-of-n Code

We present a low-cost (hardware-efficient) and fast totally self-checking (TSC) checker for m-out-of-n code, where m/spl ges/3, 2m+1/spl les/n/spl les/4m. The checker is composed of four special adders which sum the 1s in the primary inputs added by appropriate constants, two ripple carry adders which sum the outputs of the biased-adders, and a t-variable two-rail code checker tree which compares the outputs of the two ripple carry adders, where k=[log/sub 2/(n-m)+1]. All the modules are composed of 2-input gates and inverters. Compared with previous nonmodular methods, our TSC checker has a lower hardware and time complexity. Our method reduces the hardware complexity and circuit delay of the checker from O(n/sup 2/) to O(n) and from O(n) to O(log/sub 2/n), respectively. Compared with recent modular methods, our TSC checker has about the same hardware and time complexity, but is applicable to a much broader range of n. In summary, our method is superior to existing methods for the considered range of n. In addition, our TSC checker can easily be tested (the test set size of our TSC checker is relatively small) and implemented in VLSI for its modular structure.

[1]  T. R. N. Rao,et al.  Novel Totally Self-Checking Berger Code Checker Designs Based on Generalized Berger Code Partitioning , 1993, IEEE Trans. Computers.

[2]  Themistoklis Haniotakis,et al.  Efficient Totally Self-Checking Checkers for a Class of Borden Codes , 1995, IEEE Trans. Computers.

[3]  Arthur D. Friedman,et al.  Efficient Design of Self-Checking Checker for any m-Out-of-n Code , 1978, IEEE Transactions on Computers.

[4]  SUDHAKAR M. REDDY,et al.  Easily Testable Cellular Realizations for the (Exactly P)-out-of n and (p or More)-out-of n Logic Functions , 1974, IEEE Transactions on Computers.

[5]  Vassilios V. Dimakopoulos,et al.  On TSC Checkers for m-out-n Codes , 1995, IEEE Trans. Computers.

[6]  S. M. Reddy.  Note on Self-Checking Checkers , 1974, IEEE Transactions on Computers.

[7]  C. Efstathiou,et al.  Efficient modular design of m-out-of-2m TSC checkers, for m=2 K 1, K>2 , 1985 .

[8]  Gernot Metze,et al.  Design of Totally Self-Checking Check Circuits for m-Out-of-n Codes , 1973, IEEE Transactions on Computers.

[9]  Constantin Halatsis,et al.  A New Design Method for m-Out-of-n TSC Checkers , 1983, IEEE Transactions on Computers.

[10]  Parag K. Lala,et al.  A General Technique for Designing Totally Self-Checking Checker for 1-out-of-N Code with Minimum Gate Delay , 1992, IEEE Trans. Computers.

[11]  Constantin Halatsis,et al.  Efficient Modular Design of TSC Checkers for M-out-of-2M Codes , 1988, IEEE Trans. Computers.

[12]  Niraj K. Jha.  Strong fault-secure and strongly self-checking domino-CMOS implementations of totally self-checking circuits , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Sudhakar M. Reddy,et al.  On CMOS Totally Self-Checking Circuits , 1984, ITC.

[14]  Stanislaw J. Piestrak.  Design of Self-Testing Checkers for m-out-of-n Codes Using Parallel Counters , 1998, J. Electron. Test..