A New Representation of FFT Algorithms Using Triangular Matrices
2016 (English)In: IEEE Transactions on Circuits and Systems Part 1: Regular Papers, ISSN 1549-8328, E-ISSN 1558-0806, Vol. 63, no 10, 1737-1745 p.Article in journal (Refereed) Published
In this paper we propose a new representation for FFT algorithms called the triangular matrix representation. This representation is more general than the binary tree representation and, therefore, it introduces new FFT algorithms that were not discovered before. Furthermore, the new representation has the advantage that it is simple and easy to understand, as each FFT algorithm only consists of a triangular matrix. Besides, the new representation allows for obtaining the exact twiddle factor values in the FFT flow graph easily. This facilitates the design of FFT hardware architectures. As a result, the triangular matrix representation is an excellent alternative to represent FFT algorithms and it opens new possibilities in the exploration and understanding of the FFT.
Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC , 2016. Vol. 63, no 10, 1737-1745 p.
Binary tree; Cooley-Tukey; fast Fourier transform (FFT)
Other Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:liu:diva-132528DOI: 10.1109/TCSI.2016.2587822ISI: 000385621800017OAI: oai:DiVA.org:liu-132528DiVA: diva2:1046403
Funding Agencies|Swedish ELLIIT Program2016-11-142016-11-132016-12-05