ACM Home Page
Please provide us with feedback. Feedback
Identification of unsettable flip-flops for partial scan and faster ATPG
Full text Publisher SitePublisher Site PdfPdf (69 KB)
Source International Conference on Computer Aided Design archive
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design table of contents
San Jose, California, United States
Pages: 63 - 66  
Year of Publication: 1997
ISBN:0-8186-7597-7
Authors
Ismed Hartanto  Design Technology Center, Hewlett-Packard Co., Palo Alto, CA and Coordinated Science Laboratory, University of Illinois, Urbana, IL
Vamsi Boppana  Coordinated Science Laboratory, University of Illinois, Urbana, IL
W. Kent Fuchs  School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN
Sponsors
IEEE-CS : Computer Society
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 7,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  

ABSTRACT

State justification is a time-consuming operation in test generation for sequential circuits. In this paper, we present a technique to rapidly identify state elements (hip-hops) that are either difficult to set or unsettable. This is achieved by performing test generation on certain transformed circuits to identify state elements that are not settable to specific logic values. Two applications that benefit from this identification are sequential circuit test generation and partial scan design. The knowledge of the state space is shown to be useful in creating early backtracks in deterministic test generation. Partial scan selection is also shown to benefit from the knowledge of the difficult-to-set hip-hops. Experiments on the ISCAS89 circuits are presented to show the reduction in time for test generation and the improvements in the testability of the resulting partial scan circuits.


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
 
2
 
3
O. Coudert and J. C. Madre, "Symbolic Computation of the Valid States of a Sequential Machine: Algorithms and Discussion," in Proc. of the Intl. Workshop on Formal Methods in VLSI Design, Jan. 1991.
 
4
H. Touati, H. Savoj, B. Lin, R. K. Brayton, and A. Sangiovanni-Vincentelli, "Implicit State Enumeration of Finite State Machines Using BDD's," in Proc. of the Intl. Conf. on Computer-Aided Design, pp. 130-133, Nov. 1990.
 
5
 
6
 
7
K.-T. Cheng and H.-K. T. Ma, "On the Over-Specification Problem in Sequential ATPG Algorithms," IEEE Trans. on Computer Aided Design, vol. 12, pp. 1599-1604, Oct. 1993.
 
8
 
9
E. Trischler, "Incomplete Scan Path with an Automatic Test Generation Methodology," in Proc. of the Intl. Test Conf., pp. 153-162, Nov. 1980.
 
10
V. Chickermane and J. H. Patel, "An Optimization Based Approach to the Partial Scan Design Problem," in Proc. of the Intl. Test Conf., pp. 377-386, Sept. 1990.
 
11
 
12
V. Chickermane and J. H. Patel, "A Fault Oriented Partial Scan Design Approach," in Proc. of the Intl. Conf. on Computer-Aided Design, pp. 400-403, Nov. 1991.
 
13
 
14
D. H. Lee and S. M. Reddy, "On Determining Scan Flipflops in Partial Scan Designs," in Proc. of the Intl. Conf. on Computer-Aided Design, pp. 322-325, Nov. 1990.
 
15
 
16
 
17
H.K.T. Ma, S. Devadas, A. R. Newton, and A. Sangiovanni- Vincentelli, "An Incomplete Scan Design Approach to Test Generation for Sequential Machines," in Proc. of the Intl. Test Conf., pp. 730-734, Sept. 1988.
18


Collaborative Colleagues:
Ismed Hartanto: colleagues
Vamsi Boppana: colleagues
W. Kent Fuchs: colleagues

Peer to Peer - Readers of this Article have also read: