LDPC decoding 的文献

weed637

[1] R.G. Gallager; “Low-Density Parity-Check Codes”, M.I.T. Press, 1963.
[2] D.J.C.McKay; “Good Error-Correcting Codes based on Very Sparse Matrices,”
IEEE Trans Inform Theory, vol.45, Mar.1999, pp: 399-431.
[3] X.Y. Hu, E. Eleftheriou and D.M Arnold; “Progressive edge-growth Tanner graphs,” GLOBECOM '01. IEEE, Nov. 2001, 2, pp: 995-1001.
[4] J.Campello, D.S.Modhaand S.Rajagopalan; “Designing LDPC codes using bit-filling,” IEEE International Conference on Communications,11-14 June 2001,vol: 1, pp:55-59.
[5] J.Campello and D.S.Modha; “Extended bit-filling and LDPC code design,” IEEE Global Telecommunications Conference, Nov. 2001, pp: 25-29.
[6] Y.Kou, S.Lin, and M.Fossorier; “Low-Density Parity-Check Codes Based on Finite Geometries: A Rediscovery and New Results,” IEEE Trans Inform Theory, Vol.47, No.7, Nov. 2001, pp: 2711-2736.
[7] B. Vasic, K. Pedagani and M. Ivkovic; “High-Rate Girth-Eight Low-Density Parity-Check Codes on Rectangular Integer Lattices”,IEEE Transactions on Communications,Vol.52 ,No. 8 ,Aug. 2004, pp: 1248-1252.
[8] B. Ammar, B. Honary, Y. Kou, J. Xu and S. Lin; “Construction of Low-Density Parity-Check Codes Based on Balanced Incomplete Block Designs”, IEEE Transactions on Information Theory, Vol.50, No.6, June 2004, pp: 1257 -1268.
[9] LAN/MAN Standards Committee; “IEEE P802.16e-2005”, IEEE, 2005.
[10] 3gpp2; “3GPP2 C.S0084-001-0 v1.088,” 3GPP2, 2007.
[11] R. G. Gallagher, “Low-density parity-check codes,” IRE Trans. Inform. Theory, vol. IT-8, Jan. 1962, pp: 21-28.
[12] D.J.C. Mackay, “Good Error-Correcting Codes Based on Very Sparse Matrices”, IEEE Trans. Info. Theory, Vol. 45, Mar. 1999, pp: 399-431.
[13] J.H. Chen, A. Dholakia, E. Eleftheriou, M.P.C. Fossorier and X.Y. Hu, “Reduced-Complexity Decoding of LDPC Codes”, IEEE Trans. Comm., Vol.53, No. 8, Aug. 2005, pp:1288-1299.
[14] J. Erfanian, S. Pasupathy, and G. Gulak, “Reduced-complexity symbol detectors with parallel structures for ISI channels” , IEEE Trans. Comm., Vol. 42, No. 2-4, Feb.-Apr. 1994 ,pp: 1661–1671.
[15] M. P. C. Fossorier,M.Mihaljevic, and H. Imai, “Reduced complexity iterative decoding of low density parity check codes based on belief propagation”, IEEE Trans. Comm., Vol. 47, No. 5, May 1999, pp: 673–680.

[16] E. Eleftheriou, T. Mittelholzer, and A. Dholakia, “Reduced-complexity decoding algorithm for low-density parity-check codes”, IEE Electron.Lett., Vol. 37, Jan. 2001, pp: 102–104.

[17] J.G. Zhao, F. Zarkeshvari, and A.H. Banihashemi, “On Implementation of Min-Sum Algorithm and Its Modifications ofr Decoding Low-Density Parity-Check(LDPC) Codes ”, IEEE Trans. Comm. Vol. 53, No.4, Apr. 2005, pp: 549-554.
[18] T. J. Richardson and R. L. Urbanke, “The capacity of low-density parity-check codes under message-passing decoding,” IEEE Trans. Inf. Theory, Vol. 47, No. 2, Feb. 2001, pp: 599–618.

[19] J.T. Zhang, M. Fossorier, D.Q. Gu and J.Y. Zhang, “Improved min-sum decoding of LDPC codes using 2-dimensional normalization”, IEEE GLOBECOM Vol. 3, Nov.-2 Dec. 2005, pp: 6-11.
[20] J.N. Su, K. Liu and H. Min, “Hardware Efficient Decoding of LDPC Codes Using Partial-min Algorithms”, IEEE Trans. Consumer Electronics, Vol. 52, No. 4, Nov. 2006, pp: 1463-1468.
[21] M.M. Mansour and N.R. Shanbhag, “High-Throughput LDPC Decoders”, IEEE Trans. Very Large Scale Integration System, Vol. 11, No. 6, Dec. 2003, pp:976-996.
[22] D.E. Hocevar, “A Reduced Complexity Decoder Architecture via Layered Decoding of LDPC Codes”, IEEE workshop on Signal Processing Systems, Oct. 2004, pp: 107-112.
[23] V. Savin, “Iterative LDPC Decoding using Neighborhood Reliabilities”, http://arxiv.org/PS_cache/cs/pdf/0701/0701091v1.pdf.
[24] A.I.V. Casado, M. Griot and R.D. Wesel, “Informed Dynamic Scheduling foe Belief-Propagation Decoding of LDPC Codes”, http://arxiv.org/PS_cache/cs/pdf/0702/0702111v2.pdf

weed637

希望能给大家一些帮助了。

yousee

谢谢楼主，如果能把这些paper打个包上传就更好了

rewkie

挺不错的东西，正需要啊

baolin

thanks for shring!

zlhrsy

能否将paper共享出来

slysysu

谢谢~~

nico0811

謝謝您的分享