Min-Max decoding for non binary LDPC codes

2008/03/07 by Savin, Valentin · 1 citation
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.0803.1094

Abstract

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.

Cited by

• In-Memory Non-Binary LDPC Decoding

Related

• Low-complexity decoding for non-binary LDPC codes in high order fields
• Non-binary LDPC decoding using truncated messages in the Walsh-Hadamard\n domain
• Generalized Simplified Variable-Scaled Min Sum LDPC decoder for\n irregular LDPC Codes
• Multiplicatively Repeated Non-Binary LDPC Codes
• Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels