HISTORY: An Efficient and Robust Algorithm for Noisy 1-bit Compressed Sensing
Information Theory
2016-11-03 v2 math.IT
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.
Cite
@article{arxiv.1601.00530,
title = {HISTORY: An Efficient and Robust Algorithm for Noisy 1-bit Compressed Sensing},
author = {Biao Sun and Hui Feng and Xinxin Xu},
journal= {arXiv preprint arXiv:1601.00530},
year = {2016}
}
Comments
7 pages, 4 figures