Improving Single-Pass Redundancy Addition and Removal with Inconsistent Assignments

Lo, Wing-Hang; Wu, Yu-Liang

doi:10.1109/vdat.2006.258153

Cited by 4 publications

(8 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although about half of the benchmarks possessing unreachable states have no improvements on the number of alternative wires, our algorithm can still find more than 100% of alternative wires on the remaining circuits, when compared to [17]. Table II shows that there is a 131% (231.39%-100%) improvement in the number of alternative wires found if the unreachable states are considered.…”

Section: Resultsmentioning

confidence: 92%

“…Reference [17] provides a backward implication technique for the illegal combination before propagating unobservability and uncontrollability. The technique helps to find more stuckat faults.…”

Section: Redundancy Identification Using Unreachable Statesmentioning

confidence: 99%

“…According to [12] and [17], we can get a rule for adding a new gate n new with the input n cd and n cs to make the target wire redundant. The rule is shown in Fig.…”

Section: Alternative Wire Identificationmentioning

confidence: 99%

“…4. [17] shows the relationship between redundancy and potential redundancy. We expand the method to the sequential redundancy field.…”

Section: Alternative Wire Identificationmentioning

confidence: 99%

See 3 more Smart Citations

Improving redundancy addition and removal using unreachable states for sequential circuits

Yang

Xiao

2010

Proceedings of 2010 IEEE International Symposium on Circuits and Systems

View full text Add to dashboard Cite

Redundancy Addition and Removal (RAR), one of the major combinational logic perturbation techniques, has been shown to be very useful for many EDA optimization tasks. However, all the currently known RAR techniques did not analyze and make use of unreachable states, which are abundant in sequential circuits. These unreachable states can be considered as input don't cares and can add an extra flexibility in locating alternative wires. In this paper, we study the fundamental theory and propose a reasoning scheme for locating alternative wires without performing wasteful redundancy tests. To explore the deeper effect of unreachable states, the concept is extended to illegal assignments and the fault independent redundancy identification is applied on illegal assignments to find flexibilities introduced by unreachable states. On the experiments carried for both MCNC and industry benchmarks, it is shown that using such an idea, a remarkable increase of more than 100% (averagely) in the number of alternative wires can be found, which should be quite useful as most of today's practical circuits are sequential.

show abstract

Section: Resultsmentioning

confidence: 92%

Section: Redundancy Identification Using Unreachable Statesmentioning

confidence: 99%

“…According to [12] and [17], we can get a rule for adding a new gate n new with the input n cd and n cs to make the target wire redundant. The rule is shown in Fig.…”

Section: Alternative Wire Identificationmentioning

confidence: 99%

“…4. [17] shows the relationship between redundancy and potential redundancy. We expand the method to the sequential redundancy field.…”

Section: Alternative Wire Identificationmentioning

confidence: 99%

See 2 more Smart Citations

Improving redundancy addition and removal using unreachable states for sequential circuits

Yang

Xiao

2010

Proceedings of 2010 IEEE International Symposium on Circuits and Systems

View full text Add to dashboard Cite

show abstract

“…Although these two procedures target different wires, it is found that stuck-at fault test of the target wire could provide us some insights into the outcome of stuck-at fault tests of candidate wires. Over the years, different redundancy identification (RID) techniques [12,[17][18][19][20] have been developed to predict the redundancy of candidate wires using information from the stuck-at fault test of the target wire only.…”

Section: Analyzing Atpg-based Rewiringmentioning

confidence: 99%

On Structural Analysis and Efficiency for Graph-Based Rewiring Techniques

Chim

Lam

et al. 2011

IEICE Trans. Fundamentals

Self Cite

View full text Add to dashboard Cite

The digital logic rewiring technique has been shown to be one of the most powerful logic transformation methods. It has been proven that rewiring is able to further improve some already excellent results on many EDA problems, ranging from logic minimization, partitioning, FPGA technology mappings to final routings. Previous studies have shown that ATPG-based rewiring is one of the most powerful tools for logic perturbation while a graph-based rewiring engine is able to cover nearly one fifth of the target wires with 50 times runtime speedup. For some problems that only require good-enough and very quick solutions, this new rewiring technique may serve as a useful and more practical alternative. In this work, essential elements in graph-based rewiring such as rewiring patterns, pattern size and locality, etc., have been studied to understand their relationship with rewiring performance. A structural analysis on the target-alternative wire pairs discovered by ATPG-based and graphbased engines has also been conducted to analyze the structural characteristics that favor the identification of alternative wires. We have also developed a hybrid rewiring approach that can take the advantages from both ATPG-based and graph-based rewiring. Experimental results suggest that our hybrid engine is able to achieve about 50% of alternative wire coverage when compared with the state-of-the-art ATPGbased rewiring engine with only 4% of the runtime. Through applying our hybrid rewiring approach to the FGPA technology mapping problem, we could achieve similar depth level and look-up table number reductions with much shorter runtime. This shows that the fast runtime of our hybrid approach does not sacrifice the quality of certain rewiring applications.

show abstract

Error Injection & Correction: An efficient formal logic restructuring algorithm

Huang

Lee

Lin

et al. 2012

2012 International SoC Design Conference (ISOCC)

View full text Add to dashboard Cite

Improving Single-Pass Redundancy Addition and Removal with Inconsistent Assignments

Cited by 4 publications

References 12 publications

Improving redundancy addition and removal using unreachable states for sequential circuits

Improving redundancy addition and removal using unreachable states for sequential circuits

On Structural Analysis and Efficiency for Graph-Based Rewiring Techniques

Error Injection & Correction: An efficient formal logic restructuring algorithm

Contact Info

Product

Resources

About

Improving Single-Pass Redundancy Addition and Removal with Inconsistent Assignments

Cited by 4 publications

References 12 publications

Improving redundancy addition and removal using unreachable states for sequential circuits

Improving redundancy addition and removal using unreachable states for sequential circuits

On Structural Analysis and Efficiency for Graph-Based Rewiring Techniques

Error Injection &amp; Correction: An efficient formal logic restructuring algorithm

Contact Info

Product

Resources

About

Error Injection & Correction: An efficient formal logic restructuring algorithm