By Topic

Novel approach for implementing convolutions with small tables

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
$33 $33
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)
A. Skavantzos ; Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA

The author presents an algorithm, the one over eight squared algorithm, which can be useful in computing tasks with convolutional complexity, such as convolutions, correlations and complex multiplications. The algorithm reduces the address space requirement and hardware investment for table lookup implementations of such tasks from 22n to 2n, where n is the width of the operands. Owing to considerable reduction in the required table size, convolutions and correlations with table lookups can be cost-effectively extended to wider operands.

Published in:

IEE Proceedings E - Computers and Digital Techniques  (Volume:138 ,  Issue: 4 )