참고문헌
- Robert G. Gallager, "Low-density parity-check codes," MIT Press, Cambridge, Mass., 1963.
- D. M. Arnold, E. Eleftheriou, and X. Y. Hu, "Progressive edge-growth Tanner graphs," in Proc. IEEE Global Telecommunications Conf., Vol. 2, San Antonio, TX, pp. 995-1001, 2001.
- T. Tian, C. Jones, J. D. Villasenor, and R. D. Wesel, "Selective avoidance of cycles in Irregular LDPC code Construction," IEEE Trans. Comm., Vol. 52, pp. 1242-1247, 2004. https://doi.org/10.1109/TCOMM.2004.833048
- Hua Xiao, Amir H. Banihashemi, "Improved Progressive-Edge-Growth(PEG) Construction of Irregular LDPC Codes," IEEE Communications Letters, Vol. 8, 2004.
- Sung-Hua Kim, Joon-Sung Kim, Dae-Son Kim, "LDPC code Construction with Low Error Floor Based on the IPEG Algorithm," IEEE, Communications Letters, Vol. 11, 2007.
- C. Di, D. Proietti, "Finite length analysis of low density parity check codes on the binary erasure channel," IEEE Trans. Inf. Theory, Vol. 48, No. 6, pp. 1570-1579, 2002. https://doi.org/10.1109/TIT.2002.1003839
- T. Tian, C. R. Jones, "Construction of irregular LDPC codes with low error floors," in Proc. IEEE Int. Conf. Comm, Vol. 5, pp. 3125-3129, 2003.
- T, Richardson, A. Shokrollahi, R. Urbanke, "Design of capacity approaching irregular low density parity check codes," IEEE Trans, Information Theory, Vol. 47, pp. 619-637, 2001. https://doi.org/10.1109/18.910578
- Hao Chen, H. Suh "An improved Bellman- Ford algorithm based on SPFA", The Journal of The Korea Institute of Electronic Communication Sciences, Vol. 7, No. 4, pp. 721-726, 2012.
- Yanji Liu, H. Suh " A Comparison of Raptor Code Using LDGM and LDPC code", The Journal of The Korea Institute of Electronic Communication Sciences, Vol. 8, No. 1, pp. 65-70, 2013. https://doi.org/10.13067/JKIECS.2013.8.1.065
- Binbin Hu, H. Suh, "Node monitoring algorithm with piecewise linear function approximation for efficient LDPC decoding", The Journal of The Korea Institute of Electronic Communication Sciences, Vol. 6, No. 1, pp. 20-26, 2011.