An Improved Symbol-Flipping Algorithm for Nonbinary LDPC Codes and its Application to NAND Flash Memory

Oh, Jong–Hoon; Han, Seokju; Ha, Jeongseok

doi:10.1109/tmag.2019.2918985

Cited by 6 publications

(6 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Equation (28) identifies and removes those variable nodes which are common in equation (26) and (27). This helps to decide the number of flipping positions in ψ ψ ψ as subset to T .…”

Section: Multiple Symbol Flipping Bit Reliability Based Decoding Amentioning

confidence: 99%

“…In this algorithm, the successful and failed checks are isolated as shown in equations (26), (27) and (28). The set of the variable nodes that contributed to the failed checks, helps to decide which symbol position should be flipped and how many positions needs to be flipped.…”

Section: Multiple Symbol Flipping Prediction Based Algorithmmentioning

confidence: 99%

“…The complexity of these algorithms [25] depend on the size of the Galois field order q and length n of a codeword. A decision-symbol reliability-based SFD (DRB-SFD) algorithm [26] is aimed to show better performance in applications like data storage based on NAND flash memory. Paper [26] is focused on an algorithm for NAND flash memory and the BER performance has not been compared with existing algorithms like MV-SF, MV-PSFD, and D-SFDP.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

“…Equation (28) identifies and removes those variable nodes which are common in equation (26) and (27). This helps to decide the number of flipping positions in ψ ψ ψ as subset to T .…”

Section: Multiple Symbol Flipping Bit Reliability Based Decoding Amentioning

confidence: 99%

Section: Multiple Symbol Flipping Prediction Based Algorithmmentioning

confidence: 99%

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

show abstract

“…In particular, for NAND flash memory, high data throughput is crucial. Therefore, quite a few schemes have focused on reducing the decoding complexity of the NB-LDPC codes for NAND flash memory [4]- [10]. Moreover, the reliability of flash memory cells continues to degrade owing to the rapid increase in storage density via multi-level data cells.…”

Section: Introductionmentioning

confidence: 99%

“…In general, there are three types of algorithms for reducing the decoding complexity of NB-LDPC codes: simplified belief propagation decoding (SBPD) [14]- [17], symbol flipping decoding (SFD) [4], [18]- [22], and majority-logic decoding (MLgD) [23]- [26] algorithms. The SBPD algorithms outperform the other two types, but their computational complexity is higher than that of the other two.…”

Section: Introductionmentioning

confidence: 99%

Iterative Pseudo-Soft-Reliability-Based Majority-Logic Decoding for NAND Flash Memory

Park

Chung

2021

IEEE Access

View full text Add to dashboard Cite

This paper proposes a decoding algorithm for nonbinary low-density parity-check (NB-LDPC) codes, aiming to improve the error rate performance for NAND flash memory. Several NB-LDPC decoding methods for NAND flash memory have been studied. Some approaches rely on hard decisions, and these are relatively simple but do not have a good error rate performance. Others are based on soft decisions that require multiple reads for each flash memory cell, leading to significant memory throughput degradation. To improve the error rate performance without suffering performance degradation owing to multiple reads, an iterative pseudo-soft-reliability-based decoding algorithm is proposed. Using Galois field addition to calculate the Hamming distance at the initialization, the proposed algorithm not only improves the error rate performance but also reduces the average number of iterations compared with those of conventional hard-decision-based decoding algorithms. INDEX TERMSError correction codes, Hamming distance, Hard decision, Iterative hard-reliability-based majority-logic decoding algorithm, NAND flash memory, Nonbinary low-density parity-check codes

show abstract

An NB-LDPC decoder Algorithm combined using channel information for Storage Application

Ren

Ding

Xin

et al. 2020

2020 IEEE 5th International Conference on Integrated Circuits and Microsystems (ICICM)

View full text Add to dashboard Cite

An Improved Symbol-Flipping Algorithm for Nonbinary LDPC Codes and its Application to NAND Flash Memory

Cited by 6 publications

References 40 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

Iterative Pseudo-Soft-Reliability-Based Majority-Logic Decoding for NAND Flash Memory

An NB-LDPC decoder Algorithm combined using channel information for Storage Application

Contact Info

Product

Resources

About