Approaching Capacity at High-Rates with Iterative Hard-Decision Decoding

Details Approaching Capacity at High-Rates with Iterative Hard-Decision Decoding Approaching Capacity at High-Rates with Iterative Hard-Decision Decoding

2012-02-28

arxiv.org/abs/1202.6095v1

Computer Science

Information Theory

5 pages, submitted to ISIT 2012

Scientific paper

A variety of low-density parity-check (LDPC) ensembles have now been observed to approach capacity with message-passing decoding. However, all of them use soft (i.e., non-binary) messages and a posteriori probability (APP) decoding of their component codes. In this paper, we analyze a class of spatially-coupled generalized LDPC codes and observe that, in the high-rate regime, they can approach capacity under iterative hard-decision decoding. These codes can be seen as generalized product codes and are closely related to braided block codes.

Affiliated with

Also associated with

No associations

Rating

Approaching Capacity at High-Rates with Iterative Hard-Decision Decoding 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 Approaching Capacity at High-Rates with Iterative Hard-Decision Decoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approaching Capacity at High-Rates with Iterative Hard-Decision Decoding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-605414