LDPC Decoding Mappings That Maximize Mutual Information
- 26 August 2016
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 34 (9) , 2391-2401
Abstract
For low-density parity-check (LDPC) codes widely used in NAND flash memories, the bit-error rate performance is closely tied to the number of bits per message used by the message-passing decoder. This paper describes a technique to generate message-passing decoding mapping functions for LDPC codes using 3 and 4 bits per message. These maps are not derived from belief-propagation decoding or one of its approximations, instead, the maps are based on a channel quantizer that maximizes mutual information. More precisely, the construction technique is a systematic method, which uses an optimal quantizer at each step of density evolution to generate message-passing decoding mappings. Numerical results show, for high-rate codes suitable for flash memories, that 4 bits per message and a few iterations (10-20 iterations) are sufficient to approach full belief-propagation decoding, less than 5-7 bits per message typically needed. The construction technique is flexible, since it can generate maps for arbitrary number of bits per message, and can be applied to arbitrary memoryless channels.Keywords
Funding Information
- JSPS KAKENHI (26289119)
This publication has 21 references indexed in Scilit:
- Channel Codes2009
- Future memory technology: challenges and opportunities2008 International Symposium on Vlsi Technology, Systems and Applications (VLSI-TSA), 2008
- Density Evolution for Asymmetric Memoryless ChannelsIEEE Transactions on Information Theory, 2005
- An improvement on the modified weighted bit flipping decoding algorithm for LDPC codesIEEE Communications Letters, 2005
- Reduced-Complexity Decoding of LDPC CodesIEEE Transactions on Communications, 2005
- On Implementation of Min-Sum Algorithm and Its Modifications for Decoding Low-Density Parity-Check (LDPC) CodesIEEE Transactions on Communications, 2005
- The capacity of low-density parity-check codes under message-passing decodingIEEE Transactions on Information Theory, 2001
- Reduced complexity iterative decoding of low-density parity check codes based on belief propagationIEEE Transactions on Communications, 1999
- Minimum Impurity PartitionsThe Annals of Statistics, 1992
- Optimal partitioning for classification and regression treesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1991