Optimization of Rotations in FFTs
2012 (English)Doctoral thesis, comprehensive summary (Other academic)
The aims of this thesis are to reduce the complexity and increasethe accuracy of rotations carried out inthe fast Fourier transform (FFT) at algorithmic and arithmetic level.In FFT algorithms, rotations appear after every hardware stage, which are alsoreferred to as twiddle factor multiplications.
At algorithmic level, the focus is on the development and analysisof FFT algorithms. With this goal, a new approach based on binary tree decompositionis proposed. It uses the Cooley Tukey algorithm to generate a large number ofFFT algorithms. These FFT algorithms have identical butterfly operations and data flow but differ inthe value of the rotations. Along with this, a technique for computing the indices of the twiddle factors based on the binary tree representation has been proposed. We have analyzed thealgorithms in terms of switching activity, coefficient memory size, number of non-trivial multiplicationsand round-off noise. These parameters have impact on the power consumption, area, and accuracy of the architecture.Furthermore, we have analyzed some specific cases in more detail for subsets of the generated algorithms.
At arithmetic level, the focus is on the hardware implementation of the rotations.These can be implemented using a complex multiplier,the CORDIC algorithm, and constant multiplications. Architectures based on the CORDIC and constant multiplication use shift and add operations, whereas the complex multiplication generally uses four real multiplications and two adders.The sine and cosine coefficients of the rotation angles fora complex multiplier are normally stored in a memory.The implementation of the coefficient memory is analyzed and the best possible approaches are analyzed.Furthermore, a number of twiddle factor multiplication architectures based on constant multiplications is investigated and proposed. In the first approach, the number of twiddle factor coefficients is reduced by trigonometric identities. By considering the addition aware quantization method, the accuracy and adder count of the coefficients are improved. A second architecture based on scaling the rotations such that they no longer have unity gain is proposed. This results in twiddle factor multipliers with even lower complexity and/or higher accuracy compared to the first proposed architecture.
Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2012. , 49 p.
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1423
Discrete Fourier transform, Fast Fourier transform, twiddle factor multiplication
National CategorySignal Processing
IdentifiersURN: urn:nbn:se:liu:diva-74702ISBN: 978-91-7519-973-3OAI: oai:DiVA.org:liu-74702DiVA: diva2:490459
2012-03-01, Visionen, B-huset, Campus Valla, Linköpings universitet, Linköping, 13:15 (English)
Takala, Jarmo, Professor
Gustafsson, Oscar, Dr.Garrido, Mario, Dr.
List of papers