Non-binary Hybrid LDPC Codes: Structure, Decoding and Optimization

Details Non-binary Hybrid LDPC Codes: Structure, Decoding and Optimization Non-binary Hybrid LDPC Codes: Structure, Decoding and Optimization

2007-01-09

arxiv.org/abs/cs/0701066v1

IEEE 2006 Information Theory Workshop, Chengdu, China, Oct.2006, in proceedings

Computer Science

Information Theory

Scientific paper

In this paper, we propose to study and optimize a very general class of LDPC codes whose variable nodes belong to finite sets with different orders. We named this class of codes Hybrid LDPC codes. Although efficient optimization techniques exist for binary LDPC codes and more recently for non-binary LDPC codes, they both exhibit drawbacks due to different reasons. Our goal is to capitalize on the advantages of both families by building codes with binary (or small finite set order) and non-binary parts in their factor graph representation. The class of Hybrid LDPC codes is obviously larger than existing types of codes, which gives more degrees of freedom to find good codes where the existing codes show their limits. We give two examples where hybrid LDPC codes show their interest.

Affiliated with

Also associated with

No associations

Rating

Non-binary Hybrid LDPC Codes: Structure, Decoding and Optimization 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 Non-binary Hybrid LDPC Codes: Structure, Decoding and Optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-binary Hybrid LDPC Codes: Structure, Decoding and Optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-722883