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]     

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.     

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

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

On Trellis Coded Noncoherent Space-Time Modulation

Unitary space-time modulation (USTM) is well-tailored for noncoherent space-time modulation. Trellis coded USTM (TC-USTM) can obtain significant coding gains over uncoded USTM for the noncoherent block fading channel. Conventional TC-USTM schemes expand the signal set of uncoded USTM by a factor of two. In this letter, we propose a new TC-USTM scheme in which the size of USTM set is not limited to be just double for uncoded USTM. However, in TC-USTM schemes, because signals of the same trellis branch are transmitted over the same fading coefficients, one trellis branch can only obtain one temporal diversity. In this letter, we also propose a new trellis coded noncoherent space-time modulation scheme by interleaving space-time signals. The proposed scheme can enlarge temporal diversity at the price of increased complexity and delay. Simulation results demonstrate the excellent error performances of codes found by computer searches for both schemes.     

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.     

Multiple trellis coded orthogonal transmit scheme for multiple antenna systems

In this paper, a novel multiple trellis coded orthogonal transmit scheme is proposed to exploit transmit diversity in fading channels. In this scheme, a unique vector from a set of orthogonal vectors is assigned to each transmit antenna. Each of the output symbols from the multiple trellis encoder is multiplied with one of these orthogonal vectors and transmitted from corresponding transmit antennas. By correlating with corresponding orthogonal vectors, the receiver separates symbols transmitted from different transmit antennas. This scheme can be adopted in coherent/differential systems with any number of transmit antennas. It is shown that the proposed scheme encompasses the conventional trellis coded unitary space-time modulation based on the optimal cyclic group codes as a special case. We also propose two better designs over the conventional trellis coded unitary space-time modulation. The first design uses 8 Phase Shift Keying （8-PSK） constellations instead of 16 Phase Shift Keying （16-PSK） constellations in the conventional trellis coded unitary space-time modulation. As a result, the product distance of this new design is much larger than that of the conventional trellis coded unitary space-time modulation. The second design introduces constellations with multiple levels of amplitudes into the design of the multiple trellis coded orthogonal transmit scheme. For both designs, simulations show that multiple trellis coded orthogonal transmit schemes can achieve better performance than the conventional trellis coded unitarv space-time schemes.     

Coding Gain Distance Exact Estimation for Space-Time Trellis Coded Modulation

Space-time (ST) trellis coded modulation (TCM) represents a high spectral efficiency technique for multiple antennas transmissions over fading channels. In literature, it was shown that ST-TCM technique offers full diversity when the rank criterion is met. However, “brute force” methods were used in almost all previous work to search for full diversity ST-TCM codes. In the present paper, we aim to derive an exact expression for the minimum coding gain distance (CGD) in the case of full diversity ST-TCM codes with minimum memory size, for two transmit antennas. Therefore, we transpose the ST-TCM design rules into operations over the set of modulo-M integer numbers (Z _M ), between the current trellis state and encoder’s input information symbol value, in order to derive the transmitted M-levels phase shift keying modulated (M-PSK) output values. In this context, a new design method is introduced to control the code’s minimum CGD value of full diversity ST-TCM schemes.     

Systematic design of space-time codes employing multiple trelliscoded modulation

The design of space-time (ST) codes employing multiple trellis coded modulation (MTCM) is considered. This structure is shown to be necessary for achieving maximum transmit diversity gain when using trellis codes with parallel paths. Systematic code search procedures with low complexity are described based on the properties of ST-MTCM codes. It is illustrated that, if the trellis branches are properly labeled, the overall coding gain can be made larger than that achieved by conventional ST codes with the same transmission rate and the same number of states     

Constructing Space-Time Trellis Codes Using Orthogonal Designs

In this paper we consider the design of space-time trellis codes usingorthogonal designs. We derive a condition on the codewords to obtainthe maximum received signal energy and show that the codes based onorthogonal designs satisfy this condition.We consider in detail the design of a trellis code for two transmitantennas. The new code we develophas a higher diversity in fast fading and a higher coding gain in quasi-static fading when compared to otherexisting space-time codes. We also consider a turbo implementation ofthe new trellis code which results in very high diversity gains infast 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.     

