Referenced Items are not available for this document.
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
- Page(s):
- 484 - 488
- Meeting Date :
- 26 Oct 1994-29 Oct 1994
- Print ISBN:
- 0-8186-6427-4
- INSPEC Accession Number:
- 4818469
- Conference Location :
- Dallas, TX
- Digital Object Identifier :
- 10.1109/SPDP.1994.346142
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
