IEEE International Symposium on Information Theory (ISIT)

Low-density mirror-concatenated codes: a generalization of irregular repeat-and-accumulate codes

Samuel J. Dolinar, Kenneth S. Andrews

Published Dec 23, 2004• 0 citations

Abstract

Low-density mirror-concatenated (LDMC) codes are defined and shown to be equivalent to low-density parity-check (LDPC) codes. As a generalization of irregular repeat-and-accumulate (IRA) codes, LDMC codes offer a slightly different, but potentially useful, perspective on LDPC codes as concatenated codes.

DOI: 10.1109/isit.2004.1365543

Related papers

Design methods for irregular repeat accumulate codes

Aline Roumy, Souad Guemghar, Giuseppe Caire +1 more

We optimize the low-complexity random-like ensemble of irregular repeat accumulate (IRA) codes for binary-input symmetric channels in the large blocklength limit. IRA codes Jin, H et al. (2000) are special subclasses of both irregular LDPCs and irregular turbo codes. We present numerical results for the BIAWGNC and formulate the density evolution (DE) Richardson, TJ et al. (2001) for IRA codes. We study the stability condition of the fixed-point corresponding to zero BER.

IEEE International Symposium on Information Theory (ISIT)Jan 1, 200311 citations

Serially Concatenated IRA Codes

Taikun Cheng, Krishnamoorthy Sivakumar, Benjamin J. Belzer

We address the error floor problem of low-density parity check (LDPC) codes on the binary-input additive white Gaussian noise (AWGN) channel, by constructing a serially concatenated code consisting of two systematic irregular repeat accumulate (IRA) component codes connected by an interleaver. The interleaver is designed to prevent stopping-set error events in one of the IRA codes from propagating into stopping set events of the other code. Simulations with two 128-bit rate 0.707 IRA component codes show that the proposed architecture achieves a much lower error floor at higher SNRs, compared to a 16384-bit rate 1/2 IRA code, but incurs an SNR penalty of about 2 dB at low to medium SNRs. Experiments indicate that the SNR penalty can be reduced at larger blocklengths.

arXiv:0709.4466Sep 27, 20071 citation

LDPC code construction as a generalized concatenated code

Igor V. Zhilin, Victor Zyablov

We propose a construction of general concatenated code that uses low-density parity check codes as component codes. This construction itself can also be considered as low-density parity-check code and decoded using Belief Propagation algorithm. Performances of several decoders are compared; it's shown that this code can be efficiently decoded by proposed soft decoding algorithm or combining BP and proposed algorithm.

International Symposium on Problems of Redundancy in Information and Control Systems (REDUNDANCY)Jun 1, 20145 citations

Low-rate LDPC codes with simple protograph structure

D. Divsalar, Samuel J. Dolinar, C. Jones

This paper provides a construction method for low-rate low density parity check codes. Inspired by recently proposed accumulate-repeat-accumulate (ARA) codes, and hybrid concatenated codes, in this paper we extend the construction to low rates. Such codes can be viewed as hybrid concatenations of simple modules such as accumulators, repetition codes, differentiators, and punctured single parity check codes. These codes constitute a subclass of LDPC codes with very fast encoder structure. They also have a projected graph or protograph representation that allows for high-speed decoder implementation. Based on density evolution, we show through some examples that low iterative decoding thresholds close to the channel capacity limits can be achieved, as the block size goes to infinity. Iterative decoding simulation results for short blocks are provided for a few examples that show near-capacity performance and very low error floor

IEEE International Symposium on Information Theory (ISIT)Jan 1, 200583 citations

A family of irregular LDPC codes with low encoding complexity

Sarah J. Johnson, Steven R. Weller

We consider irregular quasi-cyclic low-density parity-check (LDPC) codes derived from difference families. The resulting codes can be encoded with low complexity and perform well when iteratively decoded with the sum-product algorithm.

IEEE Communications LettersFeb 1, 2003110 citations

Irregular low-density parity-check code design based on integer lattices

Wataru Matsumoto, Hirotaka Imai

We propose an irregular low-density parity-check (LDPC) code design scheme by extension of a regular LDPC code using Latin square matrices of random sequence. Our scheme is a deterministic method that enables to easily design good irregular LDPC code for any code rate and degree distributions. We optimize LDPC codes by Gaussian approximation (GA) Chung, S-Y et al., (2001) method and construct irregular LDPC codes based on integer lattices Vasic, B et al., (2002).

IEEE International Symposium on Information Theory (ISIT)Jan 1, 20031 citation