Part of the Springer Series in Information Sciences book series (SSINF, volume 2)


The practical applications of the digital convolution and of the discrete Fourier transform (DFT) have gained growing importance over the last few years. This is a direct consequence of the major role played by digital filtering and DFTs in digital signal processing and by the increasing use of digital signal processing techniques made possible by the rapidly declining cost of digital hardware. The motivation for developing fast convolution and DFT algorithms is strongly rooted in the fact that the direct computation of length-N convolutions and DFTs requires a number of operations proportional to N2 which becomes rapidly excessive for long dimensions. This, in turn, implies an excessively large requirement for computer implementation of the methods.


Fast Fourier Transform Discrete Fourier Transform Arithmetic Operation Polynomial Algebra Fast Fourier Transform Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  1. 1.Department d’ElectricitéEcole Polytechnique Fédérale de LausanneLausanneSwitzerland

Personalised recommendations