Opportunistic Space-Division Multiple Access With Beam Selection

In this paper, a novel transmission technique for the multiple-input multiple-output (MIMO) broadcast channel is proposed that allows simultaneous transmission to multiple users with limited feedback from each user. During a training phase, the base station modulates a training sequence on multiple sets of randomly chosen orthogonal beamforming vectors. Each user sends the index of the best beamforming vector and the corresponding signal-to-interference-plus-noise ratio for that set of orthogonal vectors back to the base station. The base station opportunistically determines the users and corresponding orthogonal vectors that maximize the sum capacity. Based on the capacity expressions, the optimal amount of training to maximize the sum capacity is derived as a function of the system parameters. The main advantage of the proposed system is that it provides throughput gains for the MIMO broadcast channel with a small feedback overhead, and provides these gains even with a small number of active users. Numerical simulations show that a 20% gain in sum capacity is achieved (for a small number of users) over conventional opportunistic space division multiple access, and a 100% gain (for a large number of users) over conventional opportunistic beamforming when the number of transmit antennas is four.     

基于有限反馈的MIMO系统自适应调制

该文利用信道的特征矢量,将MIMO高斯信道转化成混合信道,结合功率分配给出了自适应调制方案,使系统容量在发射功率和服务质量约束下达到最大。发射端所需的波束成形和功率分配等信息利用有限的比特反馈到发射端。仿真结果表明:在小信噪比的情况下,该自适应调制方案对系统容量有明显改善。     

Joint Optimization of User Set Selection and Transmit Power Allocation for Orthogonal Random Beamforming in Multiuser MIMO Systems

When the number of users is finite, the performance improvement of the orthogonal random beamforming (ORBF) scheme is limited in high signal‐to‐noise ratio regions. In this paper, to improve the performance of the ORBF scheme, the user set and transmit power allocation are jointly determined to maximize sum rate under the total transmit power constraint. First, the transmit power allocation problem is expressed as a function of a given user set. Based on this expression, the optimal user set with the maximum sum rate is determined. The suboptimal procedure is also presented to reduce the computational complexity, which separates the user set selection procedure and transmit power allocation procedure.     

一种动态子信道分配MIMO-OFDM波束成形系统的信号检测算法

基于动态子信道分配的MIMO-OFDM波束成形系统可以获得比传统系统更好的误码率性能。但由于处理或者反馈时延的影响,会使得发射机利用不准确的信道状态信息发射数据,从而在数据流之间引入干扰,导致系统性能下降。通过分析时延对系统的影响,该文提出了一种改进的检测算法:通过构建等效MIMO系统模型,采用最小均方误差MIMO检测算法抑制数据流之间的干扰,并利用等效MIMO信道矩阵的特征值分解白化噪声获得等效高斯信道模型,计算编码比特的对数似然比。仿真表明,该算法相对于现有算法有2.5～4 dB的性能增益。     

Optimal Beam Subset and User Selection for Orthogonal Random Beamforming

The throughput performance of orthogonal random beamforming (ORBF) with a finite number of users is limited due to the increasing amount of residual interference. In this letter, we find the optimal beam subset, the optimal user set, and the optimal number of random beams to maximize the sum throughput of the ORBF. The proposed scheme provides the best trade-off between the multiplexing gain and the multiuser interference by the determination of the optimal number of random beams as well as the beam selection diversity gain due to the selection of the optimal beam subset. In addition, two efficient suboptimal schemes are presented to reduce the computational complexity and the feedback overhead of the optimal method.     

Joint Optimization of Source Power Allocation and Relay Beamforming in Multiuser Cooperative Wireless Networks

Relay beamforming techniques have been shown to significantly enhance the sum capacity of a multiuser cooperative wireless network through the optimization of the relay weights, where concurrent communications of multiple source-destination pairs are achieved via spatial multiplexing. Further optimization of the transmit power allocation over the source nodes is expected to improve the network throughput as well. In this paper, we maximize the sum capacity of a multiuser cooperative wireless network through the joint optimization of power allocation among source nodes and relay beamforming weights across the relay nodes. We consider a two-hop cooperative wireless network, consisting of single-antenna nodes, in which multiple concurrent links are relayed by a number of cooperative nodes. When a large number of relay nodes are available, the channels of different source-destination pairs can be orthogonalized, yielding enhanced sum network capacity. Such cooperative advantage is particularly significant in high signal-to-noise ratio (SNR) regime, in which the capacity follows a logarithm law with the SNR, whereas exploiting spatial multiplexing of multiple links yields capacity increment linear to the number of users. However, the capacity performance is compromised when the input SNR is low and/or when the number of relay nodes is limited. Joint optimization of source power allocation and relay beamforming is important when the input SNR and/or the number of relay nodes are moderate or the wireless channels experience different channel variances. In these cases, joint optimization of source power and distributed beamforming weights achieves significant capacity increment over both source selection and equal source power spatial multiplexing schemes. With consideration of the needs to deliver data from each source node, we further examine the optimization of global sum capacity in the presence of individual capacity requirements by maximizing sum capacity of the network subject to a minimum capacity constraint over each individual user.     

