The goal of this thesis has been to reduce the hardware cost of SDF FFTs. Inorder to achieve this, two methods for simplifying rotations in FFTs are presented:Decimation and Reduction. When applied, these methods reduce the total amountof angles that the rotators need to rotate, as well as the total angle count of theFFT. This is useful for constant shift and add based rotators, as their hardwarecost are typically dependent on the amount of angles it needs to calculate.Decimation works by splitting a large twiddle factor into a smaller one plusan additional small rotator in series. This allows for the possibility to implementlarge FFTs without needing any large twiddle factors. Reduction is a method thattakes a twiddle factor and simplifies it by removing one angle from the rotator.This can be done without adding any hardware cost if applied correctly.In addition to the methods, the thesis also includes proposed designs for 64- upto 1024-point FFTs, as well as post-implementation results for a 32- and 64-pointFFT.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:liu-108148 |
| Date | January 2013 |
| Creators | Andersson, Rikard |
| Publisher | Linköpings universitet, Institutionen för systemteknik, Linköpings universitet, Tekniska högskolan |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0025 seconds