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

Citations

WEB OF SCIENCE

7
Citations

SCOPUS

11

초록

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.

키워드

Bose-Chaudhuri-Hocquenghem (BCH) decoder; Galois-field (GF) arithmetic; optimization; low complexity; VLSI design; HIGH-THROUGHPUT; ALGORITHMS; DESIGN; MEMORY; CODES; ECC
제목
Area-Optimized Fully-Flexible BCH Decoder for Multiple GF Dimensions
저자
Park, Byeonggil; Park, Jongsun; Lee, Youngjoo
DOI
10.1109/ACCESS.2018.2815640
발행일
2018
유형
Article
저널명
IEEE Access
권
6
페이지
14498 ~ 14509