Some Designs of Full Rate Space–Time Codes With Nonvanishing Determinant

In this correspondence, we first present a transformation technique to improve the normalized diversity product for a full rate algebraic space-time block code (STBC) by balancing the signal mean powers at different transmit antennas. After rewriting a cyclic division algebra structure into a multilayer structure for a full rate code, we show that the normalized diversity product of the transformed code with the multilayer structure is better than the one of the transformed code with the cyclic division algebra structure. We then present a new full rate algebraic STBC with multilayer structure with nonvanishing determinant (NVD) for three transmit antennas when signal constellation is carved from QAM. We show that the new code has larger normalized diversity product than the existing 3 times 3 NVD full rate STBC for quadrature amplitude modulation (QAM) signals, and we also show that it has the largest normalized diversity product in a family of full rate STBC.     

Shift-full-rank matrices and applications in space-time trellis codes for relay networks with asynchronous cooperative diversity

To achieve full cooperative diversity in a relay network, most of the existing space-time coding schemes require the synchronization between terminals. A family of space-time trellis codes that achieve full cooperative diversity order without the assumption of synchronization has been recently proposed. The family is based on the stack construction by Hammons and El Gamal and its generalizations by Lu and Kumar. It has been shown that the construction of such a family is equivalent to the construction of binary matrices that have full row rank no matter how their rows are shifted, where a row corresponds to a terminal (or transmit antenna) and its length corresponds to the memory size of the trellis code on that terminal. We call such matrices as shift-full-rank (SFR) matrices. A family of SFR matrices has been also constructed, but the memory sizes of the corresponding space-time trellis codes (the number of columns of SFR matrices) grow exponentially in terms of the number of terminals (the number of rows of SFR matrices), which may cause a high decoding complexity when the number of terminals is not small. In this paper, we systematically study and construct SFR matrices of any sizes for any number of terminals. Furthermore, we construct shortest (square) SFR (SSFR) matrices that correspond to space-time trellis codes with the smallest memory sizes and asynchronous full cooperative diversity. We also present some simulation results to illustrate the performances of the space-time trellis codes associated with SFR matrices in asynchronous cooperative communications.     

On the design and maximum-likelihood decoding of space-time trellis codes

In this letter, we present a simple generalization of the maximum ratio combining principle for space-time coded systems. This result leads to a maximum-likelihood decoder implementation that does not depend on the number of receive antennas and avoids the loss in performance incurred in the decoders proposed by Tarokh and Lo (1998) and Biglieri et al. The insights offered by this decoding rule allow for a simple and elegant proof for the space-time code design criterion in systems with large number of receive antennas. We further present an upper bound on probability of error that captures the dependence of space-time code design on the number of receive antennas. Finally, we present a computationally efficient approach for constructing space-time trellis codes that exhibit satisfactory performance in systems with variable number of receive antennas.     

On the theory of space-time codes for PSK modulation

The design of space-time codes to achieve full spatial diversity over fading channels has largely been addressed by handcrafting example codes using computer search methods and only for small numbers of antennas. The lack of more general designs is in part due to the fact that the diversity advantage of a code is the minimum rank among the complex baseband differences between modulated codewords, which is difficult to relate to traditional code designs over finite fields and rings. We present general binary design criteria for PSK-modulated space-time codes. For linear BPSK/QPSK codes, the rank of (binary projections of) the unmodulated codewords, as binary matrices over the binary field, is a sufficient design criterion: full binary rank guarantees full spatial diversity. This criterion accounts for much of what is currently known about PSK-modulated space-time codes. We develop new fundamental code constructions for both quasi-static and time-varying channels. These are perhaps the first general constructions-other than delay diversity schemes-that guarantee full spatial diversity for an arbitrary number of transmit antennas     

Space-time code design for CPFSK modulation over frequency-nonselective fading channels

