ARTÍCULO
TITULO

Decoding Algorithms and HW Strategies to Mitigate Uncertainties in a PCM-Based Analog Encoder for Compressed Sensing

Carmine Paolino    
Alessio Antolini    
Francesco Zavalloni    
Andrea Lico    
Eleonora Franchi Scarselli    
Mauro Mangia    
Alex Marchioni    
Fabio Pareschi    
Gianluca Setti    
Riccardo Rovatti    
Mattia Luigi Torres    
Marcella Carissimi and Marco Pasotti    

Resumen

Analog In-Memory computing (AIMC) is a novel paradigm looking for solutions to prevent the unnecessary transfer of data by distributing computation within memory elements. One such operation is matrix-vector multiplication (MVM), a workhorse of many fields ranging from linear regression to Deep Learning. The same concept can be readily applied to the encoding stage in Compressed Sensing (CS) systems, where an MVM operation maps input signals into compressed measurements. With a focus on an encoder built on top of a Phase-Change Memory (PCM) AIMC platform, the effects of device non-idealities, namely programming spread and drift over time, are observed in terms of the reconstruction quality obtained for synthetic signals, sparse in the Discrete Cosine Transform (DCT) domain. PCM devices are simulated using statistical models summarizing the properties experimentally observed in an AIMC prototype, designed in a 90 nm STMicroelectronics technology. Different families of decoders are tested, and tradeoffs in terms of encoding energy are analyzed. Furthermore, the benefits of a hardware drift compensation strategy are also observed, highlighting its necessity to prevent the need for a complete reprogramming of the entire analog array. The results show >30 dB average reconstruction quality for mid-range conductances and a suitably selected decoder right after programming. Additionally, the hardware drift compensation strategy enables robust performance even when different drift conditions are tested.

 Artículos similares

       
 
Liqun Liu, Jiuyuan Huo, Fei Xue and Yongqiang Dai    
This paper proposes an improved Harmony Search algorithm, and gives the definition of the Global Sharing Factor of the Harmony Search (HS) algorithm. In the definition, the number of creations of the HS algorithm is applied to the sharing factor and calc... ver más
Revista: Information

 
Meixiang Zhang, Satya Chan and Sooyoung Kim    
The satellite system is one of the most efficient means for broadcasting due to its wide service coverage as well as the fact that it can provide high data rate services by using high frequency bands. However, there are a number of problems in the satell... ver más
Revista: Algorithms

 
Marco Baldi, Alessandro Barenghi, Franco Chiaraluce, Gerardo Pelosi and Paolo Santini    
Decoding of random linear block codes has been long exploited as a computationally hard problem on which it is possible to build secure asymmetric cryptosystems. In particular, both correcting an error-affected codeword, and deriving the error vector cor... ver más
Revista: Algorithms

 
Alexander A. Molkov and Lev S. Dolin    
Estimation of water optical properties can be performed by photo or video registration of rough sea surface from underwater at an angle of total internal reflection in the away from the sun direction at several depths. In this case, the key characteristi... ver más

 
Dr.K.V. Ranga Rao,A. Ravikumar,R. Kumaraiah,Venkat Ritesh Ghanta    
On-Off Keying (OOK) is one of the most basic forms of communication widely used today. The objective of this paper is to receive, detect and decode an OOK signal in the radio spectrum. For the reception of the radio signal, an SDR receiver is used. This ... ver más