Adaptive Multiple-Attempts Approach to Optimize Multiple-Vote Symbol-Flipping NB-LDPC Decoder

Non-binary low-density parity-check (NB-LDPC) codes outperform binary codes, particularly when used with short packets and/or <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">q</i>-ary modulation. This paper presents the Adaptive Multiple-Attempts Multiple-Vote Symbol-Flipping (AMA-MVSF) algorithm, which enhances Multiple-Vote Symbol-Flipping (MVSF) performance for lower variable-node degrees (<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">d_v</i>). Simulation results show it reduces the performance gap to Belief-Propagation compared to the standard MVSF algorithm. For instance, for a <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">d_v</i> = 3 NB-LDPC code, the FER gap decreases from 0.8 dB to 0.42 dB. The proposed approach improves decoding performance while maintaining computational simplicity and hardware efficiency, key requirements for low-power embedded systems.