Fault Covering Problems in Reconfigurable VLSI Systems by Ran Libeskind-Hadas, Nany Hasan, Jingsheng Jason Cong,

By Ran Libeskind-Hadas, Nany Hasan, Jingsheng Jason Cong, Philip McKinley, C.L. Liu

Fault overlaying difficulties in Reconfigurable VLSI Systems describes the authors' fresh study on reconfiguration difficulties for fault-tolerance in VLSI and WSI structures. The e-book examines suggestions to a couple of reconfiguration difficulties.
effective algorithms are given for tractable protecting difficulties and normal strategies are given for facing numerous intractable protecting difficulties.
The e-book starts with an research of algorithms for the reconfiguration of enormous redundant thoughts. subsequent, a few extra normal protecting difficulties are thought of and the complexity of those difficulties is analyzed. ultimately, a normal and uniform strategy is proposed for fixing a large type of overlaying difficulties.
the consequences and strategies defined right here may be helpful to researchers and scholars operating during this region. As such, the booklet serves as an outstanding reference and should be used because the textual content for a complicated direction at the subject.

Show description

Read or Download Fault Covering Problems in Reconfigurable VLSI Systems PDF

Best design & architecture books

Operational Amplifiers: Theory and Design

Operational Amplifiers – conception and layout, moment variation offers a scientific circuit layout of operational amplifiers. Containing cutting-edge fabric in addition to the necessities, the publication is written to entice either the circuit clothier and the procedure fashion designer. it really is proven that the topology of all operational amplifiers could be divided into 9 major total configurations.

Computer and Information Security Handbook

The second edition of this complete instruction manual of computing device and knowledge security provides the main entire view of machine defense and privateness on hand. It deals in-depth assurance of safety conception, know-how, and perform as they relate to verified applied sciences in addition to contemporary advances.

Languages, Design Methods, and Tools for Electronic System Design: Selected Contributions from FDL 2015

This e-book brings jointly a range of the easiest papers from the eighteenth version of the discussion board on specification and layout Languages convention (FDL), which happened on September 14-16, 2015, in Barcelona, Spain. FDL is a well-established overseas discussion board dedicated to dissemination of study effects, useful reviews and new principles within the program of specification, layout and verification languages to the layout, modeling and verification of built-in circuits, complicated hardware/software embedded platforms, and mixed-technology platforms.

Extra resources for Fault Covering Problems in Reconfigurable VLSI Systems

Example text

In such cases, a feasible cover containing the smallest number of lines is desirable. The cardinality of a cover is the number of rows and columns in the cover. A minimum cover is a cover with minimum cardinality. A feasible minimum cover is a minimum cover that is also feasible, that is, a minimum cover using at most S R rows and se columns. The problem of finding a feasible minimum cover for a given array is known as the feasible minimum cover problem [26J 1 . We have noted that the feasible cover problem is NP-complete [46].

This approach is effective because large admissible sets can be found for the subproblems. L + k or smaller. Thus, the excess-O critical set is the same as the critical set described in the last section. L + k contains the excess-k critical set. L + k. Before showing how to compute excess-k critical sets, we describe a few of their properties that make them especially attractive as admissible sets. First, it is easily verified that the excess-k critical set is a superset of the excess-(k + 1) critical set.

However, for large problem instances, the computing time incurred by the Min-Cover algorithm in finding critical sets was quite small in comparison to the time required for the simple search algorithm to construct a very large number of partial solutions. In these instances, the Min-Cover algorithm consistently had better running times than the simple search algorithm. 1. 4 The Feasible Cover Problem In many faulty arrays, no feasible minimum covers exist. However, feasible covers for these arrays may exist.

Download PDF sample

Rated 4.08 of 5 – based on 12 votes