A method for programming the complex general-N Winograd Fourier transform algorithm

H.F. Silverman

doi:10.1109/ICASSP.1977.1170333

ICASSP 1977

Conference paper

09 May 1977

A method for programming the complex general-N Winograd Fourier transform algorithm

View publication

Abstract

The Winograd Fourier Transform Algorithm (WFTA) requires about 20% of the multiplications used in an optimized FFT, while the number of additions remains unchanged. This paper describes one »General-N» (i.e. many allowable DFT sizes (N) but certainly not any vector size) complex WFTA programming technique.

Conference paper

Preliminary results on the performance of a system for the automatic recognition of continuous speech

Conference paper

The 1976 Modular Acoustic Processor (MAP): Signal analysis and phonemic segmentation

Conference paper

The 1975 Modular Acoustic Processor (MAP): Diadic segment classification and final phonemic string estimation

Conference paper

An application hierarchy for heuristic rules in automatic phonemic segmentation of continuous speech

View all publications

Abstract

Related

Preliminary results on the performance of a system for the automatic recognition of continuous speech

The 1976 Modular Acoustic Processor (MAP): Signal analysis and phonemic segmentation

The 1975 Modular Acoustic Processor (MAP): Diadic segment classification and final phonemic string estimation

An application hierarchy for heuristic rules in automatic phonemic segmentation of continuous speech