Analysis of Rate One Quasi-Orthogonal Space-Time Block Coding over Rayleigh Fading Channel

Full-rate is very important in any data transmission coding. For transmitting data at low bit rate than full-rate code, higher modulation scheme is required. But it is impossible to design full rate orthogonal designs with complex constellation for more than two transmit antennas. Only Alamouti code provides full-rate for two transmit antennas. In this paper, Bit Error Rate (BER) is calculated for Quasi-Orthogonal Space-time Block Coding (QOSTBC). Here we work with Rayleigh fading channel. We consider the codes which decodes pairs of symbols instead of simple separate decoding like Orthogonal Space-Time Block Coding. In Quasi-Orthogonal Space-time Block Code full-rate is achieved but full-diversity is sacrificed. Diversity is the most important techniques for providing reliable communication over fading channels. One of the diversity techniques that uses multiple transmit and/or receive antennas is space diversity. Multiple antenna technique provides a space diversity to struggle with the fading without necessarily sacrificing bandwidth resources, so the excellent solutions of removing the fading of the channel for broadband wireless communications is using space diversity. Then, with the constellation rotation of the symbol, rotated version of Quasi-Orthogonal Space-Time Block Code is generated. It provides full diversity. We simulate BER for QOSTBC, rotated QOSTBC, orthogonal STBC and for uncoded system. The simulation result shows that QOSTBC and rotated QOSTBC perform better than other systems. It shows that QOSTBC provides a full transmission rate but that rotated QOSTBC provides the full rate with the full diversity.

RECONSTRUCTION OF SPARSE POLYNOMIALS VIA QUASI-ORTHOGONAL MATCHING PURSUIT METHOD

In this paper,we propose a Quasi-Orthogonal Matching Pursuit(QOMP)algorithm for constructing a sparse approximation of functions in terms of expansion by orthonormal polynomials.For the two kinds of sampled data,data with noises and without noises,we apply the mutual coherence of measurement matrix to establish the convergence of the QOMP algorithm which can reconstruct s-sparse Legendre polynomials,Chebyshev polynomials and trigonometric polynomials in s step iterations.The results are also extended to general bounded orthogonal system including tensor product of these three univariate orthogonal polynomials.Finally,numerical experiments will be presented to verify the effectiveness of the QOMP method.

Extended ambiguity function for bistatic MIMO radar

This paper derives the extended ambiguity function for a bistatic multiple-input multiple-output （MIMO） radar system, which includes the whole radar system parameters： geometric sensor configuration, waveforms, range, range rate, target scattering and noise characteristics. Recent research indicates the potential pa- rameter estimate performance of bistatic MIMO radars. And this ambiguity function can be used to analyze the parameter estimate performance for the relationship with the Cramer-Rao bounds of the estimated parameters. Finally, some examples are given to demonstrate the good parameter estimate performance of the bistatic MIMO radar, using the quasi-orthogonal waveforms based on Lorenz chaotic systems.

An MMSE Decoding Algorithm without Matrix Inversion in QSTBC

The matrix inversion operation is needed in the MMSE decoding algorithm of orthogonal space-time block coding （OSTBC） proposed by Papadias and Foschini. In this paper, an minimum mean square error （MMSE） decoding algorithm without matrix inversion is proposed, by which the computational complexity can be reduced directly but the decoding performance is not affected.

A novel QO-STBC scheme with linear decoding

A new quasi-orthogonal space-time block code （QO-STBC） scheme, based on eigen value decomposition （EVD）, is explored in this paper. The new scheme can significantly reduce the QO-STBC decoding complexity at receiver and achieves better bit-error rate （BER） performance as well. With EVD manipulations, the detection matrix and the channel matrix can be redefined to remove all interference terms which come from other antennas, and therefore the conventional maximum likelihood （ML） decoding method with less complexity can be applied. Moreover the new scheme improves the BER performance significantly. Theoretical analysis and simulation results are presented in this paper to show the validation of this new scheme.