Design of super-orthogonal space-time trellis codes based on trace criterion

A design of super-orthogonal space-time trellis codes （SOSTTCs） based on the trace criterion （TC） is proposed for improving the design of SOSTTCs. The shortcomings of the rank and determinant criteria based design and the advantages of the TC-based design are analyzed. The optimization principle of four factors is presented, which includes the space-time block coding （STBC） scheme, set partitioning, trellis structure, and the assignment of signal subsets and STBC schemes in the trellis. According to this principle, systematical and handcrafted design steps are given in detail. By constellation expansion, the code performance can be further improved. The code design results are given, and the new codes outperform others in the simulation.

LOW RATE SPACE-TIME TRELLIS CODES INPOWER LIMITED WIRELESSCOMMUNICATION SYSTEMS

Space-time trellis codes can achieve the best tradeoff among bandwidth efficiency, diversity gain, constellation size and trellis complexity. In this paper, some optimum low rate space-time trellis codes are proposed. Performance analysis and simulation show that the low rate space-time trellis codes outperform space-time block codes concatenated with convolutional code at the same bandwidth efficiency, and are more suitable for the power limited wireless communication system.

A new design criterion and construction method for space-time trellis codes based on classification of error events

The known design criterions of Space-Time Trellis Codes （STFC） on slow Rayleigh fading channel are rank, determinant and trace criterion. These criterions are not advantageous not onlv in operation but also in performance. With classifying the error events of STTC, a new criterion was presented on slow Rayleigh fading channels. Basod on the criterion, an effective and straighttbrward multi-step method is proposed to ennstruet codes with better performance. This method can reduce the computation of search to small enough. Simulation results show that the codes searched by computer have the same or even better performance than the repored codes.

Performance Comparison of Space-Time Trellis Codes and Space-Time Transmit Diversity under the Same Bandwidth Efficiency

Space time coding can provide high data rate and performance gain for wireless communication system. Performance comparison of space time trellis codes and space time transmit diversity is carried out under the same bandwidth efficiency in this paper. We also propose some optimum low rate space time trellis codes in quasi static Rayleigh fading chan￣nel. Performance analysis and simulation show that the low rate space time trellis codes outperform space time transmit diversity at the same bandwidth efficiency, and are more suitable for the power limited wireless communication system which has no strict requirement on bandwidth efficiency.

Performance and EXIT analysis of parallel concatenated space time trellis codes

Space time trellis coding （STTC） techniques have been proposed to achieve both diversity and coding gains in multiple input multiple output （MIMO） fading channels. But with more transmit antennas STTCs suffer from the design dificulty and complexity increasing. This paper proposes a scheme, named parallel concatenated space time trellis codes （PC-STTC）, to achieve the tradeoff between the performances and complexity of STTCs for a large number of transmit antennas. Simulation results and complexity comparison are provided to demonstrate the performance and superiority of the proposed scheme over conventional schemes in fast fading channels in low signal-to-noise ratio （SNR） regions. And an EXIT （extrinsic information transform） chart is given to analyze the iterative convergence of the proposed scheme. It shows that PC-STTC has better iterative convergence in low SNR regions.

TRELLIS STRUCTURES OF BLOCK CODES AND THEIR DECODING

Trellis structures of block codes are discussed. L-section trellis structures of some BCH codes are presented. A fast maximum likelihood decoding algorithm for BCH codes is proposed correspondingly, the decoding problem of q-ary images of qm-ary block codes is also discussed. The direct-sum partition and the associated decoding algorithms are given for the images.

Beam Pattern Scanning (BPS) versus Space-Time Block Coding (STBC) and Space-Time Trellis Coding (STTC)

In this paper, Beam Pattern Scanning (BPS), a transmit diversity technique, is compared with two well known transmit diversity techniques, space-time block coding (STBC) and space-time trellis coding (STTC). In BPS (also called beam pattern oscillation), controlled time varying weight vectors are applied to the antenna array elements mounted at the base station (BS). This creates a small movement in the antenna array pattern directed toward the desired user. In rich scattering environments, this small beam pattern movement creates an artificial fast fading channel. The receiver is designed to exploit time diversity benefits of the fast fading channel. Via the application of simple combining techniques, BPS improves the probability-of-error performance and network capacity with minimal cost and complexity. In this work, to highlight the potential of the BPS, we compare BPS and Space-Time Coding (i.e., STBC and STTC) schemes. The comparisons are in terms of their complexity, system physical dimension, network capacity, probability-of-error performance, and spectrum efficiency. It is shown that BPS leads to higher network capacity and performance with a smaller antenna dimension and complexity with minimal loss in spectrum efficiency. This identifies BPS as a promising scheme for future wireless communications with smart antennas.

