期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

MIMO-OFDM系统中LDPC码的改进型最小和译码算法研究 被引量：4

Research on the Modified Minimum-Sum Decoding Algorithm of LDPC Codes in MIMO-OFDM System
下载PDF
导出
摘要 LDPC码的译码通常是利用BP译码算法来实现的,但是BP译码算法的硬件电路复杂.虽然最小和译码算法能够简化BP译码算法,但它是以牺牲性能为代价的.为了让译码算法在复杂度和译码性能之间取得较好的折衷,针对最小和译码算法的性能缺陷,利用最小均方误差准则,提出一种改进型最小和译码算法,最后将该算法应用于M IMO-OFDM系统中.仿真结果表明,与BP译码算法以及最小和译码算法相比,改进型最小和译码算法能够在降低算法复杂度的同时保持良好的译码性能. BP decoding algorithm is usually used to realize the decoding of LDPC codes, but the hardware circuit of BP decoding algorithm is complicated. Minimum - sum decoding algorithm can simplify BP decoding algorithm, but it is achieved by sacrificing performance. According to the performance defects of minimum - sum decoding algo- rithm, a modified minimum - sum decoding algorithm is proposed by using the minimum mean square error rule in order to have a good tradeoff between complexity and decoding performance. Finally, the proposed algorithm is ap- plied in MIMO -OFDM system. The simulation results show that,compared with BP decoding algorithm and mini- mum -sum decoding algorithm, the modified minimum -sum decoding algorithm can decrease algorithm complexity and keep good decoding performance.
作者 张天瑜
机构地区 无锡市广播电视大学机电工程系
出处 《云南民族大学学报（自然科学版）》 CAS 2011年第2期152-156,共5页 Journal of Yunnan Minzu University:Natural Sciences Edition
基金 无锡市广播电视大学校级课题基金
关键词 LDPC码 MIMO—OFDM系统 归一化译码算法 偏移量译码算法 最小和译码算法 LDPC codes MIMO - OFDM system normalized decoding algorithm offset decoding algorithm mini- mum -sum decoding algorithm
分类号 TN911.22 [电子电信—通信与信息系统]
  • 相关文献

参考文献10

  • 1AHMED S, RATNARAJAH T, SELLATHURAI M,et al. Iterative receivers for MIMO - OFDM and their convergence behavior[ J]. IEEE Transactions on Vehicular Technology, 2009,58( 1 ) :461 -468.
  • 2BLOSTEIN S D, LEIB H. Multiple antenna systems: their role and impact in future wireless access [ J ]. IEEE Com- munications Magazine ,2003,41 (7) :94 - 101.
  • 3KANEMARU H, OHTSUKI T. Interference cancellation with diagonal maximum likelihood decoder for space - time/space- frequency block coded OFDM [ C ]//IEEE 59th Vehicular Technology Conference. Chiba, 2004:525 - 529.
  • 4LARSEN M D, SWINDLEHURST A L, SVANTESSON T. Performance bounds for MIMO -OFDM channel estimation [ J]. IEEE Transactions on Signal Processing, 2009,57(5): 1901 - 1916.
  • 5PISHRO - NIK H, FEKRI F. Results on punctured low - density parity - check codes and improved iterative deco- ding techniques [ J ]. IEEE Transactions on Information Theory ,2007,53 (2) :599 - 614.
  • 6NGATCHED T M N, TAKAWIRA F, BOSSERT M. An im- proved decoding algorithm for finite - geometry LDPC codes [ J 1. IEEE Transactions on Communications, 2009,57 (2) : 302 - 306.
  • 7蓝辉霞,仰枫帆.构造消环的低密度校验码[J].云南民族大学学报（自然科学版）,2005,14(1):46-47. 被引量：3
  • 8FOSSORIER M P C, MIHALJEVIC M, IMAI H. Reduced complexity iterative decoding of low - density parity check codes based on belief propagation [ J ]. IEEE Transactions on Communications, 1999,47 (5) : 673 - 680.
  • 9CHEN J,FOSSORIER M P C. Near optimum universal belief propagation based decoding of low density parity check codes [ J ]. IEEE Transactions on Communications,2002,50 (3) :406 -414.
  • 10CHEN J, FOSSORIER M P C. Density evolution for two improved BP - based decoding algorithms of LDPC codes [ J ]. IEEE Communication Letters, 2002, 6 ( 5 ) : 208 -210.

二级参考文献6

  • 1GMLLAGER R G. Low- Density Parity- Check Codes[J]. IRE Transactions on Information Theory, 1968,IT(8) :21 - 28.
  • 2MacKay D J C,Neal R M. Near Shannon limit performance of low density parity check nodes[J]. 1997,33(5) :457 - 458.
  • 3Mackay D J C. Good error- correcting codes based on very spars matrices[J]. IEEE Trans on infor theory, 1991,45(2) :399- 431.
  • 4Yu Kou, Shu Lin, Fossorier P C. Low density parity- check codes based on finite geometries: A rediscovery and new[J]. IEEE Tans on Inform Theory, 2001,47(7) :2711 - 2736.
  • 5GALLAGER R G. Low- Density Parity- Check Codes[J]. IRE Transactions on Information Theory, 1968,IT(8) :21 - 28.
  • 6Yu Kou, Shu Lin, Fossorier P C. Low density parity- check codes based on finite geometries: A rediscovery and new[J]. IEEE Tanson Inform Theory, 2001,47(7) :2711 - 2736.

共引文献2

同被引文献29

  • 1李志国,张伟功.BCH码迭代译码算法及软件实现方法[J].计算机技术与发展,2007,17(4):171-174. 被引量：6
  • 2李志国.BCH码迭代译码算法及软件实现方法[J].计算机技术与发展,2010,20(2):25-29.
  • 3GALLAGER R G.Low-density Parity-check Codes[J].IRE Transactions on Information Theory,1962,IT-8(1):21-28.
  • 4CHEN X,KANG J,LIN S,et al.Accelerating FPGA-basedEmulation of Quasi-Cyclic LDPC Codes with VectorProcessing[J].In Proc.Design,Automation and Test inEurope,2000,15(8):56-62.
  • 5MOBINI N,BANIHASHEMI A,HEMATI S.A DifferentialBinary Message-Passing LDPC Decoder[C]∥Proc.Globecom,2007:1 561-1 565.
  • 6131.1-O-2.Low Density Parity Check Codes for Use inNear-Earth And Deep Space Applications[S],2007.
  • 7SMARANDACHE R,VONTOBEL P.Pseudo-codewordAnalysis of Tanner Graphs from Projective and EuclideanPlanes[J].IEEE Trans.Inf.Theory,2007,53(7):2 376-2 393.
  • 8CHEN Xiaoheng,LIN Shu.Memory System Optimizationfor FPGABased Implementation of Quasi-Cyclic LDPCCodes Decoders[J].IEEE Transactions on Circuits andSystems—I:Regular Papers,2011,58(1):63-66.
  • 9RICHARDSON T J,SHOKROLLAHI M A,URBAMKE RL.Design of Capacity-approaching Irregular Low-densityParity-check Codes[J].IEEE Trans.Inf.Therory,2001,47(2):619-637.
  • 10BRINK S T.Design of Serially Concatenated Codes Basedon Iteratively Decoding Convergence[J].2nd InternationalSymposium on Turbo Codes and Related Topics,2000,27(9):319-322.

引证文献4

二级引证文献1

云南民族大学学报（自然科学版）
2011年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部