Weighted Symbol-Flipping Decoding for Nonbinary LDPC Codes
NSWCTC), 2010 Second International Conference(2010)
Abstract
In this paper, a new low-complexity symbol-flipping algorithm to decode nonbinary low-density parity-check (LDPC) codes is proposed. The decoding procedure updates iteratively the hard-decision received symbol vector in search of a valid codeword in the symbol vector space. Only one symbol is changed in each iteration, and symbol flipping function combines the number of failed checks and reliability of the received bits and calculated symbols. An optional mechanism to avoid infinite loops in high Galois field search is also proposed. Our studies show that the algorithm achieves an appealing tradeoff between performance and complexity over relatively low Galois field for short to medium code length.
MoreTranslated text
Key words
weighted symbol-flipping decoding,decoding procedure,medium code length,symbol-flipping (sf) decoding,hard-decision received symbol vector,symbol vector space,low density parity check codes,symbol vector,short-to-medium code length,low-complexity symbol-flipping algorithm,computational complexity,appealing tradeoff,low galois field,quasi-cyclic,performance-complexity tradeoff,nonbinary ldpc codes,galois field search,high galois field search,galois fields,failed check,nonbinary,iterative decoding,calculated symbol,parity check codes,low-density parity-check (ldpc) codes,infinite loop,fast fourier transforms,computer networks,ldpc code,wireless communication,low density parity check,error correction,vector space,galois field,reliability,decoding,niobium
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined