By Topic

Corner-turn complexity properties of polynomial transform 2D convolution methods

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

1 Author(s)
Kriz, Thomas A. ; IBM Federal Systems Division, Owego, New York

This paper examines the matrix data re-order requirements of a variety of polynomial transform 2D convolution methods which can be employed to efficiently accommodate large field problems. The results indicate that several power-of-2 length polynomial transform methods developed by Nussbaumer allow one to totally avoid the row-column data corner-turn commonly encountered in Fourier Transform 2D convolution methods, while also providing significantly reduced computational complexity. Execution time comparison with an FFT reference base is made assuming the use of general register and array processor units and use of recently developed matrix-transpose methods by Eklundh and Ari to support 2D Fourier Transform corner-turn requirements. These results demonstrate a 2-4 times throughput performance improvement for use of the polynomial transform method in place of the 2D Fourier Transform approach to circularly convolve large 2D fields in the range 1024×1024 to 8192×8192.

Published in:

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

Date of Conference:

Apr 1981