loading...
Logic Synthesis for Testability
Ames, IA March 22-March 23
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/GLSV.1996.4976056th Great Lakes Symposium on VLSI
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Chien-Chung Tsai, University of California, Santa Barbara, CA 93106
Malgorzata Marek-Sadowska, University of California, Santa Barbara, CA 93106
This paper presents a multilevel logic synthesis method that achieves 100% single stuck-at fault testability. We assume any cell library composed of AND/OR gates. The Fixed Polarity Reed-Muller forms are used to build the initial design. Algebraic factorizations and redundancy removal are two major steps that are used in deriving the final circuit. A predetermined set of input patterns is applied to identify redundancies and serves as the test set for the resulting circuit. Therefore, test pattern generation is not needed. Experimental results show that our method produces circuits with area comparable to Berkeley SIS 1.2.
Index Terms:
Logic synthesis, Fixed-Polarity Reed-Muller Forms, Testability
Citation:
Chien-Chung Tsai, Malgorzata Marek-Sadowska, "Logic Synthesis for Testability," glsvlsi, pp.0118, 6th Great Lakes Symposium on VLSI, 1996
Usage of this product signifies your acceptance of the Terms of Use.