• DocumentCode
    1128564
  • Title

    Calculation of minimum number of registers in arbitrary life time chart

  • Author

    Parhi, Keshab K.

  • Author_Institution
    Dept. of Electr. Eng., Minnesota Univ., Minneapolis, MN, USA
  • Volume
    41
  • Issue
    6
  • fYear
    1994
  • fDate
    6/1/1994 12:00:00 AM
  • Firstpage
    434
  • Lastpage
    436
  • Abstract
    This paper presents a general approach to calculate the minimum number of registers in any digital signal processing (DSP) circuit for any arbitrarily specified life time chart and periodicity of computation. DSP operations are repetitive and periodic in nature. The life time chart specifies the life period of all variables in a single frame and the subsequent frames are computed in a periodic manner. We present the techniques for the calculation of minimum number of registers by using the life time chart and the circular life time graph
  • Keywords
    digital signal processing chips; pipeline processing; shift registers; DSP chips; arbitrary life time chart; circular life time graph; digital signal processing circuit; minimum register number; periodicity of computation; single frame; Computer architecture; Computer science; Digital integrated circuits; Digital signal processing; Discrete wavelet transforms; Integrated circuit synthesis; Matrix converters; Registers; Signal synthesis; Silicon;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1057-7130
  • Type

    jour

  • DOI
    10.1109/82.300209
  • Filename
    300209