Macro-driven circuit design methodology for high-performance datapaths

ABSTRACT

Datapath design is one of the most critical elements in the design of a high performance microprocessor. However datapath design is typically does 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 “macro-driven” 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.

REFERENCES

• 1: J. Fishburn and A. Dunlop, " TILOS: A posynomial programming approach to transistor sizing," in Proc. ACM/IEEE ICCAD, pp. 326-328, 1985.
• 2: S. S. Sapatnekar, V. B. Rao and P. M. Vaidya and Sung- Mo Kang, "An exact solution to transistor sizing Problem for CMOS circuits using convex optimization," IEEE Transactions on CAD, vol. 12, pp. 1621-1634, Nov. 1993.
• 3: J.-M. Shyu, A. Sangiovanni-Vincentelli, J. Fishburn and A. Dunlop, "Optimization-based transistor sizing," IEEE Journal of Solid-State Circuits, vol.23, Apr. 1988
• 4: Michel R. C. M. Berkelaar , Jochen A. G. Jess, Gate sizing in MOS digital circuits with linear programming, Proceedings of the conference on European design automation, March 12-15, 1990, Glasgow, Scotland
• 5: W. Chuang, S. S. Sapatnekar and I. N. Hajj, "Timing and area optimization for standard-cell VLSI circuit design," IEEE Transactions on CAD, vol. 14, March 1995.
• 6: J. G. Ecker, "Geometric programming: Methods, computations & applications," SlAM Review, vol.22, pp. 338-362, July 1980.
• 7: K. O. Kortanek , Xiaojie Xu , Yinyu Ye, An infeasible interior-point algorithm for solving primal and dual geometric programs, Mathematical Programming: Series A and B, v.76 n.1, p.155-181, Jan. 2, 1997 [doi>10.1007/BF02614382]
• 8: Vivek Tiwari , Deo Singh , Suresh Rajgopal , Gaurav Mehta , Rakesh Patel , Franklin Baez, Reducing power in high-performance microprocessors, Proceedings of the 35th annual conference on Design automation, p.732-737, June 15-19, 1998, San Francisco, California, United States [doi>10.1145/277044.277227]
• 9: A. R. Conn , I. M. Elfadel , W. W. Molzen, Jr. , P. R. O'Brien , P. N. Strenski , C. Visweswariah , C. B. Whan, Gradient-based optimization of custom circuits using a static-timing formulation, Proceedings of the 36th ACM/IEEE conference on Design automation, p.452-459, June 21-25, 1999, New Orleans, Louisiana, United States [doi>10.1145/309847.309979]
• 10: Robert King Brayton , Alberto L. Sangiovanni-Vincentelli , Curtis T. McMullen , Gary D. Hachtel, Logic Minimization Algorithms for VLSI Synthesis, Kluwer Academic Publishers, Norwell, MA, 1984
• 11: Giovanni De Micheli, Synthesis and Optimization of Digital Circuits, McGraw-Hill Higher Education, 1994
• 12: D. Harris et al., "Opportunistic time-borrowing domino logic", U.S. Patent No. 5,517,136, May 14, 1996.

INDEX TERMS

Primary Classification:
  J. Computer Applications

Additional Classification:
  B. Hardware
  B.5 REGISTER-TRANSFER-LEVEL IMPLEMENTATION
      B.5.1 Design
          Subjects: Data-path design
  B.8 Performance and Reliability

General Terms:
Design, Measurement, Performance, Theory