BIST Hardware Synthesis for RTL Data Paths Based on Test Compatibility Classes

Nicolici, N., Al-Hashimi, B.M., Brown, A.D. and Williams, A.C. (2000) BIST Hardware Synthesis for RTL Data Paths Based on Test Compatibility Classes IEEE Transactions on CAD, 19, (11), pp. 1375-1385.


[img] PDF ieeetcad00.pdf - Other
Download (145kB)


New BIST methodology for RTL data paths is presented. The proposed BIST methodology takes advantage of the structural information of RTL data path and reduces the test application time by grouping same-type modules into test compatibility classes (TCCs). During testing, compatible modules share a small number of test pattern generators at the same test time leading to significant reductions in BIST area overhead, performance degradation and test application time. Module output responses from each TCC are checked by comparators leading to substantial reduction in fault-escape probability. Only a single signature analysis register is required to compress the responses of each TCC which leads to high reductions in volume of output data and overall test application time (the sum of test application time and shifting time required to shift out test responses). This paper shows how the proposed TCC grouping methodology is a general case of the traditional BIST embedding methodology for RTL data paths with both uniform and variable bit width. A new BIST hardware synthesis algorithm employs efficient tabu search-based testable design space exploration which combines the accuracy of incremental test scheduling algorithms and the exploration speed of test scheduling algorithms based on fixed test resource allocation. To illustrate TCC grouping methodology efficiency, various benchmark and complex hypothetical data paths have been evaluated and significant improvements over BIST embedding methodology are achieved.

Item Type: Article
Organisations: Electronic & Software Systems, EEE
ePrint ID: 253684
Date :
Date Event
November 2000Published
Date Deposited: 29 May 2001
Last Modified: 17 Apr 2017 23:22
Further Information:Google Scholar

Actions (login required)

View Item View Item