基于不同调度算法的多用户分集MIMO中继信道容量分析

采用平均容量性能来定量分析多用户分集多输入多输出(MIMO)中继信道,中继节点使用放大转发(Amplify-and-forward,AF)协议将接收到的源节点的发送信号重发给目的节点.研究了多用户MIMO中继信道的不同调度算法,即容量公平、最大特征根、最小特征根调度策略和空间独立性调度算法,结果表明空间独立性调度算法有...     

Rayleigh环境下MIMO系统容量分析

研究了多输入多输出(MIMO)系统Rayleigh衰落信道矩阵的特征值以及天线空间相关性对信道容量的影响.Monte-Carlo数值仿真结果表明:MIMO系统能极大提高Rayleigh衰落环境中的系统容量,且容量随最小收发天线数目的增加而线性增加,但由于相关性对信道矩阵特征值及其统计分布的影响较大,因此可导致MIMO系统容量的损失.     

基于天线选择的低秩信道MIMO系统容量研究

最近的研究表明,在衰落信道多天线MIMO系统的容量随发射天线数线性增加.而对于低散射环境,即使信号经历独立的衰落,信道秩的降低也会严重影响系统容量的增加.对于这种低秩环境,选择天线发射或接收可以有效地降低系统的成本.本文研究了天线选择对低秩信道MIMO系统容量的影响.仿真结果表明,对不同的信道条件,适当选择天线发射不仅可以增加信道容量,而且可以降低系统的复杂度和射频成本.适当选择天线接收,在不严重降低系统容量的前提下,也达到了降低系统成本的目的.     

一种分布式多入多出(MIMO)信道的容量研究

分布式MIMO系统结合了点对点MIMO信道与分布式天线系统两者的特点，能改善链路的质量，提高覆盖面积。本文提出了一种包含路径损耗、阴影衰落与小尺度衰落的分布式MIMO信道模型，分析推导了采用该模型时的分布式MIMO信道容量。通过计算机仿真，研究分析了阴影衰落、Rice信道因子K等因素对分布式MIMO上行信道容量的影响，得出了分布式MIMO信道容量空间分布的特点。     

Outage Capacity of MIMO Poisson Fading Channels

The information outage probability of a shot-noise limited direct detection multiple-input–multiple-output (MIMO) optical channel subject to block fading is considered. Information is transmitted over this channel by modulating the intensity of a number of optical signals, one corresponding to each transmit aperture, and individual photon arrivals are observed at multiple receive photodetector apertures. The transmitted signals undergo multiplicative fading. The fading occurs in coherence intervals of fixed duration in each of which the channel fade matrix remains constant, and changes across successive such intervals in an independent and identically distributed fashion. The transmitter and the receiver are assumed to be provided with perfect channel state information (CSI). An optimization formulation for the outage probability problem is outlined and an exact characterization of the optimal average conditional duty cycles is provided.      

相关信道下MIMO信道容量优化算法的研究

该文研究MIMO系统收发端天线采用均匀线阵且放置空间有限,存在相关衰落时信道容量的优化方法。采用规范化信道模型,分析了信道相关性对平均信道容量和最优信号协方差矩阵的影响,推导了最优协方差矩阵的一阶条件;利用Jensen's不等式确定了信道容量的上界,给出了闭式解,并对相关信道下信号的传输模式进行了讨论。仿真结果表明,采用该优化方法,在各种SNR下,其平均容量接近Jensen's上界;得出信道相关程度对信道平均容量的影响依赖于信噪比的结论。     

Sum Capacity of Multiuser MIMO Broadcast Channels with Block Diagonalization

The sum capacity of a Gaussian broadcast MIMO channel can be achieved with dirty paper coding (DPC). However, algorithms that approach the DPC sum capacity do not appear viable in the forseeable future, which motivates lower complexity interference suppression techniques. Block diagonalization (BD) is a linear preceding technique for downlink multiuser MIMO systems. With perfect channel knowledge at the transmitter, BD can eliminate other users' interference at each receiver. In this paper, we study the sum capacity of BD with and without receive antenna selection. We analytically compare BD without receive antenna selection to DPC for a set of given channels. It is shown that (1) if the user channels are orthogonal to each other, then BD achieves the same sum capacity as DPC; (2) if the user channels lie in the same subspace, then the gain of DPC over BD can be upper bounded by the minimum of the number of transmit and receive antennas. These observations also hold for BD with receive antenna selection. Further, we study the ergodic sum capacity of BD with and without receive antenna selection in a Rayleigh fading channel. Simulations show that BD can achieve a significant part of the total throughput of DPC. An upper bound on the ergodic sum capacity gain of DPC over BD is proposed for easy estimation of the gap between the sum capacity of DPC and BD without receive antenna selection.     

Capacity Analysis for Continuous Alphabet Channels With Side Information, Part II: MIMO Channels

