Determining the minimum iteration period of an algorithm
Authors:
- 1 December 1995
- journal article
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 11 (3) , 229-244
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Pipelining of lattice IIR digital filtersIEEE Transactions on Signal Processing, 1994
- Iteration bounds of single-rate data flow graphs for concurrent processingIEEE Transactions on Circuits and Systems I: Regular Papers, 1993
- 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
- Static rate-optimal scheduling of iterative data-flow programs via optimum unfoldingIEEE Transactions on Computers, 1991
- Algorithm transformation techniques for concurrent processorsProceedings of the IEEE, 1989
- Static Scheduling of Synchronous Data Flow Programs for Digital Signal ProcessingIEEE Transactions on Computers, 1987
- A Graph Theoretic Technique for the Generation of Systolic Implementations for Shift-Invariant Flow Graphs.1984
- The maximum sampling rate of digital filters under hardware speed constraintsIEEE Transactions on Circuits and Systems, 1981
- A characterization of the minimum cycle mean in a digraphDiscrete Mathematics, 1978