DocumentCode
1714174
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
fYear
1994
Firstpage
83
Lastpage
86
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 the minimum number of registers by using the life-time chart and the circular life-time graph
Keywords
digital signal processing chips; graphs; DSP circuit; circular life-time graph; digital signal processing; life-time chart; minimum number calculation; registers; Computer architecture; Computer science; Digital signal processing; Discrete wavelet transforms; Integrated circuit synthesis; Matrix converters; Minimization; Registers; Signal processing; Signal synthesis;
fLanguage
English
Publisher
ieee
Conference_Titel
VLSI Design, 1994., Proceedings of the Seventh International Conference on
Conference_Location
Calcutta
ISSN
1063-9667
Print_ISBN
0-8186-4990-9
Type
conf
DOI
10.1109/ICVD.1994.282661
Filename
282661
Link To Document