
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
N.K. Jha, "Fault Detection in CVS Parity Trees with Application to Strongly SelfChecking Parity and TwoRail Checkers," IEEE Transactions on Computers, vol. 42, no. 2, pp. 179189, February, 1993.  
BibTex  x  
@article{ 10.1109/12.204791, author = {N.K. Jha}, title = {Fault Detection in CVS Parity Trees with Application to Strongly SelfChecking Parity and TwoRail Checkers}, journal ={IEEE Transactions on Computers}, volume = {42}, number = {2}, issn = {00189340}, year = {1993}, pages = {179189}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.204791}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Fault Detection in CVS Parity Trees with Application to Strongly SelfChecking Parity and TwoRail Checkers IS  2 SN  00189340 SP179 EP189 EPD  179189 A1  N.K. Jha, PY  1993 KW  CVS parity trees; strongly selfchecking parity; tworail checkers; single stuckat; stuckopen; stuckon fault detection; cascode voltage switch; differential cascode voltage switch; EXOR gates; singleended cascode voltage switch; fault location; logic gates; logic testing. VL  42 JA  IEEE Transactions on Computers ER   
The problem of single stuckat, stuckopen, and stuckon fault detection in cascode voltage switch (CVS) parity trees is considered. The results are also applied to parity and tworail checkers. It is shown that, if the parity tree consists of only differential cascode voltage switch (DCVS) EXOR gates, then the test set consists of at most five vectors (in some cases only four vectors are required) for detecting all detectable single stuckat, stuckopen, and stuckon faults, independent of the number of primary inputs and the number of inputs to any EXOR gate in the tree. If, however, only a singleended output is desired from the tree, then the final gate will be a singleended cascode voltage switch (SCVS) EXOR gate, for which the test set has only eight vectors. For a strongly selfchecking (SSC) CVS parity checker, the size of a test set consisting of only codewords is nine, whereas for an SSC CVS tworail checker the size of a test set consisting of only codewords is at most five.
[1] R. L. Wadsack, "Fault modeling and logic simulators of CMOS and MOS integrated circuit,"Bell Syst. Tech. J., vol. 57, pp. 14491473, MayJune 1978.
[2] S. K. Jain and V. D. Agrawal, "Test generation for MOS circuits using Dalgorithm," inProc. Design Automat. Conf., Miami Beach, FL, June 1983, pp. 6470.
[3] S. M. Reddy and M. K. Reddy, "Testable realizations for FET stuckopen faults in CMOS combinational logic circuits,"IEEE Trans. Comput., vol. C35, pp. 742754, Aug. 1986.
[4] S. M. Reddy, M. K. Reddy, and V. D. Agrawal, "Robust tests for stuckopen faults in CMOS combinational logic circuits," inProc. Int. Symp. FaultTolerant Comput., FL, June 1984, pp. 4449.
[5] S. M. Reddy, V. D. Agrawal, and S. K. Jain, "A gatelevel model for CMOS combinational logic circuits with application to fault detection," inProc. Design Automat. Conf., June 1984, pp. 504509.
[6] Y. K. Malaiya, "Testing stuckon faults in CMOS integrated circuits," inProc. Int. Conf. Comput.Aided Design, Santa Clara, CA, Nov. 1984, pp. 248250.
[7] N. K. Jha and S. Kundu,Testing and Reliable Design of CMOS Circuits. Norwell, MA: KIuwer, 1990.
[8] L.G. Helleret al., "Cascode voltage switch logic: A differential CMOS logic family," inProc. IEEE Int. SolidState Circuits Conf., 1984, pp. 1617.
[9] R.H. Krambeck, C.M. Lee and H.F.S. Law, "HighSpeed Compact Circuits with CMOS,"IEEE J. Solidstate Circuits, SC 17, June 1982, pp. 614619.
[10] V. G. Oklobdzija and P. G. Kovijanic, "On testability of CMOSdomino logic," inProc. Int. Symp. FaultTolerant Comput., Orlando, FL, June 1984, pp. 5055.
[11] Z. Barzilai, V. S. Iyengar, B. K. Rosen, and G. M. Silberman, "Fault modeling and simulation of SCVS circuits, " inProc. Int. Conf. Comput. Design, Port Chester, NY, Oct. 1984, pp. 4247.
[12] S. R. Manthani and S. M. Reddy, "On CMOS totally selfchecking circuits," inProc. Int. Test Conf., Philadelphia, PA, Oct. 1984, pp. 866877.
[13] N. K. Jha, "Testing for multiple faults in dominoCMOS logic circuits,"IEEE Trans. Comput.Aided Design, vol. 7, no. 1, pp. 109116, Jan. 1988.
[14] N.K. Jha and Q. Tong, "Testing of multipleoutput domino logic (MODL) CMOS circuits,"IEEE J. SolidState Circuits, vol. 25, no. 3, pp. 800805, June 1990.
[15] Computers at Risk: Safe Computing in the Information Age. Washington, DC: Nat. Acad. Press, 1991.
[16] Z. Barzilai, V. S. Iyengar, B. K. Rosen, and G. M. Silberman, "Accurate fault modeling and efficient simulation of differential CVS circuits," inProc. Int. Test Conf., Oct. 1985, pp. 722729.
[17] N. K. Jha, "Testing of differential cascade voltage switch onecount generators,"IEEE J. SolidState Circuits, vol. 25, no. 1, pp. 246253, Feb. 1990.
[18] Q. Tong and N. K. Jha, "Design of Ctestable DCVS binary array dividers,"IEEE J. SolidState Circuits, vol. 26, no. 2, pp. 134141, Feb. 1991.
[19] A. R. Takach and N.K. Jha, "Easily testable gatelevel and DCVS multipliers,"IEEE Trans. Comput. Aided Design, vol. 10, pp. 932942, July 1991.
[20] W.C. Carter and P.R. Schneider, "Design of dynamically checked computers," inProc. IFIP '68, Edinburgh, Scotland, Aug. 1968, pp. 878883.
[21] D. A. Anderson, "Design of selfchecking digital networks using coding techniques," Univ. Illinois, Urbana, IL, Tech. Rep. R527, Sept. 1971.
[22] J. E. Smith and G. Metze, "Strongly fault secure logic networks,"IEEE Trans. Comput., vol. C27, pp. 491499, June 1978.
[23] M. Nicolaidis, I. Jansch, and B. Courtois, "Strongly code disjoint checkers," inProc. Int. Symp. FaultTolerant Comput., Orlando, FL, June 1984, pp. 1621.
[24] N. K. Jha, "Strongly faultsecure and strongly selfchecking dominoCMOS implementations of totally selfchecking circuits,"IEEE Trans. ComputerAided Design, vol. 9, Mar. 1990.
[25] D. C. Bossen, D. L. Ostapko, and A. M. Patel, "Optimum test patterns for parity networks," inProc. AFIPS Conf., Houston, TX, Nov. 1970, pp. 6368.
[26] N. K. Jha, "Testing of cascode voltage switch parity trees," inInt. Workshop VLSI Design, Bangalore, India, Dec. 1988.
[27] S. Kundu and S. M. Reddy, "Robust tests for parity trees," inProc. Int. Test Conf., Washington, DC, Sept. 1988.
[28] D. K. Pradhan, Ed.,FaultTolerant Computing, Vol. I. EnglewoodCliffs, NJ: PrenticeHall, 1986.
[29] J. Khakbaz and E. J. McCluskey, "Selftesting embedded parity checkers,"IEEE Trans. Comput., vol. C33, pp. 753756, Aug. 1984.
[30] T. Nanya, S. Mourad, and E. McCluskey, "Multiple Stuckat Fault Testability of SelfTesting Checkers,"Proc. Symp. FaultTolerant Computing, 1988, pp. 381386.
[31] N. Weste and K. Eshraghian,Principles of CMOS Design: A Systems Perspective. Reading, MA: AddisonWesley, 1985, pp. 322325.
[32] M. A. Marouf and A. D. Friedman, "Design of selfchecking checkers for Berger codes," inProc. Int. Symp. FaultTolerant Comput., June 1978, pp. 179184.