空时分组码系统的盲信道估计

空时编码是实现宽带无线数据通信的一种极有潜力的技术,随着发射天线个数的增加,对空时编码进行信道估计时,所需训练符号的个数也将增加,减少了传输数据的有效时间.本文将子空间方法同空时分组码的特性有机地结合,提出了无需训练序列,直接进行信道估计的方法.它充分利用空时分组码的特性,使得接收信号中,表示信道衰落影响的矩阵各向量间存在一定联系,利用这些联系,结合子空间方法,从接收信号中解得信道信息.Monte-Carlo仿真表明,在信噪比较低时,本文算法带来的信道估计误差对于解码性能影响较小.     

基于子空间的空时分组码的解码

空时码解码算法往往假设信道状态信息(CSI)已经事先估计出,信道估计需要额外的运算量,而且信道估计误差使解码性能降低.本文提出一种基于子空间方法的空时分组码直接解码算法,利用空时分组码的结构,结合子空间算法,可以不需要信道信息,直接得到码符信息的闭式解.仿真实验结果表明,随着噪声子空间求解准确度的提高,直接解码算法性能逐渐接近使用确切信道信息的相关解码器.     

无线通信中的空时分组码及其性能分析

基于无线信道易受衰减和干扰影响的特点,介绍了用于瑞利衰落信道的空时分组码。给出了几种空时 分组码的编码和基于接收端线性处理的最大似然解码算法,建立了一个基站端和移动终端有若干个未线的系统模 型,分析其性能并进行仿真。仿真结果证明,通过空时分组码和多发射天线,可获得明显增益,且解码复杂度小。     

多天线对角空频编码传输

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

空时分组码MC-CDMA系统多用户检测

本文研究了在频率选择性瑞利衰落信道中工作于时分双工(TDD)模式的多载波码分多址(MC-CDMA)系统上行链路,在用户终端处使用两个发射天线,采用基于空时分组码的发射分集。考虑对应于子载波的衰落系数是信道冲激响应的离散傅里叶变换,给出了基于空时分组码的MC-CDMA系统上行链路信号模型。采用适用于同步CDMA系统的低代价Steiner估计器来进行基于空时分组码的MC-CDMA系统的信道估计,每个用户终端的两个发射天线各分配一个midamble。研究了基于空时分组码的MC-CDMA系统的解相关多用户检测、最小均方误差(MMSE)多用户检测,进行联合的多用户检测和空时码解码。仿真结果验证了上述模型及算法的有效性。     

时选衰落信道中的坐标交织空时分组码

为了提高空时分组码在时选衰落信道下的性能,该文提出了坐标交织空时分组码(Coordinate Interleaved Space-Time Block Code, CISTBC)。和已有的空时分组码相比,CISTBC将各码元的虚部和实部分别从不同的天线发射,充分利用了信道系数的时变特性带来的多径传输,提高了码元的抗深度衰落能力。另外,该文分析了基于QR 分解和高斯近似的连续干扰消除算法对不同码元解码性能的影响,给出了循环连续干扰消除算法来减少误差传递,进一步提高了系统性能。分析和仿真表明,CISTBC有效地改善了分组码在时选信道下的性能。     

一种空时分组码在频率选择性信道下的半盲递推解码

该文针对频率选择性信道下的Alamouti空时分组码,提出了一种在接收端未知信道信息的情况下的半盲的递推解码方法。该方法基于子空间方法,利用少量的导频符号和空时分组码的结构,递推地同时完成信道均衡和解码,直接解得信息符号。与已有的按块批处理的盲解码方法相比,递推方法因为在递推过程中利用已经判得的过去的信息符号,能够方便地进行性能与运算量的折衷。仿真结果验证了方法的有效性。     

频率选择性衰落信道下的空时分组码技术

空时分组码是一种有效抗衰落的发射分集技术,但是现有的研究大都集中在平坦衰落信道下进行。文章详细分析了频率选择性衰落信道下的空时分组码技术——OFDM-STBC(Orthogonal Frequency Division Multiplexing-Space TimeBlock Coding)的系统结构和编译码方法。仿真结果表明OFDM-STBC的性能可达到甚至优于STBC在非频率选择性信道下的性能。     

基于SFBC的MIMO-OFDM在频率选择性信道中的应用

