Abstract
A fast algorithm is proposed for recursively computing the DFTs of prime length. Only (N-1)/2 real multiplications are required to compute all N frequency components in terms of permuting the input data.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have