This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Isomorph-Redundancy in Sequential Circuits
September 2000 (vol. 49 no. 9)
pp. 992-997

Abstract—Design of irredundant and fully testable nonscan sequential circuits is a major concern of logic synthesis, as the presence of undetectable faults may render an ATPG intractable. This paper outlines some intriguing properties of isomorph faults, which are sequentially undetectable as well as redundant. An isomorph fault in a sequential circuit makes the state diagram of the faulty machine identical to that of the fault-free machine under certain renaming of states. Examples of reduced sequential machines whose circuit realization is combinationally irredundant, but isomorph-redundant, are hard to construct and very little is known about them. In this paper, many curious examples of such sequential circuits are presented wherein a single stuck-at fault causes isomorphic faulty machines. An infinite family of such circuits may, in fact, be constructed. It is shown that even two-level irredundant circuits obtained by synthesis tools may admit isomorph-redundancy under multiple stuck-at faults. Various classifications and related properties of isomorph faults are also reported. These results reveal new insight and understanding of redundancy in sequential circuits.

[1] Fault-Tolerant Computing, D.K. Pradhan, ed., vol. 1. Englewood Cliffs, N.J.: Prentice-Hall, 1986.
[2] S. Devadas, H.T. Ma, R. Newton, and A. Sangiovanni-Vincentelli, “Irredundant Sequential Machines via Optimal Logic Synthesis,” IEEE Trans. Computer Aided Design of Integrated Circuits and Systems, vol. 9, no. 1, pp. 8-17, Jan. 1990.
[3] A. Ghosh, S. Devadas, and A.R. Newton, “Sequential Test Generation and Synthesis for Testability at the Register-Transfer and Logic Levels,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 12, no. 5, pp. 579-598, May 1993.
[4] K. Keutzer, S. Malik, and A. Saldhana, “Is Redundancy Necessary to Reduce Delay?” IEEE Trans. Computer-Aided Design, vol. 10, pp. 427-435, 1991.
[5] D.K. Das, S. Chakraborty, and B.B. Bhattacharya, “Interchangeable Boolean Functions and Their Effects on Redundancy in Logic Circuits,” Proc. Asia and South Pacific Design Automation Conf., pp. 469-474, Feb. 1998.
[6] S. Chakraborty, D.K. Das, and B.B. Bhattacharya, “Logical Redundancies in Irredundant Combinational Circuits,” J. Electronic Testing: Theory and Applications, vol. 4, pp. 120-125, 1993.
[7] D.K. Das, S. Chakraborty, and B.B. Bhattacharya, “Irredundant Binate Realizations of Unate Functions,” Int'l J. Electronics, vol. 25, no. 1, pp. 65-73, 1993.
[8] J.P. Hayes, “On the Properties of Irredundant Logic Networks,” IEEE Trans. Computers, vol. 25, pp. 884-892, 1976.
[9] S. Devadas,H.-K.T. Ma, and A.R. Newton,"Redundancies and don't-cares in sequential logic synthesis," J. Electronic Testing: Theory and Application, vol. 1, pp. 15-30, Feb. 1990.
[10] P. Ashar, S. Devadas, and A.R. Newton, “Irredundant Interacting Sequential Machines via Optimal Logic Synthesis,” IEEE Trans. Computer-Aided Design, vol. 10, no. 3, pp. 311-325, 1991.
[11] H. Cho, G. Hachtel, and F. Somenzi, "Redundancy Identification/Removal and Test Generation for Sequential Circuits Using Implicit State Enumeration," IEEE Trans. Computer-Aided Design, vol. 12, no. 7, pp. 935-945, 1993.
[12] I. Pomeranz and S.M. Reddy, “Classification of Faults in Synchronous Sequential Circuits,” IEEE Trans. Computers, vol. 42, no. 9, pp. 1,066-1,077, Sept. 1993.
[13] I. Pomeranz,S.M. Reddy, and J.H. Patel,"Theory and practive of sequential machine testing and testability," Proc. 23rd Fault-Tolerant Computing Symp., pp. 330-337, June 1993.
[14] I. Pomeranz and S.M. Reddy,"On identifying undetectable and redundant faults in synchronous sequential circuits," Proc. VLSI Test Symp., pp. 8-14, Apr. 1994.
[15] M. Abramovici, D.T. Miller, and R.K. Roy, “Dynamic Redundancy Identification in Automatic Test Generation,” IEEE Trans. Computer-Aided Design, vol. 11, pp. 404-407, Mar. 1992.
[16] V.D. Agrawal and S.T. Chakradhar, “Combinational ATPG Theorems for Identifying Untestable Faults in Sequential Circuits,” Proc. European Test Conf., IEEE CS Press, 1993, pp. 249-253.
[17] K.T. Cheng, “On Removing Redundancy in Sequential Circuits,” Proc. ACM/IEEE Design Automation Conf., pp. 164-169, 1991.
[18] S. Devadas and K. Keutzer, "A Unified Approach to the Synthesis of Fully Testable Sequential Machines," IEEE Trans. Computer-Aided Design, vol. 10, no. 1, Jan. 1991.
[19] J. Mao, K. Mohiuddin, and A.K. Jain, "Parsimonious Network Design and Feature Selection Through Node Pruning," Proc. 12th ICPR,Jerusalem, pp. 622-624, 1994.
[20] D.K. Das and B.B. Bhattacharya, “Testable Design of Non-Scan Sequential Circuits Using Extra Logic,” Proc. Fourth Asian Test Symp., pp. 176-182, 1995.

Index Terms:
ATPG, DFT, redundancy, sequential machines, stuck-at faults, testing.
Citation:
Debesh K. Das, Uttam K. Bhattacharya, Bhargab B. Bhattacharya, "Isomorph-Redundancy in Sequential Circuits," IEEE Transactions on Computers, vol. 49, no. 9, pp. 992-997, Sept. 2000, doi:10.1109/12.869333
Usage of this product signifies your acceptance of the Terms of Use.