Min-Max decoding for non binary LDPC codes

Details Min-Max decoding for non binary LDPC codes Min-Max decoding for non binary LDPC codes

2008-03-07

arxiv.org/abs/0803.1094v2

Computer Science

Information Theory

5 pages, ISIT08 version v2: acknowledgement footnote, and appendix containing proofs of some statements in the paper

Scientific paper

Iterative decoding of non-binary LDPC codes is currently performed using either the Sum-Product or the Min-Sum algorithms or slightly different versions of them. In this paper, several low-complexity quasi-optimal iterative algorithms are proposed for decoding non-binary codes. The Min-Max algorithm is one of them and it has the benefit of two possible LLR domain implementations: a standard implementation, whose complexity scales as the square of the Galois field's cardinality and a reduced complexity implementation called selective implementation, which makes the Min-Max decoding very attractive for practical purposes.

Affiliated with

Also associated with

No associations

Rating

Min-Max decoding for non binary LDPC codes 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 Min-Max decoding for non binary LDPC codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Min-Max decoding for non binary LDPC codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-253039