Volltext-Downloads (blau) und Frontdoor-Views (grau)

A low-complexity three-error-correcting BCH decoder with applications in concatenated codes

  • 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.

Export metadata

Additional Services

Search Google Scholar


Author:Jürgen FreudenbergerORCiDGND, Mohammed RajabORCiD, Sergo ShavgulidzeORCiD
Parent Title (English):SCC 2019; 12th International ITG Conference on Systems, Communications and Coding, February 11 - 14, 2019, Rostock, Germany
Publisher:VDE Verlag
Place of publication:Berlin ; Offenbach
Document Type:Conference Proceeding
Year of Publication:2019
Release Date:2020/01/13
First Page:7
Last Page:11
Volltextzugriff für Hochschulangehörige via Datenbank IEEE Xplore möglich
Institutes:Institut für Systemdynamik - ISD
DDC functional group:000 Allgemeines, Informatik, Informationswissenschaft
Relevance:Keine peer reviewed Publikation (Wissenschaftlicher Artikel und Aufsatz, Proceeding, Artikel in Tagungsband)
Open Access?:Nein
Licence (German):License LogoUrheberrechtlich geschützt