We focus on the parallel access of randomly aligned rectangular blocks of visual data. As an alternative of traditional linearly addressable memories, we suggest a memory organization based on an array of memory modules. A highly scalable data alignment scheme incorporating module assignment functions and a new generic addressing function are proposed. To enable short critical paths and to save hardware resources, the addressing function implicitly embeds the module assignment functions and it is separable. A corresponding design is evaluated and compared to existing schemes and is found to be cost-effective1. © Springer-Verlag 2004.
CITATION STYLE
Kuzmanov, G., Gaydadjiev, G., & Vassiliadis, S. (2004). Visual data rectangular memory. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3149, 760–767. https://doi.org/10.1007/978-3-540-27866-5_100
Mendeley helps you to discover research relevant for your work.