Is redundancy necessary to reduce delay?
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 228-234
- https://doi.org/10.1109/dac.1990.114859
Abstract
Logic optimization procedures principally attempt to optimize three criteria: performance, area, and testability. The relationship between area optimization and testability has recently been explored. As to the relationship between performance and testability, experience has shown that performance optimizations can, and do in practice, introduce single stuck-at-fault redundancies into designs. Are these redundancies necessary to increase performance or are they only an unnecessary by-product of performance optimization? The authors give a constructive resolution of this question in the form of an algorithm that takes as input a combinational circuit and returns an irredundant circuit that is as fast. They demonstrate the utility of this algorithm on a well-known circuit, the carry-skip adder, and present a novel irredundant design of that adder. As this algorithm may either increase or decrease circuit area, the authors leave unresolved the question as to whether every circuit has all irredundant circuit that is at least as fast and is of equal or lesser area.Keywords
This publication has 14 references indexed in Scilit:
- On properties of algebraic transformation and the multifault testability of multilevel logicPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Static timing analysis of dynamically sensitizable pathsPublished by Association for Computing Machinery (ACM) ,1989
- Efficient algorithms for computing the longest viable path in a combinational networkPublished by Association for Computing Machinery (ACM) ,1989
- On the general false path problem in timing analysisPublished by Association for Computing Machinery (ACM) ,1989
- Timing analysis using functional analysisIEEE Transactions on Computers, 1988
- MIS: A Multiple-Level Logic Optimization SystemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- A Switch-Level Timing Verifier for Digital MOS VLSIIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
- Redundancy and Don't Cares in Logic SynthesisIEEE Transactions on Computers, 1983
- TV: An nMOS Timing AnalyzerPublished by Springer Nature ,1983
- Skip Techniques for High-Speed Carry-Propagation in Binary Arithmetic UnitsIEEE Transactions on Electronic Computers, 1961