A Novel Bit-Flipping LDPC Decoder for Solid-State Data Storage

Article Preview

Abstract:

This paper concerns the design of high-speed and low-cost LDPC code bit-flipping decoder. Due to its inferior error correction strength, bit-flipping decoding received very little attention compared with message-passing decoding. Nevertheless, emerging flash-based solid-state data storage systems inherently favor a hybrid bit-flipping/message-passing decoding strategy, due to the significant dynamics and variation of NAND flash memory raw storage reliability. Therefore, for the first time highly efficient silicon implementation of bit-flipping decoder becomes a practically relevant topic. To address the drawbacks caused by the global search operation in conventional bit-flipping decoding, this paper presents a novel bit-flipping decoder design. Decoding simulations and ASIC design show that the proposed design solution can achieve upto 80% higher decoding throughput and meanwhile consume upto 50% less silicon cost, while maintaining almost the same decoding error correction strength.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2094-2098

Citation:

Online since:

February 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] R. Motwani and C. Ong, Robust decoder architecture for multilevel flash memory storage channels, in International Conference on Computing, Networking and Communications (ICNC), p.492–496, Feb. (2012).

DOI: 10.1109/iccnc.2012.6167471

Google Scholar

[2] R. Bez, E. Camerlenghi, A. Modelli, and A. Visconti, Introduction to Flash memory, Proceedings of the IEEE, vol. 91, p.489–502, April (2003).

DOI: 10.1109/jproc.2003.811702

Google Scholar

[3] K. Zhao, W. Zhao, H. Sun, T. Zhang, X. Zhang, and N. Zheng, LDPCin- SSD: Making advanced error correction codes work effectively in solid state drives, in USENIX Conference on File and Storage Technologies (FAST), (2013).

Google Scholar

[4] Y. Kou, S. Lin, and M. P. C. Fossorier, Low-density parity-check codes based on finite geometries: a rediscovery and new results, IEEE Transactions on Information Theory, vol. 47, p.2711–2736, Nov. (2001).

DOI: 10.1109/18.959255

Google Scholar

[5] D. J. C. MacKay, Good error-correcting codes based on very sparse matrices, IEEE Transactions on Information Theory, vol. 45, p.399– 431, Mar. (1999).

DOI: 10.1109/18.748992

Google Scholar

[6] M. M. Mansour and N. R. Shanbhag, Memory-efficient turbo decoder architectures for LDPC codes, in Proc. IEEE Workshop on Signal Processing Systems, Oct., 2002, p.159–164.

DOI: 10.1109/sips.2002.1049702

Google Scholar

[7] D.E. Hocevar, A reduced complexity decoder architecture via layered decoding of LDPC codes, IEEE Workshop on Signal Processing Systems (SIPS), p.107–112, March (2004).

DOI: 10.1109/sips.2004.1363033

Google Scholar

[8] H. Zhong and T. Zhang, Block-LDPC: A practical LDPC coding system design approach, IEEE Transactions on Circuits and Systems I, vol. 52, p.766–775, April (2005).

DOI: 10.1109/tcsi.2005.844113

Google Scholar

[9] M.M. Mansour and N.R. Shanbhag, A 640-Mb/s 2048-bit programmable LDPC decoder chip, IEEE Journal of Solid-State Circuits, vol. 41, p.684–698, March (2006).

DOI: 10.1109/jssc.2005.864133

Google Scholar