Received 3 July 2015; accepted 23 February 2016; published 26 February 2016
Because of its efficient maximum likelihood decoding, MIMO (Multiple-Input Multiple-Output) system has been received the significant amount of attention. In 1998, Alamouti proposed orthogonal STBC applied on two transmitting antennae firstly which is usually regarded as the OSTBC with full diversity and full transmission rate and has been used in mobile communication system  . More antennas can get more diversity gain. But it has been proved that full diversity and full rate complex design exists only for two transmit antennas. Due to this drawback, various linear quasi-orthogonal STBCs have been proposed to achieve a full rate (R = 1) for more than 2 transmit antennas at the expense of loosing the diversity gain and increasing the decoding complexity.
For O-STBC with N transmitting antennas, coding matrix S has following equation:
where SH is conjugate transpose of S, are transmitting symbols, is identity matrix with order N. And up to now, (2), (3) and (4) are orthogonal STBC be found with rate 1, 3/4, 3/4 respectively, as following Equations (2)-(4)  :
And for QO-STBC, proposed by Jafarkhani  , has following signal matrix:
S is an orthogonal matrix, it has the following feature:
where, represents channel gain for the four transmit antennas, and represents interference terms from neighboring signals.
So S is a quasi-orthogonal matrix. And it is well known that the presence of the channel dependent interference can cause the performance degradation in contrast to the optimal orthogonal design.
3. Constructing Orthogonal Channel Matrix by Givens Rotation
For a MIMO system, the received signal r is expressed as:
where C represents signal matrix and n is noise, the equivalent equation of r is given by
When C is chose suitably  , H can satisfy the following format:
is a diagonal matrix, so estimated value of s at the receiver is given by
Considering a flat fading channel over four time slots with 4 transmit antennas and 1 receive antenna, the channel gain is denoted by, its channel matrix is as follows after calculated through Givens rotation  - :
The symbol matrix corresponding to is expressed as:
So, although the new coding matrix is quasi-orthogonal, is an orthogonal matrix, linear decoding can be used to reduce decoding complexity (12)  . For an improved QO-STBC system based on givens rotation, we choose constant as follow:
The encoding matrix after rotation is described as:
Especially, when as a list,
If we define D as the estimating error, , then:
Here, , , , E is a full
rank matrix. So S gets coding gain.
4. Simulation Results and Performance Analysis
In this section, we make simulation for ABBA scheme, Jafarkhani scheme  and the new code by Figure 1 as following.
Figure 2 shows the BER performance of the three schemes. It can be seen that the new scheme has better performance.
Maximum transmit rate and diversity gain can be improved by givens rotation to non-orthogonal channel correlation of STBC. And also linear decoding complexity can be decreased at receive terminal. Transposition of
Figure 1. Simulation block diagram of QO-STBC.
Figure 2. BER versus SNR of three QO-STBC schemes.
channel matrix and Givens rotation are applied to eliminate part of interference terms and achieve a triangular matrix.
 Alamouti, S.M. (1998) A Simple Transmitter Diversity Scheme for Wireless Communications. IEEE Journal on Selected Areas in Communications, 16, 1451-1458.
 Xu, C.L., Gong, Y. and Letaief, K.B. (2004) High-Rate Complex Orthogonal Space-Time Block Codes for High Number of Transmit Antennas. 2004 IEEE International Conference on Communications, 2, 823-826.
 Jafarkhani, H. (2001) A Quasi-Orthogonal Space-Time Block Code. IEEE Transactions on Communications, 49, 1-4.
 Park, U., Lim, K. and Li, J. (2008) A Novel QO-STBC Scheme with Linear Decoding for Three and Four Transmit Antennas. IEEE Communications Letters, 12, 868-870.
 Tarokh, V., Jafarkhani, H. and Calderbank, A.R. (1999) Space Time Block Coding for Wireless Communications: Perfromance Results. IEEE Transactions on Information Theory, 45, 1456-1467.