Computer Aided Design Tools

In the previous chapters, approaches were presented to minimize the power consumption though supply voltage scaling and the reduction of switched capacitance. The focus of this chapter is on automatically finding computational structures that result in the lowest power consumption for DSP applications that have a specific throughput constraint given a high-level algorithmic specification. The basic approach is to scan the design space utilizing various algorithmic flowgraph transformations, high-level power estimation, and efficient heuristic/probabilistic search mechanisms. While algorithmic transformations have been successfully applied in high-level synthesis with the goal of optimizing speed and/or area, they have not addressed the problem of minimizing power.

[1]  David Goldberg,et al.  What every computer scientist should know about floating-point arithmetic , 1991, CSUR.

[2]  Fadi J. Kurdahi,et al.  Techniques for area estimation of VLSI layouts , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Farid N. Najm,et al.  Transition density, a stochastic measure of activity in digital circuits , 1991, 28th ACM/IEEE Design Automation Conference.

[4]  David G. Messerschmitt,et al.  Breaking the Recursive Bottleneck , 1988 .

[5]  Joos Vandewalle,et al.  Estimation of typical power of synchronous CMOS circuits using a hierarchy of simulators , 1993 .

[6]  Miodrag Potkonjak,et al.  Optimizing power using transformations , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Keshab K. Parhi,et al.  Algorithm transformation techniques for concurrent processors , 1989, Proc. IEEE.

[8]  Miodrag Potkonjak,et al.  Fast prototyping of datapath-intensive architectures , 1991, IEEE Design & Test of Computers.

[9]  Donald E. Thomas,et al.  Behavioral transformation for algorithmic level IC design , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Jan M. Rabaey,et al.  An integrated CAD system for algorithm-specific IC design , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  N. Kimura,et al.  Calculation of total dynamic current of VLSI using a switch level timing simulator (RSIM-FX) , 1991, Proceedings of the IEEE 1991 Custom Integrated Circuits Conference.

[12]  Christopher M. Bishop,et al.  Classification and regression , 1997 .

[13]  Alfred V. Aho,et al.  Principles of Compiler Design , 1977 .

[14]  Mark Horowitz,et al.  IRSIM: An Incremental MOS Switch-Level Simulator , 1989, 26th ACM/IEEE Design Automation Conference.

[15]  M. Potkonjak,et al.  Maximally fast and arbitrarily fast implementation of linear computations (circuit layout CAD) , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

[16]  William R. Heller,et al.  Prediction of wiring space requirements for LSI , 1977, DAC '77.

[17]  Mohamed I. Elmasry,et al.  Architectural synthesis for DSP silicon compilers , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[18]  Robert A. Walker,et al.  A Survey of high-level synthesis systems , 1991 .

[19]  Miodrag Potkonjak,et al.  Maximally fast and arbitrarily fast implementation of linear computations , 1992, ICCAD '92.

[20]  Jan M. Rabaey,et al.  Power estimation for high level synthesis , 1993, 1993 European Conference on Design Automation with the European Event in ASIC Design.

[21]  Howard Trickey,et al.  Flamel: A High-Level Hardware Compiler , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[22]  G. Goertzel An Algorithm for the Evaluation of Finite Trigonometric Series , 1958 .

[23]  Hugo De Man,et al.  Efficient and accurate multiparameter analysis of linear digital filters using a multivariable feedback representation , 1984 .