LOOK-AHEAD COMPUTATION

IMPROVING ITERATION BOUND IN LINEAR RECURSIONS.

Keshab Kumar Parhi, David G. Messerschmitt

Research output: Contribution to journalArticle

26 Citations (Scopus)

Abstract

A technique of look-ahead computation applicable to any linear recursive algorithm to achieve equivalent realizations with reduced iteration period and higher sampling rate is introduced. The concurrency created by the use of look-ahead computation can be used to obtain pipelined and/or block implementations. The authors illustrate the applicability of the look-ahead computation technique to obtain high-speed VLSI realizations of linear time-invariant and time-varying systems. A generalized look-ahead computation technique theorem for arbitrary interleaving is also presented. Finally, it is shown that the iteration period in certain synchronous data flow graphs can also be reduced by the use of look-ahead computation.

Original languageEnglish (US)
Pages (from-to)1855-1858
Number of pages4
JournalICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
StatePublished - Jan 1 1987

Fingerprint

iteration
flow graphs
Data flow graphs
Time varying systems
very large scale integration
theorems
sampling
high speed
Sampling

Cite this

@article{7f549abb0a724349bd627288ccfe61ed,
title = "LOOK-AHEAD COMPUTATION: IMPROVING ITERATION BOUND IN LINEAR RECURSIONS.",
abstract = "A technique of look-ahead computation applicable to any linear recursive algorithm to achieve equivalent realizations with reduced iteration period and higher sampling rate is introduced. The concurrency created by the use of look-ahead computation can be used to obtain pipelined and/or block implementations. The authors illustrate the applicability of the look-ahead computation technique to obtain high-speed VLSI realizations of linear time-invariant and time-varying systems. A generalized look-ahead computation technique theorem for arbitrary interleaving is also presented. Finally, it is shown that the iteration period in certain synchronous data flow graphs can also be reduced by the use of look-ahead computation.",
author = "Parhi, {Keshab Kumar} and Messerschmitt, {David G.}",
year = "1987",
month = "1",
day = "1",
language = "English (US)",
pages = "1855--1858",
journal = "Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing",
issn = "0736-7791",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - LOOK-AHEAD COMPUTATION

T2 - IMPROVING ITERATION BOUND IN LINEAR RECURSIONS.

AU - Parhi, Keshab Kumar

AU - Messerschmitt, David G.

PY - 1987/1/1

Y1 - 1987/1/1

N2 - A technique of look-ahead computation applicable to any linear recursive algorithm to achieve equivalent realizations with reduced iteration period and higher sampling rate is introduced. The concurrency created by the use of look-ahead computation can be used to obtain pipelined and/or block implementations. The authors illustrate the applicability of the look-ahead computation technique to obtain high-speed VLSI realizations of linear time-invariant and time-varying systems. A generalized look-ahead computation technique theorem for arbitrary interleaving is also presented. Finally, it is shown that the iteration period in certain synchronous data flow graphs can also be reduced by the use of look-ahead computation.

AB - A technique of look-ahead computation applicable to any linear recursive algorithm to achieve equivalent realizations with reduced iteration period and higher sampling rate is introduced. The concurrency created by the use of look-ahead computation can be used to obtain pipelined and/or block implementations. The authors illustrate the applicability of the look-ahead computation technique to obtain high-speed VLSI realizations of linear time-invariant and time-varying systems. A generalized look-ahead computation technique theorem for arbitrary interleaving is also presented. Finally, it is shown that the iteration period in certain synchronous data flow graphs can also be reduced by the use of look-ahead computation.

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

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

M3 - Article

SP - 1855

EP - 1858

JO - Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing

JF - Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing

SN - 0736-7791

ER -