Small-area parallel syndrome calculation for strong BCH decoding

This paper presents a new optimization method to reduce the hardware complexity of syndrome calculation in strong BCH decoding. All the operations required in the parallel syndrome calculation are reformulated as a single matrix computation to enlarge the search area for common sub-expressions. The computational complexity of syndrome calculation is significantly reduced by finding and sharing common terms in the single matrix computation. Implementation results show that the proposed architecture saves 55% of area overheads compared to the conventional structure.

[1]  In-Cheol Park,et al.  Low-Complexity Parallel Chien Search Structure Using Two-Dimensional Optimization , 2011, IEEE Transactions on Circuits and Systems II: Express Briefs.

[2]  Wonyong Sung,et al.  Strength-Reduced Parallel Chien Search Architecture for Strong BCH Codes , 2008, IEEE Transactions on Circuits and Systems II: Express Briefs.

[3]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

[4]  In-Cheol Park,et al.  Area-efficient syndrome calculation for strong BCH decoding , 2011 .

[5]  Miodrag Potkonjak,et al.  Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Wei Liu,et al.  Low-Power High-Throughput BCH Error Correction VLSI Design for Multi-Level Cell NAND Flash Memories , 2006, 2006 IEEE Workshop on Signal Processing Systems Design and Implementation.

[7]  Keshab K. Parhi,et al.  Small area parallel Chien search architectures for long BCH codes , 2004, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[8]  Dong Wu,et al.  A High-Speed Two-Cell BCH Decoder for Error Correcting in MLC nor Flash Memories , 2009, IEEE Transactions on Circuits and Systems II: Express Briefs.

[9]  M. Darnell,et al.  Error Control Coding: Fundamentals and Applications , 1985 .