Area-Efficient Timing Optimization
نویسندگان
چکیده
LGR (Logic Gates as Repeaters) – a methodology for delay optimization of CMOS logic circuits with RC interconnects is described. The traditional interconnect segmentation by insertion of repeaters is generalized to segmentation by distributing logic gates over interconnect lines, reducing the number of additional, logically useless inverters. Expressions for optimal segment lengths and gate scaling are derived. Considerations are presented for integrating LGR into a VLSI design flow in conjunction with related methods. Several logic circuits have been implemented, optimized and verified by LGR. Analytical and simulation results were obtained, showing significant improvement in performance in comparison with traditional repeater insertion, while maintaining low complexity and small area.
منابع مشابه
Non-Heuristic Optimization and Synthesis of Parallel-Prefix Adders
The class of parallel-prefix adders comprises the most area-delay efficient adder architectures – such as the ripple-carry, the carry-increment, and the carry-lookahead adders – for the entire range of possible area-delay trade-offs. The generic description of these adders as prefix structures allows their simple and consistent area optimization and synthesis under given timing constraints, inc...
متن کاملRevisiting the Application of Simultaneous Perturbation Stochastic Approximation towards Signal Timing Optimization
Simultaneous Perturbation Stochastic Approximation (SPSA) has gained favor as an efficient optimization method for calibrating computationally intensive, “black box” traffic flow simulations. Few recent studies have investigated the efficiency of SPSA for traffic signal timing optimization. It is important for this to be investigated, because significant room for improvement exists in the area ...
متن کاملTiming and area optimization for standard-cell VLSI circuit design - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
AbstructA standard cell library typically contains several versions of any given gate type, each of which has a different gate size. We consider the problem of choosing optimal gate sizes from the library to minimize a cost function (such as total circuit area) while meeting the timing constraints imposed on the circuit. After presenting an efficient algorithm for combinational circuits, we exa...
متن کاملA System-Level Timing Analysis and Optimization Methodology for Hardware Compilation
Electronic Design Automation (EDA) in the nano era faces a fresh set of challenges. Designs are getting larger and more complex, and design metrics are evolving from area and performance in the past to power and reliability in the future. In this changing landscape, the ITRS roadmap notes that it is imperative that we raise the level of abstraction in system-level design to deal with this incre...
متن کاملAn Area-Efficient Timing Closure Technique for FPGAs Using Shannon's Expansion
This paper presents a technique to optimize the speed performance of circuits implemented in FPGAs. After synthesis, technology mapping and placement are complete, we apply Shannon’s expansion to the most critical sections of the circuit. This approach allows us to precompute the values of functions that depend on late-arriving critical signals and use a multiplexer to quickly select the approp...
متن کامل