Determining the minimum iteration period of an algorithm

This publication has 11 references indexed in Scilit:

• A scheduling framework for minimizing memory requirements of multirate DSP systems represented as dataflow graphs
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• A novel framework for multi-rate scheduling in DSP applications
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Pipelining of lattice IIR digital filters
  IEEE Transactions on Signal Processing, 1994
• Iteration bounds of single-rate data flow graphs for concurrent processing
  IEEE 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 graphs
  IEEE Transactions on Circuits and Systems I: Regular Papers, 1992
• Static rate-optimal scheduling of iterative data-flow programs via optimum unfolding
  IEEE Transactions on Computers, 1991
• Algorithm transformation techniques for concurrent processors
  Proceedings of the IEEE, 1989
• Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing
  IEEE Transactions on Computers, 1987
• The maximum sampling rate of digital filters under hardware speed constraints
  IEEE Transactions on Circuits and Systems, 1981
• A characterization of the minimum cycle mean in a digraph
  Discrete Mathematics, 1978