DFT Algorithms - Analysis and Implementation
STANFORD UNIV CA STANFORD ELECTRONICS LABS
Pagination or Media Count:
Efficient algorithms for 11 and 13-point DFTs are presented. A more efficient algorithm, compared to earlier published versions, for the computation of 9-point DFT is also included. The effect of arithmetic roundoff in implementing the prime factor and the nested algorithms for computing DFT with fixed point arithmetic is analyzed using a statistical model. Various aspects of the prime factor, the nested and the radix-2 FFT algorithms are compared. A processor-based hardware implementation of the prime factor algorithm is discussed.
- Theoretical Mathematics