Discreteness-Aware Approximate Message Passing for Discrete-Valued Vector Reconstruction
Discreteness-Aware Approximate Message Passing for Discrete-Valued Vector Reconstruction
复制标题
用于离散值向量重建的离散感知近似消息传递
DOI:
10.1109/tsp.2018.2877170
复制
发表时间:
2018
影响因子:
5.4
通讯作者:
R. Hayakawa and K. Hayashi
中科院分区:
文献类型:
--
作者:
BABA Yasuyuki;KUBO Teruhiro;MORI Nobuhito;WATANABE Yasunori;YAMADA Tomohito;SARUWATARI Ayumi;OTSUKA Junichi;UCHIYAMA Yusuke;NINOMIYA Junichi;R. Hayakawa and K. Hayashi
This paper considers the reconstruction of a discrete-valued random vector from possibly underdetermined linear measurements using sum-of-absolute-value (SOAV) optimization. The proposed algorithm, referred to as discreteness-aware approximate message passing (DAMP), is based on the idea of approximate message passing (AMP), which has been originally proposed for compressed sensing. The DAMP algorithm has low computational complexity and its performance in the large system limit can be predicted analytically via state evolution framework, where we provide a condition for the exact reconstruction with DAMP in the noise-free case. From the analysis, we also propose a method to determine the parameters of the SOAV optimization. Moreover, based on the state evolution, we provide Bayes optimal DAMP, which has the minimum mean-square-error at each iteration of the algorithm. Simulation results show that the DAMP algorithms can reconstruct the discrete-valued vector from underdetermined linear measurements and the empirical performance agrees with our theoretical results in large-scale systems. When the problem size is not large enough, the SOAV optimization with the proposed parameters can achieve better performance than the DAMP algorithms for high signal-to-noise ratio.