ACM Home Page
Please provide us with feedback. Feedback
A highly regular multi-phase reseeding technique for scan-based BIST
Full text PdfPdf (217 KB)
Source Great Lakes Symposium on VLSI archive
Proceedings of the 13th ACM Great Lakes symposium on VLSI table of contents
Washington, D. C., USA
SESSION: Testing table of contents
Pages: 295 - 298  
Year of Publication: 2003
ISBN:1-58113-677-3
Authors
E. Kalligeros  University of Patras, Patras, Greece
X. Kavousianos  University of Patras, Patras, Greece
D. Nikolos  Computer Technology Institute, Patras, Greece
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 21,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues   peer to peer  

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/764808.764885
What is a DOI?

ABSTRACT

In this paper a novel reseeding architecture for scan-based BIST, which uses an LFSR as TPG, is proposed. Multiple cells of the LFSR are utilized as sources for feeding the scan chain in different test phases. The LFSR generates the same state sequence in all phases, keeping that way the implementation cost low. Also, a dynamic reseeding scheme is adopted for further reducing the required hardware overhead. A seed-selection algorithm is moreover presented that, taking advantage of the multi-phase architecture, manages to reduce the number of the required seeds for achieving complete (100 %) fault coverage. Experimental results demonstrate the superiority of the proposed LFSR reseeding approach over the already known reseeding techniques.


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
M. Abramovici, M. A. Breuer & A. D. Friedman, Digital Systems Testing and Testable Design, Computer Sc. Press, NY, 1990.
 
2
 
3
 
4
L. R. Huang et al., "Gauss-Elimination-Based Generation of Multiple Seed-Polynomial Pairs for LFSR", IEEE Trans. on CAD, vol. 16, no. 9, Sept. 1997, pp. 1015--1024.
 
5
 
6
 
7
 
8
B. Koenemann, "LFSR-Coded Test Patterns for Scan Design", Proc. of ETC, April 1991, pp. 237--242.
 
9
 
10
H. K. Lee & D. S. Ha, "ATALANTA: An efficient ATPG for compbinational circuits", Dept. of Elect. Eng., Virginia Polytechnic Inst. and State Univ., Blacksburg, VA, USA, Tech. Rep. 93--12, 1993.
 
11
 
12
 
13
 
14
N. A. Touba & E. J. McCluskey, " Bit-Fixing in Pseudo-random Sequences for Scan BIST", IEEE Trans. on CAD, vol. 20, no. 4, April 2001, pp. 545--555.
 
15
 
16
 
17
 
18
"A Primitive Polynomial Search Program", http://users2.ev1. net/~sduplichan/primitivepolynomials/primitivepolynomials.htm.

Collaborative Colleagues:
E. Kalligeros: colleagues
X. Kavousianos: colleagues
D. Nikolos: colleagues

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