A Simple and Efficient User-Scheduling Strategy for RUB-Based Multiuser MIMO Systems and Its Sum-Rate Analysis

We present a user-scheduling scheme for multiuser multiple-input–multiple-output (MIMO) systems with random unitary beamforming (RUB) in this paper. The new scheme, which is termed as adaptive beam activation based on the conditional best beam index feedback (ABA-CBBI), requires low average feedback load by imposing a feedback threshold on the users' signal-to-interference-plus-noise ratio (SINR) and suffers less multiuser interference by only activating those beams requested by at least one user. We derive the exact analytical expression for the sum-rate capacity of the resulting multiuser MIMO systems, based on which we examine the optimal selection of the feedback threshold in terms of sum-rate maximization. We demonstrate through selected numerical examples that the proposed ABA-CBBI scheme with optimal thresholds can achieve better sum-rate performance than existing schemes over high-signal-to-noise-ratio (SNR) regions.      

Sum-Rate Analysis of Downlink Channels with 1-Bit Feedback

The sum-rate capacity of a single-input single-output (SISO) downlink with Rayleigh flat fading channels and K users, grows as log log K when optimal scheduling is employed. However, the optimal scheduling requires that the full channel state information (CSI) for all users be available to the transmitter. In this work it is shown that the same rate growth holds even if the feedback rate from the users to the transmitter is reduced to 1-bit per fading block. A simple analysis for this setup is presented, resulting in a closed form expression for the achievable ergodic sum-rate. The mechanism of setting a sub-optimal threshold is elucidated by simple lower and upper bounds to the sum-rate. Among the insights afforded by the sum-rate expression and the bounds, is that application of the sub-optimal threshold demonstrates the same scaling law as the optimal full CSI scheme, asymptotically with the number of users K     

Threshold-based opportunistic scheduling for ergodic rate guarantees in wireless networks

In this paper, we propose an opportunistic downlink scheduling scheme that exploits multiuser diversity in a wireless network with threshold-based limited feedback. We assume that each user has its own ergodic rate requirement. The design objective of our scheme is to determine the values of thresholds with which heterogeneous ergodic rate requirements of all users are satisfied. In our analysis, we present a formula to check the feasibility of given ergodic rate requirements, and then obtain the feasible thresholds that realize them. We also obtain the optimal thresholds that maximize the ergodic sum-rate of the network while guaranteeing the ergodic rate requirements. Through numerical studies and simulations, we show the usefulness of our scheme and analysis.     

Feedback strategies for white Gaussian interference networks

A white Gaussian interference network is a channel with T transmitters and R receivers where the received symbols are linear combinations of the transmitted symbols and white Gaussian noise. This paper considers the case where K messages are transmitted through the network in a point-to-point manner, i.e., each message is encoded by exactly one transmitter and is destined for exactly one receiver. It is further assumed that feedback is available so that each transmitter sees the outputs of the receivers to which it is sending messages. Communication strategies based on the discrete Fourier transform (DFT) are developed that perform well for such networks. For multiple-access channels (K=T, R=1) with equal transmitter powers the strategies achieve the feedback sum-rate capacity if the powers are beyond some threshold. For the same channels with fixed transmitter powers and large K, the achievable sum-rate is approximately (log log K)/2 larger than the sum-rate capacity without feedback. For broadcast channels (T=1, K=R) with strong symmetries, the strategies achieve a monotonically increasing sum-rate with K. For interference channels (K=T=R) with strong interference, the strategies significantly enlarge the no-feedback capacity region by "correlation routing."     

Design of Multiuser Downlink Linear MIMO Precoding Systems With Quantized Feedback

We treat the problem of sum-rate maximization via scheduling and linear precoding in multiuser (MU) multiple-input–multiple-output (MIMO) systems with quantized feedback. We formulate the optimal quantized linear precoder design problem and provide the numerical procedure for finding the solution. We also provide a simple scheduling scheme that exploits the MU diversity gain. With the aim of sum-rate maximization, we further address the quantization codebook design based on the capacity measure by introducing a new distance metric. It is demonstrated that, with or without scheduling, the proposed optimal linear precoding scheme achieves significant gain over the conventional linear precoder designs with similar feedback overhead, such as the zero-forcing precoder. Moreover, although the proposed quantization codebook design improves the performance of other existing MU-MIMO precoding schemes, the performance gain offered by it is typically much higher when it is coupled with the proposed linear precoding design.      

