存在反馈延迟的短波MIMO预编码系统设计

利用基于码本的预编码MIMO技术去提升短波通信的空间分集增益,短波天波信道利用电离层的一次或多次反射进行远距离通信,信号传播延时较大,为了消除反馈延时对预编码MIMO系统性能的影响,文中基于Kalman滤波器提出一种信道估计与预测模型,自适应地跟踪短波时变信道,接着根据ITS短波时变信道模型提取信道时域特征,估计出预测模型参数,通过与传统无信道预测的预编码方案进行对比,方案能够有效降低反馈延迟对短波MIMO预编码系统性能的影响。     

一种MIMO时变信道下的低反馈量有限反馈预编码方法

本文提出了一种新颖的适用于MIMO时变信道环境的有限反馈预编码方法.该方法利用子空间跟踪算法自适应跟踪时变信道的发射预编码矩阵,同时结合Jacobi迭代算法有效降低了有限反馈预编码的反馈量.通过计算机仿真,该方法在ARI时变信道模型,以及更实际的Jake's时变信道模型下的跟踪性能得到很好的验证.在更低的反馈量下,该方法可以获得比传统的存在反馈延时的Grassmannian预编码方法更好的系统容量性能,而且该方法在相同的反馈量下,无论是收敛性能还是误码率性能都明显优于将Jacobi迭代算法直接应用于时变信道跟踪的预编码方法.     

一种前向放大中继通信系统中的有限反馈中继预编码方案

 本文首先给出了前向放大中继通信系统中,在给定QoS要求下的最优中继预编码矩阵的设计. 进而,针对实际通信系统中反馈信道带宽的限制,给出了一种有限反馈中继预编码码本的设计方案. 计算机仿真表明,本文所提新码本有限反馈中继预编码方案的系统性能随着反馈比特数的增加接近完全反馈下的系统性能,且在相同反馈比特数下的系统容量和误码率均明显优于将传统MIMO通信系统中的Grassmannian码本或随机码本直接应用于中继预编码的有限反馈方案.     

3D MIMO系统下水平和垂直维联合预编码的研究

第五代(5G)移动通信网络将会在很大程度上提高无线通信的速率。由于多入多出系统(MIMO)能够满足5G网络中对信息速率越来越高的要求,现在正受到广泛的关注。然而,传统意义的二维(2D)MIMO技术仅仅能控制水平维的波束。为了满足5G的需求,需要引入能同时考虑水平维和垂直维波束的三维(3D)MIMO技术。本文基于3D MIMO信道模型,在分析3D MIMO信道相关性的基础上,针对发射相关和接收相关矩阵在水平维和垂直维的分解,提出了一种利用3D MIMO信道相关性的有限反馈预编码方案。并在此基础上,结合2D MIMO信道下的DFT码本和Grassmannian码本,提出了两种新的3D MIMO信道下的码本。实验结果表明,提出的3D MIMO预编码方案整体性能优于传统2D MIMO和现有的3D MIMO预编码方案。在3D MIMO系统中,由于可以动态调节天线的下倾角,故充分发掘了空间三维自由度。3D MIMO预编码技术减小小区间干扰,增加了系统容量,有效地提高了整个通信系统的性能。      

基于码本的有限反馈非酉矩阵预编码多用户MIMO系统

该文提出了一种基于码本的有限反馈非酉矩阵预编码下行多用户MIMO系统。该方案根据用户反馈的信道信息SINR在发送端进行调度和预编码来提高系统容量。预编码的码本设计依据格拉斯曼空间装箱原理,并将码本中的向量按其相关性构成非酉矩阵来提高预编码增益和抑制多用户共道干扰。新方案反馈量少、复杂度低,在相同情况下比传统的单用户MIMO系统和基于码本的酉矩阵预编码多用户MIMO系统都具有更好的性能。     

基于Khatri-Rao矩阵积的有限反馈酉码本设计算法

