Abstract
This work is a contribution to high level synthesis for low power systems. While device feature size decreases, interconnect power becomes a dominating factor. Thus it is important that accurate physical information is used during high-level synthesis [1]. We propose a new power optimisation algorithm for RT-level netlists. The optimisation performs simultaneously slicing-tree structure-based floorplanning and functional unit binding and allocation. Since floorplanning, binding and allocation can use the information generated by the other step, the algorithm can greatly optimise the interconnect power. Compared to interconnect unaware power optimised circuits, it shows that interconnect power can be reduced by an average of 42.7 %, while reducing overall power by 21.7 % on an average. The functional unit power remains nearly unchanged. These optimisations are not achieved at the expense of area.
This work was supported by the European Union, IST-2000-30125, POET
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Scheffer, L.: A roadmap of CAD tool changes for sub-micron interconnect problems. In: International Symosium on Physical Design (ISPD), California, United States (1997)
Weng, J.-P., Parker, A.C.: 3D scheduling: High-level synthesis with floorplanning. In: Proc. of Design Automation Conference (1992)
Fang, Y.-M., Wong, D.F.: Simultaneous functional-unit binding and floorplanning. In: Proc. Int. Conf. Computer-Aided Design (1994)
Chang, J.M., Pedram, M.: Register allocation and binding for low power. In: Proc. of Design Automation Conference (1995)
Mehra, R., Guerra, L.M., Rabaey, J.M.: Low-power architectural synthesis and the impact of exploiting locality J. VLSI Signal Processing (1996)
Raghunathan, A., Jha, N.K.: SCALP: An iterative-improvement-based low power data path synthesis system. In: Proc. Int. Conf. Computer-Aided Design (1997)
Kruse, L., Schmidt, E., Cölln, G.v., Stammermann, A., Schulz, A., Macii, E., Nebel, W.: Estimation of lower and upper bounds on the power consumption from scheduled data flow graphs. IEEE Trans. VLSI Systems (2001)
Prabhakaran, P., Banerjee, P.: Simultaneous scheduling, binding and floorplanning in high-level synthesis. In: Proc. Int. Conf. VLSI Design (1998)
Zhong, L., Jha, N.K.: Interconnect-aware High-level Synthesis for Low Power. In: ICCAD (2002)
Christie, P., Stroobandt, D.: The Interpretation and Application of Rent’s Rule. IEEE Trans. VLSI Systems (2000)
Jochens, G., Kruse, L., Schmidt, E., Nebel, W.: A New Paramiterizable Power Macro-Model for Datapath Components. In: Proc. of Design, Automation and Test in Europe (1999)
Stammermann, A., Kruse, L., Nebel, W., Pratsch, A., Schmidt, E., Schulte, M., Schulz, A.: System Level Optimization and Design Space Exploration for Low Power. In: 14th International Symposium on System Synthesis, Canada (2001)
Nebel, W., Helms, D., Schmidt, E., Schulte, M., Stammermann, A.: Low Power Design for SoCs. In: Information Society in Broadband Europe, Romania (2002)
Wong, D.F., Liu, C.L.: A new algorithm for floorplan design. In: Proc. of Design Automation Conference (1986)
Semiconductor Industry Association. National Technology Roadmap for Semiconductors, San Jose, CA: SIA, 1999
Rabaey, J.M.: Digital Integrated Circuits. Prentice Hall, Englewood Cliffs (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stammermann, A., Helms, D., Schulte, M., Schulz, A., Nebel, W. (2003). Interconnect Driven Low Power High-Level Synthesis. In: Chico, J.J., Macii, E. (eds) Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation. PATMOS 2003. Lecture Notes in Computer Science, vol 2799. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39762-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-39762-5_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20074-1
Online ISBN: 978-3-540-39762-5
eBook Packages: Springer Book Archive