Adaptive minimum bit feedback for sum-rate analysis in multi-user distributed antenna systems

The paper mainly studies the sum-rate performance of limited feedback (LFB) block-diagonalization (BD) in multi-user distributed antenna system (DAS). As the channel state information (CSI) fed back to base station (BS) is limited, multi-user interference (MUI) is caused inevitably because of the quantization error. Considering the influence of the MUI to the capacity of DAS, we propose a parameter of effective sum-rate ratio (ESRR) to denote the capacity offset under the condition of the BS can get perfect CSI and limited CSI first, then we confirm that the approximated ESRR is very close to actual ESRR got through simulations. After that, based on the approximated ESRR, an adaptive minimum bit feedback scheme which can effectively reduce the overhead of feedback channel and the complexity of the system is proposed. Simulation results show the effectiveness of the proposed scheme.     

Quantized feedback MIMO scheduling for heterogeneous broadcast networks

One-bit quantization of signal-to-interference-plus-noise ratio is discussed in literature for user scheduling in homogeneous network where users are assumed to have equal signal-to-noise ratio (SNR). It is mentioned in literature that 1-bit quantization with fixed quantization threshold does not achieve multiuser diversity. Moreover, the system sum-rate achieved by this lags significantly behind that of full feedback scheme. Two multi-bit quantized feedback scheduling schemes are proposed for broadcast network with heterogeneous users experiencing different channel statistics. It is presented that these two schemes with fixed optimum quantization thresholds profit from the diversity provided by independent and identically distributed channels. Moreover, proposed optimistic multi-bit quantized scheduling scheme achieves higher system sum-rate than the proposed multi-bit quantized scheme by addressing the limitations of the later one. The optimum quantization thresholds depend on the number of transmit antennas and system SNR. Moreover, these multi-bit quantized feedback scheduling schemes also ensure user fairness. Simulation results are presented to support the numerical analysis.     

Differentiated rate scheduling for the down-link of cellular systems

We consider the problem of differentiated rate scheduling for the downlink (i.e., multi-antenna broadcast channel), in the sense that the rates required by different users must satisfy certain constraints on their ratios. When full channel state information (CSI) is available at the transmitter and receivers, the problem can be readily solved using dirty paper coding (DPC) and the application of convex optimization techniques on the dual problem which is the multiple access channel (MAC). Since in many practical application full CSI may not be feasible and computational complexity prohibitive when the number of users is large, we focus on other simple schemes that require very little CSI: time-division opportunistic (TO) beamforming where in different time slots (of different lengths) the transmitter performs opportunistic beamforming to the users requiring the same rate, and weighted opportunistic (WO) beamforming where the random beams are assigned to those users having the largest weighted SINR. For single antenna systems we also look at the capacity-achieving superposition coding (SC) scheme. In all cases, we determine explicit schedules to guarantee the rate constraints and show that, in the limit of large number of users, the throughput loss compared to the unconstrained throughput (sum-rate capacity) tends to zero. We further provide bounds on the rate of convergence of the sum-rates of these schemes to the sum-rate capacity. Finally, we provide simulation results of the performance of different scheduling schemes considered in the paper.     

On the Fading-Paper Achievable Region of the Fading MIMO Broadcast Channel

We consider transmission over the ergodic fading multiple-antenna broadcast (MIMO-BC) channel with partial channel state information at the transmitter and full information at the receiver. Over the equivalent non-fading channel, capacity has recently been shown to be achievable using transmission schemes that were designed for the "dirty paper" channel. We focus on a similar "fading paper" model. The evaluation of the fading paper capacity is difficult to obtain. We confine ourselves to the linear-assignment capacity, which we define, and use convex analysis methods to prove that its maximizing distribution is Gaussian. We compare our fading-paper transmission to an application of dirty paper coding that ignores the partial state information and assumes the channel is fixed at the average fade. We show that a gain is easily achieved by appropriately exploiting the information. We also consider a cooperative upper bound on the sum-rate capacity as suggested by Sato. We present a numeric example that indicates that our scheme is capable of realizing much of this upper bound.     

Opportunistic feedback with multiple classes in wireless systems

