Journal Article10.1109/43.640617
Postlayout logic restructuring using alternative wires
61
TL;DR: The proposed layout-driven synthesis approach for field programmable gate arrays (FPGA's) attempts to identify alternative wires and alternative functions for wires that cannot be routed due to the limited routing resources in FPGA.
read more
Abstract: In this paper, we propose a layout-driven synthesis approach for field programmable gate arrays (FPGA's). The approach attempts to identify alternative wires and alternative functions for wires that cannot be routed due to the limited routing resources in FPGA. The alternative wires (in the logic level) that can be routed through less congested areas substitute the unroutable wires without changing the circuit's functionality. Allowing the logic blocks to have alternative functions also increases the chance of successful routing. A redundancy addition and removal technique is used to identify such alternative wires. Experimental results are presented to demonstrate the usefulness of this approach. For a set of randomly selected benchmark circuits, on the average, 30-50% of wires have alternative wires. These results indicate that the routing flexibility can be substantially increased by considering these alternative wires. Our prototype system successfully completed routing for two AT&T designs that cannot be handled by an FPGA router alone. The proposed synthesis technique can also be applied to standard cell and gate array designs to reduce the routing area.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Circuit optimization by rewiring
TL;DR: This work presents a very efficient optimization method suitable for multi-level combinational circuits based on incremental restructuring of a circuit through a sequence of additions and removals of redundant wires to eliminate unnecessary wire redundancy checking.
77
Quality of EDA CAD tools: definitions, metrics and directions
Amir H. Farrahi,D.J. Hathaway,M. Wang,Majid Sarrafzadeh +3 more
- 20 Mar 2000
TL;DR: The need for rethinking quality models used in EDA tools to allow early and reliable planning, estimation, analysis, and optimization, and methodologies and directions for the next generation design automation tools are discussed.
58
Seamless Integration of SER in Rewiring-Based Design Space Exploration
Sobeeh Almukhaizim,Yiorgos Makris,Yu-Shen Yang,Andreas Veneris +3 more
- 01 Oct 2006
TL;DR: An ATPG-based rewiring method is employed to generate functionally-equivalent yet structurally-different implementations of a logic circuit based on simple transformation rules that enable the integration of the soft error rate (SER) in a unified search algorithm that iteratively evolves the design in order to satisfy a given set of objectives.
Single-pass redundancy addition and removal
Chih Wei Jim Chang,Malgorzata Marek-Sadowska +1 more
- 04 Nov 2001
TL;DR: This paper proposes a new reasoning scheme which directly identifies alternative wires without performing trial-and-error redundancy tests and shows up to 15 times speedup in comparison to the best techniques in literature.
38
Design rewiring using ATPG
Andreas Veneris,Magdy S. Abadir +1 more
TL;DR: The authors reduce the problem of design rewiring to the process of injecting a redundant set of multiple pattern faults and arrive at a new set of results with theoretical and practical applications.
References
FlowMap: an optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs
Jason Cong,Yuzheng Ding +1 more
TL;DR: A theoretical breakthrough is presented which shows that the LUT-based FPGA technology mapping problem for depth minimization can be solved optimally in polynomial time.
Chortle-crf: Fast technology mapping for lookup table-based FPGAs
Robert J. Francis,Jonathan Rose,Zvonko G. Vranesic +2 more
- 01 Jun 1991
TL;DR: A new technology mapping algorithm for lookup tablebased Field Programmable Gate Arrays (FPGA) is presented, the major innovation is a method for choosing gate-level decompositions based on bin packing that is up to 28 times faster than a previous exhaustive approach.
Improved logic synthesis algorithms for table look up architectures
Rajeev Murgai,Narendra Shenoy,Robert K. Brayton,Alberto Sangiovanni-Vincentelli +3 more
- 01 Jan 1991
TL;DR: The authors address the problem of synthesis for a popular class of programmable gate array architecture-the table look-up architectures that use lookup table memories to implement logic functions.
211
Advanced automatic t est pattern g eneration and redundancy identification techniques
Michael H. Schulz,Elisabeth Auth +1 more
- 01 Jan 1988
TL;DR: An improved implication procedure and an improved unique sensitization procedure significantly advance the deterministic test pattern generation and redundancy identification especially for those faults, for which it is difficult to generate a test pattern or to prove them to be redundant, respectively.
163
Advanced automatic test pattern generation and redundancy identification techniques
M.H. Schulz,E. Auth +1 more
- 27 Jun 1988
TL;DR: Based on the sophisticated strategies used in the automatic test pattern generation system SOCRATES, this article presented several concepts aiming at a further improvement and acceleration of the deterministic test pattern generator and redundancy identification process.
160