Real-valued fast discrete Fourier transform and cyclic convolution algorithms of highly composite even length

摘要

This paper introduces a new recursive factorization of the polynomial, 1-z/sup N/, over the real numbers when N is an even composite integer. The recursive factorization is applied for efficient computation of the discrete Fourier transform (DFT) and the cyclic convolution of real sequences with highly composite even length.