An opportunistic feedback protocol with multiple access probabilities is proposed, where users are divided into several classes according to their measured channel state. Different random access probabilities are assigned to each class. All users compete to send a feedback message through random access if their scheduling metric exceeds a threshold. An analytical model is developed for evaluating the proposed feedback protocol in terms of the sum-rate capacity and the feedback load. The proposed feedback protocol achieves an asymptotic sum-rate capacity with a minimal amount of feedback information.     

Two-way中继系统协作节点选择及功率分配策略

为了提高Two-way中继系统总速率,该文提出了一种Two-way AF中继系统的双向中继选择(BRS)策略,该策略通过联合考虑中继节点处的接收信噪比和中继节点到目的节点间的信道增益,实现了最优中继选择。进一步,在最优中继基础上提出了Two-way中继系统两种优化功率分配策略：(1)基于凸优化的功率分配策略(OPA-CO);(2)基于信道增益差异的优化功率分配策略(OPA-DCG)。方案(1)提出了总功率受限的条件下最大化Two-way中继系统总速率的优化模型;方案(2)通过考虑链路之间信道增益的不同,提出了一种速率增量最大化的数学优化模型,为降低求解凸优化模型的复杂度,采用一种迭代功率分配算法求解上述优化模型。仿真结果证明两种策略均能提高系统总速率。     

Some results on the sum-rate capacity of MIMO fading broadcast channels

We study the ergodic sum-rate capacity of the fading MIMO broadcast channel which is used to model the downlink of a cellular system with N/sub t/ transmit antennas at the,base and K mobile users each having N/sub r/ receive antennas. Assuming perfect channel state information (CSI) for all users is available at the transmitter and the receivers, we evaluate the sum-rate capacity numerically using the duality between uplink and downlink. Assuming Nt K, we also derive both upper and lower bounds on the sum-rate capacity to study its increase rate due to multi-user diversity. Finally, we compare three transmission schemes which use the single-user-MIMO scheme (SU-MIMO), ranked known interference (RKI) and zero-forcing beamforming (ZFB), respectively, to transmit to a selected set of users in order to approach the sum-rate capacity. We show that both ZFB and RKI outperform SU-MIMO in a cellular downlink scenario. when many mobile users are present.     

双向中继信道的模拟网络编码最优功率分配

在双向信息非对称条件下,研究了基于模拟网络编码的双向中继信道中的最优功率分配问题。分别给出了中断概率最小化、和速率最大化意义下的最优功率分配闭式数学表达式,并证明了两种约束下最优功率分配问题的统一性。分析表明:现有的基于模拟网络编码的双向中继信道中的最优功率分配方法是本文提出方法在某些条件下的特例。计算机仿真分析证明了提出的最优功率分配方法在中断概率和和速率性能方面均优于平均功率分配方法。      

Exploiting spatial correlation in distributed MIMO networks

Distributed-Multiple Input Multiple Output (D-MIMO) communication systems consist an attractive solution for networks with increased capacity demands. In these systems, the required information that needs to be exchanged among the network elements increases the data overhead and hence decreases the effective sum-rate (or throughput). Recently, it was shown that the total required overhead for D-MIMO networks can be reduced through its partitioning into smaller orthogonal D-MIMO segments. In this paper, a new scheme is proposed for further improving the effective sum-rate of D-MIMO networks by means of exploiting the spatial channels correlation within the D-MIMO network. Such effects can be observed in dense networks and the scope of the proposed correlation exploitation techniques is to avoid sending redundant feedback information. Numerical results indicate that important savings can be achieved when this novel method is applied under different wireless environments.     

Distributed Space-Time Coding in LTE Systems

Relay is considered as one of the candidate key technologies of LTE-advanced for it brings broader cell coverage and higher system capacity.Distributed Space-Time Coding (DSTC) not only exploits the spatial diversity from the relay structure,but also brings some coding gains.According to the performances of existing DSTC schemes,the Demodulate-and-Forward (DMF) scheme is the best candidate for DSTC in LTE-Advanced system.Moreover,a threshold-based selective relaying scheme for DSTC is proposed to solve the ...     

Improved Multiuser MIMO Unitary Precoding Using Partial Channel State Information and Insights from the Riemannian Manifold