针对于多径时延引起频率选择性衰落信道，在MIMO-OFDM的基础上采用了一种空频分组编码（space-frequency block coder——SFBC）技术。空频分组编码是在OFDM符号基础上，对一个OFDM符号中的子载波进行分组编码，使得同一帧上子载波在不同的天线上发送。现给出了SFBC编码及其解码算法，并在不同多径时延衰落条件下进行了仿真，验证了SFBC对于频率选择性衰落系统性能的改善。     

空时编码在瑞利衰落信道下的性能分析

以正交空时分组码为例讨论了空时编码技术的性能特征。给出了各种STC-OFDM系统的BER性能。理论分析和仿真结果表明,STBC-OFDM系统在频率选择性的瑞利衰落信道下,性能优于其它STC-OFDM系统。     

Turbo processing in transmit antenna diversity systems

We consider turbo-trellis-coded transmission over fading multiple-input-multiple-output (M1M0) channels with transmit diversity using space-time block codes. We give a new view on space-time block codes as a transformation of the fading MIMO channel towards a Gaussian single-input-single-output (siso) channel and provide analytical results on the BER of space-time block codes. Furthermore, we describe the concatenation of Turbo-TCM with a space-time block code and show that in addition to the transmit diversity substantial benefits can be obtained by turbo iterations as long as the channel is time-varying during transmission of a coded block or frequency hopping is applied. Finally, a double iterative scheme for turbo equalization and turbo decoding of the concatenation of Turbo-TCM and space-time block code in frequency-selective MIMO channels is described.     

Transmit antennae space-time block coding for generalized OFDM inthe presence of unknown multipath

Transmit antenna diversity has been exploited to develop high-performance space-time coders and simple maximum-likelihood decoders for transmissions over flat fading channels. Relying on block precoding, this paper develops generalized space-time coded multicarrier transceivers appropriate for wireless propagation over frequency-selective multipath channels. Multicarrier precoding maps the frequency-selective channel into a set of flat fading subchannels, whereas space-time encoding/decoding facilitates equalization and achieves performance gains by exploiting the diversity available with multiple transmit antennas. When channel state information is unknown at the receiver, it is acquired blindly based on a deterministic variant of the constant-modulus algorithm that exploits the structure of space-time block codes. To benchmark performance, the Cramer-Rao bound of the channel estimates is also derived. System performance is evaluated both analytically and with simulations     

On the design of space-time and space-frequency codes for MIMO frequency-selective fading channels

The authors introduced an algebraic design framework for space-time coding in flat-fading channels . We extend this framework to design algebraic codes for multiple-input multiple-output (MIMO) frequency-selective fading channels. The proposed codes strive to optimally exploit both the spatial and frequency diversity available in the channel. We consider two design approaches: The first uses space-time coding and maximum likelihood decoding to exploit the multi-path nature of the channel at the expense of increased receiver complexity. Within this time domain framework, we also propose a serially concatenated coding construction which is shown to offer a performance gain with a reasonable complexity iterative receiver in some scenarios. The second approach utilizes the orthogonal frequency division multiplexing technique to transform the MIMO multipath channel into a MIMO flat block fading channel. The algebraic framework is then used to construct space-frequency codes (SFC) that optimally exploit the diversity available in the resulting flat block fading channel. Finally, the two approaches are compared in terms of decoder complexity, maximum achievable diversity advantage, and simulated frame error rate performance in certain representative scenarios.     

Performance analysis and design of STBCs for frequency-selective fading channels

In this paper, space-time block-coded transmission over frequency-selective fading channels is investigated. A lower bound for the pairwise error probability for optimum detection is given. Also, an approximation for the bit-error rate is derived and compared with simulation results for maximum-likelihood sequence estimation (MLSE) for the GSM/EDGE (Enhanced Data Rates for GSM Evolution) system. Furthermore, a novel design rule for space-time block codes (STBCs) for frequency-selective fading channels is provided. A corresponding code is designed and shown to yield higher performance than Alamouti's code. It is demonstrated that for fading channels with L independent impulse response coefficients, STBCs designed for the flat fading channel can achieve at most a diversity order of (N/sub T/+L-1)N/sub R/ if N/sub T/ transmit antennas and N/sub R/ receive antennas are used. On the other hand, the maximum diversity order employing the proposed code design rule is LN/sub T/N/sub R/.     

