English
Related papers

Related papers: Generalized Approximate Message-Passing Decoder fo…

200 papers

Sparse superposition codes, or sparse regression codes, constitute a new class of codes which was first introduced for communication over the additive white Gaussian noise (AWGN) channel. It has been shown that such codes are…

Information Theory · Computer Science 2018-11-12 Jean Barbier , Mohamad Dia , Nicolas Macris

Sparse Regression Codes (SPARCs) are capacity-achieving codes introduced for communication over the Additive White Gaussian Noise (AWGN) channels and were later extended to general memoryless channels. In particular it was shown via…

Information Theory · Computer Science 2024-09-10 Yuhao Liu , Yizhou Xu , Tianqi Hou

In this project, the behavior of Generalized Approximate Message-Passing Decoder for BSC and Z Channel is studied using i.i.d matrices for constructing the codewords. The performance of GAMP in AWGN Channel is already evaluated in the…

Information Theory · Computer Science 2017-12-05 Alper Kose , Berke Aral Sonmez

We recently proved threshold saturation for spatially coupled sparse superposition codes on the additive white Gaussian noise channel. Here we generalize our analysis to a much broader setting. We show for any memoryless channel that…

Information Theory · Computer Science 2016-03-16 Jean Barbier , Mohamad Dia , Nicolas Macris

Sparse superposition codes were recently introduced by Barron and Joseph for reliable communication over the AWGN channel at rates approaching the channel capacity. The codebook is defined in terms of a Gaussian design matrix, and codewords…

Information Theory · Computer Science 2017-03-14 Cynthia Rush , Adam Greig , Ramji Venkataramanan

Sparse superposition codes were originally proposed as a capacity-achieving communication scheme over the gaussian channel, whose coding matrices were made of i.i.d. gaussian entries.We extend this coding scheme to more generic ensembles of…

Information Theory · Computer Science 2022-05-27 TianQi Hou , YuHao Liu , Teng Fu , Jean Barbier

Sparse superposition codes, or sparse regression codes (SPARCs), are a recent class of codes for reliable communication over the AWGN channel at rates approaching the channel capacity. Approximate message passing (AMP) decoding, a…

Information Theory · Computer Science 2019-04-24 Cynthia Rush , Ramji Venkataramanan

Sparse superposition (SS) codes provide an efficient communication scheme over the Gaussian channel, utilizing the vector approximate message passing (VAMP) decoder for rotational invariant design matrices. Previous work has established…

Information Theory · Computer Science 2025-04-21 Yuhao Liu , Teng Fu , Jie Fan , Panpan Niu , Chaowen Deng , Zhongyi Huang

Sparse superposition codes, also called sparse regression codes (SPARCs), are a class of codes for efficient communication over the AWGN channel at rates approaching the channel capacity. In a standard SPARC, codewords are sparse linear…

Information Theory · Computer Science 2021-06-25 Cynthia Rush , Kuan Hsieh , Ramji Venkataramanan

We study the approximate message-passing decoder for sparse superposition coding on the additive white Gaussian noise channel and extend our preliminary work [1]. We use heuristic statistical-physics-based tools such as the cavity and the…

Information Theory · Computer Science 2017-07-17 Jean Barbier , Florent Krzakala

In this paper we consider the generalized approximate message passing (GAMP) algorithm for recovering a sparse signal from modulo samples of randomized projections of the unknown signal. The modulo samples are obtained by a self-reset (SR)…

Signal Processing · Electrical Eng. & Systems 2018-07-10 Osman Musa , Peter Jung , Norbert Goertz

This paper studies a generalization of sparse superposition codes (SPARCs) for communication over the complex additive white Gaussian noise (AWGN) channel. In a SPARC, the codebook is defined in terms of a design matrix, and each codeword…

Information Theory · Computer Science 2021-06-25 Kuan Hsieh , Ramji Venkataramanan

Sparse regression codes (SPARCs) are a promising coding scheme that can approach the Shannon limit over Additive White Gaussian Noise (AWGN) channels. Previous works have proven the capacity-achieving property of SPARCs with Gaussian design…

Information Theory · Computer Science 2023-03-16 Yizhou Xu , YuHao Liu , ShanSuo Liang , Tingyi Wu , Bo Bai , Jean Barbier , TianQi Hou

Sparse superposition codes are a recent class of codes introduced by Barron and Joseph for efficient communication over the AWGN channel. With an appropriate power allocation, these codes have been shown to be asymptotically…

Information Theory · Computer Science 2018-03-19 Adam Greig , Ramji Venkataramanan

This paper addresses the reconstruction of an unknown signal vector with sublinear sparsity from generalized linear measurements. Generalized approximate message-passing (GAMP) is proposed via state evolution in the sublinear sparsity…

Information Theory · Computer Science 2025-02-21 Keigo Takeuchi

Generalised approximate message passing (GAMP) is an approximate Bayesian estimation algorithm for signals observed through a linear transform with a possibly non-linear subsequent measurement model. By leveraging prior information about…

Signal Processing · Electrical Eng. & Systems 2018-12-05 Christian Schou Oxvig , Thomas Arildsen

Recently, a new class of codes, called sparse superposition or sparse regression codes, has been proposed for communication over the AWGN channel. It has been proven that they achieve capacity using power allocation and various forms of…

Information Theory · Computer Science 2016-03-08 Jean Barbier , Mohamad Dia , Nicolas Macris

For the additive white Gaussian noise channel with average codeword power constraint, sparse superposition codes are developed. These codes are based on the statistical high-dimensional regression framework. The paper [IEEE Trans. Inform.…

Information Theory · Computer Science 2012-07-11 Antony Joseph , Andrew Barron

We study compressed sensing (CS) signal reconstruction problems where an input signal is measured via matrix multiplication under additive white Gaussian noise. Our signals are assumed to be stationary and ergodic, but the input statistics…

Information Theory · Computer Science 2016-11-03 Yanting Ma , Junan Zhu , Dror Baron

This paper addresses the reconstruction of sparse signals from generalized linear measurements. Signal sparsity is assumed to be sublinear in the signal dimension while it was proportional to the signal dimension in conventional research.…

Information Theory · Computer Science 2026-04-13 Keigo Takeuchi
‹ Prev 1 2 3 10 Next ›