高级搜索

留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
邮箱
手机号码
标题
留言内容
验证码

累加交叉并行级联单奇偶校验码的低复杂度译码算法

郭凯 陈彦辉 李建东

郭凯, 陈彦辉, 李建东. 累加交叉并行级联单奇偶校验码的低复杂度译码算法[J]. 电子与信息学报, 2009, 31(9): 2143-2147. doi: 10.3724/SP.J.1146.2008.00778
引用本文: 郭凯, 陈彦辉, 李建东. 累加交叉并行级联单奇偶校验码的低复杂度译码算法[J]. 电子与信息学报, 2009, 31(9): 2143-2147. doi: 10.3724/SP.J.1146.2008.00778
Guo Kai, Chen Yan-hui, Li Jian-dong. A Low Complexity Decoding Algorithm for Accumulated-Crossover Parallel-concatenated SPC Codes[J]. Journal of Electronics & Information Technology, 2009, 31(9): 2143-2147. doi: 10.3724/SP.J.1146.2008.00778
Citation: Guo Kai, Chen Yan-hui, Li Jian-dong. A Low Complexity Decoding Algorithm for Accumulated-Crossover Parallel-concatenated SPC Codes[J]. Journal of Electronics & Information Technology, 2009, 31(9): 2143-2147. doi: 10.3724/SP.J.1146.2008.00778

累加交叉并行级联单奇偶校验码的低复杂度译码算法

doi: 10.3724/SP.J.1146.2008.00778
基金项目: 

国家863计划项目 (2007AA01Z288)和高等学校创新引智计划(B08038)资助课题

A Low Complexity Decoding Algorithm for Accumulated-Crossover Parallel-concatenated SPC Codes

  • 摘要: 累加交叉并行级联单奇偶校验(A-CPSPC)码是一种新的纠错编码,其编码结构简单并具有较好的误比特率性能。该文针对A-CPSPC码的局部编码结构提出了一种低复杂度的最大后验(MAP)局部译码算法,该方法利用基于双向消息传递原则的和积算法(SPA)进行局部译码,消除了短环对局部译码性能的影响。分析及仿真表明,传统的置信传播算法并不适用于A-CPSPC码,该文提出的局部译码算法与基于BCJR算法的局部译码算法的性能一致,且复杂度更低。
  • Berrou C, Glavieux A, and Thitimajshima P. Near Shannonlimit error-correcting coding and decoding: Turbo-codes.Proc. of IEEE International Conference on Communications.Geneva, Switzerland, 1993, 2: 1064-1070.[2]MacKay D J C and Neal R M. Near Shannon limitperformance of low density parity check codes. ElectronicsLetters, 1996, 32(6): 1645-1646.[3]Liva G, Song S, and Lan L, et al.. Design of LDPC codes: Asurvey and new results. Journal of Communications Softwareand Systems, 2006, 2(3): 191-211.[4]Tee J S K, Taylor D P, and Martin P A. Multiple serial andparallel concatenated single parity-check codes[J].IEEETransactions on Communications.2003, 51(10):1666-1675[5]Chen L, Xu J, and Djurdjevic I, et al.. Near-Shannon-limitquasi-cyclic low-density parity-check codes[J].IEEETransactions on Communications.2004, 52(7):1038-1042[6]Lan L, Zeng L Q, and Tai Y Y, et al.. Construction ofquasi-cyclic LDPC codes for AWGN and binary erasurechannels: A finite field approach[J].IEEE Transactions onInformation Theory.2007, 53(7):2429-2458[7]Garcia-Frias J and Zhong W. Approaching Shannonperformance by iterative decoding of linear codes withlow-density generator matrix[J].IEEE Communications Letters.2003, 7(6):266-268[8]Babich F and Comisso M. Channel coding and multi-antennatechniques for distributed wireless networks. Proc. of IEEEGlobal Telecommunications Conference, Washington, DC,USA, 2007: 4180-4184.[9]Gonzalez-Lopez M, Vazquez-Araujo F J, and Castedo L, etal.. Serially-concatenated low-density generator matrix(SCLDGM) codes for transmission over AWGN and Rayleighfading channels. IEEE Transactions on WirelessCommunications, 2007, 6(8): 2753-2758.[10]Kim J S and Song H Y. Concatenated LDGM codes withsingle decoder[J].IEEE Communications Letters.2006, 10(4):287-289[11]Kschischang F R and Frey B J. Iterative decoding ofcompound codes by probability propagation in graphicalmodels[J].IEEE Journal on Selected Areas in Communications.1998, 16(2):219-230
  • 加载中
计量
  • 文章访问数:  3436
  • HTML全文浏览量:  135
  • PDF下载量:  714
  • 被引次数: 0
出版历程
  • 收稿日期:  2008-06-19
  • 修回日期:  2009-06-08
  • 刊出日期:  2009-09-19

目录

    /

    返回文章
    返回