Optimization of Rotations in FFTs
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. A...
Main Author: | Qureshi, Fahad |
---|---|
Format: | Doctoral Thesis |
Language: | English |
Published: |
Linköpings universitet, Elektroniksystem
2012
|
Subjects: | |
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-74702 http://nbn-resolving.de/urn:isbn:978-91-7519-973-3 |
Similar Items
-
Automated Parameter Tuning based on RMS Errors for nonequispaced FFTs
by: Nestler, Franziska
Published: (2015) -
An Algorithm for Computing the Radix-2n Fast Fourier Transform
by: Junyuan ZHANG, et al.
Published: (2013-07-01) -
One Technique to Enhance the Resolution of Discrete Fourier Transform
by: Ivan Kanatov, et al.
Published: (2019-03-01) -
Automated Scalable Address Generation Patterns for 2-Dimensional Folding Schemes in Radix-2 FFT Implementations
by: Felipe Minotta, et al.
Published: (2018-03-01) -
Introduction to the discrete Fourier series considering both mathematical and engineering aspects - A linear-algebra approach
by: Ludwig Kohaupt
Published: (2015-12-01)