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, k <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> , producing different sequences of code rates, R. Furthermore, a hybrid class of Deterministically Designed RC-IRA (D <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> RC-IRA) codes is obtained by combining the proposed extending algorithm with puncturing. Simulation results have shown that for k <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> = 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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
