Super-orthogonal space-time trellis codes

We introduce a new class of space-time codes called super-orthogonal space-time trellis codes. These codes combine set partitioning and a super set of orthogonal space-time block codes in a systematic way to provide full diversity and improved coding gain over earlier space-time trellis code constructions. We also study the optimality of our set partitioning and provide coding gain analysis. Codes operating at different rates, up to the highest theoretically possible rate, for different number of states can be designed by using our optimal set partitioning. Super-orthogonal space-time trellis codes can provide a tradeoff between rate and coding gain. Simulation results show more than 2-dB improvements over the codes presented in the literature while providing a systematic design methodology.     

Space-Time Trellis Code Design Based on Super Quasi-Orthogonal Block Codes With Minimum Decoding Complexity

In this letter, we propose a new family of space-time trellis codes, which are constructed by combining a super set of quasi-orthogonal space-time block codes with minimum decoding complexity with an outer multiple trellis coded modulation encoder. A systematic set-partitioning method for quadratic amplitude modulation constellations is given. The proposed scheme can be used for systems with four or more than four transmit antennas. Furthermore, its decoding complexity is low because its branch metric calculation can be implemented in a symbolwise way. Simulation results demonstrate that the proposed scheme has a comparable performance as super quasi-orthogonal space-time trellis codes proposed by Jafarkhani and Hassanpour while providing a lower decoding complexity.     

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.     

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.     

Improved Superorthogonal Codes Through Generalized Rotations

Concatenation of orthogonal space-time block codes (OSTBC) with an outer trellis has led to simple and powerful codes, known as superorthogonal codes or space-time block trellis-coded modulation. In this letter, we generalize these codes by finding new code supersets and corresponding set partitioning, resulting in improved coding gain. We provide design guidelines for the labeling of the generalized code trellises and demonstrate the gains by several example designs for two and four transmit antennas     

Efficient Space-Time Block Codes Derived from Quasi-Orthogonal Structures

We propose a new class of block codes that outperforms known space-time block codes at low rates. The new codes are designed by using appropriate rotations and set partitioning on two quasi-orthogonal codes, and combining subsets of their codewords. Using these techniques we are able to obtain higher coding gain at a given rate and improve performance. Simulations confirm the advantages of this code compared to other codes operating at the same rate and signal-to-noise ratio (SNR). We also provide an efficient maximum likelihood (ML) decoding algorithm for the new code     

满速率串行级联空时分组MTCM编码方法研究

该文研究了级联空时编码系统在编码增益,分集增益和传输能量效率的限定下最大化传输速率的问题,提出了一种在保留TCM编码方法校验位冗余的同时,还可获得满速率串行级联空时分组TCM编码方法。新方法通过引入具有不同功率分集因子的正交发射码字矩阵,并给出新的译码算法,从而使得新的编码方法在获得满速率的同时还可以获得满分集增益。分析和MATLAB仿真结果表明,在相同的编码状态数下,新方法在编码增益上比现有的满速率超正交空时分组编码方法提高1dB左右。     

一种全速率准正交空时分组码

空时分组码是发射分集中的一项新技术。通常的空时分组码采用正交设计，虽可以提供全分集增益，却不能保证全速率传输，造成发射端数据的积压。改进的空时分组码采用准正交设计，能够保证数据以全速率传输，但是其性能在低信噪比时优于正交空时分组码，在高信噪比时反而不如前者。提出一种改进的基于准正交设计的空时分组码。通过仿真表明，在不增加译码复杂度的情况下，其性能不论在低信噪比还是高信噪比时都优于正交设计的空时分组码，从而改善了系统性能。     

Space-time MSK Codes for Quasi-Static Fading Channels

In this paper, 4-state and 8-state space-time trellis codes with full rate, full diversity and high coding gain are proposed for MSK modulation, based on a technique similar to the super-orthogonal space-time trellis code (SOSTTC) design. Since the phase continuity requirement of MSK is the main constraint in space-time MSK code design not all the signal matrices corresponding to the trellis branches are orthogonal. The paper shows that the SOSTTC design technique can be extended to nonorthogonal coding structures. The new space-time MSK codes have frame error performances very close to those of their space-time QPSK counterparts given in [1]     

全速率满分集准正交空时分组码的设计

在未来的第四代移动通信中,基于多输入多输出（MIMO）天线系统的空时编码技术是改善无线通信性能,提高带限系统数据传输速率的一种理想选择,但由于正交空时分组编码不能保证满分集和数据全速率传输,提出了一种利用星座图旋转可获得全速率满分集传输的旋转准正交空时分组码的设计方法。仿真结果表明,这种方法在不增加译码复杂度的情况下,其误比特率无论在低信噪比还是在高信噪比条件下都要优于已有的准正交空时分组码。     

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

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

Concatenated space-time block coding with trellis coded modulation in fading channels

