By Topic

A kernel-independent, pipelined architecture for real-time 2-D 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)
Shukla, S.B. ; Dept. of Electr. & Comput. Eng., North Carolina State Univ., Raleigh, NC, USA ; Agrawal, D.P.

A flexible, fault-tolerant architecture to perform 2-D convolution of images for kernels of arbitrary shapes and sizes is proposed. The convolved image is output online as the input image is generated and received, providing optimal turnaround time. The regularity of the computation and the raster-scan input of pixels are used to pipeline computations as well as memory operations. Throughput of (kl/ u) is achieved for a variety of kernel sizes with a k×l array of multiply-accumulate cells, where u is the time for a single fixed-point multiply-accumulate operation. It is shown that by queuing accesses at memory modules the limitation placed by access time on the throughput can be removed. Larger, as well as smaller kernels can be accommodated on a fixed-size array with a single pass of the image and a minor change in the computation flow. The host enjoys absence of any control overhead and only has to supply the pixels and collect the output pixels in simple raster-scan fashion for any kernel size

Published in:

Computer Architecture, 1988. Conference Proceedings. 15th Annual International Symposium on

Date of Conference:

30 May-2 Jun 1988