Rician衰落信道下空时分组码的性能分析

基于Alamouti提出的BPSK调制下空时分组码在Rayleigh衰落信道中的码性能原理,推导出高阶(M ary)调制下Rician衰落信道中空时分组码的符号差错率的最小距离球界,并进行计算机仿真分析了两信道下引入空时分组码的多天线系统中发射和接收天线的分集增益,发射天线数量的“地板效应”以及Rician因子K对符号差错性能的影响。     

多天线对角空频编码传输

将平坦衰落信道的对角代数空时码(DAST)推广到频率选择性衰落信道,提出了对角空频分组码(DSF).基于多输入多输出天线和正交频分复用(OFDM),DSF码将满秩的旋转信号星座和子载波分组结合起来,以对角发送方式(每时刻只有一个天线发射)发射旋转信息符号向量的每个分量.成对错误概率分析表明:在频率选择性信道中,通过选择最佳的旋转矩阵,这种DSF-OFDM系统能实现满分集增益和最大的编码增益.系统采用了球型解码器对DSF码实施最大似然解码,它的解码复杂性是中等的,并且,解码算法的复杂性与信号星座的维数无关.此外,和先前所提出的一些方法相比,提出的空频码还具有频谱效率高(1symbol/s/Hz)的性能特点.     

空时码在Nakagami衰落信道下性能分析

基于Alamouti提出的BPSK调制下空时分组码在Rayleigh衰落信道中的简单分集方案。推导出多发射和多接收天线系统中正交空时分组码在Nakagami衰落信道的BPSK调制下的比特差错率的最小距离球界,并推广到在高阶调制下衰落信道中系统符号差错率的性能。仿真分析和比较了空时分组码的多天线系统中发射和接收天线分集增益,以及信道相关参数的变化对系统误比特性能的影响。     

相关衰落信道下闭环发射分集方案的性能分析

未来移动通信系统采用的关键技术之一是发射分集技术，如WCDMA标准中采用了一种称作闭环发射分集的方案，用于下行信道传输。闭环发射分集方案使用了前向信道的相位与幅度的部分信息来选择天线的加权系数，在信道时变速率较小时，闭环发射分集的性能优于开环发射分集方案。在一般情况下，假设两个发射天线之间距离足够大，各个发射天线到接收天线的信道是不相关的，在基站这种假设是合理的。但如果在上行信道传输中(移动台到基站)应用闭环发射分集技术时，天线之间不相关的假设很难满足。本文基于对移动台配置多天线并应用闭环发射分集技术的考虑，研究在相关瑞利衰落信道下闭环发射分集技术的性能。蒙特卡罗仿真给出了不同相关系数下的性能曲线，并得出一个具有指导意义的结论。     

相关瑞利信道下的分集与复用折衷

多天线可以用来增加通信系统的分集增益或者复用增益，二者之间存在着基本的折衷关系。相关瑞利信道的折衷性能差于i．i．d瑞利衰落信道，并且相关矩阵降秩时，折衷性能进一步下降。本文给出了相关瑞利信道下分集增益和复用增益的最优折衷关系。     

一种基于OFDM的空频码的设计

提出了一种基于OFDM达到最大可达分集增益的空频码设计方案。该编码利用正交频分复用把频率选择性衰落信道变换成平衰落信道的特性，同时引入了基于多天线的空间分集和基于时延扩展的频率分集，比空时编码具有更高的分集增益。     

正交空时分组码在瑞利衰落信道中的性能估计

根据Alamouti最大似然译码方法，给出了在正交空时分组码传输的衰落信道条件下接收机输出瞬时信噪比的一般表达式，分析了瑞利衰落信道条件下引入正交空时分组码的多天线系统的符号差错性能，研究表明采用正交空时码传输信号，增加发送天线数量和接收天线数量都可以得到更大的分集增益；在接受天线数量一定的情况下，增加发送天线的数量可以带来更大的分集增益，但当发送天线数量增加到一定程度后，再增加发送天线数量就不能带来明显的分集改善了。     

一种天线分集的多载波CDMA上行链路方案

