网格编码调制空时块码

介绍了MIMO系统模型和空时编码设计的3个准则,根据这些准则,将网格编码调制与空时块码结合, 提出了网格编码调制空时(TCMST)块码。给出了TCMST块码的网格球解码算法,并对TCMST块码的性能进行了仿真,与其他空时块码做了比较,证实了TCMST块码的性能优越性。     

空时编码在OFDM系统中的应用

研究了空时分层码（LSTC）、空时分组码（STBC）和空时网格码（STTC）3种典型的空时编码技术。讨论了各自的编码原理和译码原理。以空时分组码为重点,介绍了OFDM系统的基本原理,将空时分组码和OFDM技术相结合,对STBC-OFDM系统的基本模型加以探讨,理论分析系统接收端的信噪比性能,通过M atlab仿真对收发...     

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     

Performance evaluation of super-orthogonal space-time trellis codes using a moment generating function-based approach

A new class of space-time codes called super-orthogonal trellis codes was introduced that combine set-partitioning with a super set of orthogonal space-time block codes in such a way as to provide full diversity with increased rate and improved coding gain over previous space-time trellis code (STTC) constructions. Here, we extend the moment generating function-based method, which was previously applied to analyzing the performance of space-time block orthogonal and trellis codes, to the above-mentioned super-orthogonal codes. It is shown that the maximum-likelihood metric and expressions for the pairwise error probability previously developed for the Alamouti (1998) space-time block code combined with multidimensional trellis-coded modulation can be readily extended to the super-orthogonal case. As such, the evaluation of the pairwise error probability for the latter can be performed in a similar manner to that previously described with the specific results depending on the particular trellis code design.     

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.     

Single-block coded modulation for MINO systems

This paper introduces a new class of space-time codes that achieve coding gain without a trellis or any form of inter-block dependency. The construction of the new codes starts from an existing (parent) space-time block code (STBC). Then by increasing the constellation size followed by expurgation of the expanded codebook, a better code is obtained at the original transmission rate. This method can be applied to a wide variety of space-time block codes, including orthogonal codes and quasi-orthogonal codes. A multi-stage design algorithm is presented, and for orthogonal parent codes, an efficient decoding algorithm is developed, and its decoding complexity is analyzed. Despite altering the regular structure of the orthogonal code, the decoding complexity is only affected by a constant factor.     

On the design and performance of algebraic space-time codes forBPSK and QPSK modulation

The authors previously developed an algebraic approach to space-time code design that unifies most of the known results on trellis space-time codes and opens the door for more sophisticated space-time code constructions. We present algebraic constructions for trellis and block space-time codes for BPSK and QPSK modulated systems. The new designs benefit from the algebraic approach and are general for arbitrary number of transmit antennas in quasistatic fading channels. We also provide simulation results comparing the frame error rate performance of various constructions. These simulation results establish the performance advantage achieved by algebraic space-time codes compared to previously known codes in various scenarios     

Space-time block codes based on coordinate symmetric orthogonal designs

Space-time block codes based on coordinate symmetric orthogonal designs are proposed. Compared with space-time block codes from complex orthogonal design when the code rate is the same and the transmission rate is fixed, space-time block codes from coordinate symmetric orthogonal design with more transmit antennas can reduce the bit error rate and symbol error rate. Also these new codes have the same low decoding complexity as space-time block codes from complex orthogonal designs.     

Variable-rate space-time block codes in M-ary PSK systems

We consider a multiple antenna system when combined array processing with space-time coding is used. We present variable rate space-time block codes for two, three, and four transmit antennas and optimize the transmit power so that the average bit-error rate (BER) is minimized. Numerical results show that this optimum power allocation scheme provides significant gain over the equal power allocation scheme. We then classify all the variable rate space-time block codes having the same code rates and identify the unique code that achieves the lowest BER. We explicitly compute the performance of the variable rate codes over a Rayleigh-fading channel. The proposed variable rate space-time block codes are useful for unequal error protection in multiple transmit antenna systems.     

一种基于矩阵旋转的正交空时分组码

Tarokh等人(1999)运用正交设计理论证明了当发射天线数大于2时,不存在可以获得最大分集增益和最大传输速率的复正交空时分组码。而以牺牲正交性和部分分集增益为代价来获得更高传输速率的非正交空时分组码又会使误码性能降低。该文通过对非正交空时分组码信道相关矩阵采用矩阵旋转的方法,提出了一种可以获得最大传输速率、部分分集增益以及接收端线性解码的正交空时分组码。仿真结果表明,该方案与已有典型的空时分组码相比,具有较好的误码性能。     

