By Topic

The red-blue algorithm for dynamic programming on linear arrays

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 $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)
K. J. Rappoport ; Pacific-Sierra Res., Arlington, VA, USA

A new algorithm for dynamic programming on linear arrays is presented which uses a single data path and runs twice as fast using less than half the memory locations of the best previously known algorithm. The algorithm employs a redundant data technique in which a permuted copy of the dynamic programming table is maintained to reduce communication costs. The simplified control structure and exclusive use of shift registers for storage (i.e. no RAM is required) make the algorithm particularly suitable for VLSI implementation

Published in:

Parallel and Distributed Processing, 1994. Proceedings. Sixth IEEE Symposium on

Date of Conference:

26-29 Oct 1994