检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:龙浪 杨俊安 刘辉[1,2] 梁宗伟[1,2] LONG Lang;YANG Jun’an;LIU Hui;LIANG Zongwei(School of Electronic Countermeasure,National University of Defense Technology,Hefei 230037,China;Key Laboratory of Electronic Restricting Technique of Anhui Province,Hefei 230037,China)
机构地区:[1]国防科技大学电子对抗学院,安徽合肥230037 [2]安徽省电子制约技术重点实验室,安徽合肥230037
出 处:《系统工程与电子技术》2018年第8期1702-1707,共6页Systems Engineering and Electronics
基 金:装备发展部"十三五"预研项目资助课题
摘 要:针对非合作接收中现有盲识别算法受码长约束且抗误码性能较差的问题,提出了一种基于分析矩阵零均值比的卷积交织参数盲识别算法,可以在不需要考虑码长约束的情况下,利用经高斯约当旋转消元算法处理后得到的分析矩阵零均值比来确定秩缺间隔,从而得到交织深度的范围,最后通过联合求取交织宽度、交织深度和交织偏差来完成卷积交织参数的盲识别。分别对所提算法、多重循环搜索算法和秩准则算法在不同误码性能下进行了仿真实验,实验结果表明,所提算法在误码率较高情况下,具有较好的识别性能,且运算复杂度较小,可以完成通用数据链卷积交织的盲识别。As the existing blind recognition algorithms in noncooperative reception are constrained by code length and have poor antierror performance, a blind identification algorithm of convolutional interleaver parameters based on zeromeanratio for common data link (CDL) is proposed in high speed transmission. Unlike the prior works, the interleaver parameter identification process is carried out for a generic case without any restriction on the codeword length. Combining the zeromeanratio with GaussJordan elimination through the pivoting algorithm, the distance of rank deficiency can be determined and the depth is estimated in the presence of bit errors. Finally, the blind identification can be realized through the combination of depth, width and synchronization. The proposed algorithm, nested loop algorithm and rank criterion algorithm are used for simulation tests under different bit error rates. The experimental results show that the proposed method can achieve a better performance compared with the existing algorithms in high bit error rate and can realize the identification of convolutional interleaver parameters for CDL.
分 类 号:TN919.3[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.51