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 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.

Noncoherent Unitary Space-Time Codes： Constellation Design and Decoding Algorithm

Two novel schemes of unitary space-time constellations generation based on zero vectors adding are proposed for the multiple-antenna communication system. In the first scheme, T2 zero row vectors are added into conventional unitary matrices directly, and the number of new unitary matrices obtained by different positions of the added zero vectors in T symbol duration is [T / T2 ] times larger than that of conventional unitary matrices. In the second scheme, one part of the required constellations is created by the first scheme and the other part is obtained by the conventional design. This means that more information bits can be transmitted by the new constellations. According to their special construction, two corresponding decoding algorithms are proposed with low complexity in flat fading channel, respectively. At the same time, the probability of miss detection is deduced for the decoding algorithms. Performance analysis and simulation results show that the proposed constellations outperform the conventional constellations and the proposed decoding algorithms are efficient and simple.

A construction of fully diverse unitary space-time codes

Fully diverse unitary space-time codes are useful in multiantenna communications, especially in multiantenna differential modulation. Recently, two constructions of parametric fully diverse unitary space-time codes for three antennas system have been introduced. We propose a new construction method based on the constructions. In the present paper, fully diverse codes for systems of odd prime number antennas are obtained from this construction. Space-time codes from present construction are found to have better error performance than many best known ones.

CONSTRUCTIONS OF UNITARY SPACE-TIME CODES WITH FULL DIVERSITY

The problem of constructing unitary space-time codes with high diversity product has been studied in many prior works.Recently,constructions of parametric fully diverse unitary space-time codes for prime number antennas system have been introduced.In this paper,the authors propose new construction methods based on these constructions.And fully diverse codes of any number antennas are obtained from these constructions.Unitary space-time codes from present constructions are found to have better error performance than many best known ones.

CONSTRUCTIONS OF THREE-TRANSMIT-ANTENNA SPACE-TIME CODES

In this paper, we give design methods for three-transmit-antenna space-time codes which have reasonable parameters. A few examples are given to show that some unitary space-time codes constructed with our methods are better than the previously best-known ones.

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 Complexity Successive Cancellation List Decoding of U-UV Codes

Constituted by BCH component codes and its ordered statistics decoding(OSD),the successive cancellation list(SCL)decoding of U-UV structural codes can provide competent error-correction performance in the short-to-medium length regime.However,this list decoding complexity becomes formidable as the decoding output list size increases.This is primarily incurred by the OSD.Addressing this challenge,this paper proposes the low complexity SCL decoding through reducing the complexity of component code decoding,and pruning the redundant SCL decoding paths.For the former,an efficient skipping rule is introduced for the OSD so that the higher order decoding can be skipped when they are not possible to provide a more likely codeword candidate.It is further extended to the OSD variant,the box-andmatch algorithm(BMA),in facilitating the component code decoding.Moreover,through estimating the correlation distance lower bounds(CDLBs)of the component code decoding outputs,a path pruning(PP)-SCL decoding is proposed to further facilitate the decoding of U-UV codes.In particular,its integration with the improved OSD and BMA is discussed.Simulation results show that significant complexity reduction can be achieved.Consequently,the U-UV codes can outperform the cyclic redundancy check(CRC)-polar codes with a similar decoding complexity.

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.

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

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.

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.

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.

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.

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.

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.

Efficient unequal error protection for online fountain codes

In this paper,an efficient unequal error protection(UEP)scheme for online fountain codes is proposed.In the buildup phase,the traversing-selection strategy is proposed to select the most important symbols(MIS).Then,in the completion phase,the weighted-selection strategy is applied to provide low overhead.The performance of the proposed scheme is analyzed and compared with the existing UEP online fountain scheme.Simulation results show that in terms of MIS and the least important symbols(LIS),when the bit error ratio is 10-4,the proposed scheme can achieve 85%and 31.58%overhead reduction,respectively.

Application of maximum rank distance codes in designing of STBC-OFDM system for next-generation wireless communications

Space-Time Block Coded(STBC)Orthogonal Frequency Division Multiplexing(OFDM)satisfies higher data-rate requirements while maintaining signal quality in a multipath fading channel.However,conventional STBCs,including Orthogonal STBCs(OSTBCs),Non-Orthogonal(NOSTBCs),and Quasi-Orthogonal STBCs(QOSTBCs),do not provide both maximal diversity order and unity code rate simultaneously for more than two transmit antennas.This paper targets this problem and applies Maximum Rank Distance(MRD)codes in designing STBCOFDM systems.By following the direct-matrix construction method,we can construct binary extended finite field MRD-STBCs for any number of transmitting antennas.Work uses MRD-STBCs built over Phase-Shift Keying(PSK)modulation to develop an MRD-based STBC-OFDM system.The MRD-based STBC-OFDM system sacrifices minor error performance compared to traditional OSTBC-OFDM but shows improved results against NOSTBC and QOSTBC-OFDM.It also provides 25%higher data-rates than OSTBC-OFDM in configurations that use more than two transmit antennas.The tradeoffs are minor increases in computational complexity and processing delays.