Fast implementation of recursive programs using transformations
- 1 January 1992
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
An automatic transformational approach used to reduce the iteration bound of recursive DSP algorithms is presented. The proposed approach combines delay retiming, algebraic transformations and loop unrolling in a well defined order. The effectiveness of the approach is demonstrated using examples.Keywords
This publication has 9 references indexed in Scilit:
- Optimizing resource utilization using transformationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Algorithm transformations for unlimited parallelismPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Adaptive polynomial filtersIEEE Signal Processing Magazine, 1991
- Finite state machine has unlimited concurrencyIEEE Transactions on Circuits and Systems, 1991
- Incremental tree height reduction for high level synthesisPublished by Association for Computing Machinery (ACM) ,1991
- Pipeline interleaving and parallelism in recursive digital filters. I. Pipelining using scattered look-ahead and decompositionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- Dynamic parallel complexity of computational circuitsPublished by Association for Computing Machinery (ACM) ,1987
- Logic Minimization Algorithms for VLSI SynthesisPublished by Springer Nature ,1984
- Fast Parallel Computation of Polynomials Using Few ProcessorsSIAM Journal on Computing, 1983