By Topic

Calculation of minimum number of registers in arbitrary life time chart

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Parhi, K.K. ; Dept. of Electr. Eng., Minnesota Univ., Minneapolis, MN, USA

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

Published in:

VLSI Design, 1994., Proceedings of the Seventh International Conference on

Date of Conference:

5-8 Jan 1994