Citation
Abstract
In this article, a fast algorithm is developed to compute two-dimensional convolutions of an array of d,*d. complex number points, where d, = 2™ and d, = 2m-r+l for some l<r<im. This new algorithm requires fewer multiplications and about the same number of additions as the conventional FFT method for computing the two-dimensional convolution. It also has the advantage that the operation of transposing the matrix of data can be avoided.
Details
- Volume
- 42-57
- Published
- June 15, 1980
- Pages
- 87–102
- File Size
- 718.0 KB