Performance Enhancement of Space Time

Turbo Trellis codes

Submitted by :Muhmmad Sohaib Arshad
Supervised by : Dr M ARIF WAHALA
Thesis
committee
members
Lt.Col.Faheem
Maj Dr Adnan Rashidi
Maj Dr Adil Masood
Siddiquei
High data rates becomes a need due to some
demanding applications.
Limitations on useable frequency spectrum .
The delay and burst errors are no more
tolerated.
Transmitter
Fading Channel
+
Noise
Receiver
The randomness of the wireless channel.
The basic objective of the thesis is to devise a way to enhance
the performance of ST Turbo TC as the complexity offered by
the codes is not comparable with the performance.
Diversity is used in wireless channels to combat
the fading.
Receive diversity and transmit diversity mitigate
fading and significantly improve link quality.
The receive antennas see independently faded
versions of the same signals.
The receiver combines these signals so that the
resultant signal exhibits considerably reduced
amplitude fading.
Diversity order MR x MT
MIMO turns multipath propagation into a benefit
for the user
The capacity of MIMO system with n transmit and
receive antennas would be proportional to n

MIMO
SIMO
MISO
An effective and practical way of approaching
the capacity of MIMO is to employ space time
coding.
Coding is performed in both spatial and
temporal domains to introduce correlation
between signals transmitted from various
antennas at various time-periods.
Space time coding can achieve transmit and
receive diversity and power gain over spatially
uncoded system without sacrificing
bandwidth.
What is Space-Time
Coding?
Space diversity at antenna
Time diversity to
introduce redundant data




There are different
approaches introduced
in space time codes
Space time block codes(STBC)
Space time Trellis codes(STTC)
Space time Turbo Trellis
codes
Layered space time codes(LST)
Space-time block coding utilizes multiple
transmit antennas to create spatial
diversity.
This allows a system to have better performance
in a fading environment.
Benefits:
Good performance with minimal decoding
complexity.
Can achieve maximum diversity gain.
Receivers that use only linear processing.
No coding gain
Alamouti-Scheme
Simple yet very effective
Space diversity at transmitter end
Orthogonal block code design


Non-full rate space-time block codes can
introduce bandwidth expansion.
STTC was rst introduced by Tarokh, Seshadri
and Calderbank.
Benefits of STTC
coding gain,
spectral efficiency
diversity improvement on at fading channels.
Complex decoding(Viterbi decoder)
X
X
X
X
X
X

0,1
1
,
0,2
1

1,1
1
,
1,2
1

0,1
2
,
0,2
2

1,1
2
,
1,2
2

2
,1
2
,

2
,2
2

1
,1
1
,

1
,2
1

1
,

2

Space time trellis encoder

Turbo codes with paralleley concatenated
encoders separated by a random interleaver
having trellis as constituent codes promises
bandwidth efficient full rate code for MIMO
system .
STTC were made recursive .
The aim was to gain the advantage from the
coding gain of turbo coding and interleaver.
MAP increases the decoding complexity.

Transmitter
RSTTC
RSTTC
Interleaver
De-
Interleaver
MUX
Symbols

Our proposed system model comprises of
parallely concatenated recursive systematic
encoders separated by a deterministic interleaver
,which is used to increase the decorrelation of
the symbols encoded by both encoders.
Symbols are then punctured and sent
simultaneously on a slow fading mimo channel
from different antennas.
While the decoder comprises of a symbol-by-
symbol MAP algorithm using the same interleaver
and deinterleaver.
Transmitter
RSTTC
RSTTC
HSD
Interleaver
HSD De-
Interleaver
MUX
Symbols

De
mu
x
Decoder 1
Symbol
interleaver
Symbol
Interleaver
Decoder
2
Symbol
Deinterleaver
Symbol
Deinterleaver
2,es
A
2
r
1
r
2
r
1,es
A
2,es
A
2
A
1,es
A
Receiver
Fig shows the block diagram of ST Turbo TC
transmitter which consists of two paralleley
concatenated recursive trellis encoders separated by
an interlaever.
The encoder structure consists of shift registers
which constitutes of generator polynomials.
These generator polynomials are constructed by
making STTC generators recursive .
The feed forward polynomials are made recursive by
dividing a primitive polynomial of degree less than or
equal to the branch memory order .
The feedforward polynomials are supposed to
increase the Dmin of the coded bits whereas the
feedback polynomials are used for the decoder
convergence .
The feed forward generator polynomials

