MIMO系统中改进的二进制粒子群天线选择算法

在多输入多输出系统中,发射端和接收端的多天线配置提高了信道容量和传输可靠性,而天线选择技术能在保持系统优点的同时有效地降低运算复杂度以及硬件成本。为了能在时变的信道条件下快速地选择出一组最优的天线子集,提出了一种基于二进制粒子群算法的改进的天线选择算法。推导出了二进制粒子群联合收发端天线选择的信道容量公式,并将其作为粒子群算法的适应度函数,使天线选择问题转换成二进制编码串的组合优化问题。通过改进模糊函数提高粒子群算法的收敛性,让二进制粒子群尽可能地收敛于全局最优位置。仿真结果表明,改进的算法能在降低运算复杂度的同时提高收敛性,且系统信道容量趋近于最优算法。     

基于特征空间的MIMO天线选择算法

多输入多输出(MIMO)系统中多天线阵元(MEA)的使用增加了硬件成本和信号处理负担,而天线选择技术能够在损失MIMO性能很小的条件下大幅度降低硬件需求.在最大化信道容量的准则下,提出了一种基于信道状态信息(CSI)特征空间的渐消算法及相应的启发式简化算法,并说明了简化算法等价于特征空间矩阵上的基于范数的选择(NBS)算法.仿真实验表明,在接收天线选择个数大于发送天线个数的条件下,两种算法达到的中断容量接近最优选择算法,且计算时间较小.     

天线选择对分布式多入多出系统的容量影响研究

通过天线选择可以提高多输入多输出(MIMO)系统的容量,并能有效地降低MIMO系统的复杂度和射频成本.基于连续选择使MIMO系统容量增加最大的天线的方法,用矩阵及行列式运算导出了一种新的接收天线选择算法.将该算法用于分布式MIMO系统的容量研究,通过计算机仿真,结合Rice因子K及不同视距传播条件等因素对分布式MIMO系统上行信道容量的影响进行了研究.仿真结果在分布式无线通信组网及网络优化中具有指导意义.     

一种改进的麻雀搜索天线选择算法

为解决麻雀搜索算法在多输入多输出(Multiple-Input Multiple-Output, MIMO)系统中进行天线选择时,存在过早收敛导致系统容量非最优的问题,提出了一种改进的麻雀搜索天线选择算法。该算法首先结合0-1规划推导出信道容量函数,将其作为适应度函数。在天线选择子集寻优过程中,通过引入自适应变异,有效增加了个体变化的多样性。最后将禁忌搜索算法融入到算法中,并加速算法收敛。仿真结果表明,改进的麻雀搜索天线选择算法能够有效降低MIMO系统进行天线选择时的运算复杂度,在保证收敛速度的同时,最终得到的系统信道容量趋近于最优算法。     

60GHz 室内信道下一种快速天线选择算法

传统的基于信道容量最大化准则的天线选择算法虽然使信道容量达到了最大化,但是计算复杂度很高。针对计算复杂度高的问题, 提出了一种基于Doolittle-QR 分解的低复杂度天线选择算法。该算法基于Doolittle-QR 分解,可以快速选择出使系统容量最大化的天线。与传统的天线选择算法相比,该算法的计算复杂度不仅有效地降低了, 而且容量性能相近。在60GHz 室内信道下,仿真实验结果表明, 该算法具有良好的容量性能,优于随机天线选择算法,接近最优天线选择算法。     

一种面向透镜阵列毫米波多用户MIMO的CNN天线选择算法

毫米波通信中大规模多输入多输出(MIMO)系统的实现需要使用大量射频链,导致了系统硬件成本和能耗过高的问题。为了解决这一问题,考虑利用透镜天线阵列基于方向的能量聚焦特性并结合天线选择技术能够在性能损失不明显的同时有效地减少射频链的使用数量。针对具有透镜天线阵列的多用户MIMO系统,提出了一种基于卷积神经网络(CNN)的天线选择算法,将信道状态信息和以信道容量为指标而制作的标签作为网络的输入,对神经网络进行训练,用训练好的网络模型为新的信道状态信息选择出最优的天线组合。仿真结果表明,所提方案获得的和速率性能接近全数字方案,并且所提天线选择算法的分类准确率可以达到98%左右,优于其他基于机器学习的天线选择算法。     

一种用于MIMO系统的快速天线选择算法

