期刊文献+

基于偏移量近似的改进型RA译码算法研究 被引量:3

Research of modified RA decoding algorithm based on offset approximation
下载PDF
导出
摘要 RA码的译码通常是利用BP译码算法来实现的,但是BP译码算法的硬件电路复杂。虽然最小和译码算法能够简化BP译码算法,但它是以牺牲性能为代价的。为了让译码算法在复杂度和译码性能之间取得较好的折衷,提出一种改进型RA译码算法。该算法采用偏移量近似的方法来逼近于BP译码算法,能够降低BP译码算法的复杂度。仿真结果表明,与BP译码算法相比,改进型RA译码算法能够在降低算法复杂度的同时保持良好的译码性能,与最小和译码算法相比,改进型RA译码算法的复杂度几乎不变,但译码性能得到了明显的提高。 BP decoding algorithm is usually used to realize decoding of RA codes, but the hardware circuit of BP decoding decoding algorithm, b algorithm is complicated. Minimum-sum decoding algorithm can simplify BP ut it is achieved by sacrificing performance. A modified RA decoding algorithm is proposed in order to have a good tradeoff between complexity and decoding performance. The proposed algorithm is approximate to BP decoding algorithm by the method of offset approximation, which can decrease the complexity of BP decoding algorithm. The simulation results show that, compared with BP decoding algorithm, the modified RA decoding algorithm can decrease algorithm complexity and keep good decoding performance. Compared with minimum-sum decoding algorithm, the complexity of modified RA decoding algorithm is almost unchanged, but the decoding performance improves significantly.
作者 张天瑜
出处 《长春工业大学学报》 CAS 2009年第4期390-395,共6页 Journal of Changchun University of Technology
关键词 重复累积码 TANNER图 置信传播译码算法 最小和译码算法 偏移量近似 改进型RA译码算法 RA codes Tanner graph BP decoding algorithm minimum-sum decoding algorithm offset approximation modified RA decoding algorithm
  • 引文网络
  • 相关文献

参考文献10

  • 1Divsalar D.,Jin H.,McEliece R.J.Coding theorems for "Turbo like" codes[C].Proceedings of the 36th Annual Allerton Conference on Communication,Control,and Computing.Allerton House,Monticello,Illinois,1998:201-210. 被引量:1
  • 2Jin H.Analysis and design of Turbo-like codes[D]:[Ph D Thesis].California:California Institute of Technology,2001. 被引量:1
  • 3Johnson S.J.,Weller S.R.Practical interleavers for repeat-accumulate codes[J].IEEE Transactions on Communications,2009,57(5):1225-1228. 被引量:1
  • 4Johnson S.J.,Weller S.R.Combinatorial interleavers for systematic regular repeat-accumulate codes[J].IEEE Transactions on Communications,2008,56(8):1201-1206. 被引量:1
  • 5Tong S.,Bai B.,Wang X.Convergence rates comparison of sum-product decoding of RA codes under different message-passing schedules[J].IEEE Communications Letters,2005,9(6):543-545. 被引量:1
  • 6Abbasfar A.,Divsalar D.,Kung Y.Accumulate-repeat-accumulate codes[J].IEEE Transactions on Communications,2007,55(4):692-702. 被引量:1
  • 7高宏峰著..重复累积码及其在通信系统中的应用[M].北京:科学出版社,2008:161.
  • 8Chung S.Y.,Richardson T.J.,Urbanke R.L.Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation[J].IEEE Transactions on Information Theory,2001,47(2):657-670. 被引量:1
  • 9Fossorier 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. 被引量:1
  • 10张天瑜.OFDM系统研究及其Simulink仿真[J].长春工业大学学报,2008,29(6):699-704. 被引量:5

二级参考文献10

共引文献4

同被引文献31

  • 1Berrou C,Glavieux A.Near optimum error correcting coding and decoding:turbo-codes[J].IEEE Transactions on Communications,1996,44(10):1261-1271. 被引量:1
  • 2Divsalar D,Dolinar S,Pollara F.Iterative turbo decoder analysis based on density evolution[J].IEEE Journal on Selected Areas in Communications,2001,19(5):891-907. 被引量:1
  • 3MacKay D J C,Neal R M.Near shannon limit performance of low density parity check codes[J].Electronics Letters,1997,33(6):457-458. 被引量:1
  • 4Komninakis C,Wesel R D.Trellis turbo-codes in flat Rayleigh fading with diversity[C].// IEEE Global Telecommunications Conference,San Antonio,TX,USA,2001:963-969. 被引量:1
  • 5Sadeghi M R,Banihashemi A H,Panario D.Low-density parity-check lattices construction and decoding analysis[J].IEEE Transactions on Information Theory,2006,52(10):4481-4495. 被引量:1
  • 6Divsalar D,Jin H,McEliece R J.Coding theorems for "Turbo like" codes[C].// Proceedings of the 36th Annual Allerton Conference on Communication,Control,and Computing,Allerton House,Monticello,Illinois,1998:201-210. 被引量:1
  • 7Jin H,Khandekar A,McEliece R J.Irregular repeat-accumulate codes[C].// Proceedings of the 2nd International Symposium on Turbo Codes and Related Topics,Brest,France,2000:1-8. 被引量:1
  • 8Chung S Y,Richardson T J,Urbanke R L.Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation[J].IEEE Transactions on Information Theory,2001,47(2):657-670. 被引量:1
  • 9Fossorier 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. 被引量:1
  • 10Xia S T, Fu F W. Minimum pseudoweight and minimum pseudocodewords of LDPC codes [J]. IEEE Transactions on Information Theory, 2008,54 (1) : 480-485. 被引量:1

引证文献3

二级引证文献2

;
使用帮助 返回顶部