Comparison based Analysis of Different FFT Architectures
| Autor: | Dhara M. Koyani, Daizy M. Gandhi, Priyanka S. Pariyal, Ankit Adesara, Dharambhai Shah, Sunil F. Yadav |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
010302 applied physics
Non-uniform discrete Fourier transform Computer science Fast Fourier transform Prime-factor FFT algorithm Real-time computing 02 engineering and technology 01 natural sciences Discrete Fourier transform Computer Science::Hardware Architecture Split-radix FFT algorithm Discrete sine transform Rader's FFT algorithm 0103 physical sciences 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Algorithm Twiddle factor |
| Zdroj: | International Journal of Image, Graphics and Signal Processing. 8:41-47 |
| ISSN: | 2074-9082 2074-9074 |
| DOI: | 10.5815/ijigsp.2016.06.05 |
| Popis: | A time-domain sequence is converted into an equivalent frequency-domain sequence using discrete Fourier transform. The reverse operation converts a frequency-domain sequence into an equivalent time- domain sequence using inverse discrete Fourier transform. Based on the discrete Fourier transform. Fast Fourier transform (FFT) is an effective algorithm with few computations. FFT is used in everything from broadband to 3G and Digital TV to radio LAN"s. To improve its architecture different efficient algorithms are developed. This paper gives an overview of the work done by a different FFT processor previously. The comparison of different architecture is also discussed. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|