Optimization of multi-channel BCH error decoding for common cases

Citations

SCOPUS

4

초록

This paper proposes a new method to optimize a BCH error correction decoder in multi-channel configurations. We break the BCH decoding process into its three basic blocks: syndrome calculation, the error locator polynomial generation, and the roots of the error locator polynomial computation. While an existing multi-channel BCH decoder consists of several single-channel BCH decoders operating in parallel, this paper utilizes a pooled group of shared decoding blocks. By considering the frequency of errors, the proposed pooled group approach requires fewer hardware blocks than in a traditional multi-channel configuration with a negligible impact on performance. Combined with a specialized root finding unit for blocks with only 1 error, our scheme reduces hardware area by 47%-71% and dynamic power by 44%-59% with 2% performance degradation in typical NAND flash systems. With a constant hardware area, the proposed scheme can improve throughput by 3x-5x or NAND flash lifetime by 1.4x-4.5x.

키워드

ClocksError correction codesForcePolynomialsThroughputClocksDecodingEmbedded systemsError correctionErrorsHardwareMemory architecturePolynomialsProgram compilersReconfigurable hardwareThroughputDecoding processError correction codesError correction decoderError locator polynomialForceFrequency of errorPerformance degradationSingle channelsChannel coding
제목
Optimization of multi-channel BCH error decoding for common cases
저자
Dill, RussShrivastava, AviralOh, Hyunok
DOI
10.1109/CASES.2015.7324546
발행일
2015-10
유형
Conference Paper
저널명
2015 International Conference on Compilers, Architecture and Synthesis for Embedded Systems, CASES 2015
페이지
59 ~ 68