Trellis coded modulation (TCM) is a bandwidth efficient transmission scheme that can achieve high coding gain by integrating coding and modulation. This paper presents an analytical expression for the error event probability of concatenated space-time block coding with TCM which reveals some dominant factors affecting the system performance over slow fading channels when perfect interleavers are used. This leads to establishing the design criteria for constructing the optimal trellis codes of such a concatenated system over slow flat fading channels. Through simulation, significant performance improvement is shown to be obtained by concatenating the interleaved streams of these codes with space-time block codes over fading channels. Simulation results also demonstrate that these trellis codes have better error performance than traditional codes designed for single-antenna Gaussian or fading channels. Performance results over quasi-static fading channels without interleaving are also compared in this paper. Furthermore, it is shown that concatenated space-time block coding with TCM (with/without interleaving) outperforms space-time trellis codes under the same spectral efficiency, trellis complexity, and signal constellation.     

一种基于准正交空时码的低复杂度MIMO差分检测方法

针对可实现全速率传输的准正交空时码,提出了一种低复杂度的准正交MIMO差分检测方法.该方法在发射端对数据比特进行联合星座映射,构造准正交空时码进行差分编码;接收端采用最大似然准则对两组星座符号对(symbol pair)并行差分检测.本文提出的星座集合及联合星座映射方法简化了接收端检测算法,降低了检测计算复杂度.     

一种改进的准正交空时分组码设计方案

基于MIMO天线系统的空时编码技术是改善无线通信性能、提高带限系统数据速率的一种理想选择。但是由于正交空时分组码不能保证数据全速率传输,为此提出一种改进的准正交空时分组码设计方案。该编码方法利用准正交准则,能够保证数据以全速率传输。并在此基础上具体讨论和分析了编码的编、译码算法和误码性能。该编码方法既不降低分集增益也不增加译码复杂度,并且可以获得一定的编码增益。仿真结果表明,这种方法的误比特率无论在低信噪比还是在高信噪比条件下都要优于已有的准正交空时分组码——Jafarkhani码。     

A new full-rate full-diversity orthogonal space-time block coding scheme

In this work, we present a new space-time orthogonal coding scheme with full-rate and full-diversity. The proposed space-time coding scheme can be used on quaternary phase-shift keyed (QPSK) transceiver systems with four transmit antennas and any number of receivers. An additional feature is that the coded signals transmitted through all four transmit antennas do not experience any constellation expansion. The performance of the proposed coding scheme is studied in comparison with that of 1/2-rate full-diversity orthogonal space-time code, quasi-orthogonal code, as well as constellation-rotated quasi-orthogonal code. Our study shows that the proposed coding scheme offers full rate and outperforms the 1/2-rate orthogonal codes as well as full-rate quasi-orthogonal codes when the signal-to-noise increases. Compared to the constellation-rotated quasi-orthogonal codes (the improved QO scheme), the newly proposed code has the advantage of not expanding the signal constellation at each transmit antenna. The performance of the newly proposed code is comparable to that of the improved QO scheme.     

A quasi-orthogonal space-time block code

It has been shown that a complex orthogonal design that provides full diversity and full transmission rate for a space-time block code is not possible for more than two antennas. Previous attempts have been concentrated in generalizing orthogonal designs which provide space-time block codes with full diversity and a high transmission rate. We design rate one codes which are quasi-orthogonal and provide partial diversity. The decoder of the proposed codes works with pairs of transmitted symbols instead of single symbols     

Linear Decoupled and Quasi-Decoupled Space–Time Codes

Space-time transmit diversity results in coupling of transmitted symbols across different antennas, which increases the complexity of maximum-likelihood decoding. Symbol coupling can be completely or partially avoided if the space-time code (STC) satisfies specific decoupling conditions; examples of such codes are orthogonal space-time block codes and quasi-orthogonal codes. In this letter, we study decoupling conditions for a linear full-diversity STC. Quasi-decoupled codes are proposed as a partially decoupled full-diversity STC of any rate for any number of transmit antennas with minimum decoding delay. By optimizing the coding gain of quasi-decoupled codes, it is shown that quasi-orthogonal codes have competitive performance with respect to the Alamouti code, and the more-recent threaded algebraic space-time (TAST) codes and ABBA codes. A general full-diversity decoupling condition is considered, and the general solution to this case, which also encompasses previously known orthogonal STCs, is derived     

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.     

Iterative decoding of concatenated layered space-time trellis codes on MIMO block fading multipath AWGN channel

We propose the building of high rate space-time codes for multiple-input multiple-output (MIMO) block fading multipath additive white Gaussian noise channels by layering small compound space-time trellis codes. To recover part of the spatial diversity between the different layers, we also study their concatenation with an outer code. Naturally, our space-time coding architecture puts the burden on the receiver complexity. As a main contribution of this paper, a near-optimal soft-input soft-output reduced-complexity trellis search algorithm is suggested for joint MIMO detection and inner decoding.     

A Kind of Quasi-Orthogonal Space-Time Block Code and its Decoding Methods

It is well known that it is impossible for complex orthogonal space-time block codes with full diversity and full rate to have more than two transmit antennas while non-orthogonal designs will lose the simplicity of maximum likelihood decoding at receivers. In this paper, we propose a new quasi-orthogonal space-time block code. The code is quasi-orthogonal and can reduce the decoding complexity significantly by employing zero-forced and minimum mean squared error criteria. This paper also presents simulation results of two examples with three and four transmit antennas respectively.