Conflict-free parallel memory accessing techniques for FFT architectures

IEEE Transactions on Circuits and Systems I: Regular Papers

Volumn 55, Issue 11, 2008, Pages 3438-3447

  Reisis, Dionysios ^a   Vlassopoulos, Nikolaos ^a  

^a UNIVERSITY OF ATHENS   (Greece)

Author keywords

Fast Fourier transform (FFT); Parallel architectures; Signal processing

Indexed keywords

FAST FOURIER TRANSFORMS; INTERACTIVE COMPUTER SYSTEMS; MEMORY ARCHITECTURE; REAL TIME SYSTEMS; SIGNAL PROCESSING; TABLE LOOKUP;

ADDRESS GENERATION; B STAGES; CONFLICT FREE; IS COSTS; MEMORY BANKS; PARALLEL MEMORY; TELECOMMUNICATION APPLICATIONS;

PARALLEL ARCHITECTURES;

EID: 58049211396     PISSN: 10577122     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCSI.2008.924889     Document Type: Article

References (15)

1. J. W. Cooley and J. W. Tukey, "An algorithm for the machine calculation of complex Fourier series," Math. Comput., vol. 19, no. 90, pp. 297-301, Apr. 1965.
2. A. Oppenheim and R. Shafer, Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1975.
3. L. G. Johnson, "Conflict free memory addressing for dedicated FFT hardware," IEEE Trans. Circuits Syst. II, Analog Digit. Signal Process., vol. 39, no. 5, May 1992.
4. Y. Ma, "An effective memory addressing scheme for FFT processors," IEEE Trans. Signal Process., vol. 47, no. 3, pp. 907-911, Mar. 1999.
5. Y. Ma and L. Wanhammar, "A hardware efficient control of memory addressing for high-performance FFT processors," IEEE Trans. Signal Process., vol. 48, no. 3, pp. 917-921, Mar. 2000.
6. C. D. Thompson, "Fourier transforms in VLSI," IEEE Trans. Comput. vol. C-32, no. 11, pp. 1047-1057, Nov. 1983.
7. E. H. Wold and A. M. Despain, "Pipeline and parallel-pipeline FFT processors for VLSI implementations," IEEE Trans. Comput., vol. C-33, no. 5, pp. 414-426, May 1984.
8. S. He and M. Torkelson, "Design and implementation of a 1024-point pipeline FFT processor," in Proc. IEEE Custom Integr. Circuits Conf. 1998, pp. 131-134.
9. S. He and M. Torkelson, "A new approach to pipeline FFT processor," in Proc. IPPS, 1996, pp. 766-770.
10. B. Suter and K. S. Stevens, "A low power, high performance approach for time-frequency time-scale computations," in Proc. SPIE Conf. Advanced Signal Process. Algorithms, Architectures Implementations VIII Jul. 1998, vol. 3461, pp. 86-90.
11. R. Thomas and K. Yelick, "Efficient FFTs on IRAM," in Proc. 1st Workshop Media Processors DSPs, 1999.
12. D. Harper, "Block, multistride vector, and FFT accesses in parallel memory systems," IEEE Trans. Parallel Distrib. Syst., vol. 2, no. 1, pp. 43-51, Jan. 1991.
13. N. Hu and O. Ersoy, "Fast computation of real discrete Fourier transform for any number of data points," IEEE Trans. Circuits Syst. vol. 38, no. 11, pp. 1280-1292, Nov. 1991.
14. B. Go and M. Sunwoo, "New continuous-flow mixed radix (CFMR) FFT processor using novel in-place strategy," IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 52, no. 5, pp. 911-919, May 2005.
15. K. Babionitakis, K. Manolopoulos, K. Nakos, N. Vlassopoulos, D. Reisis, and V. Chouliaras, "A high performance VLSI FFT architecture," in Proc. 13th IEEE Int. Conf. Electron., Circuits Syst., Dec. 2006, pp. 810-813.