'Point dfts' presentation slideshows

FFT ALGORITHMS FOR COMPOSITE N

FFT ALGORITHMS FOR COMPOSITE N. efficient computation of the DFT is still possible if the sequence length may be written a power of 2. However, the sequence length may be written as a product of factors. Suppose that N may be factored as follows: N = N . N 2.

523 views • 11 slides