By Topic

An efficient algorithm for multidimensional convolution

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Elnaggar, A. ; Dept. of Electr. Eng., Sultan Qaboos Univ., Muscat, Oman ; Aboelaze, M.

This paper presents a novel recursive algorithm for generating higher-order multidimensional (or m-D for short) convolution by combining the computation of 3m identical lower-order (smaller size) convolution computations, and its implementation in parallel VLSI networks. We show that for 2-D convolutions, with careful design, the number of lower-order 2-D convolutions can be reduced from nine to six with a computation saving of 35%. The resulting VLSI architectures have very simple modular structure, highly regular topology, and use simple arithmetic units

Published in:

Acoustics, Speech, and Signal Processing, 2000. ICASSP '00. Proceedings. 2000 IEEE International Conference on  (Volume:6 )

Date of Conference:

2000