多载波系统能克服多径信道频率选择性的影响，而应用多天线发射和接收能获得分集增益。本文提出了一种两天线发、多天线收的多载波CDMA上行链路系统方案。在发射端，空时块码被用来进行发射分集。对于多载波CDMA上行链路系统，不同的用户的信号经历了不同的多径衰落，信号间的正交性不再能够保持。本文提出了一种接收机方案，并讨论了几种联合检测方法来恢复所有用户在两个编码时刻发送的信息符号，并给出计算机仿真结果。     

瑞利衰落信道采用组合发射机SC/接收机 MRC的MQAM性能分析

日益增长的无线业务需求要求提高衰落信道上无线通信的频谱利用率.本文研究一种使用组合发射机SC/接收机MRC(SC/MRC)的MQAM方案,推导其在平坦瑞利衰落信道上的误符号率,分析无线信道时变特性对系统性能的影响.数值计算结果表明该组合空间分集方案可以通过调整发射天线和接收天线的数目来获得比传统接收机分集接收更大的分集增益.     

基于天线子集选择算法的DSTBC优化

为进一步提高空时码性能,在信道模型为瑞丽和莱斯慢衰落信道的情况下,文中提出了一种优化差分空时分组码的＂天线子集选择算法＂——假设发射信号为特定的Alamouti正交空时分组码,通过最大化信道参数矩阵F范数的方法,优化了MIMO系统的天线集。仿真结果表明：此方法可降低码元的比特错误率,并且可获得相当客观的分集增益和能量增益。此外,还讨论了该优化方法的适用范围。     

Space-time codes for high data rate wireless communication:performance criterion and code construction

We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit antennas. The received signal at each receive antenna is a linear superposition of the n transmitted signals perturbed by noise. We derive performance criteria for designing such codes under the assumption that the fading is slow and frequency nonselective. Performance is shown to be determined by matrices constructed from pairs of distinct code sequences. The minimum rank among these matrices quantifies the diversity gain, while the minimum determinant of these matrices quantifies the coding gain. The results are then extended to fast fading channels. The design criteria are used to design trellis codes for high data rate wireless communication. The encoding/decoding complexity of these codes is comparable to trellis codes employed in practice over Gaussian channels. The codes constructed here provide the best tradeoff between data rate, diversity advantage, and trellis complexity. Simulation results are provided for 4 and 8 PSK signal sets with data rates of 2 and 3 bits/symbol, demonstrating excellent performance that is within 2-3 dB of the outage capacity for these channels using only 64 state encoders     

On the Design of Space–Time Trellis Codes for Transmit-Correlated Fading Channels

The analysis and design of space-time codes for correlated fading channels when the diversity gain is large enough is considered. We derive a simple form for a distance metric that characterizes the code performance in the presence of transmit correlation, and propose some design criteria to build good space-time trellis codes (STTCs) for correlated channels. For the case of two transmit antennas, we show that in strongly correlated channels, performance is governed by the constellation that results from the sum of the constellations associated with the transmit antennas. This suggests the use of new constellations to design better codes for correlated channels. The design criteria are then extended to any number of transmit antennas. Based on these criteria, we derive new STTCs for two and three transmit antennas that perform much better in correlated channels than the STTC optimized for the independent and identically distributed case. We also consider set partitioning applied to the sum constellation as a simple technique to design good codes for correlated channels. The codes derived show performance close to the codes found by an exhaustive search. Finally, we consider antenna selection as an alternative to build good codes for more than two antennas in fading-correlated scenarios     

Diagonal block space-time code design for diversity and coding advantage over flat fading channels

