The Community for Technology Leaders
Green Image
Issue No. 10 - October (2010 vol. 59)
ISSN: 0018-9340
pp: 1309-1319
Xiangyu Tang , Link_A_Media Devices, Santa Clara, CA
Seongmoon Wang , NEC Labs. America, Princeton, NJ
A self-diagnosis circuit that can be used for built-in self-repair is proposed. The circuit under diagnosis is assumed to be composed of a large number of field repairable units (FRUs), which can be replaced with spares when they are found to be defective. Since the proposed self-diagnosis circuit is implemented on the chip, responses that are scanned out of scan chains are compressed by the group compactor, the space compression circuit, and finally, the time compression circuit to reduce the volume of test response data. Both the space and time compression circuits implement a Reed-Solomon code. Unlike prior work, in the proposed technique, responses of all FRUs are observed at the same time to reduce diagnosis time. The proposed diagnosis circuit can locate up to l defective FRUs. We propose a novel space compression circuit that reduces hardware overhead by exploiting the frequency difference of the scan shift clock and the system clock and by combining scan cells into groups of size r. When the size of constituent multiple-input signature register (MISR) is m, the total number of signatures to be stored for the fault-free signature is 2lmB bits, where 1\le B \le m. The experimental results show that the proposed diagnosis circuit that can locate up to four defective FRUs in the same test session can be implemented with less than one percent of hardware overhead for a large industrial design. Hardware overhead for the diagnosis circuit is lower for large CUDs.
Built-in self-repair, field repair, Reed-Solomon codes, algebraic decoding, forward error correction, built-in self-test, built-in self-diagnosis.

X. Tang and S. Wang, "A Low Hardware Overhead Self-Diagnosis Technique Using Reed-Solomon Codes for Self-Repairing Chips," in IEEE Transactions on Computers, vol. 59, no. , pp. 1309-1319, 2009.
89 ms
(Ver 3.3 (11022016))