High-speed convolution and correlation

Authors:
Thomas G. Stockham, Jr.
Affiliations:
Massachusetts Institute of Technology, Cambridge, Massachusetts
Venue:
AFIPS '66 (Spring) Proceedings of the April 26-28, 1966, Spring joint computer conference
Year:
1966

Citing 0
Cited 8

Pipeline and Parallel-Pipeline FFT Processors for VLSI Implementations

IEEE Transactions on Computers
Minimizing the Computation Time for Using the Technique of Sectioning for Digital Filtering of Pictures

IEEE Transactions on Computers
Discrete Convolutions via Mersenne Transrorms

IEEE Transactions on Computers
Digital Convolution Algorithm for Pipelining Multiprocessor Systems

IEEE Transactions on Computers
Fast Fourier Transforms: for fun and profit

AFIPS '66 (Fall) Proceedings of the November 7-10, 1966, fall joint computer conference
Real-time spectral analysis on a small general-purpose computer

AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
On the theory of discrete systems

Automatica (Journal of IFAC)
Neutron sensitivity and software hardening strategies for matrix multiplication and FFT on graphics processing units

Proceedings of the 3rd Workshop on Fault-tolerance for HPC at extreme scale

Quantified Score

Hi-index	0.01

Visualization

Abstract

Cooley and Tukey have disclosed a procedure for synthesizing and analyzing Fourier series for discrete periodic complex functions. For functions of period N, where N is a power of 2, computation times are proportional to N log2 N as expressed in Eq. (0).