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

  • Authors:

  • H. Murakami

  • Affiliations:

  • Kanazawa Inst. of Technol., Ishikawa, Japan

  • Venue:
  • ICASSP '96 Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.