G
i
(D)=
The recursive matrix of generators

G
i
(D)=

Where q(D) is the primitive polynomial of degree
less than or equal to memory order of the branch

=
=
m
k
k
v v
1

1
2
( )
( )
( )
( )
i
i
G D
q D
G D
q D
(
(
(
(
(


( )
(

) (
2
1
D G
D G
i
i
X
X
X
X
X
X

0,1
1
,
0,2
1

1,1
1
,
1,2
1

0,1
2
,
0,2
2

1,1
2
,
1,2
2

2
,1
2
,

2
,2
2

1
,1
1
,

1
,2
1

1
,

2

+
+
X
X
X
X
.

1



Generator polynomials for QPSK Modulation

n
t


v
Feedforward Coefficients Feedback
Coefficien
ts

d
E
2

R
g
1
g
2
q
1
q
2

2
2 [(0,2)(1,2)] [(2,3)(2,0)] 3 3 10 2
3 [(2,2)(2,1)] [(2,0)(1,2)(0,2)] 3 7 12 2
4 [(1,2)(1,3)(3,2)] [(2,0)(2,2)(2,0)] 7 5 16 2

3
2 [(0,2,1)(1,2,2)] [(2,3,2)(2,0,1)] 3 3 16 2
3 [(2,2,2)(2,1,3)] [(2,0,1)(1,2,0)(02,2,)] 3 7 20 2
4 [(1,2,3)(1,3,2)(3,2,3)] [(2,0,2)(2,2,0)(2,0,2)] 7 7 24 2

4
2 [(0,2,1,0)(1,2,2,2)] [(2,3,2,3)(2,0,1,1)] 3 3 20 2
3 [(2,2,2,2)(2,1,3,2)] [(2,0,1,1)(1,2,0,1)(0,2,2,3)] 3 7 26 2
4 [(1,2,3,3)(1,3,2,2)(3,2,3,3)] [(2,0,2,2)(2,2,0,0)(2,0,2,2)] 7 7 32 >2

The input bit stream C is fed into the first
encoder without interleaving ,while the
second encoder gets the input from the
interleaver which scrambles the information
in a deterministic fashion.
Both encoded streams are punctured
alternatively and transmitted through
antennas. The encoder output for transmit
antenna i at time t, denoted by x, can be
computed as



,
0 0
k
v
m
i k k
t j i t j
n j
x g c

= =
=

With random interleavers turbo codes

perform well for large block size .
The error floor can be reduced by increasing
the block size L or by increasing the symbol
de-correaltion.
There are two major criteria's
1. The distance spectrum proprieties of the code
2. Iterative decoding suitability criteria(IDS)

According to these criteria's an interleaver proposed by
Hamid.R.Sajadapour becomes a strong candidate, as its
been able to maintain the distance spectrum of the code
and also help to decrease the correlation .
IDS criteria is not been fulfilled because of c
t
= (c
t
),
The Interleaver proposed by M ARIF and Israr Sheikh
Design of two step deterministic interleaver for turbo
code
The HSD interleaver is algebraically designed by selecting the best
permutation generator in a way that the points in smaller subsets
of the interleaved output are uniformly spread over the entire
range of the data frame.
Then the length specific circular shift is introduced in design
becomes a reason to decrease the correlation between the parity
bits corresponding to the original and interleaved data frames
The distance spectrum is catered with the
help of multiplication factor denoted by MF
and the IDS criteria is catered with the help of
circular shift or displacement.
Permutations are generated by the help of
following equation by keeping in view of the
upper bound limits and lower bound limits.

(2 ) 1 k M n =
k L <
Where k is knows as the permutation
generator and M is the multiplication factor
and L is the block size
In order to restrict K that it should always be
less than L we have to restrict M .
The upper limit on M can be derived as
follows


(2 ) 1
k L
M n L
<
<
This refers to





The values of K and M are used to produce
good permutations

2
(2 ) 1
1
2
2
1
2
1
M n L
L
M
n
n
M
n
M n
s
s
s
s
Circular Shift
The minimum Displacement distance can be defined as


The larger the (D
min
), the smaller the correlation
between the extrinsic information from one decoder to
the information data sequence at the input of the other
decoder.

mod L 0<d<S
min
/2
So the maximum value of d which helps in maximizing
the D
min
can be calculated as

And the achievable D
min
= S
min
/2.


min 1 1
min
( ) D j j = [

( ) i j jk d = [ = +

min
1
2
S
d =
Turbo codes are decoded using a method called
the Maximum Likelihood Detection MLD.
The decoders iteratively works on a priori
probabilities of the symbols and gives an output
in the form of soft decision which gives the
reliability of the decision.
MAP algorithm is used for the turbo decoding
which follows the principle of MLD.
Another decoding algorithm SOVA is also used
for turbo decoding based on viterbi decoding.
SOVA maximizes the probabilities of sequences
whereas the MAP algo maximizes the
probabilities at every moment.
Map algorithm is used for decoding of ST
Turbo TC ,which uses symbol probabilities.
The systematic information and extrinsic
information are not independent. Hence they
are calculated as joint systematic and
extrinsic information. Which is bit different
from MAP algo used for binary turbo codes.
At time t the signal received by antenna j can
be represented as
r
j
t
=

=
nT
i 1
h
t
i,j
x
i
p,t
+n
t
j

De
mu
x
Decoder 1
Symbol
interleaver
Symbol
Interleaver
Decoder
2
Symbol
Deinterleaver
Symbol
Deinterleaver
2,es
A
2
r
1
r
2
r
1,es
A
2,es
A
2
A
1,es
A
Receiver
The received sequence is demultiplxed and
fed to the first and second decoder
respectively .
The MAP decoder computes the LLR(Log likely
hood ratio) of each group of info bits.


{ }
{ }
( ) log
r t
t
r t
P c i r
c i
P c o r
=
A = =
=

1
( , )
1
( , )
( ) ( , ) ( )
log
( ) ( , ) ( )
i
t
o
t
i
t t t
l l
o
t t t
l l
l l l l
l l l l
|
|
o |
o |

' e

' e
' '
=
' '

The joint extrinsic and systematic information

of the first MAP decoder denoted by
1,es
(c
t
=
i), can be obtained by


The joint extrinsic and systematic information
of the second decoder is given by



1, 1
( )
( ) ( ) log
(0)
t
es t t
t
p i
c i c i
p
A = = A =

2, 2 1
( ) ( ) ( )
es t t es t
c i c i c i A = = A = A =
Gain in terms of SNR by MAP over different decoding algorithims
Where M=2
v
for v=2 ,Total number of operations
=30x4=120-1=119
For v=3,Total number of operations=30x8=240-1=239
For v=4,Total number of operations=30x16=480-1=489
Operation Maximum a posteriori
Algorithm
Maximization 2M-1
Addition 4M
Multiplication 10M
Table Look Up 0
Total Operation 14M
Total # of
Operations
30M-1
The simulated model comprises of both
interleaver random and HSD with block size
of 128 symbols at a time. Generator
polynomials of table 1 for QPSK modulation
are used for 2x2 transmit and receive
antennas .
Symbol-by-Symbol MAP decoders are used
number of iterations per frame used are only
5 .
Fig shows the comparison of both simulated models
and shows almost a gain of 1.1 db by HSD interlaver
as compared to the random interleaver
8 9 10 11 12 13 14
10
-3
10
-2
10
-1
10
0
Es No db
F
r
a
m
e

E
r
r
o
r

r
a
t
e
Comparison of Rsttc2x2(4-state)


FER Branka
FER HSD
Almost 0.8db gain of HSD interleaver over
random interleaver is shown in slow fading
channel.
8 9 10 11 12 13 14
10
-3
10
-2
10
-1
10
0
Comparison of Rsttc 2x2(8-state)
Es No db
F
r
a
m
e

e
r
r
o
r

r
a
t
e


FER HSD
FER Branka
Frame error rate comparison shows that in same
environments the HSD interleaver outperforms by
0.9db .
8 9 10 11 12 13 14
10
-3
10
-2
10
-1
10
0
Comparison Of Rsttc with 2x2 (16 state)
Es No db
F
r
a
m
e

E
r
r
o
r

r
a
t
e


FER HSD
FER Branka
The array gain of 5-6db is quiet evident in both
models but the HSD interleaver shows significant
performance gain over random interleaver .
0 1 2 3 4 5 6 7
10
-3
10
-2
10
-1
10
0
Copamrison of 4x4 RSTTC
Es No db
F
r
a
m
e

E
r
r
o
r

R
a
t
e


FER Branka
FER HSD
Hence we have proved by the simulated
environment that the role of interlever plays
an important role in the performance of
Space time turbo codes .The right choice of
interleaver can give us almost 1 db gain in
the same environment.
ST Turbo TC can be implemented with
different decoders .
Higher order modulation schemes.

A P. W. Wolniansky, G. J. Foschini, G. D. Golden, and R. A. Valenzuela,
V-BLAST: an architecture for realizing very high data rates over the
rich-scattering wireless channel, in International Symposium on Signals
Systems and Electronics, Pisa, Italy, September 1998, pp. 295300.
V. Tarokh, N. Seshadri and A. R. Calderbank, Space-time codes for high
data rate wireless communication: performance criterion and code
construction, IEEE Trans. Inform. Theory, vol. 44, no. 2, pp. 744765,
Mar. 1998
S. M. Alamouti, Simple transmit diversity technique for wireless
communications, IEEE Journal on Select Areas in Communications, vol.
16, pp. 14511458, 1998..
V. Tarokh, H. Jafarkhani, and A. R. Calderbank, Space-time block codes
for orthogonal designs, IEEE Transactions on Information Theory, vol.
45, pp. 14561466, July 1996.
V. Tarokh, N. Seshadri, and A. R. Calderbank, Spacetime codes for high
data rate wireless communication: Performance analysis and code
construction, IEEE Transactions on Information Theory, vol. 44, pp.
744765, March 1998.

Hamid R. Sadjadpour, Maximum a posteriori decoding algorithm for
Turbo Codes, in proceedings of SPIE, Vol. 4045, 2000.
C. Berrou, A. Glavieux and P. Thitimajshima, "Near Shannon limit error-
correcting coding and decoding: turbo codes", Proc. Inter. Conf.
Commun., 1993, pp. 10641070.
P. Robertson and T. Worz, "Bandwidth-efficient turbo trellis coded
modulation using punctured component codes", IEEE Journal on Selec.
Areas in Communications, vol. 16, no. 2, pp. 206-218, Feb. 1998.
G. Ungerboeck, "Channel coding with multilevel phase signals", IEEE
Trans. Inform. Theory, vol. 28, Jan. 1982, pp. 55-67.
Dongzhe Cui and A. Haimovich, "Performance of parallel concatenated
space-time codes", IEEE Commun. Letters, vol. 5, June 2001, pp. 236-
238.
Y. Liu and M. Fitz, "Space-time turbo codes", 13th Annual Allerton Conf.
on Commun. Control and Computing, Sept. 1999.
B. Vucetic and J. Yuan, Turbo Codes Principles and Applications, Kluwer
Publishers,2000.

Muhammad Arif, N. M. Sheikh, Asrar U.H. Sheikh, A novel design of deterministic
interleaver for turbo codes, IEEE Int. Conf. on Elec. Engg., ICEE 07, pp.1-5, April,
2007.
Benedetto S, Montorsi G. Design of parallel concatenated convolutional codes. IEEE
Trans Commun 1996;44(5):591600.
Boutillon F, Gnaediq D. Maximum spread of D-dimensional multiple turbo codes.
IEEE Trans Commun 2005;53(8):123742
Crozier N. New high-spread high-distance interleavers for turbo codes. In: Proc
20th biennial symp commum 2000. p. 37.
Crozier S, Guinand P. Distance upper bounds and true minimum distance results
for turbo-codes designed with DRP interleavers.In: Proc third int symp turbo codes
and related topics 2003. p. 16972.
Berrou C, Saouter Y, Douillard C, Kerouedan S, Jezequel M. Designing good
permutations for turbo codes: towards a single model. In: Proc IEEE ICC 2004. p.
3415.
Hokfelt J, Edfors O, Maseng T. Interleaver design for turbo codes based on the
performance of iterative decoding. In: Proc IEEE ICC 1993. p. 937
D. Divsalar, S. Dolinar and F. Pollara, "Iterative turbo decoder analysis based on
density evolution", IEEE Journal on Selected Areas in Communications, vol. 9, pp.
891-907, May 2001.



Signal power in a wireless system fluctuates. When this signal
power drops significantly, the channel is said to be in fade.
Diversity is used in wireless channels to combat the fading.
Receive diversity and transmit diversity mitigate fading and
significantly improve link quality.
The receive antennas see independently faded versions of the
same signals. The receiver combines these signals so that the
resultant signal exhibits considerably reduced amplitude fading.
Diversity order MR x MT
MIMO turns multipath propagation into a benefit for the user

THANKS