Multiple-input multiple-output (MIMO) systems can be leveraged to increase capacity in fading channels. Especially in multiuser downlink communication systems, it has been shown that knowledge of channel state information at the transmitter (CSIT) is critical to leverage the capacity gain available from multiple antennas. When duplexing is performed using time division, CSIT can often be successfully obtained when channel reciprocity is available. CSIT acquisition, however, is much more difficult in frequency division duplexing. Sending feedback on the uplink has been shown to be a powerful technique to improve downlink performance in single user MIMO systems. The basic idea is to restrict the CSIT to a B bit codebook so that the mobiles can easily transmit these bits on the uplink. In this paper, we consider the multiuser downlink model with unitary precoding when there is a codebook consisting of 2^B unitary matrices that the precoder is restricted to lie in. This codebook is designed offline and known to both the basestation and all users. Each user sends back signal-to-interference plus noise ratio (SINR) information along with binary feedback about the unitary precoder. Based on the CSIT received on the uplink, the basestation selects one of the unitary matrices in the codebook to maximize the sum-rate. For this set-up, we first analyze the sum-rate performance of the unitary precoding scheme. We then show that the codebook of unitary precoders represents a collection of points in a special kind of manifold and show how the achievable sum-rate performance relates to the minimum distance of the codebook points in this space. Finally, we present a framework for constructing the codebook to maximize this minimum distance. Monte Carlo simulation results are presented to show the sum-rate performance of the proposed codebook design.     

LTE系统中的分布式空时中继技术

中继技术作为LTE-Advanced系统的关键候选技术可为小区带来更大的覆盖范围和系统容量。分布式空时中继技术不仅可以充分利用中继技术带来的空间分集,又可以引入部分编码增益,是中继技术中最直接的应用技术。比较目前提出的分布式空时中继方案,得出基于解调-转发方式的空时中继编码方案最适合LTE—Advanced系统的方案。同时,针对解调-转发方式中存在的错误传递问题,提出基于门限的选择性空时中继方案,该方案以很小的系统复杂度换取了优异的性能增益。     

Average power allocation based sum-rate optimization in massive MIMO systems

This paper exploits variations in the average channel gains in multi-cell multi-user massive multiple input multiple output (MIMO) systems. An average transmit power-control-based sum-rate optimization scheme is presented for the uplink of the system. The matched filtering (MF) and the zero forcing (ZF) processors are considered with perfect and imperfect channel state information at receiver (CSIR) under frequency flat Rayleigh fading channel. An average power-control-based system model is constructed for analyzing the sum-rate and formulating an optimization problem. A discrete level combinatorial optimization is performed for MF and ZF sum-rate under perfect and imperfect CSIR. The numerical results show a significant improvement in the sum-rate and power consumption. A low complexity algorithm for numerical optimization of the sum-rate is proposed. The performance of algorithm is quantified with different scenarios including different number of users, macro cells, and micro cells with low and high inter-cell interference powers. The evaluation results show that the improvement in sum-rate and energy efficiency increases with inter-cell interference power and the number of MTs.     

毫米波大规模MIMO系统中基于机器学习的自适应连接混合预编码

毫米波大规模MIMO系统混合预编码是提升无线通信系统容量和降低射频链使用数量的关键技术之一,但是仍然需要大量高精度的相移器实现阵列增益。为了解决这个问题,本文中,首先通过最大化每个用户的接收信号功率,得到自适应连接结构中射频链与基站天线匹配关系,然后创新地把基于机器学习的自适应交叉熵优化方法应用于1比特量化相移的自适应连接混合预编码器中。通过减小交叉熵和加入常数平滑参数保证收敛,自适应地更新概率分布以得到几乎最优的混合预编码器。最后,仿真验证了所提方案的可行性以及具有满意的可达和速率,与其他相同硬件复杂度的混合预编码方案相比具有更优的可达和速率性能。     

AF双向中继网络中一种新的中继选择算法

通过高信噪比条件下AF双向中继网络总速率的近似表达,给出了链路增益乘积和系统总速率之间的关系式。基于此关系式提出一种最大化链路增益乘积中继选择算法(Maximum Relay Selection,MRS),在中继处引入门限,将链路质量超过门限的中继选出建立可靠候选集。在建立的可靠候选集中以两跳链路增益乘积最大化为标准,实现最佳中继选择。通过仿真将该中继选择算法与现有AF双向中继网络3种不同中继选择算法进行性能比较。仿真结果表明,该中继选择算法能在同时保证AF双向中继网络两跳链路质量的前提下,提高系统的总速率。