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

基于LDPC码的联合信源信道编码研究 被引量：1

Research on Joint Source Channel Coding Based on LDPC Codes
下载PDF
导出
摘要 为弥补UMPBP-Based译码算法相对于LLRBP译码算法的性能缺陷,提出一种改进型UMP BP-Based译码算法.该算法中的参数是在最小均方误差准则下确定的,对所有的LDPC码的译码具有通用性.最后将该算法应用于联合信源信道编码中.仿真结果表明,在相同误码率的情况下,改进型UMP BP-Based译码算法比UMP BP-Based译码算法、Normalized BP-Based译码算法以及OffsetBP-Based译码算法具有更好的LDPC译码性能. In order to make up for the performance defects of UMP BP-Based decoding algorithm relative to LLR BP decoding algorithm,a modified UMP BP-Based decoding algorithm is proposed.Parameters of the proposed algorithm are confirmed according to minimum mean square error rule and it has generality for decoding of all LDPC codes.Finally,the proposed algorithm is applied to joint source channel coding.The simulation results show that the LDPC decoding performance of modified UMP BP-Based decoding algorithm is more effective than that of UMP BP-Based decoding algorithm,Normalized BP-Based decoding algorithm and Offset BP-Based decoding algorithm under the same condition of bit error rate.
作者 张天瑜
机构地区 无锡市广播电视大学机电工程系
出处 《曲阜师范大学学报（自然科学版）》 CAS 2010年第4期81-86,共6页 Journal of Qufu Normal University(Natural Science)
基金 无锡市广播电视大学校级课题基金资助
关键词 LDPC码 最小均方误差准则 改进型UMP BP-Based译码算法 联合信源信道编码 不等差错保护 LDPC codes minimum mean square error rule modified UMP BP-Based decoding algorithm joint source channel coding unequal error protection
分类号 TN911.22 [电子电信—通信与信息系统]
  • 相关文献

参考文献12

  • 1Wiberg N.Codes and decoding on general graphs[D].Linkoping,Sweden:Linkoping University,1996.
  • 2MacKay D J C,Neal R M.Near Shannon limit performance of low density parity check codes[J].Electronics Letters,1996,32(18):1645-1646.
  • 3Liu L,Shi C J R.Sliced message passing:high throughput overlapped decoding of high-rate low-density parity-check codes[J].IEEE Transactions on Circuits and Systems I:Regular Papers,2008,55(11):3697-3710.
  • 4Hong S N,Kim S,Shin D J,et al.Quasi-cyclic low-density parity-check codes for space-time bit-interleaved coded modulation[J].IEEE Communications Letters,2008,12(10):767-769.
  • 5Chen H Y,Lin M C,Ueng Y L.Low-density parity-check coded recording systems with run-length-limited constraints[J].IEEE Transactions on Magnetics,2008,44(9):2235-2242.
  • 6张天瑜.数字电视信道传输中RS译码算法的研究[J].曲阜师范大学学报（自然科学版）,2009,35(2):74-78. 被引量：1
  • 7Liu L,Shi C J R.Sliced message passing:high throughput overlapped decoding of high-rate low-density parity-check codes[J].IEEE Transactions on Circuits and Systems I:Regular Papers,2008,55(11)3697-3710.
  • 8Hong S N,Kim S,Shin D J,et al.Quasi-cyclic low-density parity-check codes for space-time bit-interleaved coded modulation[J].IEEE Communications Letters,2008,12(10)767-769.
  • 9Kim N,Kim J,Park H,et al.An improvement of UMP-BP decoding algorithm using the minimum mean square error linear estimator[J].ETRI Journal,2004,26(5):432-436.
  • 10Kim N,Park H.Modified UMP-BP decoding algorithm based on mean square error[J].Electronics Letters,2004,40(13):816-817.

二级参考文献13

  • 1Song M A, Kuo S Y, Lan I F. A low complexity design of Reed Solomon code algorithm for advanced RAID system [J]. IEEE Transactions on Consumer Electronics, 2007, 53(2) :265-273.
  • 2Bleichenbacher D, Kiayias A, Yung M. Decoding interleaved Reed-Solomon codes over noisy channels [J]. Theoretical Computer Science, 2007,379 ( 3 ) : 348-360.
  • 3Kang K, Park J, Shin H. On the effect of Reed-Solomon coding with maximum block interleaving on MPEG-4 FGS video quality in 3G broadcasting[ J]. Simulation Modelling Practice and Theory, 2009,17(3) :504-512.
  • 4Muralidhara V N, Sen S. bound for Reed-Solomon Improvements on the Johnson codes [J]. Discrete Applied Mathematics, 2009,157 (4) : 812-818.
  • 5Lee K, O' Sullivan M E. List decoding of Reed-Solomon codes from a Grobner basis perspective [J]. Journal of Symbolic Computation, 2008,43 (9) :645-658.
  • 6Jin W, Fossorier M. Towards maximum likelihood soft decision decoding of the (255,239) Reed Solomon code [J]. IEEE Transactions on Magnetics, 2008,44 (3) :423-428.
  • 7Chang Y W, Truong T K, Jeng J H. VLSI architecture of modified Euclidean algorithm for Reed-Solomon code [J]. Information Sciences, 2003,155 (1-2) : 139-150.
  • 8Hsu H Y, Yeo J C, Wu A Y. Area-efficient VLSI design of Reed-Solomon decoder for 10GBase-LX4 optical communication systems [J]. IEEE Transactions on Circuits and Systems Ⅱ: Express Briefs, 2006,53 ( 11 ) : 1245-1249.
  • 9Lee H, Azam A. Pipelined recursive modified Euclidean algorithm block for low-complexity, high-speed Reed-Solomon decoder [ J ]. Electronics Letters, 2003,39 ( 19 ) : . 1371-1372.
  • 10Foumaris A P, Koufopavlou O. Applying systolic multiplication-inversion architectures based on modified extended Euclidean algorithm for GF (2^k) in elliptic curve cryptography [ J ]. Computers & Electrical Engineering, 2007,33(5-6) :333-348.

同被引文献2

引证文献1

二级引证文献3

曲阜师范大学学报（自然科学版）
2010年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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