MAP algorithm
T re llis c od e mod u lation
Trellis Code Modulation (TCM)
• Spectral efficiency: number of bits per second per 1 Hz of
bandw idth (b its/s/Hz).
• T h e data rate can be increased w ith outh increasing th e
bandw idth by transmiting more information per ev ery symbol.
( M ore bits per ev ery ch annel use).
• T h e information content of th e symbol is increased by
increasing amount of possible symbol v alues. F or ex ample for
transmitting tw o bits per symbol w e h av e to h av e four
possible symbol lev els.
• If th e energ y per information bit is k ept constant th e h ig h er
number of symbol v alues decrease th e av erag e pow er per
symbol - increase of error probability for symbol.
• E rror probability can be decreased by adding more code bits -
th e code rate is increased.
MAP algorithm
Trellis code modulation
• The signalling rate is not increased since each symbol contains
more information.
• Since power ber bit is kept constant after increasing the
constellation siz e the distance between the possible
constellation points, symbols, is should be decreased
• The positive coding gain is achieved if the increase of the
error probability due to smaller distance between constellation
points is outweighted by the coding gain of the error
correction code.
MAP algorithm
Trellis code modulation
• In general the coding maps information bit to higher number
of code bits.
• If the coded bits are transmitted bit by bit in order to maintain
the data rate we have to increase the channel usage rate.
• More code bits means that spectral efficiency is decreased
since more bandwidth is req uired.
• The trellis coded modulation introduces additional parity bits
and does not increase the bandwidth.
• The eff ective throughput in the channel is maintained by
enlarging the number of constellation points.
• B y increasing the amount of constellation points we increase
the signal set and more information can be transmitted by
each singnal.
MAP algorithm
Trellis code modulation
• For example: we have 4 information bits that are
tramnsmitted in 4 subsequent time intervals.
• The information bits are coded with 1/2 rate code. The
codeword contains 8 coded bits.
• In order to maintain the same information rate we have to
send for each infoamtion bit two coded bits. The coded bits
can be transmitted either by
− U sing two times shorter pulses. (two times more bandwidth)
− U sing more constellation points per channel use. For example
4 Q P SK instead of BP SK .
In order to keep power bit constant this new constellaion
should be scaled with the coding rate.
MAP algorithm MAP algorithm
Trellis code modulation Trellis code modulation

Coding versus noncoding 4 PSK transmitter

- 4 PSK each of the four bits may be transmitted.
2(010)
- The sequence that can be transmitted is not restricted.
2 3(011) 2(010)
1
- The optimum detector makes nearest phasor based decision
4(011)
0(000) for each individual received symbol.
3 - Each phasor is represented by two bit symbol.
0
5(101) 7(111)

6(110)
8 PSK TCM endoder
00 - The 8PSK trellis has four states selected accordingly to the
state of the shift register.
01

- A t arrival of a new symbol the content of the shift register is

10
changed.
11
- The encoding allows only certain trajectories trough the trellis.
- Illegitimate sequences can be rejected.
Figure: C oded and non coded transmission

MAP algorithm MAP algorithm

Trellis code modulation Trellis code modulation

Example of TCM principle

2(010)
2(01
• The extended signal set has smaller distance between the 3(011) 0)

neighbouring constellation points than the initial signal set. 4(011) 0(000)
• Subset of the signal set has better distance compared to initial
set. 7(111)
5(101)
6(110)
• If we know at the decoder which subset is in the use we have
better BER for the bit decision than in the initial code.
• In TCM the selection of the signal set is made accordingly to
the state in the trellis of the convolutionally encoded bits.

Figure: Example of the set partitioning

MAP algorithm MAP algorithm
Trellis code modulation Trellis code modulation

• The binary phasor identifiers are not Gray encoded.

D
• The bit assignment is made for achieving high Eucledian Signal mapping

Bit 2
distance between the trajectories in the trellis. + 00001111

• The Eucledian distance amongst constellation points is

Bit 1
increased at every partition step. 00110011

