Calculation of Minimum Number of Registers in Arbitrary life time Chart

Research output: Contribution to journalArticle

21 Citations (Scopus)

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)
Pages (from-to)434-436
Number of pages3
JournalIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
Volume41
Issue number6
DOIs
StatePublished - Jan 1 1994

Fingerprint

Digital signal processing
Networks (circuits)

Cite this

@article{f0636047a9a648af9734f92ea3a61392,
title = "Calculation of Minimum Number of Registers in Arbitrary life time Chart",
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.",
author = "Parhi, {Keshab K}",
year = "1994",
month = "1",
day = "1",
doi = "10.1109/82.300209",
language = "English (US)",
volume = "41",
pages = "434--436",
journal = "IEEE Transactions on Circuits and Systems II: Express Briefs",
issn = "1549-8328",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Calculation of Minimum Number of Registers in Arbitrary life time Chart

AU - Parhi, Keshab K

PY - 1994/1/1

Y1 - 1994/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0028446057&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028446057&partnerID=8YFLogxK

U2 - 10.1109/82.300209

DO - 10.1109/82.300209

M3 - Article

AN - SCOPUS:0028446057

VL - 41

SP - 434

EP - 436

JO - IEEE Transactions on Circuits and Systems II: Express Briefs

JF - IEEE Transactions on Circuits and Systems II: Express Briefs

SN - 1549-8328

IS - 6

ER -