dc.contributor.author |
Benmayor, D |
en |
dc.contributor.author |
Mathiopoulos, PT |
en |
dc.contributor.author |
Constantinou, P |
en |
dc.date.accessioned |
2014-03-01T01:34:23Z |
|
dc.date.available |
2014-03-01T01:34:23Z |
|
dc.date.issued |
2010 |
en |
dc.identifier.issn |
10897798 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/20726 |
|
dc.subject |
Extending |
en |
dc.subject |
Hybrid automatic repeat request (ARQ) |
en |
dc.subject |
Irregular repeat-accumulate (IRA) codes |
en |
dc.subject |
Low-density parity-check (LDPC) codes |
en |
dc.subject |
Rate-compatible (RC) |
en |
dc.subject.other |
Algebraic operations |
en |
dc.subject.other |
Code rates |
en |
dc.subject.other |
Coding scheme |
en |
dc.subject.other |
Error rate |
en |
dc.subject.other |
Hybrid-automatic repeat request |
en |
dc.subject.other |
Information blocks |
en |
dc.subject.other |
IRA code |
en |
dc.subject.other |
Irregular repeat-accumulate codes |
en |
dc.subject.other |
Low-complexity |
en |
dc.subject.other |
Low-density parity-check codes |
en |
dc.subject.other |
Novel algorithm |
en |
dc.subject.other |
Simulation result |
en |
dc.subject.other |
Block codes |
en |
dc.subject.other |
Coding errors |
en |
dc.subject.other |
Packet networks |
en |
dc.subject.other |
Algorithms |
en |
dc.title |
Rate-compatible IRA codes using quadratic congruential extension sequences and puncturing |
en |
heal.type |
journalArticle |
en |
heal.identifier.primary |
10.1109/LCOMM.2010.05.092141 |
en |
heal.identifier.secondary |
http://dx.doi.org/10.1109/LCOMM.2010.05.092141 |
en |
heal.identifier.secondary |
5456059 |
en |
heal.publicationDate |
2010 |
en |
heal.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. © 2010 IEEE. |
en |
heal.journalName |
IEEE Communications Letters |
en |
dc.identifier.doi |
10.1109/LCOMM.2010.05.092141 |
en |
dc.identifier.volume |
14 |
en |
dc.identifier.issue |
5 |
en |
dc.identifier.spage |
441 |
en |
dc.identifier.epage |
443 |
en |