在多径衰落环境中, MIMO系统的信道容量随天线数的增加呈线性增加,发射/接收天线选择方法能以很小的性能损失换取射频成本的大幅度降低,使MIMO系统不完全受射频成本的限制。为快速选择出使系统容量最优的发射/接收天线子集,该文提出一种快速天线选择算法的改进算法。该算法通过实时更新优化参数,大大降低计算复杂度。仿真结果表明,该算法在不影响系统容量的情况下大大减少了计算时间。     

接近最优的编码MIMO系统的发送天线子集选择算法

多天线无线系统可提供更大的信道容量和更好的抗衰落能力,发送端利用反馈的部分信道状态信息进行发送天线子集选择能够进一步提高信道容量。该文提出了一种MIMO系统的快速的、动态的天线子集选择算法,其提供的信道容量高于已有的静态算法,且接近于最优天线选择算法,而无需计算所有可能的天线子集组合的信道容量,因而具有更低的复杂度。将本文算法与比特交织编码调制(BICM)技术相结合,对各天线速率进行适配,提出了空时自适应比特交织编码调制(ST-ABICM)方案。仿真结果证实了该方案性能的优越性。     

基于强化学习的大规模天线阵天线选择算法

传统天线选择算法过于依赖信道状态信息(CSI),然而以用户为中心的大规模多输入多输出(UC-MMIMO)系统难以获得足够CSI。针对以上矛盾,将强化学习方法引入到天线选择的问题中,提出了一种基于强化学习的天线选择算法。通过仿真说明所提算法相对于传统的天线选择方法对CSI依赖程度大大降低,并且有着更低的算法复杂度。     

放大转发MIMO中继系统中的快速天线选择算法

 本文研究放大转发MIMO中继系统的天线选择,目标是最大化系统容量.针对最优天线选择算法的高复杂度,本文提出了低复杂度且性能逼近最优的快速天线选择算法.首先对MIMO中继系统容量进行了分析和仿真,结果表明：若源的天线数为M、目标的天线数为N,中继从K根天线中选择min(M,N)根就可保证系统达到近似最优的性能.在此基础上,本文以优化容量下界为目标,利用分块矩阵的性质,推导出快速天线选择算法,并分析了算法的复杂度.研究结果表明本文提出的快速天线选择算法的性能与最优算法非常接近,并且有更低的复杂度.     

Low-Complexity Throughput-Based Antenna Selection Method

Antenna selection is a low-cost low-complexity attractive approach in MIMO systems that capture many advantages of these systems. In this paper, our objective is to select the best antennas that maximize throughput with truncated selective repeat automatic repeat request at data link layer in zero-forcing MIMO receivers. We propose a novel binary particle swarm optimization method with throughput as its fitness function for joint transmit and receive antenna selection. The results of simulations demonstrate that the proposed throughput based antenna selection method has better performance compared to capacity based methods, and PSO algorithm can significantly reduce computational complexity.     

Joint Transmit and Receive Antenna Selection in Mimo Systems Based on Swarm Intelligence Algorithm

Multiple-input-multiple-output (MIMO) can provide superior performances such as system capacity, linkage, etc. But also it will bring high RF costs and system complexity, especially in large scale MIMO systems. Antenna selection (AS) is proved to be a trade-off between good performances and complexity. Specifically, from the perspective of both transmit and receive antennas, the joint transmit and receive antenna selection (JTRAS) is employed in MIMO systems. Up to now, some algorithms of JTRAS have been studied in MIMO systems. However, most of them are mainly focused on just one aspect about accuracy or complexity. Especially, compared to numerical analysis, the implementation of swarm intelligence algorithm in JTRAS needs to be studied extensively. In the paper, three intelligent algorithms, i.e. genetic algorithm, cat swarm algorithm and particle swarm algorithm are studied and compared in terms of accuracy, cost, and complexity. In addition, fractional coding is proposed in the algorithms instead of binary integer coding. The simulation results demonstrate that all three algorithms can efficiently accomplish the antenna selection. PSO has the best accuracy and stability, but the complexity of PSO is also highest. If we take overall performances in consideration, CSO is the best choice especially in practical implementation. Moreover, fractional coding will provide better performance than binary integer coding.

     

Energy efficiency of massive MIMO wireless communication systems with antenna selection