• Parallel trellis transitions are assigned to phasors with Bit 0 01010101

D + D
maximum possible distance. 01234567

• All the signals are used with equal probability.

√
• The state transitions have distance of d1 = 2 at least. Figure: Example of a TCM encoder

• L ast two bits are used for identifying the used set.
• The unprotected bit 2 is used for selecting the point in each
partitioned set.

MAP algorithm MAP algorithm

Trellis code modulation Trellis code modulation

• The error is divergence from

the correct trellis path.
Probability calculation for the symbols
• The minimum distance is the We have to evaluate the aposteriori probability for each possible
0 0 0
minimum from : constellation point given the observed value from the channel.
4
00
2 2
6
- the distance between the
01
6 2
phasors labelling the p(Y |X )
0 1
4
1 5
parallel branches
10

3
3
- distance between the X is defined by the possible constellation point (symbol).
7 7
11 1 trellis paths.
5
Y is the observed noisy value
• Free distance in 4PSK
√
Figure: Example of a TCM dfree = 2
encoder, symbol based
trellis • Free distance in TCM 8PSK
 q 
2 2 2
dfree = min d2 ; d1 + d0 + d1 = 2
MAP algorithm MAP algorithm
Trellis code modulation Trellis code modulation

Example: 8 PSK If the received point is y = 0.7 + 0.6 ∗ j  

Const. Point xi P(y |xi ) ln(P(y |xi )) ln P(P(y |xi ))
• possible 8 positions in the j (P(y |xj ))

2(010)
complex plain. 1.0000 0.13 -2.026 -2.3 4
3(011) 1(001) • Can be evaluated as multi- 0.7 07 1 + 0.7 07 1j 1.19 0.17 68 -0.1408
4(011)
plication of two independent 0 + 1.0000j 0.048 -3 .03 07 -3 .3 4
0(000)
X-Axi
s gaussian probabilities or as a -0.7 07 1 + 0.7 07 1j 0.00005 7 -9 .7 69 7 -10.09
7(111) complex gaussian probability. -1.0000 0.000... -16.09 25 -16.41
5(101)
6(110) • For a symbol x1 = 1 -0.7 07 1 - 0.7 07 1j 0.000... -18.29 5 3 -18.61
x1,real = 1 x1,im ag = 0 0 - 1.0000j 0.000... -15 .087 8 -15 .41
0.7 07 1 - 0.7 07 1j 0.00023 7 -8.3 488 -8.67
1 (yreal −x1,real )2 1 (yim ag −x1,im ag )2
p(y |x1 ) = √ e− 2σ ·√ e− 2σ
2πσ 2 2πσ 2
2
1 − |y−x 1|
= e 2σ c
2πσc2

MAP algorithm MAP algorithm

Turb o trellis coded modulation Turbo trellis coded modulation

Turbo Pinciple on Trellis codes Symbol based turbo codes

• The probability is calculated for the whole symbol s1 . • We employ multiple trellis encoders in parallel.
• The aposteriori probabilities can not be calculated for the bits • The puncturing is made at the output of the encoders.
separately. − Puncturing is made on the symbols.
− In case of two encoders every other symbol is selected from
• In general the bits probabilities are not independent.
different encoder output.
p(y |s1 ) = p(y |b1 , b2 , b3 ) 6= p(y1 |b1 )p(y2 |b2 )p(y3 |b3 ) • The symbol stream to different encoders is interleaved.
Possible Solutions In order not to puncuture systematic bits:
• Symbol based coding → Symbol Based MAP. − The symbol stream is split into two sets.
− Interleaving is made inside of the sets.
• Marginalisation → BICM. − D uring the puncturing: from one encoder is punctured away
• Use multiple interleavers and clever puncturing. symbols in one set, from the other encoder symbols from the
ohter set.
MAP algorithm MAP algorithm
Turbo trellis coded modulation Turbo trellis coded modulation

Turbo Trellis Code Modulator Symbol based Turbo Decoding