In this second part of our two-part paper, we consider the capacity analysis for wireless mobile systems with multiple-antenna architectures. We apply the results of the first part to a commonly known baseband, discrete-time multiple-antenna system where both the transmitter and receiver know the channel's statistical law. We analyze the capacity for additive white Gaussian noise (AWGN) channels, fading channels with full channel state information (CSI) at the receiver, fading channels with no CSI, and fading channels with partial CSI at the receiver. For each type of channels, we study the capacity value as well as issues such as the existence, uniqueness, and characterization of the capacity-achieving measures for different types of moment constraints. The results are applicable to both Rayleigh and Rician fading channels in the presence of arbitrary line-of-sight and correlation profiles.     

一种选择最大多用户分集MIMO信道调度方法及性能分析

提出了一种选择最大多用户分集MIMO信道调度方法,能在不降低性能的基础上减少反馈负载：每个用户将最大的信干噪比值与设定的门限比较,只有大于门限的值及对应的发射天线序号返回给基站,基站分配独立的信道给最大信干噪比用户。给出了所提方案的系统平均容量和反馈负载量的分析,仿真结果与分析一致。     

On the Outage Capacity of Correlated Multiple-Path MIMO Channels

The use of multiple-antenna arrays can dramatically increase the throughput of wireless communication systems. Thus, it is important to characterize the statistics of the mutual information for realistic correlated channels. Here, a mathematical approach is presented, using the method of replicas, that provides analytic expressions not only for the average, but also for the higher moments of the distribution of the mutual information for the most general zero-mean Gaussian multiple-input multiple-output (MIMO) channels when the channel is known at the receiver. These channels include multitap delay paths, and channels with covariance matrices that cannot be written as a Kronecker product, such as general dual-polarized correlated antenna arrays. This approach is formally valid for large antenna numbers, in which case all cumulant moments of the distribution, other than the first two, scale to zero. In addition, it is shown that the replica-symmetric result is valid if the variance of the mutual information is positive and finite. In this case, it is shown that the distribution of the mutual information tends to a Gaussian, which enables the calculation of the outage capacity. These results are quite accurate even for few antennas, which makes this approach applicable to realistic situations.     

Asymptotic Ergodic Capacity of Multidimensional Vector-Sensor Array MIMO Channels

We analyze asymptotic ergodic capacity of multidimensional vector-sensor array MIMO (PMD-MIMO) channels established by the use of dual-polarized antennas in the form of 1D, 2D and/or 3D MIMO arrays. Based on the identification of the decomposition of PMD-MIMO channels into multiple independently-fading and scaled classical MIMO channels in parallel, we consequently derive corresponding asymptotic ergodic capacities analytically via tools out of free probability theory. The analysis of derived asymptotic ergodic capacity expressions in terms of antenna locus aspect ratio ?, average symbol SNR per antenna ˉ?s and cross-polar discrimination XPD as well as comparison with asymptotic ergodic capacity of classical MIMO channels present important gains in using compact multidimensional vector-sensor array MIMO systems in asymptotic regimes.     

MIMO-OFDM系统无线衰落信道容量分析

推导了MIMO-OFDM系统在衰落信道下的各态历经容量、最优发送策略、使用等功率分配时的容量上界以及相对于单天线OFDM系统的容量增益。结果表明：天线数和平均接收信噪比是决定MIMO-OFDM系统信道容量的关键因素。天线数越多或者接收信噪比越大,信道的容量越大,信道容量几乎不受多径时延扩展的影响。慢衰落信道下的最大信道容量可以使用空-频两维注水算法得到,当接收信噪比足够大时,最大信道容量也可以用平均分配发送功率的方法逼近。     

QoS‐Guaranteed Multiuser Scheduling in MIMO Broadcast Channels

This paper proposes a new multiuser scheduling algorithm that can simultaneously support a variety of different quality‐of‐service (QoS) user groups while satisfying fairness among users in the same QoS group in MIMO broadcast channels. Toward this goal, the proposed algorithm consists of two parts: a QoS‐aware fair (QF) scheduling within a QoS group and an antenna trade‐off scheme between different QoS groups. The proposed QF scheduling algorithm finds a user set from a certain QoS group which can satisfy the fairness among users in terms of throughput or delay. The antenna trade‐off scheme can minimize the QoS violations of a higher priority user group by trading off the number of transmit antennas allocated to different QoS groups. Numerical results demonstrate that the proposed QF scheduling method satisfies different types of fairness among users and can adjust the degree of fairness among them. The antenna trade‐off scheme combined with QF scheduling can improve the probability of QoS‐guaranteed transmission when supporting different QoS groups.     

General Capacity Bounds for Spatially Correlated Rician MIMO Channels

This paper considers the capacity of spatially correlated Rician multiple-input multiple-output (MIMO) channels. We consider the general case with double-sided correlation and arbitrary rank channel means. We derive tight upper and lower bounds on the ergodic capacity. In the particular cases when the numbers of transmit and receive antennas are equal, or when the correlation is single sided, we derive more specific bounds which are computationally efficient. The bounds are shown to reduce to known results in cases of independent and identically distributed (i.i.d.) and correlated Rayleigh MIMO channels. We also analyze the outage characteristics of the correlated Rician MIMO channels at high signal-to-noise ratio (SNR). We derive the mean and variance of the mutual information and show that it is well approximated by a Gaussian distribution. Finally, we present numerical results which show the effect of the antenna configuration, correlation level (angle spreads), Rician$K$-factor, and the geometry of the dominant Rician paths.     

