This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Synthesis for Testability of Highly Complex Controllers by Functional Redundancy Removal
December 1999 (vol. 48 no. 12)
pp. 1305-1323

Abstract—This paper presents a testable synthesis methodology applicable to any top-down design method based on hardware-description-language descriptions, or graphical representations. The methodology is targeted on control-dominated applications and it is based on the identification and removal of a new class of redundant faults, called functionally redundant faults. The formal relation between functionally redundant faults and sequentially redundant faults is introduced. Moreover, the relation between functionally redundant faults and logic synthesis algorithms based on local don't cares is shown. Functionally redundant faults are identified and removed by comparing the implemented synchronous sequential circuit, which can be technology dependent, to its specification. The specification can be a single finite state machine (FSM), a set of interacting FSMs, or a hierarchical FSM that allows the description of highly complex controllers. The proposed methodology produces testable circuits, with area reduction, still mapped on the same technology library, and it manages circuits which cannot be handled by other methods presented in the literature.

[1] M. Bombana, G. Buonanno, P. Cavalloro, F. Ferrandi, D. Sciuto, and G. Zaza, “ALADIN: A Multi-Level Testability Analyzer for VLSI System Design,” IEEE Trans. VLSI, vol. 2, no. 2, pp. 157-171, June 1994.
[2] D. Harel, “Statecharts: A Visual Approach to Complex Systems,” Science of Computer Programming, Vol. 8, No. 3, pp. 231–274, 1987.
[3] K. Cheng and A. Krishnakumar, "Automatic Functional Test Generation Using the Extended Finite State Machine Model," Proc. 30th Design Automation Conf., pp. 86-91, 1993.
[4] S.R. Rao, B.Y. Pan, and J.R. Armstrong, “Hierarchical Test Generation for VHDL Behavioral Models,” Proc. European Design Automation Conf., pp. 175-182, 1993.
[5] P. Vishakantaiah, J.A. Abraham, and D.G. Saab, “CHEETA: Composition of Hierarchical Sequential Tests Using ATKET,” Proc. IEEE Int'l Test Conf., pp. 606-615, 1993.
[6] F. Fummi and D. Sciuto, “A Complete Testing Strategy Based on Interacting and Hierarchical FSMs,” INTEGRATION, the VLSI J., pp. 75-93, 1997.
[7] F. Fummi, U. Rovati, and D. Sciuto, “Functional Design for Testability of Control-Dominated Architectures,” ACM Trans. Design Automation of Electronic Systems, vol. 2, no. 2, pp. 98-122, Apr. 1997.
[8] F. Fummi, D. Sciuto, and M. Serra, “Synthesis for Testability of Large Complexity Controllers,” Proc. IEEE Int'l Conf., on Computer Design, pp. 180-185, 1995.
[9] 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.
[10] 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.
[11] M. Damiani and G. De Micheli, “Don't Care Set Specifications in Combinational and Synchronous Logic Circuits,” IEEE Trans. Computer Aided Design of Integrated Circuits and Systems, vol. 12, no. 3, pp. 365-388, Mar. 1993.
[12] G. Hachtel, R.M. Jacoby, K. Keutzer, and C.R. Morrison, “On Properties of Algebraic Transformations and the Synthesis of Multifault-Irredundant Circuits,” IEEE Trans. Computer Aided Design of Integrated Circuits and Systems, vol. 11, no. 3, pp. 313-321, Mar. 1992.
[13] H. Savoj and R.K. Brayton, “Observability Relations and Observability Don't Cares”, Proc. IEEE Int'l Conf. Computer Aided Design, pp. 518-521, 1991.
[14] K.T. Cheng, “Redundancy Removal for Sequential Circuits without Reset State,” IEEE Trans. Computer Aided Design of Integrated Circuits and Systems, vol. 12, no. 1, pp. 13-24, Jan. 1993.
[15] 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.
[16] I. Pomeranz and S.M. Reddy, “On Achieving a Complete Fault Coverage for Sequential Machines,” IEEE Trans. Computer Aided Design of Integrated Circuits and Systems, vol. 13, no. 3, pp. 378-386, Mar. 1994.
[17] S. Devadas, A. Ghosh, and K. Keutzer, Logic Synthesis, McGraw-Hill, New York, 1994.
[18] R.K. Savoj, R.K. Brayton, and H. Touati, “Extracting Local Don't Cares for Network Optimization,” Proc. IEEE Int'l Conf. on Computer Aided Design, pp. 514-517, 1991.
[19] I. Pomeranz and S.M. Reddy, “On Achieving Complete Testability of Synchronous Sequential Circuits with Synchronizing Sequences,” Proc. IEEE Int'l Test Conf., 1994.
[20] H. Touati, H. Savoj, B. Lin, R. Brayton, and A. Sangiovanni-Vincentelli, "Implicit State Enumeration of Finite State Machines Using BDDs," Proc. Int'l Conf. Computer-Aided Design, pp. 130-133, 1990.
[21] K.T. Cheng, “An ATPG-Based Approach to Sequential Logic Optimization,” Proc. IEEE Int'l Test Conf., pp. 372-375, 1991.
[22] D. Vishwani and S.T. Chakradhar, “Combinational ATPG Theorems for Identifying Untestable Faults in Sequential Circuits,” IEEE Trans. Computer Aided Design of Integrated Circuits and Systems, vol. 14, no. 9, pp. 1,155-1,160, Sept. 1995.
[23] L.A. Entrena and K.T. Cheng, “Combinational and Sequential Logic Optimization by Redundancies Addition and Removal,” IEEE Trans. Computer Aided Design of Integrated Circuits and Systems, vol. 14, no. 7, pp. 909-916, July 1995.
[24] U. Glaser and K.T. Cheng, “Logic Optimization by an Improved Sequential Redundancy Addition and Removal Technique,” Proc. IEEE Asia and South Pacific Design Automation Conf., pp. 235-240, 1995.
[25] J. Moondanos and J. Abraham, “Sequential Redundancy Identification Using Verification Techniques,” Proc. IEEE Int'l Test Conf., pp. 40-45, 1992.
[26] 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.
[27] W. Cao and D.K. Pradhan, “Sequential Redundancy Identification Using Recursive Learning,” Proc. IEEE Int'l Conf. on Computer Aided Design, pp. 100-106, 1996.
[28] M.A. Iyer and M. Abramovici, “Sequentially Untestable Faults Identified without Search,” Proc. IEEE Int'l Test Conf., pp. 259-266, 1994.
[29] K.T. Cheng and V.D. Agrawal, Partial Scan Method for Sequential Circuits with Feedback IEEE Trans. Computers, vol. 39, pp. 544-548, 1990.
[30] R.K. Brayton, R. Rudell, A. Sangiovanni-Vincentelli, and A. Wang, “MIS: A Multiple-Level Logic Optimization System,” IEEE Trans. Computer Aided Design of Integrated Circuits and Systems, vol. 6, no. 4, pp. 1,062-1,081, Nov. 1987.
[31] M. Abramovici, A.D. Breuer, and A.D. Friedman, Digital Systems Testing and Testable Design. Computer Science Press, 1990.
[32] K.T. Cheng, “On Removing Redundancy in Sequential Circuits,” Proc. ACM/IEEE Design Automation Conf., pp. 164-169, 1991.
[33] H. Cho, G.D. Hachtel, and F. Somenzi, “Fast Sequential ATPG Based on Implicit State Enumeration,” Proc. IEEE Int'l Test Conf., pp. 67-74, 1991.
[34] F. Fummi, “Design for Testability Problems for Highly Complex Circuits,” PhD Thesis, Dept. of Electronics and Information, Politecnico di Milano, 1995.
[35] G. De Micheli, Synthesis and Optimization of Digital Circuits. McGraw-Hill, 1994.
[36] O. Coudert, C. Berthet, and J.C. Madre, “Verification of Sequential Machines Based on Symbolic Execution,” Proc. Workshop Automatic Verification Methods for Finite State Systems, 1989.
[37] K.S. Brace, R.L. Rudell, and R.E. Bryant, Efficient Implementation of a BDD Package Proc. Design Automation Conf., pp. 40-45, 1990.
[38] H. Fujiwara and T. Shimono, “On the Acceleration of Test Generation Algorithms,” IEEE Trans. Computers, vol. 32, no. 12, pp. 1,137-1,144, Dec. 1983.
[39] W. Kunz and D.K. Pradhan, Recursive Learning: A New Implication Technique for Efficient Solution to CAD Problems Test, Verification and Optimization IEEE Trans. Computer-Aided Design, pp. 1143-1158, Sept. 1994.
[40] S. Yang, “Logic Synthesis and Optimization Benchmarks User Guide,” Technical Report, Microelectronic Center of North Carolina, Jan. 1991.
[41] Electronics Research Lab. Mem. UCB/ERL M92/41 Univ. of California, Berkeley, SIS: A System for Sequential Circuit Synthesis, 1992.
[42] T. Villa and A. Sangiovanni-Vincentelli, “NOVA: State Assignment of Finite State Machines for Optimal Two-Level Logic Implementations,” IEEE Trans. Computer Aided Design of Integrated Circuits and Systems, vol. 9, no. 9, pp. 905-924, Sept. 1990.
[43] F. Somenzi, “CUDD: CU Decision Diagram Package, Version 2.1.2,” Dept. of Electrical and Computer Eng., Univ. of Colorado at Boulder, 1997.
[44] T. Niermann and J. Patel, HITEC: A Test Generation Package for Sequential Circuits Proc. European Conf. Design Automation, pp. 214-218, 1991.

Index Terms:
Synthesis for testability, functional testing, logic minimization, redundancies removal, redundant faults, sequential circuits.
Citation:
Franco Fummi, Donatella Sciuto, Micaela Serra, "Synthesis for Testability of Highly Complex Controllers by Functional Redundancy Removal," IEEE Transactions on Computers, vol. 48, no. 12, pp. 1305-1323, Dec. 1999, doi:10.1109/12.817386
Usage of this product signifies your acceptance of the Terms of Use.