迭代译码的级联Reed-Solomon乘积码与卷积码

孙小钧; 刘晓健; 赵春明

doi:10.3724/SP.J.1146.2008.01572

迭代译码的级联Reed-Solomon乘积码与卷积码

doi: 10.3724/SP.J.1146.2008.01572

基金项目:

东南大学移动通信国家重点实验室自主研究项目(2008A10)，国家自然科学基金(60802007)，国家863计划项目(2009AA01Z235)和国家973计划项目(2007CB310603)资助课题

计量
- 文章访问数: 3681
- HTML全文浏览量: 88
- PDF下载量: 1344
- 被引次数: 0
出版历程
- 收稿日期: 2008-11-27
- 修回日期: 2009-09-04
- 刊出日期: 2009-12-19

Concatenated Reed-Solomon Product Code/Convolutional Code with Iterative Decoding

摘要

摘要: 该文提出用Reed Solomon(RS)乘积码作为外码，卷积码作为内码的级联码方案并且内外码间用Congruential向量生成的交织图案对RS码符号进行重排列。对此级联码采用的迭代译码基于成员码的软译码算法。当迭代次数达到最大后，通过计算RS码的校正子，提出一种纠正残余错误的方法，进一步提高了系统的误比特性能。仿真结果表明，在AWGN信道中与迭代译码的级联RS/卷积码相比，当误比特率为1e-5时，新系统的编码增益大约有0.4 dB。
- 迭代译码; 乘积码; Reed-Solomon (RS); 卷积码
Abstract: A concatenated coding scheme is proposed in this paper, which uses Reed-Solomon (RS) product code for outer code and convolutional code for inner code. The interleaving pattern, which is generated according to congruential sequence, is used to rearrange the symbols of RS product code .The iterative decoding of the concatenated coding scheme is based on the soft decoding of the component codes. When a given maximun number of iteration has been performed, a method is proposed to correct residual errors by computing the syndromes of RS codes. The simulation results show that coding gains up to 0.4 dB for a BER (Bit Error Rate) is of 1e-5 on the Gaussian channel comparison with concatenation RS/CC codes.

HTML全文

参考文献(1)

Nguyen M V, Ko K, and Lee W, et al.. A new scheme topredict erasures for Reed-Solomon decoder in T-DMBreceiver[J].IEEE Transactions on Broadcasting.2007, 53(2):530-538[2]Xu Chang-long. Soft decoding algorithm for RS-CCconcatenated codes in WiMAX system. IEEE VTC2007-spring. Proceedings. Vehicular Technology Conference,Dublin, Ireland, 22-25 April 2007: 740-742.[3]Aitsab O and Pyndiah R. Performance of concatenatedReed-Solomon convolutional codes with iterative decoding.IEEE GLOBECOM 97. Proceedings. GlobalTelecommunications conference, Phoenix, USA, 3-8 Nov.1997: 934-938.[4]Pyndiah R, Glavieux A, Picart A, and Jacq S. Near optimumdecoding of product codes. IEEE. GLOBECOM 94.Proceedings. Global Telecommunications conference, SanFrancisco, USA, 28 Nov.-2 Dec.1994: 339-343.[5]Aitsab O and Pyndiah R. Performance of reed-solomon blockturbo code. IEEE GLOBECOM 96. Proceedings. GlobalTelecommunications conference, London, UK, 18-22 Nov.1996: 121-125.[6]Rong Zhou, Le Bidan R, Pyndiah R, and Goalic A.Low-complexity high-rate Reed-Solomon block turbo codes[J].IEEE Transactions on Communications.2007, 55(9):1656-1660[7]Le Bidan R, Pyndiah R, and Adde P. Some results on thebinary minimum distance of Reed-Solomon codes and blockturbo codes. IEEE. ICC2007. Proceedings. communicationsconference, Glasgow, Scotland, 24-28 June 2007: 990-994.[8]Hirst S A, Honary B, and Markarian G. Fast chase algorithmwith an application in turbo decoding[J].IEEE Transactions onCommunications.2001, 49(10):1693-1699[9]Chi Zhipei, Song Leilei, and Parhi K K. On the performance/complexity tradeoff in block turbo decoder design[J].IEEETransactions on Communications.2004, 52(2):173-175[10]Clark G C Jr and Cain J B. Error-Correction Coding forDigital Communications. New York: Plenum, 1981.[11]Pyndiah R. Near-optimum decoding of product codes: blockturbo codes[J].IEEE Transactions on Communications.1998,46(8):1003-1010

施引文献

资源附件(0)

访问统计