时分双工系统波束赋形块长优化

提出了一种优化时分双工系统波束赋形块长的方案.在该系统中,由于上下行链路的信道互易性,基站可以通过上行导频估计出当前时刻的信道状态信息,从而计算出下一时刻的发射波束赋形向量或矩阵.当给定归一化导频开销时,不同的波束赋形块长对应不同的上行信道估计误差和上下行传输时延,进而导致不同的系统性能.以块平均后验信噪比为目标函数,...     

一种基于SIC-CDM的低复杂度混合波束赋形方案

为了平衡毫米波大规模多输入多输出系统的性能和硬件开销,降低系统功耗,以频谱效率为优化目标,在部分连接结构下提出了一种收发端联合设计的低复杂度混合波束赋形方案。首先,基于连续干扰消除将原始优化问题转化为多个子阵的速率优化问题;然后,利用坐标下降法完成模拟波束赋形矩阵设计;最后,引入等效信道矩阵大幅降低矩阵维度,再对其进行奇异值分解获得数字波束赋形矩阵。仿真结果表明,与其他算法相比,所提算法在系统功耗降低的同时保持了较优的性能,且性能逼近部分连接结构的最优方案。     

Adaptive resource allocation in multiuser OFDM systems with proportional rate constraints

Multiuser orthogonal frequency division multiplexing (MU-OFDM) is a promising technique for achieving high downlink capacities in future cellular and wireless local area network (LAN) systems. The sum capacity of MU-OFDM is maximized when each subchannel is assigned to the user with the best channel-to-noise ratio for that subchannel, with power subsequently distributed by water-filling. However, fairness among the users cannot generally be achieved with such a scheme. In this paper, a set of proportional fairness constraints is imposed to assure that each user can achieve a required data rate, as in a system with quality of service guarantees. Since the optimal solution to the constrained fairness problem is extremely computationally complex to obtain, a low-complexity suboptimal algorithm that separates subchannel allocation and power allocation is proposed. In the proposed algorithm, subchannel allocation is first performed by assuming an equal power distribution. An optimal power allocation algorithm then maximizes the sum capacity while maintaining proportional fairness. The proposed algorithm is shown to achieve about 95% of the optimal capacity in a two-user system, while reducing the complexity from exponential to linear in the number of subchannels. It is also shown that with the proposed resource allocation algorithm, the sum capacity is distributed more fairly and flexibly among users than the sum capacity maximization method.     

NOMA系统中利用共轭梯度法的功率分配方案

通过功率分配,5G通信的关键技术——非正交多址（NOMA）实现发射功率域的多用户复用,有效提高了频谱效率。不同的功率分配方案直接影响系统的吞吐量,针对NOMA下行链路现有功率分配算法存在的局部最优问题,提出了一种利用共轭梯度法的最优功率分配方案,采用共轭梯度法求解用户的加权和速率最大化的优化问题。现有理论证明,该方法可以收敛到全局最优解。仿真结果表明,该方法性能优于已有的固定功率分配（FPA）算法和分数阶发射功率分配（FTPA）算法,且此非正交多址（NOMA）系统性能明显优于正交多址（OMA）系统。      

Power allocation scheme based on sum capacity maximization for signal‐to‐leakage‐and‐noise ratio precoded multiuser multiple‐input single‐output downlink

