LDPC Codes for Rank Modulation in Flash Memories Conference Paper uri icon

abstract

  • 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.

name of conference

  • 2010 IEEE International Symposium on Information Theory

published proceedings

  • 2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY

author list (cited authors)

  • Zhang, F., Pfister, H. D., & Jiang, A. A.

citation count

  • 17

complete list of authors

  • Zhang, Fan||Pfister, Henry D||Jiang, Anxiao Andrew

publication date

  • June 2010