Transformations of a 3D image reconstruction algorithm for data transfer and storage optimization
When implementing a 3D image reconstruction algorithm on a DSP architecture, we find ourselves confronted with a large memory transfer overhead, reducing the possible speedup attainable on recent multi-media oriented architectures. This paper describes how the critical part of the algorithm is re-sp...
Saved in:
Published in | Design automation for embedded systems Vol. 5; no. 3; pp. 313 - 327 |
---|---|
Main Authors | , , , , , , |
Format | Journal Article |
Language | English |
Published |
01.08.2000
|
Online Access | Get full text |
Cover
Loading…
Summary: | When implementing a 3D image reconstruction algorithm on a DSP architecture, we find ourselves confronted with a large memory transfer overhead, reducing the possible speedup attainable on recent multi-media oriented architectures. This paper describes how the critical part of the algorithm is re-specified and aggressively transformed at the algorithm code level, to improve the data access locality of the multi-dimensional image signal, while preserving the input/output behaviour. Experiments show that a close to optimal reuse of the data in the foreground memory and registers is obtained, removing the data transfer and storage bottleneck and enabling real-time prototyping of the algorithm on a DSP architecture. |
---|---|
Bibliography: | SourceType-Scholarly Journals-2 ObjectType-Feature-2 ObjectType-Conference Paper-1 content type line 23 SourceType-Conference Papers & Proceedings-1 ObjectType-Article-3 |
ISSN: | 0929-5585 |
DOI: | 10.1023/A:1008958303888 |