Anytime properties of protograph-based repeat-accumulate codes
Date
2015
Authors
Zhang, N.
Noor A Rahim, M.
Vellambi, B.N.
Nguyen, K.D.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
ITW2015 : 2015 IEEE Information Theory Workshop, 2015, pp.177-181
Statement of Responsibility
Conference Name
2015 IEEE Information Theory Workshop (ITW2015) (11 Oct 2015 - 15 Oct 2015 : Jeju Island, South Korea)
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.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2015 IEEE