A MPCN-Based Parallel Architecture in BCH Decoders for NAND Flash Memory Devices

檔案

日期

2011-10-01

類型

期刊名稱

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS

卷期與頁次

第 58 卷第 10 期,頁 682–686

ISSN

1549-7747

語言

英文

摘要

According to large-page-size and random-bit-error characteristics, long-block-length Bose-Chaudhuri-Hochquenghem (BCH) decoders are applied to realize error correction in NAND Flash memory devices. To accelerate the decoding process in an area-efficient architecture, a parallel architecture with minimal polynomial combinational network (MPCN) for long BCH decoders is presented in this brief. The proposed design utilizes MPCNs to replace constant finite-field multipliers, which dominate the hardware complexity of the high-parallel Chien search architecture. Furthermore, both the syndrome calculator and the Chien search can be merged by exploiting our MPCN-based architecture, leading to significant hardware complexity reduction. From the synthesis results in the 90-nm CMOS technology, the MPCN-based joint syndrome calculation and Chien search has 46.7% gate count saving for parallel-32 BCH (4603, 4096; 39) decoder in contrast with the straightforward design.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Lin, Y.-M., Yang, C.-H., Hsu, C.-H., Chang, H.-C., & Lee, C.-Y. (2011). A MPCN-Based Parallel Architecture in BCH Decoders for NAND Flash Memory Devices. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 58(10), 682–686. https://doi.org/10.1109/TCSII.2011.2161704

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/14782