Title :
Real-valued fast discrete Fourier transform and cyclic convolution algorithms of highly composite even length
Author_Institution :
Kanazawa Inst. of Technol., Ishikawa, Japan
Abstract :
This paper introduces a new recursive factorization of the polynomial, 1-zN, 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
Keywords :
convolution; discrete Fourier transforms; polynomials; sequences; DFT; composite even length algorithms; cyclic convolution algorithms; even composite integer; polynomial; real numbers; real sequences; real-valued fast discrete Fourier transform; recursive factorization; Arithmetic; Computational complexity; Convolution; Discrete Fourier transforms; Equations; Physics computing; Polynomials;
Conference_Titel :
Acoustics, Speech, and Signal Processing, 1996. ICASSP-96. Conference Proceedings., 1996 IEEE International Conference on
Conference_Location :
Atlanta, GA
Print_ISBN :
0-7803-3192-3
DOI :
10.1109/ICASSP.1996.543667
