Dispersed Array LDPC Codes and Decoder Architecture for NAND Flash Memory

被引:17
作者
Shao, Wei [1 ]
Sha, Jin [1 ]
Zhang, Chuan [2 ]
机构
[1] Nanjing Univ, Elect Sci & Engn Sch, Nanjing 210046, Jiangsu, Peoples R China
[2] Southeast Univ, Natl Mobile Commun Res Lab, Nanjing 210096, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
DA-LDPC codes; NAND flash memory; column-based shuffle decoding; ASIC; LOW-COMPLEXITY;
D O I
10.1109/TCSII.2017.2783438
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Quasi-cyclic (QC) low-density parity-check (LDPC) codes have become popular in NAND flash memories, owing to their excellent error correction performance and hardware-friendly structures. However, the large scale of barrel shifters result in prohibitive routing complexity. Array LDPC code is a kind of highly structured QC-LDPC code, which provides a good balance of performance, complexity, and throughput. In this brief, a construction method of dispersed array LDPC (DA-LDPC) codes based on an array square is proposed. DA-LDPC codes not only benefit from the array property but also a hybrid and efficient storage architecture due to their stair-like structure. For NAND flash applications, the code construction and decoder architecture of a (18300, 16470) DA-LDPC code is illustrated in this brief, where a two-level decision of LDPC decoding strategy is employed. The numerical results based on an FPGA emulation platform have shown that the error floor of the (18300, 16470) DA-LDPC code is under 10(-)(11) in term of bit error rate (BER). Thanks to the well-structured DA-LDPC codes, we can conveniently apply a column-based shuffle decoding (CBSD) algorithm for ease of implementation. The corresponding ASIC implementation results have proved that the decoder architecture of DA-LDPC codes can achieve higher normalized-throughput-gate-count-ratio (NTGR) compared to state-of-art works.
引用
收藏
页码:1014 / 1018
页数:5
相关论文
共 18 条
[1]  
[Anonymous], 2009, Channel Codes: Classical and Modern
[2]   Finite Alphabet Iterative Decoders for LDPC Codes: Optimization, Architecture and Analysis [J].
Cai, Fang ;
Zhang, Xinmiao ;
Declercq, David ;
Planjery, Shiva Kumar ;
Vasic, Bane .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2014, 61 (05) :1366-1375
[3]   Using Data Postcompensation and Predistortion to Tolerate Cell-to-Cell Interference in MLC NAND Flash Memory [J].
Dong, Guiqiang ;
Li, Shu ;
Zhang, Tong .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2010, 57 (10) :2718-2728
[4]  
Eleftheriou E, 2002, 2002 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5, CONFERENCE PROCEEDINGS, P1752, DOI 10.1109/ICC.2002.997149
[5]   Reduced complexity iterative decoding of low-density parity check codes based on belief propagation [J].
Fossorier, MPC ;
Mihaljevic, M ;
Imai, H .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1999, 47 (05) :673-680
[6]   LOW-DENSITY PARITY-CHECK CODES [J].
GALLAGER, RG .
IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (01) :21-&
[7]   A 520k (18900,17010) Array Dispersion LDPC Decoder Architectures for NAND Flash Memory [J].
Ho, Kin-Chu ;
Chen, Chih-Lung ;
Chang, Hsie-Chia .
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2016, 24 (04) :1293-1304
[8]  
Kim K, 2005, 2005 IEEE Intelligent Transportation Systems Conference (ITSC), P332
[9]   Optimization Techniques for the Efficient Implementation of High-Rate Layered QC-LDPC Decoders [J].
Lee, Huang-Chang ;
Li, Mao-Ruei ;
Hu, Jyun-Kai ;
Chou, Po-Chiao ;
Ueng, Yeong-Luh .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2017, 64 (02) :457-470
[10]   Realizing Unequal Error Correction for NAND Flash Memory at Minimal Read Latency Overhead [J].
Li, Jiangpeng ;
Zhao, Kai ;
Ma, Jun ;
Zhang, Tong .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2014, 61 (05) :354-358