The potential promised by multiple transmit antennas has raised considerable interest in space-time coding for wireless communications. In this paper, we propose a systematic approach for designing space-time trellis codes over flat fading channels with full antenna diversity and good coding advantage. It is suitable for an arbitrary number of transmit antennas with arbitrary signal constellations. The key to this approach is to separate the traditional space-time trellis code design into two parts. It first encodes the information symbols using a one-dimensional (M,1) nonbinary block code, with M being the number of transmit antennas, and then transmits the coded symbols diagonally across the space-time grid. We show that regardless of channel time-selectivity, this new class of space-time codes always achieves a transmit diversity of order M with a minimum number of trellis states and a coding advantage equal to the minimum product distance of the employed block code. Traditional delay diversity codes can be viewed as a special case of this coding scheme in which the repetition block code is employed. To maximize the coding advantage, we introduce an optimal construction of the nonbinary block code for a given modulation scheme. In particular, an efficient suboptimal solution for multilevel phase-shift-keying (PSK) modulation is proposed. Some code examples with 2-6 bits/s/Hz and two to six transmit antennas are provided, and they demonstrate excellent performance via computer simulations. Although it is proposed for flat fading channels, this coding scheme can be easily extended to frequency-selective fading channels.     

Efficiently decoded full-rate space-time block codes

Space-time block codes with orthogonal structures typically provide full-diversity reception and simple receiver processing. However, rate-1 orthogonal codes for complex constellations have not been found for more than two transmit antennas. By using a genetic algorithm, rate-1 space-time block codes that accommodate very simple receiver processing at the cost of reduced diversity are designed in this paper for more than two transmit antennas. Simulation results show that evolved codes combined with efficient outer codes provide better performance over fading channels than minimum-decoding-complexity quasiorthogonal codes at typical operating signal-to-noise ratios. When the fading is more severe than Rayleigh fading, the spectral efficiency is specified, and an efficient outer code is used, evolved codes outperform orthogonal space-time block codes.     

Adaptive Channel‐Matched Extended Alamouti Space‐Time Code Exploiting Partial Feedback

Since the publication of Alamouti's famous space‐time block code, various quasi‐orthogonal space‐time block codes (QSTBC) for multi‐input multi‐output (MIMO) fading channels for more than two transmit antennas have been proposed. It has been shown that these codes cannot achieve full diversity at full rate. In this paper, we present a simple feedback scheme for rich scattering (flat Rayleigh fading) MIMO channels that improves the coding gain and diversity of a QSTBC for 2ⁿ (n = 3, 4,…) transmit antennas. The relevant channel state information is sent back from the receiver to the transmitter quantized to one or two bits per code block. In this way, signal transmission with an improved coding gain and diversity near to the maximum diversity order is achieved. Such high diversity can be exploited with either a maximum‐likelihood receiver or low‐complexity zero‐forcing receiver.     

Full-Diversity and Fast ML Decoding Properties of General Orthogonal Space-Time Block Codes for MIMO-OFDM Systems

In this letter we apply the general orthogonal space-time block codes (OSTBC) to MIMO-OFDM systems over frequency-selective fading channels and aim to exploit the potential multipath diversity. By replacing the scalar entry of an OSTBC matrix with the vector of repeated symbols, we obtain a new OSTBC which can achieve both spatial diversity and multipath diversity. Moreover, a fast maximum likelihood (ML) decoding is admitted. Simulation results show that the proposed OSTBC, for two transmit antennas, can obtain a higher diversity gain than the Alamouti code at the same ML decoding complexity     

On the design of algebraic space-time codes for MIMO block-fading channels

The availability of multiple transmit antennas allows for two-dimensional channel codes that exploit the spatial transmit diversity. These codes were referred to as space-time codes by Tarokh et al. (see ibid., vol.44, p.744-765, Mar. 1998) Most prior works on space-time code design have considered quasi-static fading channels. We extend our earlier work on algebraic space-time coding to block-fading channels. First, we present baseband design criteria for space-time codes in multi-input multi-output (MIMO) block-fading channels that encompass as special cases the quasi-static and fast fading design rules. The diversity advantage baseband criterion is then translated into binary rank criteria for phase shift keying (PSK) modulated codes. Based on these binary criteria, we construct algebraic space-time codes that exploit the spatial and temporal diversity available in MIMO block-fading channels. We also introduce the notion of universal space-time codes as a generalization of the smart-greedy design rule. As a part of this work, we establish another result that is important in its own right: we generalize the full diversity space-time code constructions for quasi-static channels to allow for higher rate codes at the expense of minimal reductions in the diversity advantage. Finally, we present simulation results that demonstrate the excellent performance of the proposed codes.