We derive a novel space-time code (STC) design criterion for continuous-phase frequency-shift keying (CPFSK) over frequency-nonselective fading channels. Our derivation is based on a specific matrix that is related to the input symbols of the CPFSK modulators. With this code-design criterion, we propose a simple interleaved space-time encoding scheme for CPFSK modulation over frequency-nonselective correlated fading channels to exploit potential temporal and spatial diversity advantages. Such an encoding scheme consists of a ring convolutional encoder and a spatial encoder, between which a convolutional interleaver is placed. A decoding algorithm that generates symbol metrics for the Viterbi decoder of convolutional codes from the spatial modulation trellis is examined. Simulation results confirm that the advantages of the combination of the interleaved convolutional encoding (for temporal diversity) and the spatial encoding (for spatial diversity) are promising for various system parameters.     

Space-time trellis codes for 4-PSK with three and four transmitantennas in quasi-static flat fading channels

It has been established that the appropriate design parameters for space-time trellis code (STTC) in quasi-static flat Rayleigh fading channels are the rank and determinant criteria or the Euclidean distance criterion, depending on the value of the overall diversity gain. We propose two groups of new STTCs with more than two transmit antennas based on these two design criteria, respectively. These new STTCs are shown to achieve large performance improvements over the ones with two transmit antennas     

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.     

An efficient space-frequency coded OFDM system for broadband wireless communications

We propose an efficient space-frequency coded orthogonal frequency-division multiplexing (OFDM) system for high-speed transmission over wireless links. The analytical expression for the pairwise probability of the proposed space-frequency coded OFDM system is derived in slow, space- and frequency-selective fading channels. The design criteria of trellis codes used in the proposed system are then developed and discussed. It is shown that the proposed space-frequency coded OFDM can efficiently achieve the full diversity provided by the fading channel with low trellis complexity, while for traditional space-frequency coded OFDM systems, we need to design space-time trellis codes with high trellis complexity to exploit the maximum achievable diversity order. The capacity properties of space-frequency coded OFDM over multipath fading channels are also studied. Numerical results are provided to demonstrate the significant performance improvement obtained by the proposed space-frequency coded OFDM scheme, as well as the excellent outage capacity properties.     

空时格码和OFDM系统联合建模及性能分析

发射端分集、编码和调制结合空时格码，可以有效地提高信号在无线衰落信道中传输的有效性和可靠性；在正交频分复用调制OFDM(Omiogonal Frequency Division Multiplexing)系统中应用空时格码可以有效地对抗多径干扰，提高系统容量，适合于在高速无线数据通信中采用。本文详细地说明了它们结合的基础，进而构造了一个基于空时格码的OFDM系统模型，并分析了在高斯信道下的系统性能。     

Adaptively Grouped Multilevel Space-Time Trellis Codes

Grouped multilevel space-time trellis codes (GMLSTTCs) utilize multilevel coding (MLC), antenna grouping and space time trellis codes (STTCs) for simultaneously providing coding gain, diversity improvement and increased spectral efficiency. The performance of GMLSTTCs is limited due to predefining of the antenna groups. It has been shown that when perfect or partial channel state information is available at the transmitter, the performance and capacity of space-time coded system can be further improved. In this paper, we present a new code designed by combining MLC, STTCs, antenna grouping and channel state information at transmitter, henceforth referred to as adaptively grouped multilevel space time trellis codes (AGMLSTTCs). AGMLSTTCs use a single full-diversity STTC at initial some levels and multiple STTCs at some later levels. The single full diversity STTC at each initial level spans all transmit antennas and the STTC at each later level spans a group of transmit antennas. The channel state information at the transmitter is used to adaptively group the transmit antennas for the later levels. Instantaneous channel power gain is calculated between each transmit antenna and all the receive antennas. A subset of transmit antennas having maximum channel power gain is selected to form a group. The simulation results show that AGMLSTTCs enable to transmit more than one data symbol per time slot with improved error performance over GMLSTTCs with predefined transmit antenna grouping.