Rate-optimal DSP synthesis by pipeline and minimum unfolding

This paper presents a rate-optimal scheduling for real-time DSP algorithms. By using pipelining and unfolding techniques, the parallel characteristics of recursive DSP algorithms can be exploited. A novel unfolding technique is developed to unravel all concurrency in the recursive data flow graph. A perfect rate unfolded data flow graph is also introduced, which can cause a fully static rate optimal functional pipeline schedule. Experimental results have shown that the proposed method can always yield rate-optimal designs with a smaller unfolding factor compared to previous studies. >

[1]  Sanjit K. Mitra,et al.  An approach to the implementation of digital filters using microprocessors , 1978 .

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Markku Renfors,et al.  Fast multiprocessor realizations of digital filters , 1980, ICASSP.

[4]  Markku Renfors,et al.  The maximum sampling rate of digital filters under hardware speed constraints , 1981 .

[5]  J. Zeman,et al.  Systematic design and programming of signal processors, using project management techniques , 1983 .

[6]  Thomas P. Barnwell,et al.  Cyclo-static multiprocessor scheduling for the optimal realization of shift-invariant flow graphs , 1985, ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[7]  Paul M. Chau,et al.  Vlsi Signal Processing II , 1986 .

[8]  Edward A. Lee,et al.  Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing , 1989, IEEE Transactions on Computers.

[9]  Alice C. Parker,et al.  Sehwa: a software package for synthesis of pipelines from behavioral specifications , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  T. P. Barnwell,et al.  Optimal multiprocessor implementations from a serial algorithm specification , 1988, ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing.

[11]  Keshab K. Parhi,et al.  Algorithm transformation techniques for concurrent processors , 1989, Proc. IEEE.

[12]  Liang-Gee Chen,et al.  Optimal module set and clock cycle selection for DSP synthesis , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[13]  Keshab K. Parhi,et al.  Static Rate-Optimal Scheduling of Iterative Data-Flow Programs via Optimum Unfolding , 1991, IEEE Trans. Computers.

[14]  Yu Hen Hu,et al.  Optimal scheduling of linear recurrence equations on a multiprocessor array , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.

[15]  Keshab K. Parhi,et al.  Unfolding and retiming for high-level DSP synthesis , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[16]  Sabih H. Gerez,et al.  Range-chart-guided iterative data-flow graph scheduling , 1992 .

[17]  Liang-Gee Chen,et al.  Rate-Optimal DSP Synthesis by Pipeline and Minimum Unfolding , 1993, The Sixth International Conference on VLSI Design.