Semisystolic Array Implementation of Circular, Skew Circular, and Linear Convolutions
- 1 February 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-34 (2) , 190-196
- https://doi.org/10.1109/tc.1985.1676558
Abstract
Semisystolic array implementation of circular and linear convolutions in one and multidimensions are discussed. The common feature of the various architectures studied is the broadcasting of the input sequence to the cells of the array. In the case of circular convolutions, there is also circular communication between the cells. A circular convolution of period N can be calculated in N time steps whereas the response time for the computation of N outputs of linear convolution with finite weight and data vectors is also N time steps without initial delay.Keywords
This publication has 7 references indexed in Scilit:
- A Real Formalism Of Discrete Fourier Transform In Terms Of Skew-Circular Correlations And Its Computation By Fast Correlation TechniquesPublished by SPIE-Intl Soc Optical Eng ,1983
- Fast Fourier Transform and Convolution AlgorithmsPublished by Springer Nature ,1982
- Optical implementation of systolic array processingOptics Communications, 1981
- Special-Purpose Devices For Signal And Image Processing: An Opportunity In Very Large Scale Integration (VLSI)Published by SPIE-Intl Soc Optical Eng ,1980
- On Computing the Discrete Fourier TransformMathematics of Computation, 1978
- A prime factor FFT algorithm using high-speed convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- Discrete Fourier transforms when the number of data samples is primeProceedings of the IEEE, 1968