Generalized Low-Density Parity-Check Coding Aided Multilevel Codes

Classic Low-Density Parity-Check (LDPC) codes have recently been used as component codes in Multilevel Coding (MLC) due to their impressive BER performance as well as owing to their flexible coding rates. In this paper, we proposed a Multilevel Coding invoking Generalized Low-Density Parity-Check (GLDPC) component codes, which is capable of outperforming the classic LDPC component codes at a reduced decoding latency, when communicating over AWGN and uncorrelated Rayleigh fading channels

Precoder-Aided Iterative Detection Assisted Multilevel Coding and Three-Dimensional EXIT-Chart Analysis

A novel three-dimensional (3D) EXIT chart is developed for investigating the iterative behaviour of Multilevel Coding (MLC) invoking Multistage Decoding (MSD). The extrinsic information transfer characteristics of both the symbol-to-bit demapper used and those of the differentprotection constituent decoders suggest that potential improvements can be achieved by appropriately designing the demapper. The proposed 3D EXIT chart is then invoked for studying the precoder-aided multilevel coding scheme employing both MSD and Parallel Independent Decoding (PID) for communicating over AWGN and uncorrelated Rayleigh fading channels with the aid of 8PSK modulation. At BER=10?5, the precoder was capable of enhancing the achievable Eb/N0 performance by 0.5dB to 2.5dB over AWGN and Rayleigh channels, respectively

Multilevel Generalised Low-Density Parity-Check Codes

Multilevel coding invoking generalised low-density parity-check component codes is proposed, which is capable of outperforming the classic low-density parity check component codes at a reduced decoding latency

Multilevel Coding Schemes for Compute-and-Forward with Flexible Decoding

We consider the design of coding schemes for the wireless two-way relaying channel when there is no channel state information at the transmitter. In the spirit of the compute and forward paradigm, we present a multilevel coding scheme that permits computation (or, decoding) of a class of functions at the relay. The function to be computed (or, decoded) is then chosen depending on the channel realization. We define such a class of functions which can be decoded at the relay using the proposed coding scheme and derive rates that are universally achievable over a set of channel gains when this class of functions is used at the relay. We develop our framework with general modulation formats in mind, but numerical results are presented for the case where each node transmits using the QPSK constellation. Numerical results with QPSK show that the flexibility afforded by our proposed scheme results in substantially higher rates than those achievable by always using a fixed function or by adapting the function at the relay but coding over GF(4).Comment: This paper was submitted to IEEE Transactions on Information Theory in July 2011. A shorter version also appeared in the proceedings of the International Symposium on Information Theory in August 2011 without the proof of the main theore