摘要
针对联合天线选择算法计算复杂度较高的问题,提出一种基于改进的二进制粒子群算法的快速联合发送端和接收端天线选择算法。通过推导粒子群算法中关于联合天线选择的适应度函数,将联合天线选择问题转化为组合优化问题;改进粒子群算法的位置更新,增加粒子的多样性,增加算法的收敛精度和寻优效率。仿真结果表明,该算法大幅降低了计算复杂度,保持了较高的容量性能。
Considering the problem of high computational complexity of joint antenna selection algorithm,a fast joint transmit and receive antenna selection algorithm for multi-input multi-output systems based on improved binary particle swarm optimization（BPSO）was proposed.By deducing the fitness function of BPSO for antenna selection,the joint antenna selection problem was converted to combinatorial optimization problem.Location update operations of particles were improved,which increased the diversity of the particles,meanwhile increased the convergence accuracy and the efficiency of optimization of the algorithm.Results of simulation show that the algorithm greatly reduces the computational complexity and maintains high capacity performance.
出处
《计算机工程与设计》
北大核心
2016年第12期3250-3254,共5页
Computer Engineering and Design
关键词
多输入多输出系统
联合收发端
二进制粒子群算法
天线选择算法
信道容量
multi-input multi-output systems
joint transmit and receive antenna
binary particle swarm optimization
antenna selection algorithm
channel capacity
