Area-Optimized Fully-Flexible BCH Decoder for Multiple GF Dimensions

Byeonggil Park, Jongsun Park, Youngjoo Lee

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Recently, there are increasing demands for fully flexible Bose-Chaudhuri-Hocquenghem (BCH) decoders, which can support different dimensions of Galois fields (GF) operations. As the previous BCH decoders are mainly targeting the fixed GF operations, the conventional techniques are no longer suitable for multiple GF dimensions. For the area-optimized flexible BCH decoders, in this paper, we present several optimization schemes for reducing hardware costs of multi-dimensional GF operations. In the proposed optimizations, we first reformulate the matrix operations in syndrome calculation and Chien search for sharing more common sub-expressions between GF operations having different dimensions. The cell-based multi-m GF multiplier is newly introduced for the area-efficient flexible key-equation solver. As case studies, we design several prototype flexible BCH decoders for digital video broadcasting systems and NAND flash memory controllers managing different page sizes. The implementation results show that the proposed fully-flexible BCH decoder architecture remarkably enhances the area-efficiency compared with the conventional solutions.

Original languageEnglish
Pages (from-to)14498-14509
Number of pages12
JournalIEEE Access
Volume6
DOIs
Publication statusPublished - 2018 Mar 12

Keywords

  • Bose-Chaudhuri-Hocquenghem (BCH) decoder
  • Galois-field (GF) arithmetic
  • low complexity
  • optimization
  • VLSI design

ASJC Scopus subject areas

  • Computer Science(all)
  • Materials Science(all)
  • Engineering(all)

Fingerprint Dive into the research topics of 'Area-Optimized Fully-Flexible BCH Decoder for Multiple GF Dimensions'. Together they form a unique fingerprint.

  • Cite this