ACM Home Page
Please provide us with feedback. Feedback
SOPRANO: an efficient automatic test pattern generator for stuck-open faults in CMOS combinational circuits
Full text PdfPdf (909 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 27th ACM/IEEE Design Automation Conference table of contents
Orlando, Florida, United States
Pages: 660 - 666  
Year of Publication: 1991
ISBN:0-89791-363-9
Authors
Hyung Ki Lee  Department of Eiectrical Engineering, Virginia Polytechnic Institute and State University, Blacksburg, Virginia
Dong Sam Ha  Department of Eiectrical Engineering, Virginia Polytechnic Institute and State University, Blacksburg, Virginia
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
IEEE-CS : Computer Society
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 12,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/123186.123432
What is a DOI?

ABSTRACT

In this paper, we describe a highly efficient automatic test pattern generator for stuck-open (SOP) faults, called SOPRANO, in CMOS combinational circuits. The key idea of SOPRANO is to convert a CMOS circuit into an equivalent gate level circuit and SOP faults into the equivalent stuck-at faults. Then SOPRANO derives test patterns for SOP faults using a gate level test pattern generator. Several techniques to reduce the test set size are introduced in SOPRANO. Experimental results performed on eight benchmark circuits show that SOPRANO achieves high SOP fault coverage and short processing time.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
R.L. Wadsack, "Fault Modeling and Logic Simulation of CMOS and MOS Integrated Circuits", Bell Sys. Tech. J., Vol. 57, No. 5, pp. 1449-1474, May-June 1978.
 
2
3
 
4
H.H. Chen, R. G. Mathews and J. A. Newkirk, "An Algorithm to Generate Tests for MOS Circuits at the Switch Level," Proc. i985 international Test Conference, Philadelphia, PA, pp. 304-312, Nov. 1985.
 
5
 
6
J. Rajski and H. Cox, "Stuck-Open Fault Testing in Large CMOS Networks by Dynamic Path Tracing," Proc. International Conference on Computer Design, Rye Brook, NY, pp. 252-255, Oct. 1986.
 
7
H. Cox and J. Rajski, "Stuck-Open and Transition Fault Testing in CMOS Complex Gates," Proc. 1988 International Test Conference, Washington D.C., pp. 688-694, Sept. 1988.
 
8
 
9
 
10
S. M. Reddy, M. K. Reddy and V, D. Agrawal, "Robust Tests for Stuck-Open Faults in C:MOS Combinational Logic Circuits," Proc. 14th International Symposium on Fault-Tolerant Computing, Orlando, FL, pp. 44-49, June 1984.
 
11
K. Kinoshita, Private Communication.
 
12
Y. M. EI-Ziq and R.J. Cloutier, "Functional-Level Test Generation for Stuck-Open Faults in ~,MOS VLSI," Proc. 1981 International Test Conference, Philadelphia, PA, pp. 536-546, Oct. 1981.
 
13
R. J. Chandramouli, "On Testing Stuck-Open Faults," Proc. 13th International Symposium on Fault-Tolerant Computing, Milan, Italy, pp. 258-265, June 1983.
14
 
15
P. Goel,"An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits," IEEE Trans, on Computers, Vol. C-30, No. 3, pp. 215-222, March 1981.
 
16
H. Hujiwara and T. K. Shimono, '"On the Acceleration of Test Generation Algorithms," IEEE Trans. on Computers, Vol. C-32, No. 12, pp. 1137-1144, Dec. 1983.
 
17
M. H. Schulz, E. Trischler and T. M. Sarfert, "SOCRATES: A Highly Efficient Automatic Test Pattern Generation System," IEEE Trans. on Computer-Aided Design, Vol. 7, No. 1, pp. 126-137, Jan. 1988.
 
18
D. Harrel, R. sheng and J. Udell, "Efficient Single Fault Propagation in Combinational Circuits," Proc. International Conference on Computer Aided Design, Santa Clara, CA., pp. 2-5, Nov., 1987.
 
19
J. Gallant, D. Maier and J.A. Storer, "On Finding Minimal Length Superstring," Journal orComputer and System Sciences, Vol. 20, No. 1, pp. 50-58, Feb. 1980.
 
20
S. Chakravarty and S. S. Ravi, "Computing Optimal Test Sequences from Complete Test Sets for Stuck-Open Faults in CMOS circuits," IEEE Trans. on Computer Aided Design, Vol. 9, No. 3, pp. 329-331, March 1990.
 
21
H. K. Lee, D. S. Ha and K. Kim, "A CMOS Stuck-Open Fault Simulator," 1989 Southeastcon, Columbia, SC., pp. 1151-1155, April 1989.
 
22
F. Brglez and H. Fujiwara, "A Neutral Netlist of 10 Combinational Bench Mark Circuits and a Target Translator in FORTRAN," Special Session on ATPG and Fault Simulation, 1985 International Symposium on Circuits and Systems, Kyoto, Japan, June 1985.


Collaborative Colleagues:
Hyung Ki Lee: colleagues
Dong Sam Ha: colleagues