
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
WenFeng Chang, ChengWen Wu, "LowCost Modular Totally SelfChecking Checker Design for $m$outof$n$ Code," IEEE Transactions on Computers, vol. 48, no. 8, pp. 815826, August, 1999.  
BibTex  x  
@article{ 10.1109/12.795123, author = {WenFeng Chang and ChengWen Wu}, title = {LowCost Modular Totally SelfChecking Checker Design for $m$outof$n$ Code}, journal ={IEEE Transactions on Computers}, volume = {48}, number = {8}, issn = {00189340}, year = {1999}, pages = {815826}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.795123}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  LowCost Modular Totally SelfChecking Checker Design for $m$outof$n$ Code IS  8 SN  00189340 SP815 EP826 EPD  815826 A1  WenFeng Chang, A1  ChengWen Wu, PY  1999 KW  Fault tolerance KW  logic testing KW  moutofn code KW  online testing KW  totallyselfchecking checker. VL  48 JA  IEEE Transactions on Computers ER   
Abstract—We present a lowcost (hardwareefficient) and fast totally selfchecking (TSC) checker for
[1] D.A. Anderson and G. Metze, “Design of Totally SelfChecking Check Circuits for$m$outof$n$Codes,” IEEE Trans. Computers, vol. 22, pp. 263269, Mar. 1973.
[2] J.E. Smith, “The Design of Totally SelfChecking Check Circuits for a Class of Unordered Codes,” J. Design Automation and FaultTolerant Computing, vol. 2, pp. 321343, Oct. 1977.
[3] M.A. Marouf and A.D. Friedman, “Efficient Design of SelfChecking Checker for Any$m$outof$n$Code,” IEEE Trans. Computers, vol. 27, no. 6, pp. 482490, June 1978.
[4] N. Gaitanis and C. Halatsis, “A New Design Method for moutofn TSC Checkers,” IEEE Trans. Computers, vol. 32, no. 3, pp. 273283, Mar. 1983.
[5] S.J. Piestrak, “Design Method of TSC Checkers for moutofn Codes,” Proc. Int'l Symp. FaultTolerant Computing (FTCS), pp. 162168, Milan, June 1983.
[6] V.V. Dimakopoulos, G. Sourtziotis, A. Paschalis, and D. Niklos, “On TSC Checkers for moutofn Codes,” Proc. Second IEEE Int'l OnLine Testing Workshop, pp. 132135, Biarritz, July 1996.
[7] S.J. Piestrak, “Modular Design of SelfTesting Checkers for moutofn Codes,” Proc. Second IEEE Int'l OnLine Testing Workshop, pp. 132135, Biarritz, July 1996.
[8] S.R. Manthani and S.M. Reddy, “On CMOS Totally SelfChecking Circuits,” Proc. Int'l Test Conf. (ITC), pp. 866877, Philadelphia, Oct. 1984.
[9] N.K. Jha,"Strongly FaultSecure and Strongly SelfChecking DominoCMOS Implementations of Totally SelfChecking Circuits," IEEE Trans. ComputerAided Design, pp. 332336, March 1990.
[10] D.L. Tao, C.R.P. Hartmann, and P.K. Lala, “A General Technique for Designing Totally SelfChecking Checker for 1outofN Code with Minimum Gate Delay,” IEEE Trans. Computers, vol. 41, no. 7, pp. 881886, July 1992.
[11] T.R.N. Rao, G.L. Feng, M.S. Kolluru, and J.C. Lo, “Novel Totally SelfChecking Berger Checker Designs Based on Generalized Berger Code Partitioning,” IEEE Trans. Computers, vol. 42, no. 8, pp. 10201024, Aug. 1993; see also Correction in IEEE Trans. Computers, vol. 43, no. 5, p. 640, May 1994.
[12] S.M. Reddy, “A Note on SelfChecking Checker,” IEEE Trans. Computers, vol. 42, no. 8, pp. 1,0201,024, Aug. 1993.
[13] S.M. Reddy and J.R. Wilson, “Easily Testable Cellular Realizations for the (Exactly$p$)outof$n$and ($p$or More)outof$n$Logic Function,” IEEE Trans. Computers, vol. 23, no. 1, pp. 98100, Jan. 1974.
[14] C. Efstathiou and C. Halatsis, “Efficient Modular Design of TSC Checkers for$m=2^k1$,$k>2$,” Electronics Letters, vol. 21, pp. 1,0831,084, Nov. 1985.
[15] A.M. Paschalis et al., “Efficient Modular Design of TSC Checkers formoutofnCodes,” IEEE Trans. Computers, vol. 37, no. 3, pp. 301309, Mar. 1988.
[16] T. Haniotakis, A. Paschalis, and D. Nikolos, “Efficient Totally SelfChecking Checkers for a Class of Borden Codes,” IEEE Trans. Computers, vol. 44, no. 11, pp. 1,3181,322, Nov. 1995.
[17] M.A. Marouf and A.D. Friedman, “Design of SelfChecking Checker for Berger Codes,” Proc. Int'l Symp. FaultTolerant Computing (FTCS), June 1978.