.png){kind=icon}
Return
IMAGING: In-Memory AlGorithms for Image processiNG
.png){kind=icon}
OA
AI
DOI：10.1109/TCSI.2018.2846699.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Data-intensive applications such as image processing suffer from massive data movement between memory and processing units. The severe limitations on system performance and energy efficiency imposed by this data movement are further exacerbated with any increase in the distance the data must travel. This data transfer and its associated obstacles could be eliminated by the use of emerging non-volatile resistive memory technologies (memristors) that make it possible to both store and process data within the same memory cells. In this paper, we propose four in-memory algorithms for efficient execution of fixed point multiplication using MAGIC gates. These algorithms achieve much better latency and throughput than a previous work and significantly reduce the area cost. They can thus be feasibly implemented inside the size-limited memory arrays. We use these fixed point multiplication algorithms to efficiently perform more complex in-memory operations such as image convolution and further show how to partition large images to multiple memory arrays so as to maximize the parallelism. All the proposed algorithms are evaluated and verified using a cycle-accurate and functional simulator. Our algorithms provide on average 200x better performance over state-of-the-art APIM, a processing in-memory architecture for data intensive applications.
Keywords:
von Neumann bottleneck
memristors
MAGIC
algorithms
processing in memory
Journal
IF:
5.2
Papers:
9.9K
Citations:
2.2W
Organization
Cited Papers
Halo(alkoxo) and monocyclopentadienyl(halo)alkoxo derivatives of titanium, zirconium and hafnium
OAAI
OAAIShareSaveEx situ remediation of contaminated sediments using mineral additives: Assessment of pollutant bioavailability with the Microtox solid phase test.png)
Chemosphere
ChemosphereIF0
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
View more