Maximizing the throughput of high performance DSP applications using behavioral transformations
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Algebraic Recurrence Transformations For Massive ParallelismPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Pipelining: just another transformationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A polynomial time algorithm for the computation of the iteration-period bound in recursive data flow graphsIEEE Transactions on Circuits and Systems I: Regular Papers, 1992
- Fast implementation of recursive programs using transformationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Fast prototyping of datapath-intensive architecturesIEEE Design & Test of Computers, 1991
- Static rate-optimal scheduling of iterative data-flow programs via optimum unfoldingIEEE Transactions on Computers, 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
- Optimizing Synchronous Circuitry by Retiming (Preliminary Version)Published by Springer Nature ,1983
- The Complexity of Parallel Evaluation of Linear RecurrencesJournal of the ACM, 1977
- New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and RecurrencesJournal of the ACM, 1976