Reduced complexity hard‐ and soft‐input BCH decoding with applications in concatenated codes
Open Access
- 11 March 2021
- journal article
- research article
- Published by Institution of Engineering and Technology (IET) in IET Circuits, Devices & Systems
- Vol. 15 (3) , 284-296
Abstract
Error correction coding for optical communication and storage requires high rate codes that enable high data throughput and low residual errors. Recently, different concatenated coding schemes were proposed that are based on binary BCH codes with low error correcting capabilities. In this work, low‐complexity hard‐ and soft‐input decoding methods for such codes are investigated. We propose three concepts to reduce the complexity of the decoder. For the algebraic decoding we demonstrate that Peterson's algorithm can be more efficient than the Berlekamp–Massey algorithm for single, double, and triple error correcting BCH codes. We propose an inversion‐less version of Peterson's algorithm and a corresponding decoding architecture. Furthermore, we propose a decoding approach that combines algebraic hard‐input decoding with soft‐input bit‐flipping decoding. An acceptance criterion is utilised to determine the reliability of the estimated codewords. For many received codewords the stopping criterion indicates that the hard‐decoding result is sufficiently reliable, and the costly soft‐input decoding can be omitted. To reduce the memory size for the soft‐values, we propose a bit‐flipping decoder that stores only the positions and soft values of a small number of code symbols. This method significantly reduces the memory requirements and has little adverse effect on the decoding performance.Keywords
This publication has 30 references indexed in Scilit:
- Soft input decoder for high‐rate generalised concatenated codesIET Circuits, Devices & Systems, 2018
- Generalized error-locating codes with component codes over the same alphabetProblems of Information Transmission, 2017
- A Soft Input Decoding Algorithm for Generalized Concatenated CodesIEEE Transactions on Communications, 2016
- Serial quasi-primitive BC-BCH codes for NAND flash memories2016
- Decoder architecture for generalised concatenated codesIET Circuits, Devices & Systems, 2015
- Quasi-Primitive Block-Wise Concatenated BCH Codes With Collaborative Decoding for NAND Flash MemoriesIEEE Transactions on Communications, 2015
- Block-Wise Concatenated BCH Codes for NAND Flash MemoriesIEEE Transactions on Communications, 2014
- A Low-Complexity Three-Error-Correcting BCH Decoder for Optical Transport NetworkIEEE Transactions on Circuits and Systems II: Express Briefs, 2012
- Product Code Schemes for Error Correction in MLC NAND Flash MemoriesIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2011
- Low-Complexity GEL Codes for Digital Magnetic Storage SystemsIEEE Transactions on Magnetics, 2004