Simulation Models for Investigation of Multiuser Scheduling in MIMO Broadcast Channels

Spatial correlation is a result of insufficient antenna spacing among multiple antenna elements, while temporal correlation is caused by Doppler spread. This paper compares the effect of spatial and temporal correlation in order to investigate the performance of multiuser scheduling algorithms in multiple‐input multiple‐output (MIMO) broadcast channels. This comparison includes the effect on the ergodic capacity, on fairness among users, and on the sum‐rate capacity of a multiuser scheduling algorithm utilizing statistical channel state information in spatio‐temporally correlated MIMO broadcast channels. Numerical results demonstrate that temporal correlation is more meaningful than spatial correlation in view of the multiuser scheduling algorithm in MIMO broadcast channels. Indeed, the multiuser scheduling algorithm can reduce the effect of the Doppler spread if it exploits the information of temporal correlation appropriately. However, the effect of spatial correlation can be minimized if the antenna spacing is sufficient in rich scattering MIMO channels regardless of the multiuser scheduling algorithm used.     

Capacity of MI MO LAS-CDMA System Under Correlating Multi-Path Fading Channels

1IntroductionMI MOtechnology has emerged as a key method toachieve high spectral and power efficiency in wirelesscommunications .By the work of E. Telatar and Fosi-chini[1 ~6]et al .,the capacity of aMtransmite anten-nas andNreceive antennas systemcan be min( M,N)ti mes that of a single antenna system,that is to say ca-pacity canincreaselinealy with minumof the number ofantennas at transmiter and receiver .In order to encounter multi-paths fading,capacity oftraditional BLAST-CDMAis res…     

Capacity/Throughput Optimization for H-BLAST with SC Receiver over MIMO Channels

Among various Bell Labs layered space-time (BLAST) architectures over multiple input multiple output (MIMO) channels, we focus on the horizontal BLAST (H- BLAST) transmission scheme as it can achieve the channel capacity with a simple receiver, namely the successive cancellation (SC) receiver. The power optimization across layers is considered with a short-term power constraint. In addition, for block- fading channels, the rate optimization across layers is studied to maximize the throughput when the instantaneous channel state information (CSI) is not available. Since the CSI is not available, the rates can be greater than the instantaneous channel capacity and error propagation in the SC receiver is inevitable. Thus, the rate optimization plays a key role in reducing the chance of error propagation to maximize the throughput. It is shown that the optimal rates can be obtained recursively and each optimization can be carried out by a one-dimensional search.     

On the Ergodic Capacity of Rank-1 Ricean-Fading MIMO Channels

This paper investigates the ergodic capacity of Ricean-fading multiple-input-multiple-output (MIMO) channels with rank-1 mean matrices under the assumption that the channel is unknown at the transmitter and perfectly known at the receiver. After introducing the system model and the concept of ergodic capacity of MIMO channels, we derive the explicit expressions for the expected values of the determinant and log-determinant of complex noncentral Wishart matrices. Subsequently, we obtain new upper and lower bounds on the ergodic capacity of rank-1 Ricean-fading MIMO channels at any signal-to-noise ratio (SNR). We show that our bounds are tighter than previously reported analytical bounds, and discuss the impact of spatial fading correlation and Ricean K-factor with the help of these bounds. Furthermore, we extend the analysis of ergodic capacity to frequency selective spatially correlated Ricean-fading MIMO channels. We demonstrate that the calculation of ergodic capacity of frequency selective fading MIMO channels can be converted to the calculation of the one of equivalent frequency flat-fading MIMO channels. Finally, we present numerical results that confirm the theoretical analysis     

Adaptive MIMO Transmission for Exploiting the Capacity of Spatially Correlated Channels

We consider a novel low-complexity adaptive multiple-input multiple-output (MIMO) transmission technique. The approach is based on switching between low-complexity transmission schemes, including statistical beamforming, double space-time transmit diversity, and spatial multiplexing, depending on the changing channel statistics, as a practical means of approaching the spatially correlated MIMO channel capacity. We first derive new ergodic capacity expressions for each MIMO transmission scheme in spatially correlated channels. Based on these results, we demonstrate that adaptive switching between MIMO schemes yields significant capacity gains over fixed transmission schemes. We also derive accurate analytical approximations for the optimal signal-to-noise-ratio switching thresholds, which correspond to the crossing-points of the capacity curves. These thresholds are shown to vary, depending on the spatial correlation, and are used to identify key switching parameters. Finally, we propose a practical switching algorithm that is shown to yield significant spectral efficiency improvements over nonadaptive schemes for typical channel scenarios