检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张兢 李岳 曹阳 彭小峰 李小红 ZHANG Jing;LI Yue;CAO Yang;PENG Xiaofeng;LI Xiaohong(School of Electrical and Electronic Engineering,Chongqing University of Technology,Chongqing 400054,China)
机构地区:[1]重庆理工大学电气与电子工程学院,重庆400054
出 处:《激光杂志》2020年第10期153-156,共4页Laser Journal
基 金:重庆市教委科学技术项目(No.KJ1500934,KJ120827);重庆市科委社会事业与民生保障科技创新专项(No.cstc2017shmsA40019);重庆市研究生科研创新项目(No.CYS18311);重庆市基础与前沿研究计划项目(No.cstc2015jcyjA40051)。
摘 要:为了提高深空光通信的信息传输效率,降低译码复杂度,针对极化码的分段CRC辅助SCL译码,引入了一种树图剪枝算法,提出树图剪枝-分段循环冗余校验辅助SCL(SCAL-P)译码算法。根据深空光通信系统和深空信道自由空间段信道情况,可以通过控制剪枝门限,在满足译码性能前提下提高译码效率。仿真结果表明,在码长N=1024,L=16时,选用剪枝门限值为7,此时剪枝操作能降低分段CRC辅助SCL译码18%左右的译码复杂度,并且只产生约0.4 dB的损耗,还可以根据不同的信道情况,设置不同的剪枝门限值,有效地提高了深空光通信系统的信息传输效率。In order to improve the information transmission efficiency of deep space optical communication and reduce the decoding complexity,a segmented CRC assisted SCL decoding for polarized codes is introduced.A tree map pruning algorithm is introduced,which means the tree map pruning-segmented circular redundancy check auxiliary SCL(SCAL-P)decoding algorithm.According to the deep space optical communication system and the channel conditions of free space segment of deep space channel,the pruning threshold can be controlled to improve the decoding efficiency on the premise of satisfying the decoding performance.Simulation results show that when the code length is N=1024 and L=16,the pruning threshold selected is 7.At the same time,the pruning operation can reduce decoding complexity of segmented CRC assisted SCL decoding by about 18%,and only generates a loss of about 0.4 dB,and can also set different pruning thresholds according to different channel conditions,which effectively improves the information transmission efficiency of deep space optical communication systems.
分 类 号:TN929.1[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49