The DFT (Discrete Fourier Transform) is essentially a sequence of polynomials of the twiddle factor WkN, thus the relationship between the properties of twiddle factors WknN and algorithms for the DFT is very close. This paper intends to summarize and investigate the properties of WknN and explain how they are used in some efficient algorithms for DFT. Besides the periodicity and symmetry of WknN, the real coefficient pairs of WknN and the occurrence number of WiN (I = kn mod N) are presented and discussed. A new algorithm based on these properties is presented too.
(See document for exact affiliation information.)
https://aes2.org/publications/elibrary-page/?id=11445
(671KB)
Click to purchase paper as a non-member or login as an AES member. If your company or school subscribes to the E-Library then switch to the institutional version. If you are not an AES member Join the AES. If you need to check your member status, login to the Member Portal.