This paper proposes a power allocation scheme to maximize the sum capacity of all users for signal‐to‐leakage‐and‐noise ratio (SLNR) precoded multiuser multiple‐input single‐output downlink. The designed scheme tries to explore the effect of the power allocation for the SLNR precoded multiuser multiple‐input single‐output system on sum capacity performance. This power allocation problem can be formulated as an optimization problem. With high signal‐to‐interference‐plus‐noise ratio assumption, it can be converted into a convex optimization problem through the geometric programming and hence can be solved efficiently. Because the assumption of high signal‐to‐interference‐plus‐noise ratio cannot be always satisfied in practice, we design a globally optimal solution algorithm based on a combination of branch and bound framework and convex relaxation techniques. Theoretically, the proposed scheme can provide optimal power allocation in sum capacity maximization. Then, we further propose a judgement‐decision algorithm to achieve a trade‐off between the optimality and computational complexity. The simulation results also show that, with the proposed scheme, the sum capacity of all the users can be improved compared with three existing power allocation schemes. Meanwhile, some meaningful conclusions about the effect of the further power allocation based on the SLNR precoding have been also acquired. The performance improvement of the maximum sum capacity power allocation scheme relates to the transmit antenna number and embodies different variation trends in allusion to the different equipped transmit antenna number as the signal‐to‐noise ratio (SNR) changes.Copyright © 2013 John Wiley & Sons, Ltd.     

Performance of Layered Steered Space–Time Codes in Wireless Systems

Layered Steered Space–Time Codes (LSSTC) is a recently proposed multiple-input multiple-output (MIMO) system that combines the benefits of vertical Bell Labs space–time (VBLAST) scheme, space–time block codes (STBC) and beamforming. In this paper, we derive the error performance and capacity of a single-user LSSTC system. The analysis is general enough to any layer ordering and modulation schemes used. In addition, the derived analysis is general for any LSSTC structure in which layers may have different number of antenna arrays and may be assigned power according to any power allocation. Furthermore, we analytically investigate the tradeoff between the main parameters of the LSSTC system, i.e., diversity, multiplexing and beamforming. Our results give recursive expressions for the probability of error for LSSTC which showed nearly perfect match to the simulation results. Results have also revealed the possibility of designing an adaptive system in which it was shown that combining beamforming, STBC, and VBLAST has better performance than VBLAST at high SNR range.     

下行链路广播信道能效优化鲁棒波束成形算法

针对多天线广播下行链路通信系统,研究了一种鲁棒能效联合波束成形和功率分配算法。首先,鲁棒能效优化问题描述为满足一定功率约束的系统和速率与系统消耗之比的最大化优化问题。其次,利用分数规划理论及用户速率与最小均方误差之间的关系,把所描述的分数规划优化问题转化成参数化多项式优化问题。然后,利用拉格朗日对偶及单调优化理论,提出了一种有效的鲁棒能效优化算法。数值仿真结果表明,相对于传统的非鲁棒能效优化算法,所提鲁棒能效优化算法可获得明显的能效性能增益。      

Joint Transmit Beamforming and Power Control for CDMA System

1　Introduction　Power control and beamforming are two main methods toreduce interference in CDMA cellular communication sys tem. In power control, the transmitters powers are constant ly adjusted when the instantaneous SIR is not equal to targetSIR, so that the quality of weak links is improved. Base sta tion equipped with antenna arrays may adjust their beam pat terns so that they have maximum gain towards the directionsof target mobiles and minimum gain towards the other direc tio…     

Graph‐based resource allocation algorithms for multiuser downlink MIMO‐OFDMA networks

Multiuser multiple‐input multiple‐output orthogonal frequency division multiple access (MIMO‐OFDMA) is considered as the practical method to attain the capacity promised by multiple antennas in the downlink direction. However, the joint calculation of precoding/beamforming and resource allocation required by the optimal algorithms is computationally prohibitive. This paper proposes computationally efficient resource allocation algorithms that can be invoked after the precoding and beamforming operations. To support stringent and diverse quality of service requirements, previous works have shown that the resource allocation algorithm must be able to guarantee a specific data rate to each user. The constraint matrix defined by the resource allocation problem with these data rate constraints provides a special structure that lends to efficient solution of the problem. On the basis of the standard graph theory and the Lagrangian relaxation, we develop an optimal resource allocation algorithm that exploits this structure to reduce the required execution time. Moreover, a lower‐complexity suboptimal algorithm is introduced. Extensive simulations are conducted to evaluate the computational and system‐level performance. It is shown that the proposed resource allocation algorithms attain the optimal solution at a much lower computational overhead compared with general‐purpose optimization algorithms used by previous MIMO‐OFDMA resource allocation approaches. Copyright © 2012 John Wiley & Sons, Ltd.     

Dynamic Cooperative Base Station Selection Scheme for Downlink CoMP in LTE-Advanced Networks

