Unfolding and Folding of Architectures - Digital Design of Signal Processing Systems: A Practical Approach - page 379

6. K. K. Parhi and D. G. Messerschmitt, “Static rate-optimal scheduling of iterative data-flow programs via optimum
unfolding,” IEEE Transactions on Computing, 1991, vol. 40, pp. 178-195.
7. K. K. Parhi, “High-level algorithm and architecture transformations for DSP synthesis,” IEEE Journal of VLSI
Signal Processing, 1995, vol. 9, pp. 121-143.
8. L.-G. Jeng and L.-G. Chen, “Rate-optimal DSP synthesis by pipeline andminimumunfolding,” IEEETransactions
on Very Large Scale Integration Systems, 1994, vol. 2, pp. 81-88.
9. L. Jia, Y. Gao and H. Tenhunen, “Efficient VLSI implementation of radix-8 FFT algorithm,” in Proceedings of
IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, 1999, pp. 468-471.
10. L. Jia, Y. Gao, J. Isoaho and H. Tenhunen, “A new VLSI-oriented FFT algorithm and implementation,” in
Proceedings of 11th IEEE International ASIC Conference, 1998, pp. 337-341.
11. G. L. Stuber et al., “BroadbandMIMO-OFDMwireless communications,” Proceedings of the IEEE, 2004, vol. 92,
pp. 271-294.
12. J. Valls, T. Sansaloni et al. “Efficient pipeline FFT processors for WLAN MIMO-OFDM systems,” Electronics
Letters, 2005, vol. 41, pp. 1043-1044.
13. B. Fu and P. Ampadu, “An area-efficient FFT/IFFT processor for MIMO-OFDM WLAN 802.11n,” Journal of
Signal Processing Systems, 2008, vol. 56, pp. 59-68.
14. C. Cheng and K. K. Parhi, “High-throughput VLSI architecture for FFT computation,” IEEE Transactions on
Circuits and Systems II, 2007, vol. 54, pp. 863-867.
15. S. He and M. Torkelson, “Designing pipeline FFT processor for OFDM (de)modulation,” in Proceedings of
International Symposium on Signals, Systems and Electronics, URSI, 1998, pp. 257-262.
16. C.-C. Wang, J.-M. Huang andH.-C. Cheng, “A2K/8Kmode small-area FFT processor for OFDMdemodulation of
DVB-T receivers,” IEEE Transactions on Consumer Electronics, 2005, vol. 51, pp. 28-32.
17. Y.-W. Lin, H.-Y. Liu and C.-Y. Lee, “A dynamic scaling FFT processor for DVB-Tapplications,” IEEE Journal of
Solid-State Circuits, 2004, vol. 39, pp. 2005-2013.
18. C.-L. Wang and C.-H. Chang, “A new memory-based FFT processor for VDSL transceivers,” in Proceedings of
IEEE International Symposium on Circuits and Systems, 2001, pp. 670-673.
19. C.-L. Wey, W.-C. Tang and S.-Y. Lin, “Efficient VLSI implementation of memory-based FFT processors for DVB-
T applications,” in Proceedings of IEEE Computer Society Annual Symposium on VLSI, 2007, pp. 98-106.
20. C.-H. Chen, B.-D. Liu, J.-F. Yang and J.-L. Wang, “Efficient recursive structures for forward and inverse discrete
cosine transform,” IEEE Transactions on Signal Processing, 2004, vol. 52, pp. 2665-2669.
21. K. K. Parhi, VLSI Digital Signal Processing Systems: Design and Implementation, 1999, Wiley.
22. T. C. Denk and K. K. Parhi, “Synthesis of folded pipelined architectures for multirate DSP algorithms,” IEEE
Transactions on Very Large Scale Integration Systems, 1998, vol. 6, pp. 595-607.
23. G. Goertzel, “An algorithm for evaluation of finite trigonometric series,” American Mathematical Monthly, 1958,
vol. 65, pp. 34-35.