Anytime properties of protograph-based repeat-accumulate codes

Research output: Chapter in Book/Report/Conference proceedingsConference proceedingpeer-review

Abstract

In this paper, a highly efficient protograph-based repeat-accumulate (P-RA) anytime code is proposed, which is derived from the combination of protograph-based low-density parity-check convolutional (P-LDPCC) and spatially coupled low-density parity-check convolutional (SC-LDPCC) codes. Density evolution technique is applied to demonstrate the anytime properties of the P-RA codes over the binary erasure channel (BEC). The simulation results show that P-RA codes perform better than SC-LDPCC and P-LDPCC codes. More importantly, the finite-length performance of P-RA codes is only dependent on the decoding delay rather than the decoding message position.

Original languageEnglish
Title of host publicationITW 2015 - 2015 IEEE Information Theory Workshop
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages177-181
Number of pages5
ISBN (Electronic)9781467378529
DOIs
Publication statusPublished - 17 Dec 2015
Externally publishedYes
EventIEEE Information Theory Workshop, ITW 2015 - Jeju Island, Korea, Republic of
Duration: 11 Oct 201515 Oct 2015

Publication series

NameITW 2015 - 2015 IEEE Information Theory Workshop

Conference

ConferenceIEEE Information Theory Workshop, ITW 2015
Country/TerritoryKorea, Republic of
CityJeju Island
Period11/10/1515/10/15

Fingerprint

Dive into the research topics of 'Anytime properties of protograph-based repeat-accumulate codes'. Together they form a unique fingerprint.

Cite this