Synthesis of power-optimized and area-optimized circuits from hierarchical behavioral descriptions

ABSTRACT

We present a technique for synthesizing power- as well as area-optimized circuits from hierarchical data flow graphs under throughput constraints. We allow for the use of complex RTL modules, such as FFTs and filters, as building blocks for the RTL circuit, in addition to simple RTL modules such as adders and multipliers. Unlike past techniques in the area, we also customize the complex RTL modules to match the environment in which they find themselves. We present a fast and efficient algorithm for mapping multiple behaviors onto the same RTL module during the course of synthesis, thus allowing our synthesis system to explore previously unexplored regions of the design space. These techniques are at the core of an iterative improvement based approach which can accept temporary degradation in solution quality in its quest for a globally optimal solution. The moves in our iterative improvement procedure explore optimizations along different dimensions such as functional unit selection, resource allocation, resource sharing, resource splitting, and selection and resynthesis of complex RTL modules. These inter-related optimizations are dynamically traded off with each other during the course of synthesis, thus exploiting the benefits that arise from their interaction. The synthesis framework also tackles other related high-level synthesis tasks such as scheduling, clock selection, and Vdd selection. Experimental results demonstrate that our algorithm produces circuits whose area and power consumption are comparable to or better than those produced using flattened synthesis, within much shorter CPU times. The efficacy of our algorithm in the power-optimization mode is illustrated by the fact that it produces circuits that consume upto 6.7 times less power than area-optimized circuits working at 5 Volts at area overheads not exceeding 50%.

REFERENCES

• 1: M. Potkonjack , J. Rabaey, A scheduling and resource allocation algorithm for hierarchical signal flow graphs, Proceedings of the 26th ACM/IEEE conference on Design automation, p.7-12, June 25-28, 1989, Las Vegas, Nevada, United States [doi>10.1145/74382.74385]
• 2: D. Sreenivasa Rao , F. J. Kurdahi, Controller and datapath trade-offs in hierarchical RT-level synthesis, Proceedings of the 7th international symposium on High-level synthesis, p.152-157, May 18-20, 1994, Niagra-on-the-Lake, Ontario, Canada
• 3: D. S, Rao and E J, Kurdahi, "Hierarchical design space exploration for a class of digital systems," IEEE Trans. Computer-Aided Design, vol. 1, pp. 282-294, Sept. 1993.
• 4: A.P. Chandrakasan, M. Potkonjak, R. Mehra, J. Rabaey,, and R. W. Brodersen, "Optimizing power using transformations, 'IEEE Trans. Computer-Aided Design, vol. 14, pp. 12-5 1, Jan. 1995.
• 5: A. Raghunathan and N. K. Jha, "An ILP formulation for low power based on minimizing switched capacitance in datapath allocation," in Proc. lnt. Syrup. Circuits & Systems, pp. 1069-1073, May 1995.
• 6: Aurobindo Dasgupta , Ramesh Karri, Simultaneous scheduling and binding for power minimization during microarchitecture synthesis, Proceedings of the 1995 international symposium on Low power design, p.69-74, April 23-26, 1995, Dana Point, California, United States [doi>10.1145/224081.224094]
• 7: Laurence Goodby , Alex Orailoglu , Paul M. Chau, Microarchitectural Synthesis of Performance-Constrained, Low-Power VLSI Designs, Proceedings of the1994 IEEE International Conference on Computer Design: VLSI in Computer & Processors, p.323-326, October 10-12, 1994
• 8: G. Lakshminarayana and N. K. lha, "Hierarchical synthesis for low power," Tech. Rep., CE-J98-003, Princeton University, 1998.
• 9: Anand Raghunathan , Niraj K. Jha, Behavioral Synthesis for low Power, Proceedings of the1994 IEEE International Conference on Computer Design: VLSI in Computer & Processors, p.318-322, October 10-12, 1994
• 10: Anand Raghunathan , Niraj K. Jha, An iterative improvement algorithm for low power data path synthesis, Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design, p.597-602, November 05-09, 1995, San Jose, California, United States
• 11: Christos H. Papadimitriou , Kenneth Steiglitz, Combinatorial optimization: algorithms and complexity, Prentice-Hall, Inc., Upper Saddle River, NJ, 1982
• 12: Daniel D. Gajski , Nikil D. Dutt , Allen C.-H. Wu , Steve Y.-L. Lin, High-level synthesis: introduction to chip and system design, Kluwer Academic Publishers, Norwell, MA, 1992

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.1 PROCESSOR ARCHITECTURES
      C.1.3 Other Architecture Styles
          Subjects: Data-flow architectures

Additional Classification:
  C. Computer Systems Organization

  G. Mathematics of Computing
  G.4 MATHEMATICAL SOFTWARE
      Subjects: Algorithm design and analysis

  J. Computer Applications

General Terms:
Algorithms, Design, Experimentation, Measurement, Performance, Theory

Keywords:
ISM frequency band, RF CMOS, digital radio, spread spectrum communication, transceiver