|
[1] W. Jiadong, T. Courtade, H. Shankar, and R. D. Wesel, Soft informa-tion for LDPC decoding in ash: Mutual-information optimized quanti-zation," in Proc. IEEE Globecom, 2011, pp. 1-6. [2] K. Zhao, W. Zhao, H. Sun, T. Zhang, X. Zhang, and N. Zheng, LDPC-in-SSD: Making advanced error correction codes work eectively in solidstate drives, in Proc. USENIX Conf. File Storage Technologies (FAST),2013. [3] T. Richardson and R Urbanke, The capacity of LDPC codes undermessage-passing decoding, IEEE Trans. on Information Theory, vol.47, no. 2, pp. 599-618, Feb. 2001. [4] S. ten Brink, Convergence behavior of iteratively decoded parallel con-catenated codes, IEEE Trans. on Commun., vol. 49, no. 10, pp. 1727-1737, Oct. 2001. [5] L. Dolecek, Z. Zhang, M. Wainwright, V. Anantharam, and B. Nikolic,Evaluation of the low frame error rate performance of LDPC codes using importance sampling,In Proc.IEEE Info. TheoryWorkshop, Sept. 2007.44 [6] D. J. C. MacKay and R. M. Neal,Near Shannon limit performance of low density parity check codes,Electron. Lett., vol. 32, no. 18, pp.16451646, 1996. [7] R. M. Tanner,A recursive approach to low-complexity codes, IEEETrans. Inf. Theory,vol. IT-27, no. 5, pp. 533-547, Sep. 1981. [8] J. Pearl,Probabilistic reasoning in intelligent systems: networks of plausi-ble inference. Morgan Kaufmann, 1988. [9] M. P. C. Fossorier, M. Mihaljevic, and H. Imai, Reduced complexity iterative." [10] M. M. Mansour and N. R. Shanbhag, Turbo decoder architecturesnfor low-density parity check codes,in IEEE Global Telecommunications Conference, 2002, vol. 2, pp.1383-1388. [11] Jieng-Heng Shy,LDPC Coded Modulation and Its Applications to MLC Flash Memory", NTHU Master Thesis. [12] William E. Ryan and Shu Lin, Channel Codes, pp.184-185. [13] Jyun-Kai Hu, A Reduced-Complexity Layered Decoder Architecture for High-Rate QC-LDPC codes", NTHU Master Thesis. |