Linear Dispersion Orthogonal Space-Time Block Codes

A new architecture of space-time codes as a combination of orthogonal space-time block codes （OSTBC） and linear dispersion codes （LDC） is proposed in order to improve the bit error rate（BER） performance of OSTBC.The scheme proposed is named linear dispersion orthogonal space-time block codes （LDOSTBC）.In LDOSTBC scheme,firstly,the data is coded into LDC codewords.Then,the coded LDC substreams are coded into OSTBC codewords again.The decoding algorithm of LDOSTBC combines linear decoding of OSTBC and ML decoding or suboptimum detection algorithms of LDC.Compared with OSTBC scheme when the rate of LDC is MtR,the performance of LDOSTBC scheme can be improved without decreasing the data rate,where Mt is the number of transmit antennas and R is the spectral efficiency of the modulation constellation.If some rate penalty is allowed,when the rate of LDC is less than MtR the performance of LDOSTBC can be improved further.

Differential modulation based on space-time block codes

A differential modulation scheme using space-time block codes is put forward. Compared with other schemes, our scheme has lower computational complexity and has a simpler decoder. In the case of three or four transmitter antennas, our scheme has a higher rate a higher coding gain and a lower bit error rate for a given rate. Then we made simulations for space-time block codes as well as group codes in the case of two, three, four and five transmit antennas. The simulations prove that using two transmit antennas, one receive antenna and code rate of 4 bits/s/Hz, the differential STBC method outperform the differential group codes method by 4 dB. Useing three, four and five transmit antennas, one receive antenna, and code rate of 3 bits/s/Hz are adopted, the differential STBC method outperform the differential group codes method by 5 dB, 6. 5 dB and 7 dB, respectively. In other words, the differential modulation scheme based on space-time block code is better than the corresponding differential modulation scheme

A Design Method of Noncoherent Unitary Space-Time Codes

We generalized an constructing method of noncoherent unitary space time codes (N-USTC) over Rayleigh flat fading channels. A family of N-USTCs with T symbol peroids, M transmit and N receive antennas was constructed by the exponential mapping method based on the tangent subspace of the Grassmann manifold. This exponential mapping method can transform the coherent space time codes (C-STC) into the N-USTC on the Grassmann manifold. We infered an universal framework of constructing a C-STC that is designed by using the algebraic number theory and has full rate and full diversity (FRFD) for t symbol periods and same antennas, where M, N, T, t are general positive integer. We discussed the constraint condition that the exponential mapping has only one solution, from which we presented a approach of searching the optimum adjustive factor αopt that can generate an optimum noncoherent codeword. For different code parameters M, N, T, t and the optimum adjustive factor αopt, we gave the simulation results of the several N-USTCs.

REDUCED-COMPLEXITY DECODING ALGORITHMS FOR UNITARY SPACE-TIME CODES

Two reduced-complexity decoding algorithms for unitary space-time codes based on tree-structured constellation are presented. In this letter original unitary space-time constellation is divided into several groups. Each one is treated as the leaf nodes set of a subtree. Choosing the unitary signals that represent each group as the roots of these subtrees generates a tree-structured constellation. The proposed tree search decoder decides to which sub tree the receive signal belongs by searching in the set of subtree roots. The final decision is made after a local search in the leaf nodes set of the se-lected sub tree. The adjacent subtree joint decoder performs joint search in the selected sub tree and its “surrounding” subtrees,which improves the Bit Error Rate (BER) performance of purely tree search method. The exhaustively search in the whole constellation is avoided in our proposed decoding al-gorithms,a lower complexity is obtained compared to that of Maximum Likelihood (ML) decoding. Simulation results have also been provided to demonstrate the feasibility of these new methods.

A New Generalized Complex Orthogonal Space-Time Block Codes

Recent research challenges in the wireless communication include the usage of diversity and efficient coding to improve data transmission quality and spectral efficiency. Space diversity uses multiple transmitting and/or receiving antennas to create independent fading channels without penalty in bandwidth efficiency. Space-time block coding is an encoding scheme for communication over Rayleigh fading channels using multiple transmitting antennas. Space-time block codes from complex orthogonal designs exist only for two transmitting antennas. This paper generalizes a new complex orthogonal space-time block code for four transmitting antennas, whose decoding complexity is very low. Simulations show that the generalized complex orthogonal space-time block code has low bit error rate, full rate and possibly large diversity.

Space-time Block Codes Based on Quasi-Orthogonal Designs

