Tags
No Tags
| Title: | SCAN CHAIN FAULT IDENTIFICATION USING WEIGHT-BASED CODES FOR SoC CIRCUITS |
| Author: | GHOSH, SWAROOP |
| Description: | Recently, it has been observed that embedded cores in a high-speed SoC circuit have the problem of broken scan chains that cannot shift properly. Also, scan chain intermittent faults caused by holdtime violations and crosstalk noises are pervasive. In this research, an efficient method is proposed to identify the faulty scan chain(s) at the core level. That is, the core where the scan chain is defective can be identified, even if the scan chain is broken. The result can be used to tune up the fabrication process or to guide the fine-grained scan cell identification process. Here, weight-based m-out-of-n codes, which can generate a large number of codewords, with small hardware overhead and high fault detection capability are used to generate the scan chain diagnostic patterns for permanent and intermittent faults. An efficient codeword generation method is proposed to maximize the number of codewords, minimize the aliasing probabilities and test application cost. Aliasing probabilities are analyzed thoroughly for code sequences that are shifted to the scan chain in an overlapped manner. The idea of multiple m-out-of-n codes is also proposed to guarantee that sufficient number of codewords are generated to perturb the scan chains and the associated combinational circuits. A test pattern broadcast architecture is incorporated to support the proposed testing method. The complexity of control signal generation and scan chain test is greatly reduced by adopting this architecture. Further, by adding a test pattern alignment scheme, it is possible to share the control signals for all checkers and to support the broadcast architecture as well. Therefore, the hardware overhead of the test architecture is also reduced. Finally, a totally self-checking checker is designed to support the application of multiple weight-based codes. Simulation results demonstrate the feasibility of the proposed method as the aliasing probability is zero in almost every code sequence. |
| Permanent Link: |
http://rave.ohiolink.edu/etdc/view?acc_num=ucin1085765670
http://hdl.handle.net/2374.OX/9818 |
| Date: | 2004 |
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||