LDPC codes for rank modulation in flash memories

Conference Paper

An LDPC code is proposed for flash memories based on rank modulation. In contrast to previous approaches, this enables the use of long ECCs with fixed-length modulation codes. For ECC design, the rank modulation scheme is treated as part of an equivalent channel. A probabilistic model of the equivalent channel is derived and a simple high-SNR approximation is given. LDPC codes over integer rings and finite fields are designed for the approximate channel and a low-complexity symbol-flipping verification-based (SFVB) message-passing decoding algorithm is proposed to take advantage of the channel structure. Density evolution (DE) is used to calculate decoding thresholds and simulations are used to compare the low-complexity decoder with sum-product decoding. © 2010 IEEE.

Full Text

Duke Authors

Cited Authors

  • Zhang, F; Pfister, HD; Jiang, A

Published Date

  • August 23, 2010

Published In

  • IEEE International Symposium on Information Theory - Proceedings

Start / End Page

  • 859 - 863

International Standard Book Number 13 (ISBN-13)

  • 9781424469604

Digital Object Identifier (DOI)

  • 10.1109/ISIT.2010.5513603

Citation Source

  • Scopus