Efficient Unknown Blocking Using LFSR Reseeding

This paper presents an efficient method to block unknown values from entering temporal compactors. The control signals for the blocking logic are generated by an LFSR. The proposed technique minimizes the size of the LFSR by propagating only one fault effect for each fault and balancing the number o...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the Design Automation & Test in Europe Conference Vol. 1; pp. 1 - 2
Main Authors: Seongmoon Wang, Balakrishnan, B.J., Chakradhar, S.T.
Format: Conference Proceeding
Language:English
Published: IEEE 2006
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents an efficient method to block unknown values from entering temporal compactors. The control signals for the blocking logic are generated by an LFSR. The proposed technique minimizes the size of the LFSR by propagating only one fault effect for each fault and balancing the number of specified bits in each control pattern. The linear solver to find seeds of the LFSR intelligently chooses a solution such that the impact on test quality is minimal. Experimental results show that sizes of control data for the proposed method are smaller than prior work and run time of the proposed method is several orders of magnitude smaller than that of prior work. Hardware overhead is very low
ISBN:3981080114
9783981080117
ISSN:1530-1591
1558-1101
DOI:10.1109/DATE.2006.243929