Advanced Search
Volume 29 Issue 2
Jan.  2011
Turn off MathJax
Article Contents
Lü Shu-juan, Wei Guo, Zhu Jin-kang. Searching the Optimal Puncture Matrix for Rate Compatible Punctured Turbo (RCPT) Codes with Density Evolution[J]. Journal of Electronics & Information Technology, 2007, 29(2): 269-273. doi: 10.3724/SP.J.1146.2005.00509
Citation: Lü Shu-juan, Wei Guo, Zhu Jin-kang. Searching the Optimal Puncture Matrix for Rate Compatible Punctured Turbo (RCPT) Codes with Density Evolution[J]. Journal of Electronics & Information Technology, 2007, 29(2): 269-273. doi: 10.3724/SP.J.1146.2005.00509

Searching the Optimal Puncture Matrix for Rate Compatible Punctured Turbo (RCPT) Codes with Density Evolution

doi: 10.3724/SP.J.1146.2005.00509
  • Received Date: 2005-05-08
  • Rev Recd Date: 2005-09-16
  • Publish Date: 2007-02-19
  • A new algorithm for searching the optimal puncture matrices of the rate compatible punctured Turbo(RCPT) codes is proposed. The algorithm is based on density evolution and its main goal is to analyze the thresholds for different puncture matrices. The thresholds are calculated using Gaussian approximation and simulation. Compared to a conventional distance spectrum approach, this new approach has two advantages. The first advantage is that the new algorithm is independent of the interleaver. The second is that when the Turbo code is very long, the complexity of the calculation will not increase too much for the proposed approach. In AWGN channels, when the code is long, the examples shows that the optimal puncture matrices are the same for both approaches while the proposed approach has reduced computational complexity. This paper also analyzes the puncture matrices of the code used in 3GPP and provides the optimal matrices and thresholds. The result shows that the rate matching algorithm given in 3GPP corresponds to some RCPT matrixes when using puncturing and these matrixes are the same as those optimal matrices given in this paper for certain rates.
  • loading
  • [1] Hagenauer J. Rate compatible punctured convolutional codes (RCPC codes) and their applications[J].IEEE Trans. on Commun.1988, 36(4):389-400 [2] Barbulescu A S and Pietrobon S S. Rate compatible turbo codes[J].Electron. Lett.1995, 31(3):535-536 [3] Narayanan K R and Stber G L. A novel ARQ technique using the turbo coding principle[J].IEEE Commun. on Lett.1997, 1(3):49-51 [4] Rowitch D N and Milstein L B. On the performance of hybrid FEC/ARQ systems using rate compatible punctured turbo (RCPT) codes[J].IEEE Trans. on Commun.2000, 48(6):948- [5] Richardson T and Urbanke R. The capacity of low density parity check codes under message passing decoding[J].IEEE Trans. on Inform. Theory.2001, 47(2):599-618 [6] Gamal H E and Hammons Jr A R. Analyzing the Turbo decoder using the Gaussian approximation[J].IEEE Trans.on Inform. Theory.2001, 47(2):671-686 [7] Divsalar D, Dolinar S, and F. Pollara. Iterative turbo decoder analysis based on density evolution. IEEE J. Select. Areas Commun., 2001, 19(5): 891-907. [8] Brink S ten. Convergence behavior of iteratively decoded parallel conatenated codes[J].IEEE Trans. on Commun.2001, 49(10):1727-1737 [9] Laddomada M and Scanavino B. Design of punctured serially concatenated convolutional codes[J].IEEE Commun. Lett.2005, 9(2):169-171 [10] Wiberg N. Codes and decoding on general graphs. Linkping Studies in Sci. and Technol., Linkping, Sweden, Ph.D. dissertation 440, 1996. [11] 3GPP TS 25.212 v5.9.0. Multiplexing and channel coding (FDD). Jun. 2004.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (3338) PDF downloads(1092) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return