莱斯信道下多载波异步发射分层空时码设计

视距路径的存在使多天线信道矩阵的条件数增加,造成同步多载波分层空时码的线性检测性能严重下降甚至失效。针对这一现实问题,该文提出了一种新的发射信号设计方法:在频域上将每个天线上的多载波信号异步发射。在莱斯信道中得到了联合迫零检测的误比特率表达式,并在未编码和Turbo编码情况下与同步多载波分层空时码进行了仿真对比。理论分析和仿真结果表明:异步多载波发射结构能够突破同步多载波分层空时码对接收天线数的限制,利用线性检测方法可以获得系统的最大可能空间分集度。     

无线光通信中的空时编码研究进展(三)

空时编码利用多天线阵列提供的并行信道传输信息,可以在保证通信质量的前提下进一步提高信息传输速率。介绍了笔者在正交空时码、空时网格码、酉空时码、差分空时码、混合空时码等方面的工作。采用类脉冲位置调制定义了负数、共轭、求补等运算,将编码矩阵转化为一个用脉冲位置表示的实数矩阵。分析了不同发射天线/接收天线数目、大气湍流强度与系统误码率之间的关系。讨论了差分空时码、酉空时码在不同大气湍流条件下的误码率特性;将分层空时码和空时分组码相结合,对复用增益和分集增益进行合理的折中,提出了一种适合于IM/DD式光通信的混合空时编码方案。     

分层空时码检测算法的研究

分层空时码技术是提高无线信道传输速率的一种十分有效的方法.迫零检测算法和最小均方误差检测算法是分层空时码体制中经常使用的两种检测算法,它们都使用了通常的线性合并置零技术,因此要求接收天线数不小于发射天线数,即要求在接收机上安装较多的天线,从而限制了分层空时码在移动环境下的应用.本文引入分层空时码的最大似然检测算法,突破了前两种算法对接收天线数的限制,并分别针对单路径和多径衰落信道环境,对分层空时码的三种检测算法的性能进行了仿真比较和分析,从而提出了它们各自适合的应用环境.     

分层空时编码及应用研究

分层空时编码是应用于多输入多输出系统中的一种空时编码,具有结构简单、易于实现且频带利用率随着发射天线数目的增加而线性增加等优点。针对分层空时编码传输速率高、无法获得最大分集增益以及系统抗衰落性能差等缺点,提出了一种结合空时分组码的混合结构模型——分层空时混合码。同时,介绍了分层空时编码检测算法的最新进展以及分层空时编码在自由空间光通信、OFDM系统中的研究成果及应用。     

基于QR分解的循环迭代检测算法

理论和实践研究表明垂直分层空时码可显著提高多天线系统的传输容量。为克服垂直分层空时码QR分解检测算法不能充分利用多天线分集增益信息的缺点,提出循环迭代QR分解检测算法。新算法在QR分解检测算法基础以循环迭代方式利用多天线系统提供分集增益信息,从而改善检测器性能。分析和仿真表明循环迭代QR分解检测算法复杂度是连续干扰消除算法的五分之一;在对称系统中（接收天线和发送天线数相等）,新算法性能优于连续干扰消除算法。     

双向中继系统中基于对角空时码的空间调制传输算法

在双向中继系统中,针对采用SSK传输不能获得发射分集且频谱效率较低的问题,提出了一种对角空时码空间调制算法,简称为DSTC-SM。该算法在源节点处采用DSTC-SM码字发送信号,在中继节点处配置单根天线对接收到的信号进行放大并将其转发至目的节点。DSTC-SM码字的构造中以对角码作为基本码块,并与空间调制（SM）技术相结合,采用循环结构来激活不同的天线。此外,通过对旋转角度的优化使该方案在即使只激活一根天线的情况下仍然可以获得发射分集增益。仿真结果表明,所提的算法比现有的算法具有较好的误码性能。     

在频率选择性信道中的差分空频编码

