• Publications
  • Influence
Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes
TLDR
The optimized irregular LDPC codes at each level of MLC with multistage decoding (MSD) are able to perform well at signal-to-noise ratios (SNR) very close to the capacity of the additive white Gaussian noise (AWGN) channel.
Joint Physical Layer Coding and Network Coding for Bidirectional Relaying
TLDR
A communication system where two transmitters wish to exchange information through a central relay is considered, using lattice codes and lattice decoding, to obtain a rate of 1/2 log(1/2 + snr) bits per transmitter, which is essentially optimal at high SNR.
On the achievable information rates of finite state ISI channels
TLDR
Two simple Monte Carlo methods for estimating the achievable information rates of general finite state channels requiring only the ability to simulate the channel with an a posteriori probability (APP) detector matched to the channel are presented.
The serial concatenation of rate-1 codes through uniform random interleavers
TLDR
This paper constructs "good" binary linear block codes at any rate r<1 by serially concatenating an arbitrary outer code of rate r with a large number of rate-1 inner codes through uniform random interleavers and proves that long codes from this ensemble will achieve the Gilbert-Varshamov (1952) bound with high probability.
Iterative collision resolution for slotted ALOHA: An optimal uncoordinated transmission policy
TLDR
It is shown that the well-known soliton distribution is an optimal probability distribution and that the resulting throughput efficiency can be arbitrarily close to 1.0 in a multi-user wireless network.
A Simple Proof of Maxwell Saturation for Coupled Scalar Recursions
TLDR
A simple proof of threshold saturation that applies to a wide class of coupled scalar recursions based on constructing potential functions for both the coupled and uncoupled recursions is presented.
A simple proof of threshold saturation for coupled scalar recursions
TLDR
A simple proof of threshold saturation that applies to a broad class of coupled scalar recursions is presented and is surprisingly simple when compared to previous methods.
Capacity-achieving ensembles for the binary erasure channel with bounded complexity
We present two sequences of ensembles of nonsystematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the binary erasure channel
Reed–Muller Codes Achieve Capacity on Erasure Channels
TLDR
This work shows that symmetry alone implies near-optimal performance in any sequence of linear codes where the blocklengths are strictly increasing, the code rates converge, and the permutation group of each code is doubly transitive.
Nonlinear Interference Mitigation via Deep Neural Networks
TLDR
A neural-network-based approach is presented to efficiently implement digital backpropagation (DBP) and the resulting "learned" DBP significantly reduces the complexity compared to conventional DBP implementations.
...
...