- Title
- Analysis and design of raptor codes using a multi-edge framework
- Creator
- Jayasooriya, Sachini; Shirvanimoghaddam, Mahyar; Ong, Lawrence; Johnson, Sarah J.
- Relation
- Funding BodyARCGrant NumberLP130100783 http://purl.org/au-research/grants/arc/LP130100783
- Relation
- IEEE Transactions on Communications Vol. 65, Issue 12, p. 5123-5136
- Publisher Link
- http://dx.doi.org/10.1109/TCOMM.2017.2750179
- Publisher
- Institute of Electrical and Electronics Engineers (IEEE)
- Resource Type
- journal article
- Date
- 2017
- Description
- The focus of this paper is on the analysis and design of Raptor codes using a multi-edge framework. In this regard, we first represent Raptor codes as multi-edge type (MET) low-density parity-check codes. This MET representation gives a general framework to analyze and design Raptor codes over a binary input additive white Gaussian noise channel using MET density evolution (MET-DE). We then consider a joint decoding scheme based on the belief propagation (BP) decoding for Raptor codes in the multi-edge framework, and analyze the convergence behavior of the BP decoder using MET-DE. In joint decoding of Raptor codes, the component codes corresponding to the inner code and the precode are decoded in parallel and provide information to each other. We also derive an exact expression for the stability of Raptor codes with joint decoding. We then propose an efficient Raptor code design method using the multi-edge framework, where we simultaneously optimize the inner code and the precode. Through density evolution analysis we show that the designed Raptor codes using the multi-edge framework outperform the existing Raptor codes in literature in terms of realized rates.
- Subject
- belief-propagation; code optimization; density evolution; MET-LDPC codes; raptor codes
- Identifier
- http://hdl.handle.net/1959.13/1390402
- Identifier
- uon:33048
- Identifier
- ISSN:0090-6778
- Language
- eng
- Reviewed
- Hits: 1589
- Visitors: 1763
- Downloads: 0
Thumbnail | File | Description | Size | Format |
---|