In EDS ansehen

Rate‐compatible spatially coupled LDPC code ensembles based on repeat‐accumulate extensions.

Gespeichert in:
Bibliographische Detailangaben
Titel: Rate‐compatible spatially coupled LDPC code ensembles based on repeat‐accumulate extensions.
Autoren: Hou, Wei, Lu, Shan, Cheng, Jun
Quelle: IET Communications (Wiley-Blackwell); Nov2016, Vol. 10 Issue 16, p2422-2426, 5p
Schlagwörter: LOW density parity check codes, ITERATIVE decoding, COMPUTER simulation
Abstract: A family of rate‐compatible capacity‐approaching codes is obtained by spatially coupling multiple identical copies of rate‐compatible base codes. The base code consists of a given regular low‐density parity‐check (LDPC) code and a parameter‐adjustable repeat‐accumulate (RA) extension. The RA‐extension repeatedly accumulates all of the variable nodes of the given LDPC code by q + 1 times to generate q + 1 blocks of accumulated nodes, in which all of the accumulated variable nodes in the first q blocks and the α‐fractional accumulated variable nodes in the last block are transmitted. The spatially coupled versions of the base codes, called RA‐extended spatially coupled LDPC (SC‐LDPC) codes, achieve arbitrary rates by simply adjusting parameters q and α, and thus they are rate‐compatible. The potential thresholds of the base code ensembles are calculated to predict the iterative decoding performance of the proposed RA‐extended SC‐LDPC codes. Numerical results and simulations show that the authors' proposed rate‐compatible codes are capacity‐approaching over binary erasure channels. [ABSTRACT FROM AUTHOR]
Copyright of IET Communications (Wiley-Blackwell) is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Datenbank: Complementary Index
Beschreibung
Abstract:A family of rate‐compatible capacity‐approaching codes is obtained by spatially coupling multiple identical copies of rate‐compatible base codes. The base code consists of a given regular low‐density parity‐check (LDPC) code and a parameter‐adjustable repeat‐accumulate (RA) extension. The RA‐extension repeatedly accumulates all of the variable nodes of the given LDPC code by q + 1 times to generate q + 1 blocks of accumulated nodes, in which all of the accumulated variable nodes in the first q blocks and the α‐fractional accumulated variable nodes in the last block are transmitted. The spatially coupled versions of the base codes, called RA‐extended spatially coupled LDPC (SC‐LDPC) codes, achieve arbitrary rates by simply adjusting parameters q and α, and thus they are rate‐compatible. The potential thresholds of the base code ensembles are calculated to predict the iterative decoding performance of the proposed RA‐extended SC‐LDPC codes. Numerical results and simulations show that the authors' proposed rate‐compatible codes are capacity‐approaching over binary erasure channels. [ABSTRACT FROM AUTHOR]
ISSN:17518628
DOI:10.1049/iet-com.2015.1031