A new space-time block codes based on quasi-orthogonal designs are put forward. First the channel model is formulated. Then the connection between orthogonal /quasi-orthogonal designs and space-time block codes is explored. Finally we make simulations for the transmission of 4 bits/s/Hz and 6 bits/s/Hz using eight transmit antennas using the rate 3/4 quasi-orthogonal space-time block code and the rate 1/2 full-diversity orthogonal space-time block code. Simulation results show that full transmission rate is more important for very low signal noise ratio (SNR) and high bit error probability (BEP), while full diversity is more important for very high SNR and low BEP.

EXACT ERROR PROBABILITY OF ORTHOGONAL SPACE-TIME BLOCK CODES OVER FLAT FADING CHANNELS

Space time block coding is a modulation scheme recently discovered for the transmit an- tenna diversity to combat the effects of wireless fading channels. Using the equivalent Single-Input Single-Output (SISO) model, this paper presents closed-form expressions for the exact Symbol Error Rate (SER) and Bit Error Rate (BER) of Orthogonal Space-Time Block Codes (OSTBCs) with M-ary Phase-Shift Keying (MPSK) and M-ary Quadrature Amplitude Modulation (MQAM) over flat un- correlated Nakagami-m and Ricean fading channels.

An Improved Group Space-Time Block Code Through Constellation Rotation

A new improved group space-time block code (G-STBC) based on constellation rotation for four transmit antennas was proposed. In comparison with the traditional G-STBC coding scheme, the proposed space-time code has longer code length and adopts proper rotation-based symbols, which can increase the minimum distance of space-time codes and thereby improve code gain and achieve full diversity performance. The simulation results verify that the proposed group space-time code can achieve better bit error performance than both the traditional group space-time code and other quasi-orthogonal space-time codes. Compared with Ma’s full diversity full rate (FDFR) codes, the proposed space-time code also can achieve the same excellent error performance. Furthermore, the design of the new space-time code gives another new and simple method to construct space-time codes with full diversity and high rate in case that it is not easy to design the traditional FDFR space-time codes.

A VERTICAL LAYERED SPACE-TIME CODE AND ITS CLOSED-FORM BLIND SYMBOL DETECTION

Vertical layered space-time codes have demonstrated the enormous potential to accommodate rapid flow data. Thus far, vertical layered space-time codes assumed that perfect estimates of current channel fading conditions are available at the receiver. However, increasing the number of transmit antennas increases the required training interval and reduces the available time in which data may be transmitted before the fading coefficients change. In this paper, a vertical layered space-time code is proposed. By applying the subspace method to the layered space-time code, the symbols can be detected without training symbols and channel estimates at the transmitter or the receiver. Monte Carlo simulations show that performance can approach that of the detection method with the knowledge of the channel.

WATER-FILLING SPACE-TIME CODE IN CORRELATED FLAT RAYLEIGH FADING MISO CHANNELS

In this paper, STC with water-filling transmit power distribution in MISO system is proposed when the partial channel information feedback is possible, for example, at slow fading scenario. The performances of the water-filling STC including water-filling STTC and water-filling STBC are analyzed. Performance comparison of the Ungerboeck's 2/3 trellis coded 8PSK modulated 2-STBC and 2-STTCs with QPSK is given out in different channel correlation.

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.

Design and implementation of space-time precoded systems with full diversity and lossless capacity

A new space-time(ST)code design is proposed based on the design criteria of space-time codes,which is applied to the MIMO systems with fewer receive antennas than transmit antennas.The space-time codes,referred to as full diversity lossless capacity(FDLLC)ST code,achieve full transmit diversity and lossless equivalent channel capacity for ST precoded systems.Combined FDLLC-ST codes with channel codes,ST bit interleaved coded modulation(ST-BICM)system is constructed and an iterative detector/decoder is employed at the receiver.Simulations are presented.It is proved that the proposed design has good performance compared with other ST precoded MIMO systems.

Improved Super-Orthogonal Trellis-Coded Spatial Modulation Using STBC-CSM

Trellis coded modulation (TCM) is a scheme that enhances the error performance without extra power not bandwidth. This paper presents a modified Super-Orthogonal Trellis-Coded Spatial Modulation (SOTC-SM) based on a cyclic structure of the Space Time Coding. The developed code benefits from expanded codebook of the Space Time Block Coded Spatial Modulation (STBC-SM) to enhance the coding gain. The set-partitioning and the code design based on the expanded codebook was given for codes with rate of 2 and 3 bps and can be easily extended to higher rates. The Bit-Error Rate (BER) performance of the proposed scheme was evaluated via computer simulation. It was shown that the proposed scheme outperforms the SOTC-SM performance for the same number of transmit antennas.