Bit Reliability-Based Decoders for Non-Binary LDPC Codes

Huang, Qin; Yuan, Shuai

doi:10.1109/tcomm.2015.2501298

Cited by 22 publications

(17 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This weighted BRB (wBRB) algorithm shows improved performance over ISRB and BRB and does not suffer from error floor for parity check matrices with small column weight. A full bit-reliability based decoder [21] is the binary form of weighted BRB as this algorithm uses the binary representation of the nonzero entries of the parity check matrix to facilitate hardware implementation.…”

Section: Introductionmentioning

confidence: 99%

“…Symbol flipping (SF) decoding algorithms have low complexity as compared to the bit reliability based decoding algorithms [20], [21] and the q-ary belief propagation [1] [5] message passing algorithms but at the cost of reduced bit error rate performance. In the symbol flipping decoding algorithm presented in [22], the least reliable position is determined by majority decision, while the flipped symbol value is computed from the reliability of the received bits.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

2020

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

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

2020

View full text Add to dashboard Cite

show abstract

“…Introduction: In short-to-moderate block-lengths regime, non-binary (NB) low-density parity-check (LDPC) codes introduced in [1,2] are competitive candidates, as when combined with higher-order modulations or used in burst-error channels, short NB LDPC codes usually outperform binary LDPC codes of the same bit lengths. Recently, construction [3][4][5][6][7][8], decoding [9][10][11], and application [12,13] of NB LDPC codes have received great attention. However, highdecoding complexity hinders the application of NB LDPC codes in practical systems.…”

mentioning

confidence: 99%

“…However, highdecoding complexity hinders the application of NB LDPC codes in practical systems. To reduce decoding complexity, various lowcomplexity decoding algorithms have been proposed in the literature, see [9][10][11] and the references therein.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Extended construction of array‐based non‐binary LDPC codes

Zhao

2019

Electron. lett.

View full text Add to dashboard Cite

Array-based non-binary (NB) low-density parity-check (LDPC) codes are attractive in practice for their advantages in implementation and performance. However, existing construction of array-based NB LDPC codes is only with the prime number cases. In this Letter, the authors extend the array-based construction to composite numbers to give an explicit construction of structured array-based NB LDPC codes with column weights three, four, and five. The resulting codes have girth at least six. The simulation results show that the proposed structured codes perform as well as the random codes constructed by progressive edge-growth algorithm, when decoded with the Q-ary sum product algorithm and the low-complexity weighted bit-reliability-based decoding algorithm.

show abstract

Quantum secure direct communication with entanglement source and single-photon measurement

Lin

et al. 2020

Sci. China Phys. Mech. Astron.

View full text Add to dashboard Cite

Bit Reliability-Based Decoders for Non-Binary LDPC Codes

Cited by 22 publications

References 28 publications

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

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

Extended construction of array‐based non‐binary LDPC codes

Quantum secure direct communication with entanglement source and single-photon measurement

Contact Info

Product

Resources

About