A single-symbol-decodable space-time block code with full rate and low peak-to-average power ratio

Three desirable properties of a four-antenna spacetime block code are full rate, full diversity, and single-symbol decodability. Previously reported space-time codes that achieve all three properties do so at the expense of the peak-to-average power ratio (PAPR). A fourth desirable property of a space-time block code is that its PAPR be the same as that of the underlying quadrature-amplitude modulation alphabet. In this letter we introduce space-time codes for three and four transmit antennas that achieve all four properties; these codes use a diversity technique based on constellation stretching. Numerical results for quasistatic Rayleigh-fading channels show that, despite their low PAPR, the proposed codes are comparable in SNR performance to the best-performing single-symbol decodable space-time codes for three and four transmit antennas.     

利用卷积-循环神经网络的串行序列空时分组码识别方法

针对多输入多输出(Multiple Input Multiple Output, MIMO)系统中的空时分组码识别(Space-Time Block Code, STBC)问题,本文提出了一种利用卷积-循环神经网络的串行序列空时分组码识别方法。将一维接收信号的实部和虚部分离后输入网络,利用卷积神经网络(CNN)提取其空间特征,结合循环神经网络(RNN)提取其深层时序特征,提高网络的特征表达能力;网络训练过程采用反向传播方法,通过计算输出与目标值的误差,将误差反向传回网络中并更新权值,完成网络的训练过程;将测试集数据输入训练好的网络中,实现对空时分组码的识别和区分。该方法将深度学习算法运用到串行序列空时分组码识别当中,训练完的网络可直接对单接收天线下的空时分组码进行识别,不需要重复计算信号的统计特征,避免了人为设计特征参数和检测阈值。该方法不需要知道信道和噪声的先验信息,适用于电子侦查等非协作通信情况。仿真实验表明,该算法能够有效地对串行序列空时分组码进行识别,并且在低信噪比下有较好的识别性能。      

频率选择性衰落信道下一种空时分组码的直接解码

该文针对 3个发射天线,1个接收天线的空时分组码系统,提出了频率选择性衰落信道下,无需信道估计,直接对空时分组码进行解码的方法,把子空间方法应用于空时编码当中,从信号处理和空时编码两个方面考虑空时分组码的直接解码问题,利用空时分组码所特有的正交设计,较为方便地从子空间中解出信号信息,从单载波的角度,解决了频率选择性衰落下空时分组码的解码问题。Monte-Carlo仿真给出了直接解码算法的性能,并与使用准确信道信息的解码算法做了性能比较。     

A high-rate orthogonal space-time block code

We present a space-time block code from complex orthogonal designs for 5 transmit antennas, which can send 10 information symbols in a block of 15 channel uses and hence have rate 2/3. Simulation results show that this orthogonal space-time block code with rate 2/3 for five transmit antennas can achieve diversity gain over those orthogonal space-time block codes with higher rates for less number of transmit antennas.     

High-rate orthogonal space-time block code for four transmit antennas

A high-rate (rate 1.5) nonlinear orthogonal space-time block code for four transmit antennas is presented. It outperforms previous space- time block codes where there are more than two receive antennas. This high-rate code improves on the performance of a recently proposed nonlinear orthogonal space-time block code of the same rate and without any extra constellation expansion.     

一种新的准正交空时分组码的设计

根据正交设计理论,当发送天线数大于2时,不存在可以获得完全分集增益和全速率的复正交空时分组码.对空时分组码采用准正交设计,能够保证数据以全速率传输,但是会使其误码性能降低.文章在对准正交空时分组码(QOSTBC)结构研究的基础上,提出了一种全速率的四发射天线准正交空时分组码,并给出了基于最大似然译码方法.仿真结果表明,文章方案与已有典型的Jafarkhani准正交空时分组码相比,在高信噪比时有更好的误码性能.     

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

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

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.     

Super-quasi-orthogonal space-time trellis codes for four transmit antennas

We introduce a new family of space-time trellis codes that extends the powerful characteristics of super-orthogonal space-time trellis codes to four transmit antennas. We consider a family of quasi-orthogonal space-time block codes as building blocks in our new trellis codes. These codes combine set partitioning and a super set of quasi-orthogonal space-time block codes in a systematic way to provide full diversity and improved coding gain. The result is a powerful code that provides full rate, full diversity, and high coding gain. It is also possible to maintain a tradeoff between coding gain and rate. Simulation results demonstrate the good performance of our new super-quasi-orthogonal space-time trellis codes.     

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