Change search
ReferencesLink to record
Permanent link

Direct link
Some Results on MAP Decoding of Non-Binary LDPC Codes Over the BEC
KTH, School of Electrical Engineering (EES), Communication Theory.
2011 (English)In: IEEE Transactions on Information Theory, ISSN 0018-9448, Vol. 57, no 4, 2225-2242 p.Article in journal (Refereed) Published
Abstract [en]

In this paper, the transmission over the binary erasure channel (BEC) using non-binary LDPC (NBLDPC) codes is considered. The concept of peeling decoder and stopping sets is generalized to NBLDPC codes. Using these generalizations, a combinatorial characterization of decoding failures of NBLDPC codes is given, under assumption that the Belief Propagation (BP) decoder is used. Then, the residual ensemble of codes resulted by the BP decoder is defined and the design rate and the expectation of total number of codewords of the residual ensemble are computed. The decoding failure criterion combined with the density evolution analysis helps us to compute the asymptotic residual degree distribution for NBLDPC codes. Our approach to compute the residual degree distribution on the check node side is not efficient as it is based on enumeration of all the possible connections on the check node side which satisfy the decoding failure criterion. So, the computation of the asymptotic check node side residual degree distribution and further part of our analysis is performed for NBLDPC codes over GF(2)(m) with m = 2. In order to show that asymptotically almost every code in such LDPC ensemble has a rate equal to the design rate, we generalize the argument of the Maxwell construction to NBLDPC codes, defined over FG(2)(2). It is also observed that, like in the binary setting, the Maxwell construction, relating the performance of MAP and BP decoding holds in this setting.

Place, publisher, year, edition, pages
2011. Vol. 57, no 4, 2225-2242 p.
Keyword [en]
BEC, design rate, MAP performance, non-binary LDPC codes, peeling decoder, stopping sets
National Category
Computer Science
URN: urn:nbn:se:kth:diva-32239DOI: 10.1109/TIT.2011.2110930ISI: 000288459100025ScopusID: 2-s2.0-79952833319OAI: diva2:419202
QC 20110526 Available from: 2011-05-26 Created: 2011-04-11 Last updated: 2011-05-26Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Rathi, Vishwambhar
By organisation
Communication Theory
In the same journal
IEEE Transactions on Information Theory
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 21 hits
ReferencesLink to record
Permanent link

Direct link