By Topic

Computing on reconfigurable buses

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

4 Author(s)
Lin, R. ; Dept. of Comput. Sci., State Univ. of New York, Geneseo, NY, USA ; Olariu, S. ; Schwing, J.L. ; Zhang, J.

The authors demonstrate novel uses for buses in a multiprocessor reconfigurable architecture both as topological descriptors and as powerful computational devices. This paradigm results in fast algorithms to solve a number of problems in computer arithmetic, image processing, and computer vision. An O(1) time algorithm is proposed to compute the sum and difference of two N-bit numbers using N processors only. Two fast algorithms are presented for image segmentation and parallel visibility. The algorithm for image segmentation uses a novel technique involving building a bus around each region of interest in the image. Once such a bus is established it can be successfully used as a topological descriptor for the corresponding region. With a binary image pretiled in the natural way on a reconfigurable mesh of size N×N the segmentation algorithm runs in O(log N) time, improving by a factor of O(log N) over the state of the art. A very simple algorithm is introduced to solve the parallel visibility problem on an image of size N×N. The algorithm runs in O(log N) time and is conceptually very simple

Published in:

Computers and Communications, 1993., Twelfth Annual International Phoenix Conference on

Date of Conference:

23-26 Mar 1993