针对有限反馈多输入多输出(MIMO)系统,提出了一种用于信道状态信息(CSI)量化的KRP(Khatri-RaoProduct)酉码本设计算法。该码本的设计中首先定义了一个相移键控(PSK)符号向量集合,随后在用PSK符号向量构造了一个准范德蒙矩阵的基础上,利用任意一个酉矩阵与准范德蒙矩阵作Khatri-Rao积来生成不同的酉码本矩阵。与现有的Grassmannian码本相比,提出的KRP码本在生成酉矩阵集合时无需进行最优搜索,复杂度大为降低。理论分析及仿真结果表明,KRP码本的最小弦距离恒大于零,而且采用KRP码本作为有限反馈预编码可使系统获得满天线分集,当反馈比特数相同时,KRP码本的性能优于Grassmannian码本。     

基于零向波束形成和旁瓣抑制的MIMO-OFDM系统码本设计

MIMO系统可提高通信系统的容量和频谱的利用率,支持高速数据传输,是下一代无线传输系统的关键技术。在MIMO系统中,当发射端已知信道状态信息时,利用有限反馈的预编码可提高系统的性能。已有的码本设计方法,有的实现较为复杂,有的受到信道的限制。根据零向准则波束形成器的原理,结合降低天线副瓣的方法,实现了一种MIMO—OFDM系统预编码码本的设计。将此码本用于MIMO—OFDM系统有限反馈的预编码中,经仿真结果验证了码本设计方法的有效性。该码本的设计复杂度低,具有较好的性能。     

空时相关MIMO信道下的空时联合Huffman有限反馈预编码

针对空时相关的MIMO信道,提出了一种新颖的Huffman空时联合有限反馈预编码方法,提高了系统性能,并减少了反馈量。从信道的空间相关性出发,推导了迫零准则下预编码的构成,从而设计了一种旋转量化码本,减小了空间相关性对系统性能的影响。另外,针对信道的时间相关性,利用基于邻域的有限反馈来降低慢衰落信道的反馈量。同时,由于领域内各码字被选中的概率不同,可以利用Huffman编码进一步减少反馈量。     

LTE系统下行预编码仿真研究

LTE技术相比3G通信技术有更快的传输速率,更小的延迟率,更大的带宽。LTE技术相比3G通信技术有更好的用户体验。主要研究LTE物理下行共享信道中的预编码技术,重点研究基于Grassmannian码本和DFT码本的预编码算法。通过MATLAB仿真平台实验对比发现,基于Grassmannian码本的预编码算法有更好的性能。     

LTE-A下行单用户MIMO增强技术研究

无线通信系统中,基站可以针对信道空间特性采用不同的下行传输模式获得空间复用增益和波束成形增益以提升系统性能。LTE-A中的下行单用户MIMO增强技术,采用了基于码本以及非码本的预编码技术优化性能,有必要分析其技术特点和增益来源以指导产品设计。分析了LTE-A中单用户MIMO技术演进的新特点,着重研究了新的双码本结构,在对信道属性匹配、码本搜索运算复杂度和UE上报载荷方面的改进。针对LTE-A预编码技术性能问题,通过计算机链路级仿真比较了LTE—A中基于码本以及非码本预编码技术的吞吐量性能,仿真结果表明码本技术较非码本技术具有一定优势。     

Quantized Principal Component Selection Precoding for Spatial Multiplexing with Limited Feedback

In this paper, for spatial multiplexing with limited feedback, a quantized principal component selection (QPCS) precoding scheme is proposed that achieves comparable capacity to the closed-loop multiple-input multiple-output (MIMO) and furthermore adapts to various fading channel conditions without any additional feedback bits and transmit channel state information (CSI). We propose a systematic design method for a codebook consisting of a finite number of unitary matrices based on a maximizing minimum distance criterion in the one- dimensional angular domain and show that the method outperforms the Grassmannian subspace packing method in various fading channel conditions. The proposed QPCS precoding scheme allows for adjustment of the precoding matrix based on limited feedback information on the principal vectors approximating a MIMO channel in the angular domain according to various channel conditions. Furthermore, for practical implementation of the QPCS precoding scheme, we propose a structured precoder optimization procedure and show that the proposed procedure induces a negligible capacity loss compared with the exhaustive precoder optimization, even with considerably reduced complexity.     

Limited feedback unitary precoding for orthogonal space-time block codes

