Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Networks Security, Wireless Communications and Trusted Computing (NSWCTC)

Weighted Symbol-Flipping Decoding for Nonbinary LDPC Codes

Bing Liu, Jun Gao, Gaoqi Dou, Wei Tao

Published Jan 1, 2010• 25 citations
Publisher

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.

DOI
10.1109/nswctc.2010.59

Related papers

Majority decision based weighted symbol-flipping decoding for nonbinary LDPC codes

Bing Liu, Jun Gao, Gaoqi Dou +1 more

A new low-complexity symbol-flipping algorithm based on majority decision 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. Flipped symbol position is determined by majority decision and flipped value is calculated by channel output. And 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.

International Conference on Future Computer and Communication•Jan 1, 2010•4 citations

Prediction and Voting Based Symbol Flipping Non-Binary LDPC Decoding Algorithms

Waheed Ullah, Ling Cheng, Fambirai Takawira

In this paper, we present two low complexity algorithms to decode non-binary LDPC codes. The proposed decoding algorithms update iteratively the hard decision received vector to search for a valid codeword in the vector space of Galois field (GF). The selection criterion for the position of unreliable symbols is based on failed checks and the information from the Galois field structure. In the first proposed algorithm, the flipping function is calculated for all symbols of the received sequence and multiple symbols are flipped in each iteration while in the second proposed algorithm, a single symbol is flipped per iteration. In the second method, unreliable positions are short-listed by using a majority voting scheme, and then the flipping function is computed to predict candidate symbols from the set of symbols in GF(q) while not violating the field order q. The proposed methods reduce the decoding complexity and memory use. The results of the algorithms show appealing tradeoffs between complexity and bit error rate performance for non-binary LDPC codes.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Aug 1, 2020•5 citations

Low Complexity Bit Reliability and Predication Based Symbol Value Selection Decoding Algorithms for Non-Binary LDPC Codes

Waheed Ullah, Ling Cheng, Fambirai Takawira

The main challenge for hardware implementation of non-binary LDPC decoding is the high computational complexity and large memory requirement. To address this challenge, five new low complexity LDPC decoding algorithms are proposed in this paper. The proposed algorithms are developed specifically towards the low complexity, yet effective, decoding of the NB LDPC codes. The proposed decoding algorithms update, iteratively, the hard decision received vector to search for the valid codeword in the vector space of Galois field ${(GF)}$ . The selection criterion for least reliable symbol positions is based on the information from the failed checks and the reliability information from the Galois field structure as well as from the received channel soft information. To choose the correct value for the candidate symbol, two methods are used. The first method is based on the prediction of the error symbol from the set of Galois field symbols which maximize an objective function. In the second method, individual bits are flipped based on the reliability information obtained from the channel. Algorithms 1 and 2 flip a single symbol per iteration whilst the other three algorithms 3, 4 and 5 flip multiple symbols in each iteration. The proposed voting based Algorithms 1, 2 and 5 first short list the unreliable positions using a majority voting scheme and then choose the candidate symbol value from the set of the symbols in ${GF(q)}$ while not violating the field order ${q}$ . These methods simplify the decoding complexity in terms of computation and memory. Results and analysis of these algorithms show an appealing tradeoff between computational complexity and bit error rate performance for NB LDPC codes.

IEEE Access•Jan 1, 2020•13 citations

Design of Decoder using Modified Hybrid Weighted Symbol Flipping for Nonbinary Ldpc Codes

M. K. Dharani, C. Kalamani

A hybrid decoding algorithm which proposed for nonbinary and binary low density parity (LDPC) codes, both the algorithm combines the weighted symbol flipping (WSF) algorithm with the fast Fourier transform q-ary sum product algorithm (FFT-QSPA).The flipped position and value are determined by the symbol flipping metric and the received bit values in the first stage WSF algorithm. If the low complexity WSF algorithm is failed, the second stage FFT-QSPA is activated as a switching strategy. They are particularly effective for decoding LDPC codes constructed based on finite geometries and finite fields. Analyzing both the techniques nonbinary LDPC codes gives the better error performance and greatly reduces the computation complexity compared to binary LDPC codes. The proposed hybrid algorithm is used for some applications in communication systems for high speed and low power consumption. Keywords Nonbinary and binary low density parity-check (LDPC) code, Weighted symbol –flipping (WSF), Hybrid weighted symbol-flipping (HWSF), iterative decoding. 1.

International Conference on Innovations in Information, Embedded and Communication Systems•Nov 18, 2014•0 citations

Hybrid weighted bit-flipping decoding algorithm for LDPC codes

Gaoqi Dou