The symbol based MAP algorithm differ from its bit based
Trellis Signal Channel
Modulator counterpart:
Encoder 1 Mapper interl.
• The probabilities are calculated for the symbols.
Symbol Symbol • In general the logarithms are evaluated for the probabilities
Interl. Deinterl.
not for the likelihood ratios.
Trellis Signal • The extrinsic infomation is calculated for the symbols.
Encoder 1 Mapper
In TTCM encoder the full symbol is punctured away.
• In the trellis all the probabilities for all the possible values the
Figure: Example of a TTCM encoder punctured symbol can take are set to be equal.
• The MAP decoder evaluates the aposteriori probability also
for the symbols that are punctured away and use these as the
extrinsic information for the other decoder.
• Between the decoders is transmitted the extrisic information
for the symbols.

MAP algorithm MAP algorithm

Turbo trellis coded modulation Turbo trellis coded modulation

[P&S]
metric A+[E&S] 4
[E&S]
symbol by
interleaver
symbol + a-priori 2 2
MAP
6
6
interleaver a=[E&S]
symbols

5 0
A=[e&s] 4
1
a+[e&s] [e&s]
symbol by
symbol + deinterleaver
a-priori
MAP
metric
[p&s] 3
deinterleaver 3
Hard decision 7 7
a-posteriori
1
P - parity, S - systematic, E - extrinsic, A - a-priori

