Mathematical background for generalized, partial, and incomplete discrete Fourier transforms
- 24 March 2005
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5, 218-221
- https://doi.org/10.1109/icassp.1980.1170900
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- New algorithms for digital convolutionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Existence Theorems for Transforms Over Finite Rings with Applications to 2-D ConvolutionMathematics of Computation, 1980
- Flexibility in the length of convolutions computed using Fourier-like fast transform algorithmsSignal Processing, 1980
- The Discrete Fourier Transform Over Finite Rings with Application to Fast ConvolutionIEEE Transactions on Computers, 1978
- Computation of Convolutions and Discrete Fourier Transforms by Polynomial TransformsIBM Journal of Research and Development, 1978