A new formulation of yield enhancement problems for reconfigurable chips
- 6 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The covering problem assigns redundant elements to replace defective elements so that the chip will function properly. A general model that can be used to represent the relationship between redundant elements and defective elements in a uniform way is presented. This model subsumes many of the models discussed in previous approaches. A complete characterization of the complexity of the covering problems in all the subcases of the model, most of which have not been studied before, is given. It is hoped that the formulation will also lead to new ways of designing reconfigurable chips.<>Keywords
This publication has 7 references indexed in Scilit:
- Minimum fault coverage in reconfigurable arraysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Interstitial redundancy: an area efficient fault tolerance scheme for large area VLSI processor arraysIEEE Transactions on Computers, 1988
- Efficient Spare Allocation for Reconfigurable ArraysIEEE Design & Test of Computers, 1987
- A new approach to the maximum flow problemPublished by Association for Computing Machinery (ACM) ,1986
- A Fault-Driven, Comprehensive Redundancy AlgorithmIEEE Design & Test of Computers, 1985
- Some Matching Problems for Bipartite GraphsJournal of the ACM, 1978
- Multiple word/bit line redundancy for semiconductor memoriesIEEE Journal of Solid-State Circuits, 1978