Anytime properties of protograph-based repeat-accumulate codes

Document Type

Conference Proceeding

Publication Date

12-17-2015

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.

Identifier

84962764382 (Scopus)

ISBN

[9781467378529]

Publication Title

Itw 2015 2015 IEEE Information Theory Workshop

External Full Text Location

https://doi.org/10.1109/ITWF.2015.7360758

First Page

177

Last Page

181

Grant

DE12010016

Fund Ref

Australian Research Council

This document is currently not available here.

Share

COinS