Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

Rate-Compatible LDPC Codes Based on the PEG Algorithm for Relay Communication Systems

  • Zhou, Yangzhao (School of Information Science and Technology, Donghua University) ;
  • Jiang, Xueqin (School of Information Science and Technology, Donghua University) ;
  • Lee, Moon Ho (Division of Electronics and Information Engineering, Chonbuk National University)
  • Received : 2015.12.15
  • Published : 2015.08.31
⟨ Previous Next ⟩

Abstract

It is known that the progressive edge-growth (PEG) algorithm can be used to construct low-density parity-check (LDPC) codes at finite code lengths with large girths through the establishment of edges between variable and check nodes in an edge-by-edge manner. In [1], the authors derived a class of LDPC codes for relay communication systems by extending the full-diversity root-LDPC code. However, the submatrices of the parity-check matrix H corresponding to this code were constructed separately; thus, the girth of H was not optimized. To solve this problem, this paper proposes a modified PEG algorithm for use in the design of large girth and full-diversity LDPC codes. Simulation results indicated that the LDPC codes constructed using the modified PEG algorithm exhibited a more favorable frame error rate performance than did codes proposed in [1] over block-fading channels.

Keywords

Acknowledgement

Supported by : National Nature Science Foundation of China

References

  1. D. Duyck, M. Moeneclaey, J. J. Boutros, "Low-density graph codes for coded cooperation on slow fading relay channels," IEEE Trans. Inf. Theory, vol. 57, no. 7, pp. 4202-4218, July 2011. https://doi.org/10.1109/TIT.2011.2145470
  2. T. Cover and A. E. Gamal, "Capacity theorems for the relay channel," IEEE Trans. Inf. Theory, vol. 25, no. 5, pp. 572-584, Sept. 1979. https://doi.org/10.1109/TIT.1979.1056084
  3. J. N. Laneman, D. Tse, and G. W. Wornell, "Cooperative diversity in wireless networks: Efficient protocols and outage behavior," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3062-3080, Dec. 2004. https://doi.org/10.1109/TIT.2004.838089
  4. A. Nosratinia, T. E. Hunter, and A. Hedayat, "Cooperative communication in wireless networks," IEEE Commun. Mag., vol. 42, no. 10, pp. 74-80, Oct. 2004. https://doi.org/10.1109/MCOM.2004.1341264
  5. A. Sendonaris, E. Erkip, and B. Aazhang, "User cooperation diversity- Part I: System description," IEEE Trans. Commun., vol. 51, no. 11, pp. 1927-1938, Nov. 2003. https://doi.org/10.1109/TCOMM.2003.818096
  6. A. Sendonaris, E. Erkip, and B. Aazhang, "User cooperation diversity- Part II: Implementation aspects and performance analysis," IEEE Trans. Commun., vol. 51, no. 11, pp. 1939-1948, Nov. 2003. https://doi.org/10.1109/TCOMM.2003.819238
  7. T. E. Hunter, Coded cooperation: A new framework for user cooperation in wireless systems, Ph.D. thesis, University of Texas at Dallas, 2004.
  8. A.Sendonaris, E. Erkip, and B. Aazhang, "User cooperation diversity. Part I. System description. Part II.Implementation aspects and performance analysis," IEEE Trans. Commun., vol.51, no.11, pp.1927-1948, Nov. 2003. https://doi.org/10.1109/TCOMM.2003.818096
  9. J. N. Laneman, D. Tse, and G. W. Wornell, "Cooperative diversity in wireless networks: Efficient protocols and outage behavior," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3062-3080, Dec. 2004. https://doi.org/10.1109/TIT.2004.838089
  10. J. Boutros et al., "Design and analysis of low-density parity-check codes for block-fading channels," in Proc.IEEE ITA, Oct. 2007, pp. 54-62.
  11. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, no. 6, pp. 533-547, Sep. 1981.
  12. X. Tao et al., "Recursive design of high girth (2,k) LDPC codes from (k,k) LDPC codes," IEEE Commun. Lett., vol. 15, no. 1, Jan. 2011.
  13. R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inf. Theory, no. 8, pp. 21-28, Jan. 1962. https://doi.org/10.1109/TIT.1962.1057683
  14. X.-Y. Hu, E. Eleftheriou, and D. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 386-398, Jan.2005. https://doi.org/10.1109/TIT.2004.839541
  15. T. J. Richardson, M. A.Shokrollahi, and R. L.Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001. https://doi.org/10.1109/18.910578
  16. T. Richardson and R.Urbanke, "The capacity of low density parity check codes under message passing decoding," IEEE Trans. Inf. Theory, vol. 47, pp. 599-618, Feb. 2001. https://doi.org/10.1109/18.910577