This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Low-Cost Modular Totally Self-Checking Checker Design for $m$-out-of-$n$ Code
August 1999 (vol. 48 no. 8)
pp. 815-826

Abstract—We present a low-cost (hardware-efficient) and fast totally self-checking (TSC) checker for $m$-out-of-$n$ code, where $m \geq 3$, $2m+1 \leq n \leq 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 $k$-variable two-rail code checker tree which compares the outputs of the two ripple carry adders, where $k=\lfloor \log_2 (n-m)+ 1 \rfloor$. 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^2)$ to $O(n)$ and from $O(n)$ to $O(\log_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] D.A. Anderson and G. Metze, “Design of Totally Self-Checking Check Circuits for$m$-out-of-$n$Codes,” IEEE Trans. Computers, vol. 22, pp. 263-269, Mar. 1973.
[2] J.E. Smith, “The Design of Totally Self-Checking Check Circuits for a Class of Unordered Codes,” J. Design Automation and Fault-Tolerant Computing, vol. 2, pp. 321-343, Oct. 1977.
[3] M.A. Marouf and A.D. Friedman, “Efficient Design of Self-Checking Checker for Any$m$-out-of-$n$Code,” IEEE Trans. Computers, vol. 27, no. 6, pp. 482-490, June 1978.
[4] N. Gaitanis and C. Halatsis, “A New Design Method for m-out-of-n TSC Checkers,” IEEE Trans. Computers, vol. 32, no. 3, pp. 273-283, Mar. 1983.
[5] S.J. Piestrak, “Design Method of TSC Checkers for m-out-of-n Codes,” Proc. Int'l Symp. Fault-Tolerant Computing (FTCS), pp. 162-168, Milan, June 1983.
[6] V.V. Dimakopoulos, G. Sourtziotis, A. Paschalis, and D. Niklos, “On TSC Checkers for m-out-of-n Codes,” Proc. Second IEEE Int'l On-Line Testing Workshop, pp. 132-135, Biarritz, July 1996.
[7] S.J. Piestrak, “Modular Design of Self-Testing Checkers for m-out-of-n Codes,” Proc. Second IEEE Int'l On-Line Testing Workshop, pp. 132-135, Biarritz, July 1996.
[8] S.R. Manthani and S.M. Reddy, “On CMOS Totally Self-Checking Circuits,” Proc. Int'l Test Conf. (ITC), pp. 866-877, Philadelphia, Oct. 1984.
[9] N.K. Jha,"Strongly Fault-Secure and Strongly Self-Checking Domino-CMOS Implementations of Totally Self-Checking Circuits," IEEE Trans. Computer-Aided Design, pp. 332-336, March 1990.
[10] D.L. Tao, C.R.P. Hartmann, and P.K. Lala, “A General Technique for Designing Totally Self-Checking Checker for 1-out-of-N Code with Minimum Gate Delay,” IEEE Trans. Computers, vol. 41, no. 7, pp. 881-886, July 1992.
[11] T.R.N. Rao, G.L. Feng, M.S. Kolluru, and J.-C. Lo, “Novel Totally Self-Checking Berger Checker Designs Based on Generalized Berger Code Partitioning,” IEEE Trans. Computers, vol. 42, no. 8, pp. 1020-1024, Aug. 1993; see also Correction in IEEE Trans. Computers, vol. 43, no. 5, p. 640, May 1994.
[12] S.M. Reddy, “A Note on Self-Checking Checker,” IEEE Trans. Computers, vol. 42, no. 8, pp. 1,020-1,024, Aug. 1993.
[13] S.M. Reddy and J.R. Wilson, “Easily Testable Cellular Realizations for the (Exactly$p$)-out-of-$n$and ($p$or More)-out-of-$n$Logic Function,” IEEE Trans. Computers, vol. 23, no. 1, pp. 98-100, Jan. 1974.
[14] C. Efstathiou and C. Halatsis, “Efficient Modular Design of TSC Checkers for$m=2^k-1$,$k>2$,” Electronics Letters, vol. 21, pp. 1,083-1,084, Nov. 1985.
[15] A.M. Paschalis et al., “Efficient Modular Design of TSC Checkers form-out-of-nCodes,” IEEE Trans. Computers, vol. 37, no. 3, pp. 301-309, Mar. 1988.
[16] T. Haniotakis, A. Paschalis, and D. Nikolos, “Efficient Totally Self-Checking Checkers for a Class of Borden Codes,” IEEE Trans. Computers, vol. 44, no. 11, pp. 1,318-1,322, Nov. 1995.
[17] M.A. Marouf and A.D. Friedman, “Design of Self-Checking Checker for Berger Codes,” Proc. Int'l Symp. Fault-Tolerant Computing (FTCS), June 1978.

Index Terms:
Fault tolerance, logic testing, m-out-of-n code, on-line testing, totally-self-checking checker.
Citation:
Wen-Feng Chang, Cheng-Wen Wu, "Low-Cost Modular Totally Self-Checking Checker Design for $m$-out-of-$n$ Code," IEEE Transactions on Computers, vol. 48, no. 8, pp. 815-826, Aug. 1999, doi:10.1109/12.795123
Usage of this product signifies your acceptance of the Terms of Use.