Ostbc AND QSTBC: by Bala Aditya Krishna Kumar Madhav Magesh

OSTBC
AND
QSTBC
By
Bala Aditya
Krishna kumar
Madhav
Magesh
Orthogonal space time block codes
OSTBC
1. Improves the performance of wireless communications
2. Allows low complexity maximum-likelihood decoding in case of
smaller signal constellations.
3. Guarantees full diversity.
4. Low decoding latency.
5. Ability to provide full transmit diversity
6. Multiple antennas only at the base stations -low cost per user
7. High data rate
8. The complexity of a full ML decoder of OSTBC grows
exponentially with the size of the signal constellation,
which can be very complex for large signal constellations.
1. An orthogonal STBC is characterized by a code matrix
Gpxn (p= time delay or block length , n= number of
transmit antennas.)
2. The entries of G are linear combinations of k data
symbols or their conjugate, that belong to an
arbitrary signal constellation. The columns of G are
orthogonal to each other

and where GH denotes the complex conjugate transpose
of matrix G, and In is the size-n identity
matrix.

3.The code rate of G is defined as R = k/p (i.e., each
codeword with block length p carries k information symbols).
On Transceiver signal linearization

1. Consider a communication system with n transmit and
one receive antennas coded with an orthogonal STBC
Gp×n of rate k/n.
2. Consider another nxn code matrix.
3. Now let us compare these two matrices for better Rate
performance.Of the two Gnxn matrix gives lower code
rate.
4. It has been proved that for nxn matrix the upper bound of
rate is found to be 2/n and 1/n when n is even and odd
respectively.
5. So the conclusion is non square orthogonal designs
provide better rate as close as 3/4 (~1).

SYSTEM MODEL:
Code matrix:
If OSTBC used in this system is the Alamouti scheme
Channel matrix:
The channel gains vary from one signaling interval to

another as
where parameter α accounts for the Doppler shift

of the channel.
The signals received at two successive intervals at the receive
antenna are
w(2n) and w(2n +1) are AWGN samples having

zero-mean and variance σ^2 .
The received signals is, r(n) = H(n)s(n) + w(n)
The optimal decoder for the received signal is the ML

detector, which detects the transmitted codeword as
Full ML decoder:
ML decoder has to compute 2^2b decoding metrics which is
very complex for a large signal constellation.
Assumption:
The channel fading is quasi-static, i.e., the channel gains do not
vary within one signaling frame but may vary from frame to
frame
Therefore, the channel matrix is orthogonal, i.e.,
Therefore, the full ML decoding in can be simplified

as
simplified ML decoder:
This has to compute only 2×2^b decoding metrics
compared to 2^2b decoding metrics that the full ML
decoder (b=no of transmitted bits).

To further reduce the complexity a symbol by symbol
decoder is employed.
But this simplified ML decoder no longer offers good

performance when the channel varies from one signaling
interval to another.

This occurs in the vehicular environment where the
channels are non-identical and the CSI is not perfect.

when the channel varies from one signaling
interval to another, we have
Therefore, the decision statistics becomes
Here the second term is now the interference from the

second transmit antenna and , the second term is the
interference from the first transmit antenna. This type of
interference reasons why the simplified ML decoder in
no longer offers good performance when the channel
varies from one signaling interval to another
Case 1:The non-identical channels are associated with a
common receive antenna, the optimum decoder is
derived. We show that this optimum decoder can be
simplified to an SBS decoder, under the condition that the
received signal and the estimated channel matrices are
properly weighted.

Case 2:The non-identical channels are associated with a

common transmit antenna, we also derive the optimum
decoder. But it is shown that no matter how the receiver
structure is designed, the optimum decoder cannot be
simplified to a SBS decoder.
DISADVANTAGE

OSTBC suffers from low code rate when used with more
than 2 transmit antennas and complex modulation

SOLUTION

This disadvantage can be alleviated by a class of group-
decodable STBC design called the Quasi-Orthogonal STBC
(QO-STBC)
Reference
A Generalized Simplified ML Decoder of Orthogonal
Space-Time Block Code for Wireless Communications
over Time-Selective Fading Channel by
Tuan A. Tran and Abu B. Sesay
Dept. of Electrical and Computer Engineering, University
of Calgary 2500 University Drive, N.W., Calgary, AB,
Canada T2N1N4
On Orthogonal Space-Time Block Codes and
Transceiver Signal
Linearization
Weifeng Su, Member, IEEE, Stella N. Batalama, Member,
IEEE, and Dimitris A. Pados, Member, IEEE
THANK YOU

Ostbc AND QSTBC: by Bala Aditya Krishna Kumar Madhav Magesh

Uploaded by

Copyright:

Available Formats

Ostbc AND QSTBC: by Bala Aditya Krishna Kumar Madhav Magesh

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Ostbc AND QSTBC: by Bala Aditya Krishna Kumar Madhav Magesh

Uploaded by

Copyright:

Available Formats

OSTBC

The channel gains vary from one signaling interval to

where parameter α accounts for the Doppler shift

w(2n) and w(2n +1) are AWGN samples having

The received signals is, r(n) = H(n)s(n) + w(n)

The optimal decoder for the received signal is the ML

Therefore, the channel matrix is orthogonal, i.e.,

Therefore, the full ML decoding in can be simplified

But this simplified ML decoder no longer offers good

Therefore, the decision statistics becomes

Here the second term is now the interference from the

Case 2:The non-identical channels are associated with a

You might also like