Decoding Complexity of Irregular LDGM-LDPC Codes Over the BISOM Channels

Details Decoding Complexity of Irregular LDGM-LDPC Codes Over the BISOM Channels Decoding Complexity of Irregular LDGM-LDPC Codes Over the BISOM Channels

2010-03-12

arxiv.org/abs/1003.2454v3

M. Raina, P. Spasojevic, "Decoding Complexity of Irregular LDGM-LDPC Codes Over the BISOM Channels,'' IEEE Conference on Infor

Computer Science

Information Theory

Scientific paper

An irregular LDGM-LDPC code is studied as a sub-code of an LDPC code with some randomly \emph{punctured} output-bits. It is shown that the LDGM-LDPC codes achieve rates arbitrarily close to the channel-capacity of the binary-input symmetric-output memoryless (BISOM) channel with bounded \emph{complexity}. The measure of complexity is the average-degree (per information-bit) of the check-nodes for the factor-graph of the code. A lower-bound on the average degree of the check-nodes of the irregular LDGM-LDPC codes is obtained. The bound does not depend on the decoder used at the receiver. The stability condition for decoding the irregular LDGM-LDPC codes over the binary-erasure channel (BEC) under iterative-decoding with message-passing is described.

Affiliated with

Also associated with

No associations

Rating

Decoding Complexity of Irregular LDGM-LDPC Codes Over the BISOM Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Decoding Complexity of Irregular LDGM-LDPC Codes Over the BISOM Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decoding Complexity of Irregular LDGM-LDPC Codes Over the BISOM Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-126325