Abstract
We investigate the gate-delay-fault testability properties of multilevel, multiplexor-based logic circuits. Based on this investigation, we describe a procedure for synthesizing gate-delay-fault testable multilevel circuits. The procedure involves the construction of a multilevel circuit from a general, unordered Binary Decision Diagram (BDD) by replacing vertices of the BDD with multiplexors. The procedure relies on the following result derived in this article: If the multilevel circuit constructed from the BDD is initially fully single stuck-at fault testable, or made fully single stuck-at fault testable by redundancy removal, then it is completely robustly gate-delay-fault testable. Once the initial gate-delay-fault testable circuit has been obtained, constrained algebraic factorization is used to improve the area and performance characteristics without compromising testability. Unlike previous techniques for synthesizing robustly gate-delay-fault testable circuits, this procedure can be used to synthesize fully testable circuits directly from nonflattenable, logic-level implementations.
Similar content being viewed by others
References
G.D. Hachtel, R.M. Jacoby, K. Keutzer, and C.R. Morrison. On the relationship between area optimization and multifault testability of multilevel logic.International Conference on Computer-Aided Design, Santa Clara, CA, November 1989, pp. 422–425.
N.K. Jha and S. Kundu.Testing and Reliable Design of CMOS Circuits. Kluwer Academic Publishers, Boston, 1990.
S. Devadas and K. Keutzer. Synthesis and optimization procedures for robustly delay-fault testable logic circuits.Proceedings of the 27 th Design Automation Conference, Orlando, FL, June 1990, pp. 221–227.
S. Devadas, H-K. T. Ma, A.R. Newton, and A. Sangiovanni-Vincentelli. A Synthesis and Optimization Procedure for Fully and Easily Testable Sequential Machines. InIEEE Transactions on Computer-Aided Design, 8(10): 1100–1107 (October 1989).
K-T. Cheng, S. Devadas, and K. Keutzer. Robust delay-fault test generation and synthesis for testability under a standard scan design methodology.Proceedings of the 28 th Design Automation Conference, San Francisco, CA, June 1991, pp. 403–410.
C.Y. Lee. Representation of switching circuits by Binary Decision Programs.Bell System Technical Journal, 38: 985–999 (July 1959).
S.B. Akers. Binary Decision Diagrams.IEEE Transactions on Computers, C-27: 509–516 (June 1978).
R. Bryant. Graph-based algorithms for Boolean function manipulation.IEEE Transactions on Computers, C-35: 677–691 (August 1986).
P. Ashar, S. Devadas, and K. Keutzer. Testability properties of multilevel logic networks derived from Binary Decision Diagrams. InProceedings of the Santa Cruz Conference on Advanced Research in VLSI, March 1991, pp. 35–54.
S. Chakravarty. A testable relization of CMOS combinational circuits.Proceedings of the International Test Conference, Washington, D.C., September 1989, pp. 509–518.
M.A. Breuer and A.D. Friedman.Diagnosis and Reliable Design of Digital Systems. Computer Science Press, Los Alamitos, 1976.
H. Fujiwara.Logic Testing and Design for Testability. MIT Press, Cambridge MA, 1985.
S. Kundu, S.M. Reddy, and N.K. Jha. On the design of robust multiple fault testable CMOS combinational logic circuits. InProceedings of the International Conference on Computer-Aided Design, Santa Clara, CA, November 1988, pp. 240–243.
J. Burch. Using BDDs to verify multipliers.Proceedings of 1991 International Workshop on Formal Methods in VLSI Design, Miami, FL, January 1991.
S. Malik, A.R. Wang, R. Brayton, and A. Sangiovanni-Vincentelli. Logic verification using Binary Decision Diagrams in a logic synthesis environment. InProceedings of the Int'l Conference on Computer-Aided Design, Santa Clara, CA, November 1988, pp. 6–9.
S. Devadas and K. Keutzer. Design of integrated circuits fully testable for delay faults and multifaults.Proceedings of the International Test Conference, Washington, D.C., October 1990, pp. 284–293.
A. Casotto (ed.).Oct Tools Distribution 5.0. Electronics Research Laboratory, University of California, Berkeley, March 1991.
R. Brayton, R. Rudell, A. Sangiovanni-Vincentelli, and A. Wang. MIS: a multiple-level logic optimization system. InIEEE Transactions on Computer-Aided Design, 6(11): 1061–1081 (November 1987).
K-T. Cheng, A. Saldanha, R.K. Brayton, and A. Sangiovanni-Vincentelli. Timing optimization and testability considerations. InInt'l Conference on Computer-Aided Design, Santa Clara, CA, November 1990, pp. 460–463.
S. Devadas and K. Keutzer. Synthesis of robust delay-fault testable circuits: practice.IEEE Transactions on Computer-Aided Design, March 1992, 11(3): pp 277–300.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ashar, P., Devadas, S. & Keutzer, K. Gate-delay-fault testability properties of multiplexor-based networks. Form Method Syst Des 2, 93–112 (1993). https://doi.org/10.1007/BF01383945
Issue Date:
DOI: https://doi.org/10.1007/BF01383945