A method for power- and bandwidth efficient communication over the Gaussian channel is presented. The method is based on the superposition of binary random variables. As an example we design a signal constellation for a spectral efficiency of 10 bit/s/Hz. The constellation has a constrained capacity limit only 0.18 dB from the Gaussian capacity limit. Moreover, we show that combined with multi-level coding and low-density parity-check codes, a low bit-error rate is achieved at 0.6 dB from the Gaussian capacity limit for a large codeword length.Electrical Engineering, Mathematics and Computer Scienc
The achievability and converse bounds on the throughput of covert communication over AWGN channels a...
International audienceIn this paper, we analyze the performance of superposition coding for Gaussian...
This paper considers a broadcast system in which a single transmitter sends a common message and (in...
A method for power- and bandwidth efficient communication over the Gaussian channel is presented. Th...
A scheme for power- and bandwidth-efficient communication on the linear Gaussian channel is proposed...
We investigate methods for power and bandwidth efcient communication. The approach we consider is ba...
Abstract—For the additive Gaussian noise channel with aver-age codeword power constraint, sparse sup...
In this paper, achievable rates regions are derived for power constrained Gaussian broadcast channel...
Abstract—For the additive white Gaussian noise channel with average codeword power constraint, new c...
We derive the two-user capacity region with and without common information for a Gaussian broadcast ...
Motivated by the growing application of wireless multi-access networks with stringent delay constrai...
Sparse superposition codes were recently introduced by Barron and Joseph for reliable communication ...
We consider the progressive transmission of a lossy source across a power constrained Gaussian chann...
Shannon channel capacity theorem poses highest bit-rate of error free transmission over additive whi...
This dissertation studies several problems regarding the joint/separate source-channel coding in dat...
The achievability and converse bounds on the throughput of covert communication over AWGN channels a...
International audienceIn this paper, we analyze the performance of superposition coding for Gaussian...
This paper considers a broadcast system in which a single transmitter sends a common message and (in...
A method for power- and bandwidth efficient communication over the Gaussian channel is presented. Th...
A scheme for power- and bandwidth-efficient communication on the linear Gaussian channel is proposed...
We investigate methods for power and bandwidth efcient communication. The approach we consider is ba...
Abstract—For the additive Gaussian noise channel with aver-age codeword power constraint, sparse sup...
In this paper, achievable rates regions are derived for power constrained Gaussian broadcast channel...
Abstract—For the additive white Gaussian noise channel with average codeword power constraint, new c...
We derive the two-user capacity region with and without common information for a Gaussian broadcast ...
Motivated by the growing application of wireless multi-access networks with stringent delay constrai...
Sparse superposition codes were recently introduced by Barron and Joseph for reliable communication ...
We consider the progressive transmission of a lossy source across a power constrained Gaussian chann...
Shannon channel capacity theorem poses highest bit-rate of error free transmission over additive whi...
This dissertation studies several problems regarding the joint/separate source-channel coding in dat...
The achievability and converse bounds on the throughput of covert communication over AWGN channels a...
International audienceIn this paper, we analyze the performance of superposition coding for Gaussian...
This paper considers a broadcast system in which a single transmitter sends a common message and (in...