VLSI Digital Signal Processing Systems: Design and Implementation

REFERENCES

1. M. Renfors and Y. Neuvo, “The maximum sampling rate of digital filters under hardware speed constraints,” IEEE Trans. on Circuits and Systems, vol. CAS-28, no. 3, pp. 196–202, March 1981.

2. K. K. Parhi and D. G. Messerschmitt, “Static rate-optimal scheduling of iterative data-flow programs via optimum unfolding,” IEEE Trans. on Computers, vol. 40, no. 2, pp. 178–195, Feb. 1991.

3. S. H. Gerez, S. M. Heemstrade Groot, and O. E. Herrmann, “A polynomial-time algorithm for the computation of the iteration-period bound in recursive dataflow graphs,” IEEE Trans. on Circuits and Systems–I: Fundamental Theory and Applications, vol. 39, no. 1, pp. 49–52, Jan. 1992.

4. K. Ito and K. K. Parhi, “Determining the minimum iteration period of an algorithm,” Journal of VLSI Signal Processing, vol. 11, pp. 229–244, 1995.

5. D. Y. Chao and D. T. Wang, “Iteration bounds of single-rate data flow graphs for concurrent processing,” IEEE Trans. on Circuits and Systems– I: Fundamental Theory and Applications, vol. 40, no. 9, pp. 629–634, Sept. 1993.

6. R. M. Karp, “A characterization of the minimum cycle mean in a digraph,” Discrete Mathematics, vol. 23, pp. 309–311, 1978.

7. E. A. Lee and D. G. Messerschmitt, “Static scheduling of synchronous data flow programs for digital signal processing,” IEEE Trans. on Computers, vol. C-36, no. 1, pp. 24–35, Jan. 1987.

8. D. A. Schwartz and T. P. Barnwell, III, “Cyclo-static solutions: optimal multiprocessor realizations of recursive algorithms,” in ...