Obtaining full-diversity space-frequency codes from space-time codes via mapping

This paper considers the problem of space-frequency code design for frequency-selective multiple-input-multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) modulation. We show that space-time codes achieving full diversity in quasistatic flat fading environment can be used to construct space-frequency codes that can achieve the maximum diversity available in frequency-selective MIMO fading channels. Since the codes are constructed via a simple mapping from space-time codes to space-frequency codes, the abundant classes of existing space-time block and trellis codes can be used for full diversity transmission in MIMO-OFDM systems. The proposed mapping provides a tradeoff between the achieved diversity order and the symbol rate. Moreover, we characterize the performance of the space-frequency codes obtained via the mapping by finding lower and upper bounds on their coding advantages as functions of the coding advantages of the underlying space-time codes. This result will allow us to investigate the effects of the delay distribution and the power distribution of the channel impulse responses on the performance of the resulting space-frequency codes. Extensive simulation results are also presented to illustrate and support the theory.     

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.     

Space-time codes and concatenated channel codes for wirelesscommunications

Following a brief historical perspective on channel coding, an introduction to space-time block codes is given. The various space-time codes considered are then concatenated with a range of channel codecs, such as convolutional and block-based turbo codes as well as conventional and turbo trellis codes. The associated estimated complexity issues and memory requirements are also considered. These discussions are followed by a performance study of various space-time and channel-coded transceivers. Our aim is first to identify a space-time code/channel code combination constituting a good engineering tradeoff in terms of its effective throughput, bit-error-rate performance, and estimated complexity. Specifically, the issue of bit-to-symbol mapping is addressed in the context of convolutional codes (CCs) and convolutional coding as well as Bose-Chaudhuri-Hocquenghem coding-based turbo codes in conjunction with an attractive unity-rate space-time code and multilevel modulation is detailed. It is concluded that over the nondispersive or narrow-band fading channels, the best performance versus complexity tradeoff is constituted by Alamouti's twin-antenna block space-time code concatenated with turbo convolutional codes. Further comparisons with space-time trellis codes result in similar conclusions     

MUI-free receiver for a synchronous DS-CDMA system based on blockspreading in the presence of frequency-selective fading

We discuss a synchronous direct-sequence code division multiple-access (DS-CDMA) system based on block spreading in the presence of frequency-selective fading. Note that block spreading, which is also known as chip interleaving, refers to a spreading of a data block sequence, which is obtained by dividing a data symbol sequence into consecutive blocks. For such a system, we develop a simple new receiver that completely removes the multiuser interference (MUI) without using any channel information. The MUI-free operation is obtained by the use of a shift-orthogonal set of code sequences on which this receiver is based. Within the framework of the MUI-free receiver, we further present a subspace deterministic blind single-user channel estimation algorithm. As a benchmark for the MUI-free receiver and the corresponding subspace deterministic blind single-user channel estimation algorithm, we consider the linear multiuser equalizer and the corresponding subspace deterministic blind multiuser channel estimation algorithm developed by Liu and Xu (1996) for a standard synchronous DS-CDMA system in the presence of frequency-selective fading. We show that the complexity of the MUI-free receiver using the corresponding subspace deterministic blind single-user channel estimation algorithm is much smaller than the complexity of the linear multiuser equalizer using the corresponding subspace deterministic blind multiuser channel estimation algorithm. We further show that the performance of the MUI-free receiver is comparable with the performance of the linear multiuser equalizer. This is for the case in which the channels are known as well as for the case in which the channels are estimated with the corresponding subspace deterministic blind channel estimation algorithm     

Space-time block coding for wireless communications: performanceresults

We document the performance of space-time block codes, which provide a new paradigm for transmission over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space-time block code, and the encoded data is split into n streams which 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. Maximum likelihood decoding is achieved in a simple way through decoupling of the signals transmitted from different antennas rather than joint detection. This uses the orthogonal structure of the space-time block code and gives a maximum likelihood decoding algorithm which is based only on linear processing at the receiver. We review the encoding and decoding algorithms for various codes and provide simulation results demonstrating their performance. It is shown that using multiple transmit antennas and space-time block coding provides remarkable performance at the expense of almost no extra processing