Abstract
The cyclic convolution algorithms of chapter 6 are efficient for special small block lengths, but as the size of the block length increases, other methods are required. First, as discussed in chapter 6, these algorithms keep the number of required multiplications small, but they can require many additions. Also, each size requires a different algorithm. There is no uniform tructure that can be repeatedly called upon. In this chapter, a technique similar to the Good-Thomas PFA will be developed to decompose a large size cyclic convolution into several small size cyclic convolutions that in turn can be evaluated using the Winograd cyclic convolution algorithm. These ideas were introduced by Agarwal and Cooley [1] in 1977. As in the Good-Thomas PFA, the CRT is used to define an indexing of data. This indexing changes a one-dimensional cyclic convolution into a two-dimensional one. We will see how to compute a two-dimensional cyclic convolution by ‘nesting’ a fast algorithm for a one-dimensional case inside another fast algorithm for a one-dimensional cyclic convolution. There are several two-dimensional cyclic convolution algorithms that, although important, will not be discussed. These can be found in [2].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agarwal, R. C. and Cooley, J. W. “New Algorithms for Digital Convolution”, IEEE Trans. Acoust., Speech and Signal Proc., 25, 1977, pp. 392–410.
Blahut, R. E. Fast Algorithms for Digital Signal Processing, Addison-Wesley, 1985, Chapter 7.
Nussbaumer, H. J. Fast Fourier Transform and Convolution Algorithms, Second Edition, Springer-Verlag, 1981, Chapter 6.
Arambepola, B. and Rayner, P. J. “Efficient Transforms for Multidimensional Convolutions”, Electron. Lett., 15, 1979, pp. 189–190.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Tolimieri, R., Lu, C., An, M. (1997). Agarwal-Cooley Convolution Algorithm. In: Algorithms for Discrete Fourier Transform and Convolution. Signal Processing and Digital Filtering. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-2767-8_7
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2767-8_7
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-3115-3
Online ISBN: 978-1-4757-2767-8
eBook Packages: Springer Book Archive