Journal article Open Access
Le Gallo, Manuel; Sebastian, Abu; Cherubini, Giovanni; Giefers, Heiner; Eleftheriou, Evangelos
In-memory computing is a promising non-von Neumann approach where certain computational tasks are performed within resistive memory units by exploiting their physical attributes. In this paper, we propose a new method for fast and robust compressed sensing of sparse signals with approximate message passing recovery using in-memory computing. The measurement matrix for compressed sensing is encoded in the conductance states of resistive memory devices organized in a crossbar array. This way, the matrix-vector multiplications associated with both the compression and recovery tasks can be performed by the same crossbar array without intermediate data movements at potential O(1) time complexity. For a signal of size N, the proposed method achieves a potential O(N)-fold recovery complexity reduction compared with a standard software approach. We show the array-level robustness of the scheme through large-scale experimental demonstrations using more than 256k phase-change memory devices.
Name | Size | |
---|---|---|
LeGallo18.pdf
md5:77eb782ef6baab0f8b8ae06eb59a73fa |
586.4 kB | Download |
Views | 84 |
Downloads | 123 |
Data volume | 72.1 MB |
Unique views | 83 |
Unique downloads | 122 |