To reduce loop-oscillation errors occurring in the weighted bit-flipping algorithm,a hybrid weighted bit-flipping decoding algorithm for low-density parity-check(LDPC) codes is proposed.The proposed algorithm updates multiple bits in each iteration,a random perturbation is added when the loop oscillation is detected which could reduce loop-oscillation errors by changing objective function.And these errors are analyzed from the mathematic perspective.Simulation results and complexity comparison show that the proposed algorithm achieves an appealing tradeoff among performance,convergence and complexity for structured LDPC codes compared with the best known weighted bit-flipping decoding algorithm.

Systems engineering and electronics•Jan 1, 2010•1 citation

Parallel Symbol-Flipping Decoding for Non-Binary LDPC Codes

Chao-Cheng Huang, Chi‐Jen Wu, Chao‐Yu Chen +1 more

A new low-complexity parallel symbol-flipping decoding algorithm for non-binary low-density parity-check (NB-LDPC) codes is proposed. The algorithm outperforms quite a number of existing reliability-based message-passing algorithms, and its computation complexity is smaller than that of almost all the previously proposed iterative decoding algorithms for NB-LDPC codes. It is suitable for decoding NB-LDPC codes whose parity-check matrices have large column weights.

IEEE Communications Letters•Jun 1, 2013•23 citations
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.
A new low-complexity symbol-flipping algorithm based on majority decision 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. Flipped symbol position is determined by majority decision and flipped value is calculated by channel output. And 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.
In this paper, we present two low complexity algorithms to decode non-binary LDPC codes. The proposed decoding algorithms update iteratively the hard decision received vector to search for a valid codeword in the vector space of Galois field (GF). The selection criterion for the position of unreliable symbols is based on failed checks and the information from the Galois field structure. In the first proposed algorithm, the flipping function is calculated for all symbols of the received sequence and multiple symbols are flipped in each iteration while in the second proposed algorithm, a single symbol is flipped per iteration. In the second method, unreliable positions are short-listed by using a majority voting scheme, and then the flipping function is computed to predict candidate symbols from the set of symbols in GF(q) while not violating the field order q. The proposed methods reduce the decoding complexity and memory use. The results of the algorithms show appealing tradeoffs between complexity and bit error rate performance for non-binary LDPC codes.
The main challenge for hardware implementation of non-binary LDPC decoding is the high computational complexity and large memory requirement. To address this challenge, five new low complexity LDPC decoding algorithms are proposed in this paper. The proposed algorithms are developed specifically towards the low complexity, yet effective, decoding of the NB LDPC codes. The proposed decoding algorithms update, iteratively, the hard decision received vector to search for the valid codeword in the vector space of Galois field (GF){(GF)}(GF) . The selection criterion for least reliable symbol positions is based on the information from the failed checks and the reliability information from the Galois field structure as well as from the received channel soft information. To choose the correct value for the candidate symbol, two methods are used. The first method is based on the prediction of the error symbol from the set of Galois field symbols which maximize an objective function. In the second method, individual bits are flipped based on the reliability information obtained from the channel. Algorithms 1 and 2 flip a single symbol per iteration whilst the other three algorithms 3, 4 and 5 flip multiple symbols in each iteration. The proposed voting based Algorithms 1, 2 and 5 first short list the unreliable positions using a majority voting scheme and then choose the candidate symbol value from the set of the symbols in GF(q){GF(q)}GF(q) while not violating the field order q{q}q . These methods simplify the decoding complexity in terms of computation and memory. Results and analysis of these algorithms show an appealing tradeoff between computational complexity and bit error rate performance for NB LDPC codes.
A hybrid decoding algorithm which proposed for nonbinary and binary low density parity (LDPC) codes, both the algorithm combines the weighted symbol flipping (WSF) algorithm with the fast Fourier transform q-ary sum product algorithm (FFT-QSPA).The flipped position and value are determined by the symbol flipping metric and the received bit values in the first stage WSF algorithm. If the low complexity WSF algorithm is failed, the second stage FFT-QSPA is activated as a switching strategy. They are particularly effective for decoding LDPC codes constructed based on finite geometries and finite fields. Analyzing both the techniques nonbinary LDPC codes gives the better error performance and greatly reduces the computation complexity compared to binary LDPC codes. The proposed hybrid algorithm is used for some applications in communication systems for high speed and low power consumption. Keywords Nonbinary and binary low density parity-check (LDPC) code, Weighted symbol –flipping (WSF), Hybrid weighted symbol-flipping (HWSF), iterative decoding. 1.
To reduce loop-oscillation errors occurring in the weighted bit-flipping algorithm,a hybrid weighted bit-flipping decoding algorithm for low-density parity-check(LDPC) codes is proposed.The proposed algorithm updates multiple bits in each iteration,a random perturbation is added when the loop oscillation is detected which could reduce loop-oscillation errors by changing objective function.And these errors are analyzed from the mathematic perspective.Simulation results and complexity comparison show that the proposed algorithm achieves an appealing tradeoff among performance,convergence and complexity for structured LDPC codes compared with the best known weighted bit-flipping decoding algorithm.