Back to Search
Start Over
On the Twiddling Factors
- Source :
- IEEE Transactions on Computers. :544-545
- Publication Year :
- 1973
- Publisher :
- Institute of Electrical and Electronics Engineers (IEEE), 1973.
-
Abstract
- Concepts of group theory are used to explain the difference between two major fast Fourier transform (FFT) algorithms and the relation between FFT and fast Walsh transforms.
- Subjects :
- Computer science
Non-uniform discrete Fourier transform
Discrete-time Fourier transform
Fast Fourier transform
Discrete Fourier transform
Theoretical Computer Science
Discrete Fourier transform (general)
symbols.namesake
Cyclotomic fast Fourier transform
Hartley transform
Hardware_ARITHMETICANDLOGICSTRUCTURES
Arithmetic
Constant Q transform
Continuous wavelet transform
Fourier transform on finite groups
Prime-factor FFT algorithm
Short-time Fourier transform
Fractional Fourier transform
Computational Theory and Mathematics
Split-radix FFT algorithm
Hardware and Architecture
Rader's FFT algorithm
Phase correlation
symbols
Harmonic wavelet transform
Software
Twiddle factor
Subjects
Details
- ISSN :
- 00189340
- Database :
- OpenAIRE
- Journal :
- IEEE Transactions on Computers
- Accession number :
- edsair.doi...........1c9ab821c8d689821b60dfb2259862f0
- Full Text :
- https://doi.org/10.1109/t-c.1973.223762