For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Fast Discrete Fourier Transform and Cyclic Convolution Algorithms for Real Sequences
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/08/25
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Digital Signal Processing)
the discrete Fourier transform, real fast algorithm, orthogonal expansion,
Full Text: PDF(260.2KB)>>
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.