An Algorithm for Computing the Radix-2n Fast Fourier Transform
In digital signal processing, the Fast Fourier Transform (FFT) is a kind of high efficient method to calculate the discrete Fourier transform (DFT). It cuts the discrete signal sequence which the length is N for different radix sequences to operate using the way of handing back and partition. Curren...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IFSA Publishing, S.L.
2013-07-01
|
| Series: | Sensors & Transducers |
| Subjects: | |
| Online Access: | http://www.sensorsportal.com/HTML/DIGEST/july_2013/P_1278.pdf |