TY - GEN
T1 - Serial Quantization for Representing Sparse Signals
AU - Cohen, Alejandro
AU - Shlezinger, Nir
AU - Eldar, Yonina C.
AU - Medard, Muriel
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/9/1
Y1 - 2019/9/1
N2 - Sparse signals are encountered in a broad range of applications. In order to process these signals using digital hardware, they must be first quantized using an analog-to-digital convertor (ADC), which typically operates in a serial scalar manner. In this work we propose a method for serial quantization of sparse signals (SeQuanS) inspired by group testing theory, which is designed to reliably and accurately quantize sparse signals acquired in a sequential manner using serial scalar ADCs. Unlike previously proposed approaches which combine quantization and compressed sensing (CS), our SeQuanS scheme updates its representation on each incoming analog sample and does not require the complete signal to be observed and stored in analog prior to quantization. We characterize the asymptotic tradeoff between accuracy and quantization rate of SeQuanS as well as its computational burden. Our numerical results demonstrate that SeQuanS is capable of achieving substantially improved representation accuracy over previous CS-based schemes without requiring the complete set of analog signal samples to be observed prior to its quantization, making it an attractive approach for acquiring sparse time sequences.
AB - Sparse signals are encountered in a broad range of applications. In order to process these signals using digital hardware, they must be first quantized using an analog-to-digital convertor (ADC), which typically operates in a serial scalar manner. In this work we propose a method for serial quantization of sparse signals (SeQuanS) inspired by group testing theory, which is designed to reliably and accurately quantize sparse signals acquired in a sequential manner using serial scalar ADCs. Unlike previously proposed approaches which combine quantization and compressed sensing (CS), our SeQuanS scheme updates its representation on each incoming analog sample and does not require the complete signal to be observed and stored in analog prior to quantization. We characterize the asymptotic tradeoff between accuracy and quantization rate of SeQuanS as well as its computational burden. Our numerical results demonstrate that SeQuanS is capable of achieving substantially improved representation accuracy over previous CS-based schemes without requiring the complete set of analog signal samples to be observed prior to its quantization, making it an attractive approach for acquiring sparse time sequences.
UR - http://www.scopus.com/inward/record.url?scp=85077794972&partnerID=8YFLogxK
U2 - 10.1109/ALLERTON.2019.8919843
DO - 10.1109/ALLERTON.2019.8919843
M3 - Conference contribution
AN - SCOPUS:85077794972
T3 - 2019 57th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2019
SP - 987
EP - 994
BT - 2019 57th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 57th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2019
Y2 - 24 September 2019 through 27 September 2019
ER -