检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]哈尔滨工业大学电子与信息工程学院,哈尔滨150080
出 处:《西安交通大学学报》2017年第8期53-58,83,共7页Journal of Xi'an Jiaotong University
基 金:国家自然科学基金资助项目(61671179);国家"973计划"资助项目(2013CB329003)
摘 要:针对多输入多输出(MIMO)单载波频分多址(SC-FDMA)系统中现有波束赋形算法在非理想信道状态信息下性能下降以及对信道信息误差敏感的问题,提出了一种鲁棒波束赋形算法。该算法利用谱范数对信道状态信息误差进行建模,并基于均方误差和准则将波束赋形优化问题建模为一个极小极大化问题,然后利用优超理论以及奇异值不等式理论证明该优化问题的鞍点特性并得出最优的波束赋形结构,最后利用凸优化得到最优的功率分配算法。仿真结果表明:与非鲁棒波束赋形和等功率分配算法相比,该鲁棒波束赋形算法在误码率以及频谱效率方面都能获得更好的性能,信道状态信息误差增大时,该鲁棒波束赋形算法与非鲁棒波束赋形算法相比在高信噪比时误码率性能约有1dB增益,频谱效率约提升6%。A robust beamforming algorithm for multiple access systems with multiple-input multiple-output (MIMO) and single carrier frequency division (SC-FDMA) is proposed to solve the problems of performance degradation and sensitivity to channel state information (CSI) errors of conventional beamforming algorithms under scenarios of imperfect CSI.The algorithm establishes a model for the imperfect CSI by using a spectral norm,and the beamforming optimization is formulated as a min-max problem based on the criterion of sum of mean-squared errors.Then,the saddle point property of the min-max problem is established and the optimal beamforming structure is obtained by using majorization theory and singular value inequalities.An optimal power allocation algorithm is derived by employing convex optimization.Simulation results and comparisons with the non-robust beamforming and equal power allocation algorithms show that the proposed algorithm has better performance in bit error rate (BER) and spectral efficiency.When the CSI errors increase,a comparison with the non-robust beamforming algorithm in the high SNR regime show that the proposed algorithm obtains 1 dB gain in bit error rate,and the spectral efficiency improves by about 6 %.
关 键 词:波束赋形 多输入多输出 单载波频分多址 非理想信道状态信息
分 类 号:TN914[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30