An O(N)Supply Voltage Assignment Algorithm for Low-Energy Serially Connected CMOS Modules and a Heuristic Extension to Acyclic Data Flow Graphs

  • Authors:
  • Abdulkadir Utku Diril;Yuvraj Singh Dhillon;Kyu-won Choi;Abhijit Chatterjee

  • Affiliations:
  • -;-;-;-

  • Venue:
  • ISVLSI '03 Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03)
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, a novel algorithm is proposed for assigningsupply voltages to serially executing functional units(FUs) in a digital system such that the overall dynamicenergy consumption is minimized for a given timingconstraint. Novel closed form expressions for optimumsupply voltage values are presented. The computationtime of the algorithm is O(N)for N FUs in series. Anextension of the O(N) algorithm is proposed foroptimizing the acyclic data flow graph associated withany given task. Given the number of FUs available for thetask, the operations required for the task are scheduled onthe FUs. Voltages are then assigned to the FUs on eachpath of the flow graph using the O(N) algorithm. Energysavings of 10-60% are achieved on DSP filter designsusing the proposed high-level optimization methodologyover single supply voltage designs.