![]() Chou, Hung-Pu ![]() Report (2022) BCH codes are being widely used in commercial NAND flash controllers, and the decoding algorithm based on the Berlekamp-Massey (BM) algorithm is a classic solution for solving the key equation used for ... [more ▼] BCH codes are being widely used in commercial NAND flash controllers, and the decoding algorithm based on the Berlekamp-Massey (BM) algorithm is a classic solution for solving the key equation used for error correction. The latency of BM decoding is the bottleneck of the Bose-Chaudhuri Hocquenghem (BCH) decoder when correcting a high number of bit errors. However, the flash memory has an error distribution that degrades with usage: few errors occur in the new memory and a low number of errors occur within a code block. With usage, the system performance degrades and BM decoding needs t iterations in order to correct a larger number t of errors. In an attempt to improve the system performance for high speed applications, early termination of the BM decoding is necessary to overcome this degradation. In this paper, a practical solution for early termination checking for BM algorithm is provided. The analysis of proposed method is presented by means of considering the weight distribution of BCH code and deriving the probability of malfunction as the event of undetectable error. The proposed method is presented to be effective by the numerical results and the probability of malfunction for the proposed method is lower than 10−26. As a result, the FPGA testing on a USB device validate the reliability of the proposed method for applying to a commercial product. [less ▲] Detailed reference viewed: 28 (10 UL)![]() Chou, Hung-Pu ![]() in Global Conference on Consumer Electronics (2019) Detailed reference viewed: 43 (9 UL)![]() Chou, Hung-Pu ![]() in IEEE Communications Letters (2018) For a recording system that has a run-length-limited (RLL) constraint, this approach imposes the hard error by flipping bits before recording. A high error coding rate limits the correcting capability of ... [more ▼] For a recording system that has a run-length-limited (RLL) constraint, this approach imposes the hard error by flipping bits before recording. A high error coding rate limits the correcting capability of the RLL bit error. Since iterative decoding does not include the estimation technique, it has the potential capability of solving the hard error bits within several 7 iterations compared to an LDPC coded system. In this letter, we implement density evolution and the differential evolution approach to provide a performance evaluation of unequal error protection LDPC code to investigate the optimal LDPC code distribution for an RLL flipped system. [less ▲] Detailed reference viewed: 34 (4 UL)![]() Chou, Hung-Pu ![]() in Proceedings of 2017 International SoC Design Conference (ISOCC) (2017) Detailed reference viewed: 38 (10 UL)![]() Chou, Hung-Pu ![]() in IEEE Transactions on Communications (2012) Detailed reference viewed: 42 (7 UL)![]() ; ; et al Poster (2010) In this paper, we investigate the soft iterative decoding technique for ternary recoding systems with run-length-limited (RLL) constraints. We employ a simple binary-to-ternary RLL encoder following the ... [more ▼] In this paper, we investigate the soft iterative decoding technique for ternary recoding systems with run-length-limited (RLL) constraints. We employ a simple binary-to-ternary RLL encoder following the LDPC (low density parity check) encoder. In the decoder, the iteratively passing of soft information between the LDPC decoder and a detector is used, where the detector is constructed for a combination of the RLL encoder, PLM (pulse length modulation) precoder and the partial response channel. We provide two different decoding algorithms. For one of the decoding algorithm, we are able to obtain bit-error-rate performance which is inferior to the comparable system without considering the RLL constraint for the high sign-to-noise ratio (SNR) regime and is better for the low-to-moderate SNR regime. [less ▲] Detailed reference viewed: 32 (3 UL)![]() Chou, Hung-Pu ![]() in IEEE Transactions on Magnetics (2010) Detailed reference viewed: 42 (4 UL) |
||