Volume 39 Issue 2
May  2017
Article Contents
Article Navigation >  Journal of University of Electronic Science and Technology of China  > 2010  >  39(2): 214-218

HUANG Ying, LEI Jing. Performance Analysis of Multidimensional Parity Check Product Codes[J]. Journal of University of Electronic Science and Technology of China, 2010, 39(2): 214-218. doi: 10.3969/j.issn.1001-0548.2010.02.013
Citation: HUANG Ying, LEI Jing. Performance Analysis of Multidimensional Parity Check Product Codes[J]. Journal of University of Electronic Science and Technology of China, 2010, 39(2): 214-218. doi: 10.3969/j.issn.1001-0548.2010.02.013
shu

Performance Analysis of Multidimensional Parity Check Product Codes

doi: 10.3969/j.issn.1001-0548.2010.02.013
  • 1.

    Institute of Electronic Science and Engineering,National University of Defense Technology Changsha 410073

  • Received Date: 2008-08-29
  • Rev Recd Date: 2009-03-28
  • Publish Date: 2010-04-15
  • Different from Turbo codes, product codes have no error floor problem and have better performance at high rate. In the recent year, product codes are widely used. Parity check product codes, which have the simpler decoding algorithm, can adapt to different required data length. Its performance formula is proposed after analyzing the code multiplicity and information multiplicity. Computer simulations show that the performance of the formula is the same as that of maximum likelihood(ML) decoding algorithm and iterative decoding algorithm. Performance analysis, which is based on different parameters such as code rate, dimension, and code length, shows that multidimensional parity check product codes have close performance at same code rate and dimension, and the codes with higher dimension can get better performance at same code rate.
  • 加载中
通讯作者: 陈斌, bchen63@163.com
  • 1. 

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

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

Article Metrics

Article views(3640) PDF downloads(31) Cited by()

Related
Proportional views

Performance Analysis of Multidimensional Parity Check Product Codes

doi: 10.3969/j.issn.1001-0548.2010.02.013
  • 1. Institute of Electronic Science and Engineering,National University of Defense Technology Changsha 410073
  • Received Date: 2008-08-29
  • Rev Recd Date: 2009-03-28
  • Publish Date: 2010-04-15

Abstract: Different from Turbo codes, product codes have no error floor problem and have better performance at high rate. In the recent year, product codes are widely used. Parity check product codes, which have the simpler decoding algorithm, can adapt to different required data length. Its performance formula is proposed after analyzing the code multiplicity and information multiplicity. Computer simulations show that the performance of the formula is the same as that of maximum likelihood(ML) decoding algorithm and iterative decoding algorithm. Performance analysis, which is based on different parameters such as code rate, dimension, and code length, shows that multidimensional parity check product codes have close performance at same code rate and dimension, and the codes with higher dimension can get better performance at same code rate.

HUANG Ying, LEI Jing. Performance Analysis of Multidimensional Parity Check Product Codes[J]. Journal of University of Electronic Science and Technology of China, 2010, 39(2): 214-218. doi: 10.3969/j.issn.1001-0548.2010.02.013
Citation: HUANG Ying, LEI Jing. Performance Analysis of Multidimensional Parity Check Product Codes[J]. Journal of University of Electronic Science and Technology of China, 2010, 39(2): 214-218. doi: 10.3969/j.issn.1001-0548.2010.02.013
shu

    HTML

Catalog

    Journal Online

    Author's Notes

    Links

    Copyright © 《电子科技大学学报》编辑部

    Address: Room 350, central building, University of Electronic Science and Technology, No.4, Section 2, Jianshe North Road, Chengdu Tel: 028-83202308,83207559 Email: xuebao@uestc.edu.cn

    本系统由 北京仁和汇智信息技术有限公司 开发 

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return