## Macro-Driven Circuit Design Methodology for High-Performance Datapaths (2000)

Venue: | in Proc. of ACM/IEEE DAC |

Citations: | 1 - 0 self |

### BibTeX

@INPROCEEDINGS{Nemani00macro-drivencircuit,

author = {Mahadevamurty Nemani and Vivek Tiwari},

title = {Macro-Driven Circuit Design Methodology for High-Performance Datapaths},

booktitle = {in Proc. of ACM/IEEE DAC},

year = {2000}

}

### OpenURL

### Abstract

Datapath design is one of the most critical elements in the design of a high performance microprocessor. However datapath design is typically done manually, and is often custom style. This adversely impacts the overall productivity of the design team, as well as the quality of the design. In spite of this, very little automation has been available to the designers of high performance datapaths. In this paper we present a new "macrodriven " approach to the design of datapath circuits. Our approach, referred to as SMART (Smart Macro Design Advisor), is based on automatic generation of regular datapath components such as muxes, comparators, adders etc., which we refer to as datapath macros. The generated solution is based on designer provided constraints such as delay, load and slope, and is optimized for a designer provided cost metric such as power, area. Results on datapath circuits of a high-performance microprocessor show that this approach is very effective for both designer productivity as well as design quality.

### Citations

504 |
Synthesis and optimization of digital circuits
- DeMicheli
- 1994
(Show Context)
Citation Context ...Besides the business realities regarding the relative size of the high-performance vs. general VLSI market, the reasons for this are to do with the basic nature and limitations of synthesis tools [10]=-=[11]-=-. These tools are good at searching and optimizing within a defined search space. They cannot innovate, i.e. extend the search space on their own. However, continuous innovation is necessary in the hi... |

360 |
Sangiovanni_Vincentelll ""Logic Minimization Algorithms for VLSI Synthesis" Kluwer Academic Pub
- Brayton, Hachte, et al.
- 1984
(Show Context)
Citation Context ...AD. Besides the business realities regarding the relative size of the high-performance vs. general VLSI market, the reasons for this are to do with the basic nature and limitations of synthesis tools =-=[10]-=-[11]. These tools are good at searching and optimizing within a defined search space. They cannot innovate, i.e. extend the search space on their own. However, continuous innovation is necessary in th... |

164 | TILOS: a posynomial programming approach to transistor sizing - Fishburn, Dunlop - 1985 |

90 | An exact solution to the transistor sizing problem for CMOS circuits using convex optimization - Sapatnekar, Rao, et al. - 1993 |

39 |
Geometric programming: methods, computations and applications
- Ecker
- 1980
(Show Context)
Citation Context ...rn places a restriction on the complexity of the modeling process. Keeping these issues of accuracy versus speed in mind, we have chosen to keep the component model “posynomial” (positive polynomi=-=al) [6]-=-. This makes the optimization problem a Geometric Program [3]. The advantage of such programs is that they can be transformed into convex problems [6, 7] that can be solved efficiently and quickly, in... |

38 |
Optimization-based transistor sizing
- Shyu, Sangiovanni-Vincentelli, et al.
- 1988
(Show Context)
Citation Context ...cess. Keeping these issues of accuracy versus speed in mind, we have chosen to keep the component model “posynomial” (positive polynomial) [6]. This makes the optimization problem a Geometric Prog=-=ram [3]-=-. The advantage of such programs is that they can be transformed into convex problems [6, 7] that can be solved efficiently and quickly, in a numerically stable fashion. The optimal sizes for the netl... |

33 |
An infeasible interior-point algorithm for solving primal and dual geometric programs
- Kortanek, Xu, et al.
- 1997
(Show Context)
Citation Context ...omponent model “posynomial” (positive polynomial) [6]. This makes the optimization problem a Geometric Program [3]. The advantage of such programs is that they can be transformed into convex probl=-=ems [6, 7]-=- that can be solved efficiently and quickly, in a numerically stable fashion. The optimal sizes for the netlist are generated by solving the above optimization problem using a geometric program solver... |

26 | Gradient-based optimization of custom circuits using a static-timing formulation
- Conn, Elfadel, et al.
- 1999
(Show Context)
Citation Context ...several different types of constraints we generate for sizing a given circuit, the most important ones are the timing constraints. While there are several approaches to generating timing constraints, =-=[9]-=-, the approach taken by us has been to specify these as constraints on the topological paths through the network. However, a combinational circuit can have an extremely large set of paths through it. ... |

16 | Timing and area optimization for standard-cell VLSI circuit design
- Chuang, Sapatnekar, et al.
- 1995
(Show Context)
Citation Context ...or sizing, in which the transistor sizes are allowed to vary continuously between a minimum and maximum size, has been tackled before in [1-4]. A related problem is that of discrete of library-sizing =-=[5]-=-. This is a combinatorial problem that is NP-complete. The continuous transistor sizing methodology used in SMART has significant differences from prior approaches. As mentioned earlier, the sizer has... |

6 |
Logic Minimization Algorithms for VLSI Synthesis
- al
- 1984
(Show Context)
Citation Context ...AD. Besides the business realities regarding the relative size of the high-performance vs. general VLSI market, the reasons for this are to do with the basic nature and limitations of synthesis tools =-=[10]-=-[11]. These tools are good at searching and optimizing within a defined search space. They cannot innovate, i.e. extend the search space on their own. However, continuous innovation is necessary in th... |

3 |
et al, “Opportunistic Time-Borrowing Domino Logic
- Harris
- 1996
(Show Context)
Citation Context ...flow customization for different macros. An interesting feature of SMART sizer for dynamic circuits is that the problem formulation automatically takes into account OTB (Opportunistic Time Borrowing) =-=[12]-=-. This allows its application on even some of the most critical circuits. 6. RESULTS In this section, we discuss a few results obtained using SMART. 6.1 Sizing results In order to study the effectiven... |

1 | Gate-Sizing in MOS digital circuits with linear programming - Berkelaar, Jess - 1990 |