Rate-compatible IRA codes using quadratic congruential extension sequences and puncturing

Authors:
David Benmayor;P. Takis Mathiopoulos;Philip Constantinou
Affiliations:
Institute for Space Applications and Remote Sensing, National Observatory of Athens and School of Electrical and Computer Engineering, National Technical University of Athens, Greece;ISARS, NOA;School of ECE, NTUA
Venue:
IEEE Communications Letters
Year:
2010

Citing 3
Cited 0

Design and analysis of E2RC codes

IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
The design of efficiently-encodable rate-compatible LDPC codes

IEEE Transactions on Communications
Regular and irregular progressive edge-growth tanner graphs

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

A novel algorithm for the design of rate-compatible (RC) irregular repeat-accumulate (IRA) codes through deterministic extending based on quadratic congruential extension sequences is introduced. To maintain low-complexity, algebraic operations are used without any post-construction girth conditioning. The proposed extending algorithm is general and can be applied to any IRA mother code of information block length, k0, producing different sequences of code rates, R. Furthermore, a hybrid class of Deterministically Designed RC-IRA (D2RC-IRA) codes is obtained by combining the proposed extending algorithm with puncturing. Simulation results have shown that for k0 = 1024 R and = 8/24, 8/23, ..., 8/9, the proposed codes outperform equivalent deterministic coding schemes in both error rate and throughput by up to 0.62 dB and 0.6 dB, respectively.