Accelerating Logic Rewiring Using Implication Analysis Tree(Special Section on VLSI Design and CAD Algorithms)
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we present a novel algorithm to the alternative wiring problem by analyzing the implication relationship between nodes of alternative wires. Alternative wiring, or rewiring, refers to the process of adding a redundant connection to a circuit so as to make a target connection redundant and removable from the circuit without altering the functionality of the circuit. The well-known ATPG-based alternative wiring scheme, Redundancy Addition and Removal for Multilevel Boolean Optimization (RAMBO), has shown its effectiveness in solving the problem in the last decade. But, the deficiency of RAMBO lies in its long execution time for redundancy identification among a large set of candidate alternative wires. Our approaches of redundancy identification by source node and destination node implication relationship indicate that a large subset of unnecessary redundancy check processes can be further avoided to improve the efficiency significantly. We propose an algorithm, the Implication Based Alternative Wiring Logic Transformation (IBAW), to integrate the two adroit techniques. IBAW provides a competent solution to the alternative wiring problem and shows an outstanding efficiency in our experiments. Experiments were performed on MCNC benchmark circuits. Results show that IBAW runs 6.8 times faster than the original RAMBO in locating alternative wires and solution quality is maintained.
- 社団法人電子情報通信学会の論文
- 2002-12-01
著者
-
Wu Yu-liang
Department Of Computer Science And Engineering The Chinese University Of Hong Kong
-
Sze Chin-ngai
Department Of Electrical Engineering Texas A&m University
-
Bian Jinian
Department Of Computer Science And Technology Tsinghua University
-
LONG Wangning
Aplus Design Technologies, Inc.
-
Long Wangning
Aplus Design Technologies Inc.
-
WU Yu-Liang
Department of Computer Science and Engineering, The Chinese University of Hong Kong
関連論文
- Accelerating Logic Rewiring Using Implication Analysis Tree(Special Section on VLSI Design and CAD Algorithms)
- An Efficient Exact Router for Hyper-Universal Switching Box(Special Section on Papers Selected from ITC-CSCC 2002)
- On Structural Analysis and Efficiency for Graph-Based Rewiring Techniques
- On Structural Analysis and Efficiency for Graph-Based Rewiring Techniques