Title :
Rate-compatible IRA codes using quadratic congruential extension sequences and puncturing
Author :
Benmayor, David ; Mathiopoulos, P. Takis ; Constantinou, Philip
Author_Institution :
Sch. of Electr. & Comput. Eng. (ECE), Nat. Tech. Univ. of Athens (NTUA), Athens, Greece
fDate :
5/1/2010 12:00:00 AM
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 and R = 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.
Keywords :
automatic repeat request; channel coding; parity check codes; quadratic programming; algebraic operations; error rate; hybrid automatic repeat request; irregular repeat-accumulate codes; low density parity check codes; quadratic congruential extension sequences; rate-compatible IRA codes; Algorithm design and analysis; Application software; Automatic repeat request; Channel coding; Context; Error analysis; Parity check codes; Sparse matrices; Throughput; Time varying systems; Extending, hybrid automatic repeat request (ARQ), irregular repeat-accumulate (IRA) codes, low-density parity-check (LDPC) codes, rate-compatible (RC);
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2010.05.092141
