检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]重庆邮电大学通信与信息工程学院,重庆400065 [2]重庆邮电大学移动通信技术重庆市重点实验室,重庆400065
出 处:《电讯技术》2018年第1期78-83,共6页Telecommunication Engineering
基 金:国家科技重大专项(2016ZX03001010-004);重庆市基础与前沿研究计划项目(cstc2015jcyjA40040)
摘 要:在广义空间调制(GSM)系统中,最大似然(ML)检测可以取得最优的检测性能,然而其计算复杂度随激活天线数的增加急剧增长。针对这一问题,提出了一种基于稀疏重构理论的低复杂度检测算法——正则化正交匹配追踪(ROMP)算法。该算法首先根据信道矩阵和当前残差的内积选取多个候选激活天线索引,接着对候选天线索引按正则化标准进行可靠性验证,剔除错误索引,缩小信号的搜索空间,最后通过求解最小二乘问题估计信号。仿真结果表明,与经典的正交匹配追踪(OMP)算法相比,所提算法以少许复杂度的增加为代价极大提升了检测性能,能够在检测性能与复杂度之间取得更好的折中。The optimal detection of generalized spatial modulation ( GSM) system is the Maximum Likeli-hood ( ML) algorithm. However,the computational complexity of ML detection increases significantly with the increase of the number of active antennas. To solve this problem,a low-complexity detection algorithm based on sparse reconstruction,termed as Regularized Orthogonal Matching Pursuit ( ROMP) algorithm,is proposed. The algorithm starts by producing an estimate of the plausible active antennas indices according to correlation between the MIMO channels and the residual,then removes wrong indexes based on the regu-larization criteria and hence the search space is shrunk. Finally,it estimates GSM signal by involving the LS problem. Simulation results show that the proposed algorithm can improve the detection performance at the cost of slightly increased complexity compared with the conventional orthogonal matching pursuit (OMP) detector,and a better tradeoff between the performance and complexity is achieved.
关 键 词:广义空间调制 信号检测 最大似然 正则化正交匹配追踪
分 类 号:TN911.23[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.69