Coordinated Multi-Point (CoMP) transmission is a technique proposed to enhance the spectral efficiency and system throughput in an interference limited cellular networks. In CoMP joint processing (JP) scheme multiple base stations (BSs) are coordinately transmit data streams to each user. As more than two base stations are involved, abundant spatial resources are exploited and more backhaul spectrum for JP cooperation is required. The backhaul architecture for CoMP JP is crucial to provide low latency, unlimited capacity, less power consumption, and perfect synchronization among the BSs. However, satisfying all these constraints is impossible as the number of cooperative BSs increases for each user. In this paper, a dynamic cooperative base station selection scheme is proposed to reduce the backhaul load for CoMP user by selecting the appropriate number of coordinated BSs from the CoMP cluster to ensure the certain quality of service (QoS). In particular, for cell edge user the number of cooperative BSs per user has been selected in order to achieve reduced overhead and the allocation of backhaul capacity is performed under the max–min fairness criterion. Simulation results show that the proposed selection scheme achieves significant performance improvement than other transmission modes in terms of the average sum rate per backhaul use and minimal total power consumption.     

Achievable rate region with secrecy constraints for secure communication in two‐way relay networks

In this paper, we consider a two‐way relay network consisted of two sources and multiple relays in the presence of an eavesdropper, where the cooperative beamforming strategy is applied to exploit the cooperative diversity to support the secure communication as illustrated in Figure 1. Naturally, we are interested in the beamforming strategy and power allocation to maximize the achievable sum secrecy rate. However, the corresponding problem is equivalent to solve a product of three correlated generalized Rayleigh quotients problem and difficult to solve in general. Because of the openness of wireless medium, the information rate leakage to the eavesdropper cannot be canceled perfectly. To some extent, ‘almost perfect secrecy’, where the rate leakage to the eavesdropper is limited, is more interesting from the practical point of view. In this case, we concern ourself mainly the achievable rate region for general case where the rate at the eavesdropper is regarded as the measurement of secrecy level. Two beamforming approaches, optimal beamforming and null space beamforming, are applied to investigate the achievable rate region with total power constraint and the rate constraint at the eavesdropper, which can be obtained by solving a sequence of the weighted sum inverse‐signal‐to‐noise‐ratio minimization (WSISM) problem. Because of the non‐convexity of WSISM problem, an alternating iteration algorithm is proposed to optimize the relay beamforming vector and two sources' transmit power, where two subproblems need to be solved in each iteration. Meanwhile, we provide the convergence analysis of proposed algorithm. Through the numerical simulations, we verify the effectiveness of proposed algorithm. Copyright © 2013 John Wiley & Sons, Ltd.     

单频网多播系统中的开环半动态功率分配算法

在单频网多播传输中,传统的全反馈动态功率分配数算法需要根据每个时隙反馈的用户瞬时信道信息进行实时的调整,所以造成了资源分配频率快、上行反馈开销大的缺点。为了克服这个缺点,提出了一个低复杂度、没有用户反馈的单频网多播开环半动态功率分配算法。首先在各小区等功率分配的假设下,根据单频网的形状信息算出各小区等价信道增益,然后再根据这个增益值,实现满足速率需求情况下的各小区功率分配。仿真结果显示,与全反馈的动态功率分配算法相比,该算法以一小部分性能损失为代价,大大减少了单频网的上行反馈和资源分配的开销,因此更适用于实际的单频网多播系统。     

一种基于错误传播补偿的V—BLAST自适应比特和功率分配算法

本文探讨了V-BLAST系统在总发射功率受限和一定目标误码率要求的前提下,基于自适应调制时间块的比特、功率分配问题,分析和比较了系统在采用不同串行干扰抵消顺序时的抗信道时变性能和抗错误传播性能,找出了在BER和速率两方面性能最优的串行干扰抵消顺序。针对错误传播对系统BER性能的冲击,提出了一种新的基于错误传播补偿的V-BLAST自适应比特、功率分配方案。仿真结果表明,该方案能显著提高系统在时变信道下的BER性能,有效增大自适应调制块长度,减小反馈开销。     

基于动态反馈与功率分配的干扰对齐方法

在多用户MIMO系统中,信道状态的精确性严重影响干扰对齐技术的性能。该文针对信道状态信息(CSI)有限反馈导致的干扰泄露问题,提出一种基于动态反馈与功率分配的干扰对齐方法。首先从理论上分析了系统和速率与信道状态反馈比特分配和功率分配之间的关系,得到了在动态反馈和功率分配条件下系统和速率的解析表达式;在此基础上,以系统容量提升为目标,对反馈比特分配和功率分配优化问题进行建模;并根据信道的准静态特性利用库恩塔克条件(KKT)对该问题进行求解,得到功率和反馈比特分配方案。仿真结果表明,与单独考虑信道状态动态反馈条件下的干扰对齐技术相比,提出的方法能够有效减少干扰泄漏强度,提高系统和速率。