Fast Fourier transforms with factored residue look-up tables
| Autor: | Anastasios P. Goutzoulis |
|---|---|
| Rok vydání: | 2010 |
| Předmět: |
Signal processing
Adder Computer science business.industry Materials Science (miscellaneous) Fast Fourier transform Prime-factor FFT algorithm Industrial and Manufacturing Engineering Quadratic residue symbols.namesake Optics Fourier transform Split-radix FFT algorithm Phase correlation Lookup table Electronic engineering symbols Hardware_ARITHMETICANDLOGICSTRUCTURES Business and International Management business Algorithm Mathematics |
| Zdroj: | Applied optics. 28(19) |
| ISSN: | 1559-128X |
| Popis: | The implementation of fast Fourier transforms (FFTs) via the use of residue factored look-up tables (FLUTs) is investigated. The principles of FLUTs are reviewed, and a gate-level pipelined adder architecture is presented. The basics of the quadratic residue system (QRNS) are then discussed, and FLUT-based gatelevel pipelined architectures are presented for binary-to-QRNS and QRNS-to-binary converters as well as for FFT butterflies. The Despain small integer approximations are used to represent the FFT complex rotations, each of which is expressed via a linear combination of common angles. The QRNS FLUT FFT performance is measured via a normalized mean square error (MSE) figure, which is estimated via computer simulations performed for 16- and 32-point QRNS FFTs in conjunction with various input signals and different approximation accuracy. Based on these results the largest FLUT FFT order, for which an MSE of |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|