Calculation of minimum number of registers in arbitrary life time chart

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE International Conference on VLSI Design
Editors Anon
PublisherPubl by IEEE
Pages83-86
Number of pages4
ISBN (Print)0818649909
StatePublished - Jan 1 1994
EventProceedings of the 7th International Conference on VLSI Design - Calcutta, India
Duration: Jan 5 1994Jan 8 1994

Publication series

NameProceedings of the IEEE International Conference on VLSI Design

Other

OtherProceedings of the 7th International Conference on VLSI Design
CityCalcutta, India
Period1/5/941/8/94

Fingerprint Dive into the research topics of 'Calculation of minimum number of registers in arbitrary life time chart'. Together they form a unique fingerprint.

Cite this