pith. sign in

arxiv: 1601.00530 · v2 · pith:E4OFDB3Gnew · submitted 2016-01-04 · 💻 cs.IT · math.IT

HISTORY: An Efficient and Robust Algorithm for Noisy 1-bit Compressed Sensing

classification 💻 cs.IT math.IT
keywords algorithmhistoryrecoverynoiseproposedrobustaccuracyacquisition
0
0 comments X
read the original abstract

We consider the problem of sparse signal recovery from 1-bit measurements. Due to the noise present in the acquisition and transmission process, some quantized bits may be flipped to their opposite states. These sign flips may result in severe performance degradation. In this study, a novel algorithm, termed HISTORY, is proposed. It consists of Hamming support detection and coefficients recovery. The HISTORY algorithm has high recovery accuracy and is robust to strong measurement noise. Numerical results are provided to demonstrate the effectiveness and superiority of the proposed algorithm.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.