摘要
为了提高光通信链路的译码性能,基于极化码的串行抵消序列译码,提出了一种树图剪枝算法。通过剪枝门限值来选择译码路径,提高了路径搜索效率。根据极化码构造可以确定剪枝门限的取值范围和不同剪枝门限值对应性能优先或效率优先的译码原则,然后根据信道情况和自由空间光通信(FSO)系统的传输需求合理地设置剪枝门限。不同湍流强度下的仿真结果表明,剪枝操作能在保证译码性能的前提下降低约24%的译码复杂度,有效提升了强湍流信道中极化码的译码效率。
In order to improve the decoding performance of optical communication links, a tree pruning algorithm is proposed based on the serial cancellation sequence decoding of polarization codes. Selecting the decoding path by the pruning threshold value, the efficiency of path search is improved. According to the construction of polarization code, this paper can determine the range of pruning thresholds. Different pruning thresholds corresponding to the decoding principle of performance priority or efficiency priority can reasonably set pruning threshold according to the channel condition and the demand of free space optical communication（FSO） system transmission. Simulation results under different turbulence intensities show that pruning operation can reduce the decoding complexity by about 24% at the premise of guaranteeing decoding performance, and effectively enhance the decoding efficiency of polarization codes in strong turbulence channel.
作者
张晗
曹阳
涂巧玲
李小红
ZHANG Han;CAO Yang;TU Qiaoling;LI Xiaohong(School of Electrical and Electronic Engineering, Chongqing University of Technology, Chongqing 400054, Chin)
出处
《光通信技术》
北大核心
2018年第6期38-41,共4页
Optical Communication Technology
基金
国家自然科学基金青年基金(61205106)资助
中国博士后科学基金(2014M552329)资助
重庆市教委科学技术研究项目(KJ1500934)和重庆市教委科学技术研究项目(KJ120827)资助
重庆市科委社会事业与民生保障科技创新专项(cstc2017shms A40019)资助
