By Topic

Efficient reconfiguration algorithms for degradable VLSI/WSI arrays

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. -Y. Kuo ; Dept. of Electr. & Comput. Eng., Arizona Univ., Tucson, AZ, USA ; I. -Y. Chen

The development of efficient algorithms for constructing a flawless subarray from a defective VLSI/WSI (wafer scale integration) array is discussed. The array consists of identical elements such as processors or memory cells embedded in a switch lattice in the form of a rectangular grid, in contrast to the redundancy approach in which some elements are dedicated as spares, all the elements in the degradation approach are treated in a uniform way. Each element can be either fault-free or defective, and a subarray which contains no faulty element is derived under constraints of switching and routing mechanisms. Although extensive literature exists concerning spare allocation and reconfiguration in arrays with redundancy, little research has been published on optimal reconfiguration in a degradable array. A graph formulation is used to describe the problem, and reconfiguration is found to relate to finding an independent set of a graph. Efficient heuristic algorithms are presented to determine a target subarray from the defective host array

Published in:

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  (Volume:11 ,  Issue: 10 )