Browse > Article

A New Two-Level Index Mapping Scheme for Pipelined Implementation of Multidimensional DFT  

Yu, Sung-Wook (중앙대학 전자전기공학부)
Publication Information
The Transactions of The Korean Institute of Electrical Engineers / v.56, no.4, 2007 , pp. 790-794 More about this Journal
Abstract
This paper presents a new index mapping method for DFT (Discrete Fourier Transform) and its application to multidimensional DFT. Unlike conventional index mapping methods such as DIT (Decimation in Time) or DIF (Decimation in Frequency) algorithms, the proposed method is based on two levels of decomposition and it can be very efficiently used for implementing multidimensional DFT as well as 1-dimensional DFT. The proposed pipelined architecture for multidimensional DFT is very flexible so that it can lead to the best tradeoff between performance and hardware requirements. Also, it can be easily extended to higher dimensional DFTs since the number of CEs (Computational Elements) and DCs (Delay Commutators) increase only linearly with the dimension. Various implementation options based on different radices and different pipelining depths will be presented.
Keywords
Multidimensional DFT; FFT; Index Mapping; Pipelined Architecture;
Citations & Related Records

Times Cited By SCOPUS : 0
연도 인용수 순위
  • Reference
1 S. G. Johnson and M. Frigo, 'A Modified Split-Radix FFT With Fewer Arithmetic Operations,' IEEE Transactions on Signal Processing, Vol. 55, pp. 111-119, 2007   DOI   ScienceOn
2 S. Bouguezel, M. O. Ahmad, and M. N. S. Swamy, 'New radix-(2$\times$2$\times$2)/(4$\times$4$\times$4) and radix-(2$\times$2$\times$2)/(4$\times$4$\times$4) DIF FFT algorithms for 3-D DFT,' IEEE Transactions on Circuits and Systems, Vol. 53, pp. 306-315, 2006   DOI   ScienceOn
3 J. D. Bruguera and T. Lang, 'Implementation of the FFT Butterfly with Redundant Arithmetic,' IEEE Transactions on Circuits and Systems II, Vol. 43, pp. 717-723, 1996   DOI   ScienceOn
4 E. E. Swartzlander, Jr., W. K. W. Young and S. J. Joseph, 'A Radix 4 Delay Commutator for Fast Fourier Transform Processor Implementation,' IEEE Journal of Solid-State Circuits, Vol. 19, pp. 702-709, 1984   DOI   ScienceOn
5 J. W. Cooley and J. W. Tukey, 'An Algorithm for the Machine Calculation of Complex Fourier Series,' Mathematics of Computation, Vol. 19, pp. 297-301, 1965   DOI
6 L. R. Rabiner and B. Gold, Theory and Applications of Digital Signal Processing, Ch. 10, Englewood Cliffs, NJ: Prentice-Hall, 1975
7 B. Gold and T. Bially, 'Parallelism in Fast Fourier Transform Hardware,' IEEE Transactions on Audio and Electronics, Vol. AU-21, pp. 5-16, 1973
8 L. Dadda and V. Piuri, 'Pipelined Adders,' IEEE Transactions on Computers, Vol. 45, pp. 348-356, 1996   DOI   ScienceOn
9 V. Szwarc, L. Desormeaux, W. Wong, C. Yeung, C. H. Chan and T. A. Kwasniewski, 'A Chip Set for Pipeline and Parallel Pipeline FFT Architectures,' Journal of VLSI Signal Processing, Vol. 8, pp. 253-265, 1994   DOI
10 C. S. Burrus, 'Index Mappings for Multidimensional Formulation of the DFT and Convolution,' IEEE Transactions on Acoustics, Speech and Signal Processing, Vol. 25, pp. 239-242, 1977   DOI
11 T. Sansaloni, A. Perez-Pascual, V. Torres and J. Valls, 'Efficient Pipeline FFT Processors for WLAN MIMO-OFDM Systems,' Electronics Letters, Vol. 41, pp. 1043-1044, 2005   DOI   ScienceOn