TY - JOUR
T1 - Area-Optimized Fully-Flexible BCH Decoder for Multiple GF Dimensions
AU - Park, Byeonggil
AU - Park, Jongsun
AU - Lee, Youngjoo
N1 - Funding Information:
This work was supported by the National Research Foundation of Korea through the Korean government (Ministry of Science and ICT) under Grant 2016R1C1B1007593 and Grant 2016R1A2B4015329.
PY - 2018/3/12
Y1 - 2018/3/12
N2 - 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.
AB - 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.
KW - Bose-Chaudhuri-Hocquenghem (BCH) decoder
KW - Galois-field (GF) arithmetic
KW - VLSI design
KW - low complexity
KW - optimization
UR - http://www.scopus.com/inward/record.url?scp=85043781719&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85043781719&partnerID=8YFLogxK
U2 - 10.1109/ACCESS.2018.2815640
DO - 10.1109/ACCESS.2018.2815640
M3 - Article
AN - SCOPUS:85043781719
VL - 6
SP - 14498
EP - 14509
JO - IEEE Access
JF - IEEE Access
SN - 2169-3536
ER -