Academic Journals Database
Disseminating quality controlled scientific knowledge

Matrix-Vector Based Fast Fourier Transformations on SDR Architectures

Author(s): Y. He | K. Hueske | J. Götze | E. Coersmeier

Journal: Advances in Radio Science - Kleinheubacher Berichte
ISSN 1684-9965

Volume: 6;
Start page: 89;
Date: 2008;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Today Discrete Fourier Transforms (DFTs) are applied in various radio standards based on OFDM (Orthogonal Frequency Division Multiplex). It is important to gain a fast computational speed for the DFT, which is usually achieved by using specialized Fast Fourier Transform (FFT) engines. However, in face of the Software Defined Radio (SDR) development, more general (parallel) processor architectures are often desirable, which are not 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 that 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.

Tango Rapperswil
Tango Rapperswil

RPA Switzerland

RPA Switzerland

Robotic process automation