@inproceedings{6c2cb5a15d4543bcb1a49ae76a57b3d0,
title = "Multidimensional mapping techniques for convolution",
abstract = "It is shown that the permutation employed in the Agarwal-Cooley algorithm and the algorithm of Zalcstein is the most basic of a larger class of similarity transforms useful in the efficient computation of convolution. Using the notion of similarity and employing companion matrices, one-dimensional to multidimensional mappings are discussed for convolution, in particular, the noncircular convolutions that arise in the Winograd circular convolution algorithm. The use of such mappings in multidimensional interpolation algorithms is also discussed.",
author = "Selesnick, {I. W.} and Burrus, {C. S.}",
year = "1993",
language = "English (US)",
isbn = "0780309464",
series = "Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing",
publisher = "Publ by IEEE",
pages = "111.288--291",
booktitle = "Digital Speech Processing",
note = "1993 IEEE International Conference on Acoustics, Speech and Signal Processing ; Conference date: 27-04-1993 Through 30-04-1993",
}