Power efficient data path synthesis of sum-of-products computations

  • Authors:
  • Konstantinos Masselos;Panagiotis Merakos;Spyros Theoharis;Thanos Stouraitis;Costas E. Goutis

  • Affiliations:
  • INTRACOM S. A, Athens, Greece and Department of Electrical and Computer Engineering, University of Patras, Patras, 26-500 Greece;Athena SEMI S.A., Athens, Greece and Department of Electrical and Computer Engineering, University of Patras, Patras, 11-141 Greece;ALMA Technologies S.A., Athens 11-745 Greece;Department of Electrical and Computer Engineering, University of Patras, Patras 26-500 Greece;Department of Electrical and Computer Engineering, University of Patras, Patras 26-500 Greece

  • Venue:
  • IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special section on the 2001 international conference on computer design (ICCD)
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Techniques for the power efficient data path synthesis of sum-of-products computations between data and coefficients are presented. The proposed techniques exploit specific features of this type of computations. Efficient heuristics for the scheduling and assignment tasks, based on the concept of the Traveling Salesman's Problem, are described. Different cost functions are proposed to drive the synthesis tasks. The proposed cost functions target the power consumption either in the interconnect buses or in the functional units. Experimental results from different relevant digital signal processing algorithmic kernels prove that the proposed synthesis techniques lead to significant power savings.