21 research outputs found
The Design of Efficiently-Encodable Rate-Compatible LDPC Codes
We present a new class of irregular low-density parity-check (LDPC) codes for
moderate block lengths (up to a few thousand bits) that are well-suited for
rate-compatible puncturing. The proposed codes show good performance under
puncturing over a wide range of rates and are suitable for usage in incremental
redundancy hybrid-automatic repeat request (ARQ) systems. In addition, these
codes are linear-time encodable with simple shift-register circuits. For a
block length of 1200 bits the codes outperform optimized irregular LDPC codes
and extended irregular repeat-accumulate (eIRA) codes for all puncturing rates
0.6~0.9 (base code performance is almost the same) and are particularly good at
high puncturing rates where good puncturing performance has been previously
difficult to achieve.Comment: Accepted subject to minor revision to IEEE Trans. on Com
The Design of Efficiently-Encodable Rate-Compatible LDPC Codes
We present a new class of irregular low-density parity-check (LDPC) codes for moderate block lengths (up to a few thousand bits) that are well-suited for rate-compatible puncturing. The proposed codes show good performance under puncturing over a wide range of rates and are suitable for usage in incremental redundancy hybrid-automatic repeat request (ARQ) systems. In addition, these codes are linear-time encodable with simple shift-register circuits. For a block length of 1200 bits the codes outperform optimized irregular LDPC codes and extended irregular repeat-accumulate (eIRA) codes for all puncturing rates 0.6~0.9 (base code performance is almost the same) and are particularly good at high puncturing rates where good puncturing performance has been previously difficult to achieve
Network flow algorithms for wireless networks and design and analysis of rate compatible LDPC codes
While Shannon already characterized the capacity of point-to-point channels back in 1948, characterizing the capacity of wireless networks has been a challenging problem. The deterministic channel model proposed by Avestimehr, etc. (2007 - 1) has been a promising approach
for approximating the Gaussian channel capacity and has been widely studied recently. Motivated by this model, an improved combinatorial algorithm is considered for finding the unicast capacity for wireless information flow on such deterministic networks in the first part of this
thesis. Our algorithm fully explores the useful combinatorial features intrinsic in the problem. Our improvement applies generally with any size of finite fields associated with the channel model. Comparing with other related algorithms, our improved algorithm has very competitive
performance in complexity.
In the second part of our work, we consider the design and analysis of rate-compatible LDPC codes. Rate-compatible LDPC codes are basically a family of nested codes, operating at different code rates and all of them can be encoded and decoded using a single encoder and
decoder pair. Those properties make rate-compatible LDPC codes a good choice for changing channel conditions, like in wireless communications. The previous work on the design and analysis of LDPC codes are all targeting at a specific code rate and no work is known on
the design and analysis of rate-compatible LDPC codes so that the code performance at all code rates in the family is manageable and predictable. In our work, we proposed algorithms for the design and analysis of rate-compatible LDPC codes with good performance and make the code performance at all code rates manageable and predictable. Our work is based on E2RC codes, while our approaches in the design and analysis can be applied more generally not only to E2RC codes, but to other suitable scenarios, like the design of IRA codes. Most encouragingly, we obtain families of rate-compatible codes whose gaps to capacity are at most 0.3 dB across the range of rates when the maximum variable node degree is twenty, which is very promising compared with other existing results
Development of rate-compatible structured LDPC CODEC algorithms and hardware IP
Issued as final reportSamsung Advanced Institute of Technolog
Randomly Punctured LDPC Codes
In this paper, we present a random puncturing analysis of low-density parity-check (LDPC) code ensembles. We derive a simple analytic expression for the iterative belief propagation (BP) decoding threshold of a randomly punctured LDPC code ensemble on the binary erasure channel (BEC) and show that, with respect to the BP threshold, the strength and suitability of an LDPC code ensemble for random puncturing is completely determined by a single constant that depends only on the rate and the BP threshold of the mother code ensemble. We then provide an efficient way to accurately predict BP thresholds of randomly punctured LDPC code ensembles on the binary- input additive white Gaussian noise channel (BI-AWGNC), given only the BP threshold of the mother code ensemble on the BEC and the design rate, and we show how the prediction can be improved with knowledge of the BI-AWGNC threshold. We also perform an asymptotic minimum distance analysis of randomly punctured code ensembles and present simulation results that confirm the robust decoding performance promised by the asymptotic results. Protograph-based LDPC block code and spatially coupled LDPC code ensembles are used throughout as examples to demonstrate the results