ABSTRACT
To gain the knowledge concerning the design and implementation of fast algorithms for computing the prime-length discrete Fourier transform (DFT), this chapter provides MATLAB implementation to demonstrate the merits of these algorithms. It aims to evaluate the two function M- les Tfft.m and iTfft.m on computing the DFT/inverse DFT of data sets with prime length N2. The chapter discusses Bluestein s fast Fourier transform (FFT) and provides array-smart implementations for both FFT and its inverse in MATLAB. It presents Bluesteins FFT/inverse FFT algorithms in the form of MATLAB® functions Bfft and iBfft. In coding the algorithm, the chapter utilizes MATLAB vectorized operations and built-in functions in processing all data arrays.
