检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王玉龙 吴迪[1] 胡涛 WANG Yu-long;WU Di;HU Tao(PLA Strategic Support Force Information Engineering University,Zhengzhou,Henan 450001,China)
机构地区:[1]解放军战略支援部队信息工程大学,河南郑州450001
出 处:《电子学报》2022年第11期2754-2764,共11页Acta Electronica Sinica
摘 要:针对空时分组码(Space-Time Block Code,STBC)盲识别中码型相同的编码区分性较差甚至无法区分的问题,提出了一种基于接收信号统计特征的识别算法.首先分析了多输入多输出(Multiple Input Multiple Output,MIMO)系统中采用的空时编码方案与接收信号的统计特征之间的相关性,设计了概率匹配与弥散度匹配对该相关性进行量化,获得接收信号与不同编码方案的匹配度,最后利用决策树选择匹配度最高的编码作为识别结果.仿真结果表明,针对两组同型的空时分组码,所提算法在信噪比为8 dB时可达98%以上的识别率,而基于特征提取的传统算法无法对两组编码进行有效区分;与基于深度学习的算法相比,本文算法对同型空时码的识别具有更好的鲁棒性,识别过程使用更少的计算资源.To solve the problem that space-time block codes(STBCs)with the same shape are poor differentiation or even indistinguishable,a recognition algorithm based on probability matching and dispersion matching was proposed.Firstly,the correlation between the STBCs adopted by multiple input multiple output(MIMO)system and the statistical characteristics of the received signal is analyzed.Probability matching and dispersion matching are designed to quantify the correlation,and the matching degree between the received signal and different codes is obtained.Finally,the decision tree is used to select the code with the highest matching degree as the recognition result.Simulation results show that the proposed algorithm can achieve more than98%recognition rate when SNR is8dB,while the traditional algorithm based on feature extraction cannot effectively distinguish the in-group codes.Compared with the algorithm based on deep learning,the proposed algorithm has better robustness for the recognition of space-time block codes with the same shape,and has better realtime performance and better applicability with fewer computing resources.
关 键 词:多输入多输出 正交空时分组码 准正交空时分组码 决策树 统计特征 盲识别
分 类 号:TN911.7[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.191.201.27