本文提出了频率选择性衰变信道中采用了差分空频编码的正交频分复用(OFDM)传输方法。根据信道长度,我们将每个天线OFDM帧中的输入数据分组,同一组中各天线上的数据编码组成为一个对角信号星座,沿频域方向独立的对每组信号实施差分编码。通过分析成对错误概率,我们证明了这种码潜在能提供的分集是发射天线数,接收天线数和信道长度的乘积,比差分空时码具有更大分集增益,因而具有更好的性能,这一分析结果也为我们的仿真实验证实了。     

无线通信中的分层空时编码技术

介绍了将发射分集与编码相结合的空时编码技术的基本原理,并给出了在特定条件下的信道容量公式.在此基础上介绍了分层空时编码技术,分析了分层空时码的特点并给出了编码算法.     

垂直分层空时编码的直接解码和盲信道估计算法

提出了适合垂直分层空时编码结构的盲信号检测和信道估计算法,在发射端进行了预编码,并利用一种类ESPRIT算法进行了盲信号检测和信道估计。与已提出的绝大多数垂直分层空时编码结构的信号检测和信道估计算法不同,去掉了接收天线数必须大于发射天线数这一约束。计算机仿真结果显示所提出的盲信号检测和信道估计算法与非盲算法几乎有相同的性能。     

在频率选择性相关信道中的空频分组编码技术

本文提出了频率选择性瑞利衰落信道中的对角空频分组码(DSF)，研究了码的性能。分析表明，在各天线对间的信道相互独立，系统有NT个发射天线，NR个接收天线和信道冲击响应长度是L时，DSF码可实现分集增益NRNTL。此外，相关的发射天线阵列会使DSF码分集增益下降，但是对码的性能影响不大，特别是在较长的多路径信道上。因此，DSF码对于相关的衰落信道显示出优越的鲁棒性能。最终仿真结果证实了本文的分析。     

FSO-MIMO中的自适应多层空时编码

为了根据信道的时变特性来选择合适的空时编码方式,结合正交空时分组码与分层空时码的优点,并借鉴天线分组的多层空时编码原理,提出了一种在自由空间光通信多输入多输出中4×4的自适应多层空时编码方案,并用Monte Carlo法进行仿真研究。结果表明,在一定的信噪比范围内,采用自适应多层空时,编码方案在保证一定误比特率的条件下,能使数据传输速率达到最大化;采用自适应调制方式能更有效地利用资源并提高数据的传输速率。     

MIMO系统中实现图像分级保护的空时传输方案

针对多输入多输出(MIMO)系统,当发射端已知信道状态信息时,提出基于信道矩阵奇异值分解(SVD)的空时编码(STC)传输方案SVD-STC,并推导出相应的群检测算法.SVD-STC是分层空时(LST)码和空时网格码(STTC)的混合形式,在传输率和分集之间取得折衷.由于采用奇异值分解,SVD-STC具有不等保护特性,可以与信源编码结合,实现图像分等级传输,显著提高重建图像的质量,同时具有较高的传输率,适用于固定无线通信系统中的多媒体传输.     

An optimal two transmit antenna space-time code and its stacked extensions

A space-time code is proposed that exhibits the highest coding gain among competing full-rate full transmit diversity space-time codes for the two transmit and receive antenna coherent quasi-static fading channel. The proposed code is derived from a layered architecture with real rotation of quadrature amplitude modulation (QAM) information symbols in two dimensions. The existing codes of similar architecture concentrate on application of complex full modulation diversity rotations or asymmetric real rotations. An analytic evaluation illustrates the significant improvement in coding gain achieved with the proposed code. Moreover, the coding gain of the proposed code is independent of its rate. This implies that the proposed code achieves the optimal diversity-multiplexing tradeoff curve for the two transmit antenna system. A stacked extension of the proposed code offers a reduced complexity capacity optimal alternative to the full diversity codes for larger number of transmit antennas. Performance enhancement in several scenarios is verified through simulations.     

