Loading...
Please wait, while we are loading the content...
Similar Documents
Fast Fourier Transform (FFT)
| Content Provider | Scilit |
|---|---|
| Author | Abood, Samir I. |
| Copyright Year | 2020 |
| Description | FFT is a very efficient method for computing the DFT coefficients. It reduces the number of complex multiplications from $N^{2}$ in case of DFT to simply $N/2log_{2}$(N) In the case of FFT. The only restriction on the algorithm is that the sequence x(ne) should consist of $2^{m}$ Samples, where m is a positive integer – in other words, the number N of samples in the sequence should be a power of 2, i.e., N = 2,4,8,16,... etc. If x(n) does not contain $2^{m}$ samples, then we append it with zeros until the number of samples in the resulting sequence becomes a power of 2. There are several ways in which the FFT could ). We shall study radix-2 FFT algorithms, namely, Decimation-in-Frequency method. Decimation-in-Time method. Other types include radix-4 and split-radix methods. Book Name: Digital Signal Processing |
| Related Links | https://content.taylorfrancis.com/books/download?dac=C2019-0-09028-3&isbn=9781003010548&doi=10.1201/9781003010548-8&format=pdf |
| Ending Page | 142 |
| Page Count | 14 |
| Starting Page | 129 |
| DOI | 10.1201/9781003010548-8 |
| Language | English |
| Publisher | Informa UK Limited |
| Publisher Date | 2020-01-20 |
| Access Restriction | Open |
| Subject Keyword | Book Name: Digital Signal Processing Hardware and Architecturee |
| Content Type | Text |
| Resource Type | Chapter |
