• DocumentCode
    3257470
  • Title

    Pipelined FFT for wireless communications supporting 128–2048 / 1536 -point transforms

  • Author

    Inkeun Cho ; Patyk, Tomasz ; Guevorkian, D. ; Takala, Jarmo ; Bhattacharyya, Souvik

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Univ. of Maryland, College Park, MD, USA
  • fYear
    2013
  • fDate
    3-5 Dec. 2013
  • Firstpage
    1242
  • Lastpage
    1245
  • Abstract
    Modern wireless communication systems use orthogonal frequency division multiplexing (OFDM) and multiple input multiple output (MIMO) schemes, which call for fast Fourier transforms (FFT). Traditionally power-of-two FFT lengths have been exploited but recently also non-power-of-two transform lengths have been defined. For example, 3GPP LTE specification defines 1536- point FFT. In this paper, we propose a pipeline FFT architecture, which supports FFT lengths of power-of-two multiple of three. The architecture is basically single delay feedback structure followed by radix-3 computation unit. The proposed architecture is memory optimal as for N-point transform only N - 1 memory locations are needed.
  • Keywords
    MIMO communication; OFDM modulation; digital arithmetic; fast Fourier transforms; 128-2048/1536-point transforms; 1536- point FFT; 3GPP LTE specification; MIMO scheme; N-1 memory locations; OFDM; fast Fourier transforms; modern wireless communication systems; multiple input multiple output schemes; orthogonal frequency division multiplexing; pipelined FFT; radix-3 computation unit; single delay feedback structure; Clocks; Fast Fourier transforms; Field programmable gate arrays; Solids;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Conference on Signal and Information Processing (GlobalSIP), 2013 IEEE
  • Conference_Location
    Austin, TX
  • Type

    conf

  • DOI
    10.1109/GlobalSIP.2013.6737133
  • Filename
    6737133