Skip to main content
Article thumbnail
Location of Repository

A Matrix-Vector Based Approach to FFT Implementations

By Yuheng He, Klaus Hueske, Jürgen Götze and Edmund Coersmeier


Abstract — Today Discrete Fourier Transforms (DFTs) are applied in various radio standards based on OFDM (Orthogonal Frequency Division Multiplex). To achieve a high computational speed with low power consumption, specialized Fast Fourier Transform (FFT) engines are used in mobile devices. However, in face of the Software Defined Radio (SDR) development, more general (parallel) processor architectures are often desirable, which are not necessarily tailored to FFT computations. Therefore, alternative approaches are required to reduce the complexity of the DFT. Starting from a matrix-vector based description of the FFT idea, we will present different factorizations of the DFT matrix, which allow a reduction of the complexity. The resulting complexity lies between the original DFT and the minimum FFT complexity. The computational complexities of these factorizations and their suitability for implementation on different processor architectures are investigated

Topics: multi-core, SDR, matrix-vector, OFDM
Year: 2014
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • http://www.dt.e-technik.uni-do... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.