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 language | English (US) |
|---|---|
| Pages (from-to) | 1855-1858 |
| Number of pages | 4 |
| Journal | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |
| State | Published - Jan 1 1987 |
Fingerprint
Cite this
LOOK-AHEAD COMPUTATION : IMPROVING ITERATION BOUND IN LINEAR RECURSIONS. / Parhi, Keshab Kumar; Messerschmitt, David G.
In: ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, 01.01.1987, p. 1855-1858.Research output: Contribution to journal › Conference article
}
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 - Conference article
AN - SCOPUS:0023168975
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 -