Performance analysis of different puncturing schemes for rate compatible block-type LDPC

  • Authors:

  • Zheng Meng;Fei Zesong;Kuang Jingming;Chen Xiang;Sun Wei

  • Affiliations:

  • RCDCT, Modern Communication Lab, Dept. of E.E., Beijing Institute of Technology, Beijing, P. R. China;RCDCT, Modern Communication Lab, Dept. of E.E., Beijing Institute of Technology, Beijing, P. R. China;RCDCT, Modern Communication Lab, Dept. of E.E., Beijing Institute of Technology, Beijing, P. R. China;RCDCT, Modern Communication Lab, Dept. of E.E., Beijing Institute of Technology, Beijing, P. R. China;RCDCT, Modern Communication Lab, Dept. of E.E., Beijing Institute of Technology, Beijing, P. R. China

  • Venue:
  • WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The LDPC can provide multiple rates without employing more parity check matrices through the using of Rate Compatible strategy, in which the idea of puncturing is used to get codes at higher rates. This paper mainly focused on Block-type LDPC, for which three different puncturing algorithms are shown. One is the original scheme of puncturing based on the recovery step. Another one is proposed by directly using the former on Base check matrix. Besides, the idea of puncturing distribution on systematical B-LDPC also performs well. These puncturing schemes are analyzed and compared in the text, and based on the result, new puncturing schemes for B-LDPC in IEEE 802. 16e standard are proposed.