Orthogonal space-time block codes (OSTBCs) are a class of easily decoded space-time codes that achieve full diversity order in Rayleigh fading channels. OSTBCs exist only for certain numbers of transmit antennas and do not provide array gain like diversity techniques that exploit transmit channel information. When channel state information is available at the transmitter, though, precoding the space-time codeword can be used to support different numbers of transmit antennas and to improve array gain. Unfortunately, transmitters in many wireless systems have no knowledge about current channel conditions. This motivates limited feedback precoding methods such as channel quantization or antenna subset selection. This paper investigates a limited feedback approach that uses a codebook of precoding matrices known a priori to both the transmitter and receiver. The receiver chooses a matrix from the codebook based on current channel conditions and conveys the optimal codebook matrix to the transmitter over an error-free, zero-delay feedback channel. A criterion for choosing the optimal precoding matrix in the codebook is proposed that relates directly to minimizing the probability of symbol error of the precoded system. Low average distortion codebooks are derived based on the optimal codeword selection criterion. The resulting design is found to relate to the famous applied mathematics problem of subspace packing in the Grassmann manifold. Codebooks designed by this method are proven to provide full diversity order in Rayleigh fading channels. Monte Carlo simulations show that limited feedback precoding performs better than antenna subset selection.     

Adaptive precoding and power allocation in distributed antenna systems with limited feedback

This paper introduces the limited feedback precoding into the distributed antenna system and proposes to adapt the predetermined orthogonal space time block codes to the available channel state information at the transmitter. The optimal representation of precoding information, namely the precoder, with least bits therefore becomes the key problem. Inspired by the characteristics of the distributed antenna system, we focus our work on the precoder construction, adaptable in response to the large and small scale fading, such that the symbol error probability is significantly reduced over that of a fixed, non‐adaptive, independent and identically distributed precoder codebook design. Furthermore, a suboptimal power‐loading strategy is presented by minimizing the derived tight upper bound on the average pairwise error probability of the precoded orthogonal space time block codes, which approaches the optimal performance asymptotically without additional channel knowledge other than the available feedback information. We prove that the proposed precoded orthogonal space time transmission scheme can achieve full diversity order. In particular, the robustness of our proposed transmission scheme to channel estimation error and feedback delay is respectively investigated in some detail, and numerical results show that it obviously improves the link reliability and obtains substantial gains even with few bits of feedback in comparison with conventional antenna selection scheme. Copyright © 2013 John Wiley & Sons, Ltd.     

Precoder Partitioning in Closed-loop MIMO Systems

We study unitary precoding for multistream MIMO systems with partial channel state information at the transmitter. We introduce a quantization scheme in which the full space of non-equivalent precoding matrices is partitioned into Grassmannian and orthogonalization parts. The Grassmannian part is used for maximizing the power after precoding and the orthogonalization part is used for removing cross talk between the data streams. We show that orthogonalization improves the attainable capacity when the receiver is linear. We give a parametrization for the non-equivalent orhogonalization matrices and a metric which measures the orthogonality of the transmission. Optimal orthogonalization codebooks for two-stream transmission are presented. When feedback is limited, the optimal partitioning of feedback bits between Grassmannian and orthogonalization parts becomes an issue. In correlated scenarios, the number of feedback bits may be significantly reduced by investing bits into the orthogonalization part.     

Novel Transmit Beamforming Schemes for Time-Selective Fading Multiantenna Systems

Transmit beamforming has been widely adopted for wireless systems with multiple transmit antennas. For a block fading channel, the Grassmannian beamformer has been shown to provide very good performance for finite rate feedback. However, the original Grassmannian beamformer does not take the time domain correlation of the channel fading into consideration. In this paper, based on a first-order autoregressive (AR1) dynamic fading model, we develop two new classes of beamforming algorithms that exploit the interframe correlations in the channel fading. We first introduce an algorithm based on a standard predictive vector quantization (PVQ) approach, and the resulting PVQ beamformer accomplishes superior power delivery at the receiver. However, the error performance of the PVQ beamformer is not satisfactory at high signal-to-noise ratios, and it also has a high implementation complexity. To resolve these issues, we then develop a novel successive beamforming (SBF) algorithm. The new SBF scheme uses the knowledge of the previous fading blocks to aid the beamforming codebook design of the current fading block. The beamforming codebook is constructed based on the successive partition of the surface of a spherical cap. The new SBF scheme accomplishes nearly the same performance as that of the PVQ beamformer, and it has a much simpler implementation. Through numerical simulations, we demonstrate that the proposed beamformers outperform the other previously proposed beamformers at various fading scenarios     

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.