Massive multiple-input multiple-output (MIMO) requires a large number (tens or hundreds) of base station antennas serving for much smaller number of terminals, with large gains in energy efficiency and spectral efficiency compared with traditional MIMO technology. Large scale antennas mean large scale radio frequency (RF) chains. Considering the plenty of power consumption and high cost of RF chains, antenna selection is necessary for Massive MIMO wireless communication systems in both transmitting end and receiving end. An energy efficient antenna selection algorithm based on convex optimization was proposed for Massive MIMO wireless communication systems. On the condition that the channel capacity of the cell is larger than a certain threshold, the number of transmit antenna, the subset of transmit antenna and servable mobile terminals (MTs) were jointly optimized to maximize energy efficiency. The joint optimization problem was proved in detail. The proposed algorithm is verified by analysis and numerical simulations. Good performance gain of energy efficiency is obtained comparing with no antenna selection.     

简明的联合收发端天线选择算法

For reducing the computational complexity of the problem of joint transmit and receive antenna selection in Multiple-Input- Multiple-Output (MIMO) systems, we present a concise joint transmit/receive antenna selec-tion algorithm. Using a novel partition of the channel matrix, we drive a concise formula. This formula enables us to augment the chan-nel matrix in such a way that the computational complexity of the greedy Joint Transmit/Receive Antenna Selection (JTRAS) algorithm is reduced by a factor of 4nL, where nL is the number of selected antennas. A de-coupled version of the proposed algorithm is also proposed to further improve the efficien-cy of the JTRAS algorithm, with some capacity degradation as a tradeoff. The computational complexity and the perform-ance of the proposed approaches are evalu-ated mathematically and verified by computer simulations. The results have shown that the proposed joint antenna selection algorithm maintains the capacity perormance of the JTRAS algorithm while its computational complexity is only 1/4nL of that of the JTRAS algorithm. The decoupled version of the proposed algorithm further reduces the computational complexity of the joint antenna selection and has better performance than other decoupling-based algorithms when the selected antenna subset is small as compared to the total number of antennas.     

关于MIMO系统的天线子集选择性能的研究

讨论了有关 MIMO 无线系统中的天线子集选择性能的问题。首先建立了 MIMO 信道模型,对信道模型进行了分析,接着对信道矩阵为非满秩的情况进行了研究,分别采用几种组合对发射、接收天线进行选择,得出不同组合对信道容量的影响。仿真结果表明,选择发射天线可以增加信道容量,选择接收天线虽然无助于增加信道容量,但在不会严重降低信道容量的前提下,可以降低系统的成本。     

Receive antenna selection for MIMO systems over correlated fading channels

In this letter, we propose a novel receive antenna selection algorithm based on cross entropy optimization to maximize the capacity over spatially correlated channels in multiple-input multiple-output (MIMO) wireless systems. The performance of the proposed algorithm is investigated and compared with the existing schemes. Simulation results show that our low complexity algorithm can achieve near-optimal results that converge to within 99% of the optimal results obtained by exhaustive search. In addition, the proposed algorithm achieves near-optimal results irrespective of the mutual relationship between the number of transmit and receive antennas, the statistical properties of the channel and the operating signal-to-noise ratio.     

一种快速的接收天线选择算法

天线选择是MIMO系统中一项重要的技术,它能从MIMO系统的多个发射天线和多个接收天线中选择出性能最好的一个或几个天线,从而以很小的性能损失换取成本的大幅降低,极大地提高了MIMO系统的性能价格比。最优算法具有较高的复杂度而限制了它的应用,文中从次优的递增递减算法入手,提出了一种具有更低复杂度的递增递减接收天线选择算法。仿真结果表明,该算法以很小的系统容量损失为代价换取了复杂度的降低。     

大规模MIMO相关信道下的联合天线分组和天线选择

在大规模多输入多输出系统中,针对密集部署的大型天线阵列之间的强相关性会抑制天线选择增益效果的问题。在系统下行链路场景下建立空间相关信道模型,提出了基于天线分组的天线选择算法。根据瞬时信道相关矩阵将天线阵列划分为若干组,保证各组内天线之间相关性较强。在完成天线分组的基础上,基于信道矩阵列范数准则在各组发射天线与接收天线之间构成的子信道矩阵中选择天线,进而构造有效发射天线与接收天线之间的信道矩阵。仿真分析了所提天线选择算法对系统遍历和速率的影响,结果表明,在基站天线数为32、接收天线数为2、选择天线数为2、天线相关因子为0.9的假设下,当信噪比为10 dB时,与基于相邻天线分组的天线选择算法相比,所提算法使系统和速率约提高了27.5%,且所提算法若要与最优天线选择算法达到相同的和速率,仅需将其信噪比提升1～2 dB即可。