Look-ahead computation: Improving iteration bound in linear recursions
- 24 March 2005
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 12, 1855-1858
- https://doi.org/10.1109/icassp.1987.1169698
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A graph theoretic technique for the generation of systolic implementations for shift-invariant flow graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Static Scheduling of Synchronous Data Flow Programs for Digital Signal ProcessingIEEE Transactions on Computers, 1987
- Towards an FIR filter tissuePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Fast block data processing via a new IIR digital filter structureIEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
- Parallelism and Array ProcessingIEEE Transactions on Computers, 1984
- Optimizing Synchronous Circuitry by Retiming (Preliminary Version)Published by Springer Nature ,1983
- The maximum sampling rate of digital filters under hardware speed constraintsIEEE Transactions on Circuits and Systems, 1981
- Block-shift invariance and block implementation of discrete-time filtersIEEE Transactions on Circuits and Systems, 1980
- Look-Ahead ProcessorsACM Computing Surveys, 1975
- A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence EquationsIEEE Transactions on Computers, 1973