期刊文献+

基于Polar码的水声通信信源信道联合译码方法 被引量:3

A joint source-channel decoding algorithm based on polar codes for underwater acoustic communication
下载PDF
导出
摘要 水声信道时延扩展较长,频域选择性衰落严重,导致水声通信提升可靠性困难。同时,水声通信实际发送的信源中通常存在残留冗余,传统方法难以利用这部分冗余,从而导致一定的带宽浪费。针对该问题,提出了一种基于Polar码的水声通信信源信道联合译码方法。该方法根据Polar码的译码结构,以信源状态转移关系为基础构建信源信道联合译码网格图,综合信源转移概率和信道转移概率计算统一的序列后验概率,实现了信源译码和信道译码的一体化联合优化。该方法能够利用信源符号间相关性导致的残留冗余抵抗信道差错,在不降低通信速率的情况下进一步提高水声通信系统可靠性。湖上实验结果表明,在相同条件下,所提方法可将系统误码率由传统分离译码的1.9×10^(−2)降低为4.0×10^(−4);当传输图像序列时,传统分离译码方法的误码率为3.7×10^(−3),而所提方法则在实验中实现了无误码通信。 It is difficult to improve the reliability of underwater acoustic communication(UAC)due to the long-time delay and severe frequency fading of underwater acoustic channels.On the other hand,there are always some source residual redundancies in practical UAC.Traditional methods cannot use these redundancies.That leads to some waste of bandwidth.To overcome these problems,a joint source-channel decoding algorithm based on polar codes for UAC is proposed.According to the decoding structure of polar codes,the joint source-channel decoding trellis is constructed based on the source transfer relationship.The posterior probabilities are computed by combining the source transfer probability and the channel transfer probability.In this way,the source decoding and channel decoding are optimized jointly.This algorithm can take advantage of the source residual redundancies for error control decoding and can improve the reliability of UAC without reducing the communication rate.The lake experimental results show that the proposed algorithm can reduce the bit error rate(BER)from 1.9×10^(−2)of the traditional separate decoding algorithm to 4.0×10^(−4).When transmitting photographs,the proposed algorithm can reduce the BER from 3.7×10^(−3)of the traditional separate decoding algorithm to 0.
作者 胡承昊 台玉朋 汪俊 胡治国 王海斌 HU Chenghao;TAI Yupeng;WANG Jun;HU Zhiguo;WANG Haibin(State Key Laboratory of Acoustics,Institute of Acoustics,Chinese Academy of Sciences,Beijing 100190,China;University of Chinese Academy of Sciences,Beijing 100049,China)
出处 《应用声学》 CSCD 北大核心 2022年第1期60-69,共10页 Journal of Applied Acoustics
关键词 水声通信 Polar码 信源信道联合译码 湖上实验 Underwater acoustic communication Polar codes Joint source-channel decoding Lake experiment
  • 相关文献

参考文献4

二级参考文献27

  • 1Bauer R, Hagenauer J. Iterative source/channel decoding using reversible variable length codes [ C ] ff Proc IEEE Data Compression Conference ( DCC' 00). Snowbird, Utah, USA, 2000 : 93-102.
  • 2Bauer R, Hagenauer J. Symbol-by-symbol MAP decoding of variable length codes. [ C ]//Proc 3rd ITG Conference on Source and Channel Coding ( CSCC' 00 ). Munich, Germany, 2000 : 111-116.
  • 3Bahl LR, Coeke J, Jelinek F, et al. Optimal decoding of linear codes for minimizing symbol error rate[ J]. IEEE Trans Inf Theo, 1974, 20 ( 2 ) : 284-287.
  • 4Kliewer J, Thobaben R. Parallel concatenated joint source-channel coding[ J ]. Electron Lett, 2003, 39 (23) : 1664-1666.
  • 5Kliewer J, Thobaben R. Iterative joint source-channel decoding of variable-length codes using residual source redundancy[ J]. IEEE Trans Wire Comman, 2005, 4(3) : 919-929.
  • 6Thobaben R, Kliewer J. Low-complexity iterative joint source-channel decoding for variable-length encoded Markov sources[ J]. IEEE Trans Commun, 2005, 53(12): 2054-2064.
  • 7Bauer R, Hagenauer J. On variable length codes for iterative source/channel decoding[ C]//Proc IEEE Data Compression Conference ( DCC' 01 ). Snowbird, Utah, USA, 2001:273-282.
  • 8Guivarch L, Carlach J C, Siohan P. Joint source-channel soft decoding of huffman codes with turbo codes[ C ] //Proc DCC'00, Snowbird, Uath, USA, 2000:83-92.
  • 9Jeanne M, Carlach J C, Siohan P. Joint source-channel decoding of variable length codes for convolutional codes and turbo codes [ J]. IEEE Trans Commun, 2005, 53(1): 10-15.
  • 10Lia J J, Tu G F, Zhang C, et al. Joint source and channel decoding for variable length encoded turbo codes[ J]. EURASIP J Advances in Signal Processing, 2008 ( 1 ).

共引文献3

同被引文献11

引证文献3

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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