Abstract The recently proposed superposition codes (SCs) have been mathematically proved to be decoded at any rate below the capacity, for additive white Gaussian noise (AWGN) channels. The main objective of this paper is to study the feasibility of a novel SC approach as an alternative to the traditional way of designing modern physical (PHY) layer schemes. Indeed, currently, PHY solutions are based on the decomposition into two separate problems of modulation shaping and coding over finite alphabets. Since superposition codes are defined over real numbers, modulation and coding can be jointly realized. Moreover, a fast decoding method is developed and tested by comparing the obtained results with both the uncoded system performance and tw...
Sparse superposition codes, or sparse regression codes, constitute a new class of codes, which was f...
A method for power- and bandwidth efficient communication over the Gaussian channel is presented. Th...
An achievable rate is given for discrete memoryless channels with a given (possibly suboptimal) deco...
The recently proposed superposition codes (SCs) have been mathematically proved to be decoded at any...
Abstract The recently proposed superposition codes (SCs) have been mathematically proved to be decod...
This paper studies a generalization of sparse superposition codes (SPARCs) for communication over th...
Sparse superposition codes were recently introduced by Barron and Joseph for reliable communication ...
Abstract—Superposition codes are efficient for the Additive White Gaussian Noise channel. We provide...
Sparse superposition codes are a recent class of codes introduced by Barron and Joseph for efficient...
We propose a capacity approaching coding strategy for additive white Gaussian noise (AWGN) channels ...
This paper presents a comprehensive analysis of superposition coded modulation (SCM). Two types of S...
Abstract—We present simple, practical codes designed for the binary and Gaussian dirty-paper channel...
In this tutorial, a unified treatment of the topic of SuperPosition Coding (SPC) aided communication...
Abstract—For the additive white Gaussian noise channel with average codeword power constraint, new c...
Abstract—For the additive white Gaussian noise channel with average codeword power constraint, spars...
Sparse superposition codes, or sparse regression codes, constitute a new class of codes, which was f...
A method for power- and bandwidth efficient communication over the Gaussian channel is presented. Th...
An achievable rate is given for discrete memoryless channels with a given (possibly suboptimal) deco...
The recently proposed superposition codes (SCs) have been mathematically proved to be decoded at any...
Abstract The recently proposed superposition codes (SCs) have been mathematically proved to be decod...
This paper studies a generalization of sparse superposition codes (SPARCs) for communication over th...
Sparse superposition codes were recently introduced by Barron and Joseph for reliable communication ...
Abstract—Superposition codes are efficient for the Additive White Gaussian Noise channel. We provide...
Sparse superposition codes are a recent class of codes introduced by Barron and Joseph for efficient...
We propose a capacity approaching coding strategy for additive white Gaussian noise (AWGN) channels ...
This paper presents a comprehensive analysis of superposition coded modulation (SCM). Two types of S...
Abstract—We present simple, practical codes designed for the binary and Gaussian dirty-paper channel...
In this tutorial, a unified treatment of the topic of SuperPosition Coding (SPC) aided communication...
Abstract—For the additive white Gaussian noise channel with average codeword power constraint, new c...
Abstract—For the additive white Gaussian noise channel with average codeword power constraint, spars...
Sparse superposition codes, or sparse regression codes, constitute a new class of codes, which was f...
A method for power- and bandwidth efficient communication over the Gaussian channel is presented. Th...
An achievable rate is given for discrete memoryless channels with a given (possibly suboptimal) deco...