|
Abstract
In this talk, I will present two error-correction coding techniques, serially concatenated trellis coded modulations (SCTCMs) and Low-Density Parity-Check (LDPC) codes, as well as our codes designed for wireless communications.
Universal SCTCMs that perform consistently close to the available mutual information for periodic erasure channel (PEC), periodic fading channel (PFC) and the 2x2 compound matrix channel are proposed. We use both the maximum-likelihood decoding criteria and iterative decoding criteria to design universal SCTCMs. Each component of the SCTCM including the constituent codes, constellation, labeling, and interleaver are carefully chosen to achieve universality. The proposed SCTCMs have good frame-error-rate (FER) performance over any quasi-static fading distribution.
As for the LDPC codes, we use a graph-conditioning algorithm to construct high-rate irregular LDPC codes. The proposed algorithm can dramatically lower the error floor with little compromise of the convergence threshold. In addition, we propose a rate-compatible scheme called row-combining which combines rows of a lower-rate parity-check matrix into higher-rate codes according to predefined combining rules. The resulting LDPC code is called Constant-Blocklength Multiple-Rate (CBMR) LDPC codes. It is also found that row-combining fits well with an efficient hardware architecture known as the irregular partitioned permutation (IPP) LDPC code.
|