A Generalized Technique for Register Counting and its Application to Cost-Optimal DSP Architecture Synthesis

  • Authors:
  • Kazuhito Ito;Keshab K. Parhi

  • Affiliations:
  • Dept. of Elec. and Elect. Syst., Saitama University, Urawa, Saitama 338, Japan;Dept. of Electrical Engineering, University of Minnesota, Minneapolis, MN 55455

  • Venue:
  • Journal of VLSI Signal Processing Systems - Special issue on the 1995 VLSI signal processing workshop
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we propose a generalized technique to count therequired number of registers in a schedule which supports overlappedscheduling and can be applied to the case where a generaldigit-serial data format is used. This technique is integrated intoan integer linear programming (ILP) model for time-constrainedscheduling. In the ILP model, appropriate processors of certain dataformats are chosen from a library of processors and data formatconverters are automatically inserted between processors of differentdata formats if necessary. Then the required number of registers foreach data format is evaluated correctly by the proposed technique.Hence an optimal architecture for a given digital signal processingalgorithm is synthesized where the cost of registers as well as thecost of processors and data format converters are minimized. It isshown that by including the cost of registers in the synthesis taskas proposed in this paper leads to up to 12.8% savings in the totalcost of the synthesized architecture when compared with synthesisperformed without including the register cost in the total cost.