Matrix-Vector Based Fast Fourier Transformations on SDR Architectures

[摘要] Today Discrete Fourier Transforms (DFTs) are applied in variousradio standards based on OFDM (Orthogonal Frequency Division Multiplex).It is important to gain a fast computational speed for the DFT, which is usuallyachieved by using specialized Fast Fourier Transform (FFT) engines. However, in faceof the Software Defined Radio (SDR) development, more general (parallel) processorarchitectures 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-vectorbased description of the FFT idea, we will present different factorizations of the DFT matrix, whichallow 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 differentprocessor architectures are investigated.

[学科分类] 电子、光学、磁材料