A pipelined tree machine architecture for computing a multidimensional convolution
- 1 April 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems
- Vol. 29 (4) , 201-207
- https://doi.org/10.1109/tcs.1982.1085137
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On the application of a fast polynomial transform and the Chinese remainder theorem to compute a two-dimensional convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1981
- Efficient transforms for multidimensional convolutionsElectronics Letters, 1979
- Computation of Convolutions and Discrete Fourier Transforms by Polynomial TransformsIBM Journal of Research and Development, 1978
- A digital system to produce imagery from SAR dataPublished by American Institute of Aeronautics and Astronautics (AIAA) ,1976
- The Fast Fourier Transform in a Finite FieldMathematics of Computation, 1971
- High-speed convolution and correlationPublished by Association for Computing Machinery (ACM) ,1966
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965