Journal ArticleDOI
An improvement in the evaluation of convolutions of real symmetric signals using the fast Fourier transform
Reads0
Chats0
TLDR
This work has shown that the evaluation of convolutions of real data using the fast Fourier transform can be made more efficient if one of the two signals is symmetric.About:
This article is published in Signal Processing.The article was published on 1986-04-01. It has received 1 citations till now. The article focuses on the topics: Cyclotomic fast Fourier transform & Discrete Fourier transform (general).read more
Citations
More filters
References
More filters
The fast Fourier Transform
TL;DR: A computer algorithm that computes the discrete Fourier transform much faster than other algorithms, is explained and examples and detailed procedures are provided to assist the reader in learning how to use the algorithm.
Journal ArticleDOI
Number theoretic transforms to implement fast digital convolution
R.C. Agarwal,C.S. Burrus +1 more
TL;DR: Transforms using number theoretic concepts developed as a method for fast and error-free calculation of finite digital convolution are shown to be ideally suited to digital computation by taking into account quantization of amplitude as well as time in their definition.
Journal ArticleDOI
The fast Fourier transform algorithm: Programming considerations in the calculation of sine, cosine and Laplace transforms☆
TL;DR: The problem of establishing the correspondence between the discrete transforms and the continuous functions with which one is usually dealing is described and formulas and empirical results displaying the effect of optimal parameters on computational efficiency and accuracy are given.
Journal ArticleDOI
Computation of convolutions and discrete Fourier transforms by polynomial transforms
Henri J. Nussbaumer,P. Quandalle +1 more
TL;DR: Efficient algorithms for computing one-dimensional convolutions and Discrete Fourier Transforms are derived from polynomial transforms, which are shown to have the convolution property and can be computed in ordinary arithmetic, without multiplications.