%A Zhilin LI, Wenbo XU, Xiaobo ZHANG, Jiaru LIN %T A survey on one-bit compressed sensing: theory and applications %0 Journal Article %D 2018 %J Front. Comput. Sci. %J Frontiers of Computer Science %@ 2095-2228 %R 10.1007/s11704-017-6132-7 %P 217-230 %V 12 %N 2 %U {https://journal.hep.com.cn/fcs/EN/10.1007/s11704-017-6132-7 %8 2018-03-22 %X

In the past few decades, with the growing popularity of compressed sensing (CS) in the signal processing field, the quantization step in CS has received significant attention. Current research generally considers multi-bit quantization. For systems employing quantization with a sufficient number of bits, a sparse signal can be reliably recovered using various CS reconstruction algorithms.

Recently, many researchers have begun studying the onebit case for CS. As an extreme case of CS, onebit CS preserves only the sign information of measurements, which reduces storage costs and hardware complexity. By treating one-bit measurements as sign constraints, it has been shown that sparse signals can be recovered using certain reconstruction algorithms with a high probability. Based on the merits of one-bit CS, it has been widely applied to many fields, such as radar, source location, spectrum sensing, and wireless sensing network.

In this paper, the characteristics of one-bit CS and related works are reviewed. First, the framework of one-bit CS is introduced. Next, we summarize existing reconstruction algorithms. Additionally, some extensions and practical applications of one-bit CS are categorized and discussed. Finally, our conclusions and the further research topics are summarized.