5
Figure: Example of a TCM decoder
P(r1|s#,2)=P(r1|b#,11,b#,21,b#,31)
P(r2|s#,2)=P(r2|b#,12,b#,22,b#,32)
P(r3|s#,3)=P(r2|b#,13,b#,23,b#,33)

Punctured
MAP algorithm MAP algorithm
Turbo trellis coded modulation Turbo trellis coded modulation

A


Nonbinary or symbol based MAP algorithm The algorithm for calculating pk,m = P sk = m|y
• Calculation of the probability value for the symbol. A
• Calculation of the pk,m is sim ilar to calculation of a b it
• Each information symbol uk can have M different values and ap osteriori p rob ab lity in the trellis of a b inary cod e.
contain m log2 (M) bits of information. • W e sum ov er all the p aths troug h the trellis w here g iv en
• The decoder computes aposteriori Probability (APP) A
pk,m for sy m b ol at tim e k w as sk = m.
each of the possible 2m symbols. 1 X
A
Ak−1 (st ) · Mk st 0 , st · Bk s 0 = Ck ·p A



• A
pk,m is the probability that the received symbol at time k was pk,m =
k,m
P y 0
sk = X . (s ,s)⇒
sk =m
• The received symbol is decided to be the one with the highest
A • In d ecision p rocess w e d o not need the ab solute v alues b ut
pk,m probability.
ratios and therefore can d rop from m ultip lication w ith the
com m on constants.

MAP algorithm MAP algorithm

T u rb o tre llis c od e d mod u lation Turbo trellis coded modulation

• The computation of Mk (st 0 , st) is diff erent in the symbol

2
based map compared to the binary M A P . 1 − |yk −x2k |
P yk | st 0 , st = = Ck2 ηk st 0 , st



2
e 2σ


2π σ
Mk s 0 , s = P {y ∧ Sk = st} | Sk−1 = st 0 X
Ak−1 (st) Mk st 0 , st


Ak (st) =



= P yk | st 0 , st · P st| st 0

a ll st 0
= P yk | st 0 , st · P (m)
X
Bk st 0 = Bk+ 1 (st) Mk st 0 , st



- sk = m is the input symbol necessary to cause the transition from
a ll st
state st 0 to state st.
- P (m) is the a-priori probability of m. (Typically all the symbols are
• In the result of the algorithm we get a po sterio ri estimation for
eq uiprobable).
each symbol.
- The fi rst term is probability that the symbol received is yk and the
symbol transmitted is xk (xk is phasor corresponding to sk ). • S ince in TTCM the codes have the common symbols this
a po sterio ri information can be used in decoding of the other
- yk = xk + nk . nk is complex A WG N .
code as the extrinsic information of the symbols.
MAP algorithm MAP algorithm
Turbo trellis coded modulation Turbo trellis coded modulation

Complexity of the MAP symbol decoder Performance of TTCM

• N information symbols.
0
10

• E ach information symbol contains M possible values BER

FER

• Number of encoder states is S. −1

10

• The trellis code double the original signal constellation. There

are M = 2M possible transmitted symbols. −2
10

BER/FER
• The forward and back ward computation requires
- 2 · N · M · S multiplications −3
10

- N · M · S additions
A
• The terms in pk,m require three multipliations −4
10

• there are total N · M terms with S terms to be summed.

−5
10
3 3.1 3.2 3.3 3.4 3.5 3.6 3.7 3.8 3.9 4
7·N ·M ·S multiplications SNR

3·N ·M ·S summations
3·N ·M exponentials Figure: B ER and FER for 8 PSK encoded TTCM, datarate 2 bits per
symbol

MAP algorithm MAP algorithm

Turbo trellis coded modulation B IC M

−1
Bit Interleaved Coded Modulation (BICM)
10

• Purpose of the BICM is to increase the diversity order of TCM

schemes.
−2
10 • D iversity order of TCM is the minimum number of different
symbols along the shortest error event path between the
correct and error event path.
BER

−3
10
• If there is no parallel branch the degree of diversity is
increased when constraint length of the code is increased.
iteration 1
iteration 2
−4
10 iteration 3 Convolutional encoder 8-PSK modulator

iteration 4

Bit 2
Bit 2
D
+ interleaver
010
011
001
Bit 1
+
−5
10
3 3.1 3.2 3.3 3.4 3.5 3.6 3.7 3.8 3.9 4 Bit 1 interleaver 110 000
SNR D D
Bit 0
+ interleaver
111
101
100

Figure: TTCM performance dependency on interations

Figure: Example of a BICM encoder
MAP algorithm MAP algorithm
BICM BICM

• The symbols are generated by a non-systematic convolutional Turbo BICM

encoder.
• BICM uses bit interleavers for all the bits of a symbol. Tranmsmitter

• The number of bitinterleavers equals to the number of bits encoder interleaver modulator

assigned to one non-binary codeword.

Receiver
• Purpose of the bit interleaver:
interleaver
- Disperse the burst errors and maximiz e the diversity order of
the system.
deinterleaver
- U ncorrelate the bits associated with the given transmitted Demodulator
SISO
decoder
symbol.
• The interleaved bits are collected into non-binary symbols.
Figure: BICM combined with forward error correction
• The symbols are Gray labeled.
The iterative turbo BICM improves BICM performance in gaussian
channel by increasing free eucledial distance of the code. Two new
ideas:
calcualtion of the marginal probability for each bit
set partitioning

MAP algorithm MAP algorithm

BICM BICM

• The deocder treats each bit stream as independent.

Bit 2 Bit 1 Bit 0
• Form the symbols are calcualted the marginal probability for
011 011 011
each bit. 010
001
010
001 010 001

• The decoder treats marginal probablities as they would be 110 000

110
000
110
000
independent.
100 100 100
111 111 111
101 101 101

010 010 010

011 011 011
001 001 001

100 000 100 000 100 000

101 111 101 111 101 111

110 110 110

(Bit 2, Bit 1, Bit 0)

Figure: Example of a set partitioning compared to Gray labelling

MAP algorithm
BICM

BICM-ID converts a 2m ary signalling scheme into m independent

parallel binary schemes.
• First iteration - the Gray labelling optimal.
- Gray labelling has a lower number of nearest neighbours
compared to SP - based labelling.
- The higher the number of nearest neighbour the higher the
chances for a bit to be decoded into wrong region.
• Second iteration
- The soft information allows to confine the decision region into
a pair of constellation points.
- We want to maximise the minimum Eucledian distance
between any two points in the possible phasor pairs for all the
bits.