摘要
针对传统算法利用计算机搜索大约束长度的卷积码的最大约束长度不超过30的情况,提出了一种改进的大约束长度卷积码搜索算法——基于堆栈结构的搜索算法,利用该搜索算法可以找到约束长度大于30的卷积码编码器。利用卷积码的最大自由距离界,设定该算法搜索到的编码器的距离界的上限和下限,并利用费诺译码算法对找到的大约束长度的卷积码编码器的性能进行检验。结果表明,通过该搜索算法找到的大约束长度卷积码的在同等信噪比情况下的误码率较低。
In the traditional algorithm,the maximum constraint length of a large convolutional length convolutional code is not more than 30.In this case,an modified large-constrained length convolutional code search algorithma stack structure-based search algorithm is proposed.By using the search algorithm,a convolutional code encoder with a constraint length greater than 30 can be found.The upper and lower limits of the distance bound of the encoder searched by the algorithm can be set by using the maximum free distance bound of the convolutional code.Then,the performance of the found large-constrained length convolutional code encoder is tested by using the Ferno decoding algorithm.The experiment results indicate that the error rate of the large-constraint length convolutional code found by the search algorithm is lower under the same SNR.
作者
张涛涛
王满喜
荣辉
杨志飞
ZHANG Tao-tao;WANG Man-xi;RONG Hui;YANG Zhi-fei(State Key Laboratory of Complex Electromagnetic Environment Effects on Electronics and Information System,Luoyang Henan 471003,China;China Luoyang Electronic Equipment Test Center,Luoyang Henan 471003,China)
出处
《通信技术》
2018年第7期1532-1535,共4页
Communications Technology
基金
电子信息系统复杂电磁环境效应国家重点实验室基金项目(No.CEWEE2018Z0205B)~~
关键词
大约束长度
卷积码
堆栈结构
编码器
large-constraint length
convolutional code
stack structure
encoder
