TY  - CHAP
U1  - Konferenzveröffentlichung
A1  - Freudenberger, Jürgen
A1  - Rajab, Mohammed
A1  - Shavgulidze, Sergo
T1  - A low-complexity three-error-correcting BCH decoder with applications in concatenated codes
T2  - SCC 2019; 12th International ITG Conference on Systems, Communications and Coding, February 11 - 14, 2019, Rostock, Germany
N2  - Error correction coding (ECC) for optical communication and persistent storage systems require high rate codes that enable high data throughput and low residual errors. Recently, different concatenated coding schemes were proposed that are based on binary Bose-Chaudhuri-Hocquenghem (BCH) codes that have low error correcting capabilities. Commonly, hardware implementations for BCH decoding are based on the Berlekamp-Massey algorithm (BMA). However, for single, double, and triple error correcting BCH codes, Peterson's algorithm can be more efficient than the BMA. The known hardware architectures of Peterson's algorithm require Galois field inversion. This inversion dominates the hardware complexity and limits the decoding speed. This work proposes an inversion-less version of Peterson's algorithm. Moreover, a decoding architecture is presented that is faster than decoders that employ inversion or the fully parallel BMA at a comparable circuit size.
Y1  - 2019
UR  - https://ieeexplore.ieee.org/document/8661299
SN  - 978-3-8007-4862-4
SB  - 978-3-8007-4862-4
U6  - https://doi.org/10.30420/454862002
DO  - https://doi.org/10.30420/454862002
N1  - Volltextzugriff für Hochschulangehörige via Datenbank IEEE Xplore möglich
SP  - 7
EP  - 11
PB  - VDE Verlag
CY  - Berlin ; Offenbach
ER  -