Turbo-BLAST for wireless communications: theory and experiments

Turbo-BLAST is a novel multitransmit multireceive (MTMR) antenna scheme for high-throughput wireless communications. It exploits the following ideas: the Bell Labs layered space time (BLAST) architecture; random layered space-time (RLST) coding scheme by using independent block codes and random space-time interleaving; sub-optimal turbo-like receiver that performs iterative decoding of the RLST codes and estimation of the channel matrix in an iterative and, most important, simple fashion. The net result is a new transceiver that is not only computationally efficient compared with the optimal maximum likelihood decoder, but it also yields a probability of error performance that is orders of magnitude smaller than traditional BLAST schemes for the same operating conditions. This paper also presents experimental results using real-life indoor channel measurements demonstrating the high-spectral efficiency of turbo-BLAST.     

Using Orthogonal and Quasi-Orthogonal Designs in Wireless Relay Networks

Distributed space-time coding was proposed to achieve cooperative diversity in wireless relay networks without channel information at the relays. Using this scheme, antennas of the distributive relays work as transmit antennas of the sender and generate a space-time code at the receiver. It achieves the maximal diversity when the transmit power is infinitely large. This paper is on the design of practical distributed space-time codes (DSTCs). We use orthogonal and quasi-orthogonal designs which are originally used in the design of space-time codes for multiple-antenna systems. It is well known that orthogonal space-time codes have full diversity and linear decoding complexity. They are particularly suitable for transmissions in the network setting using distributed space-time coding since their ldquoscale-freerdquo property leads to good performance. Our simulations show that they achieve lower error rates than the random code. We also compare distributed space-time coding to selection decode-and-forward using the same orthogonal designs. Simulations show that distributed space-time coding achieves higher diversity than selection decode-and-forward (DF) when there is more than one relay. We also generalize the distributed space-time coding scheme to wireless relay networks with channel information at the relays. Although our analysis and simulations show that there is no improvement in the diversity, in some networks, having channel information at the relays saves both the transmission power and the transmission time.     

MIMO antenna subset selection with space-time coding

This paper treats multiple-input multiple-output (MIMO) antenna subset selection employing space-time coding. We consider two cases differentiated based on the type of channel knowledge used in the selection process. We address both the selection algorithms and the performance analysis. We first consider the case when the antenna subsets are selected based on exact channel knowledge (ECK). Our results assume the transmission of orthogonal space-time block codes (with emphasis on the Alamouti (see IEEE J. Select. Areas Commun., vol.16, p.1451-68, Oct. 1998) code). Next, we treat the case of antenna subset selection when statistical channel knowledge (SCK) is employed by the selection algorithm. This analysis is applicable to general space-time coding schemes. When ECK is available, we show that the selection algorithm chooses the antenna set that maximizes the channel Frobenius norm leading to both coding and diversity gain. When SCK is available, the selection algorithm chooses the antenna set that maximizes the determinant of the covariance of the vectorized channel leading mostly to a coding gain. In case of ECK-based selection, we provide analytical expressions for average SNR and outage probability improvement. For the case when SCK-based selection is used, we derive expressions for coding gain. We also present extensive simulation studies, validating our results.     

Double differential space-time block coding for time-selectivefading channels

Most existing space-time coding schemes assume time-invariant fading channels and offer antenna diversity gains relying on accurate channel estimates at the receiver. Other single differential space-time block coding schemes forego channel estimation but are less effective in rapidly fading environments. Based on a diagonal unitary matrix group, a novel double differential space-time block coding approach is derived in this paper for time-selective fading channels. Without estimating the channels at the receiver, information symbols are recovered with antenna diversity gains regardless of frequency offsets. The resulting transceiver has very low complexity and is applicable to an arbitrary number of transmit and receive antennas. Approximately optimal space-time codes are also designed to minimize bit error rate. System performance is evaluated both analytically and with simulations