Block Coded Modulation

Course Presentation

Haris Bin Khalid

Center for Advanced Studies in Engineering

 Block Coded Modulation
The Idea of coded modulation is to jointly optimize coding and
modulation in order to improve the performance of digital transmission
schemes
Block Coding & Channel Signal Set Construct Bandwidth Efficient
Codes referred to as Block Coded Modulation
Most Powerful Method to Construct Block Coded Modulation is Multi
level Coding by Hamai & Irakawa in 1976
Originally, MLC was proposed for one{dimensional signaling combined
with labeling by binary counting of the signal levels.
 Multilevel Coding
Imai's idea of multilevel coding (MLC) is to protect each
address bit of the signal point by an individual binary
code Number of parallel encoders
The outputs at each instant select one symbol

q1 K1 N x1
E1 (rate R1)
data bits
from the q2 K2 N x2 Signal
information E2 (rate R2)
M-way Mapping Point
source Partitioning (to 2M-point
of data constellation)

qM KM N xM
EM (rate RM)

M M
1
R Ri K i bits/symbo l
i 1 N i 1
 System Model
Consider a modulation scheme with M= 2^L , L>1 signal points in a -dimensional signal
space

binary partitioning of the 8{ASK (8{ary amplitude shift keying) signal (D = 1) set is
illustrated
In the first step, at partitioning level 1, the signal set A is divided into two parts, namely
the subsets A(x0 = 0) and A(x0 = 1).
Then, all subsets A(x0 . xi1 ) at partitioning level i are iteratively divided into two
further subsets A(x0 ..xi1 0) and A(x0 .. xi1 1) at partitioning level i + 1.
Each subset at partitioning level i is uniquely labeled by the path (x0 . xi1 ) in the
partitioning tree from the root to the subset in the equation on the next slide
 If A and Y denote the transmitted and received symbol sequences respectively, using the
chain rule for mutual information
I (Y ; A) I (Y ; X1 , X 2 , , X M )
I (Y ; X 1 ) I (Y ; X 2 | X 1 )
I (Y ; X M | X 1 , X 2 , , X M 1 )
 Decoding

Optimum decoder: Maximum-Likelihood decoder

If the encoder memories are 1, 2, ,M,

the total number of states is 2,
where = 1 + 2 + + M.

Complexity Need to look for suboptimum

decoders
 X
X
X
1 2 i 1

...
Y Decoder Di
X i

The decoding (in stage i) is usually

done in two steps
Point in subset decoding
Subset decoding

This method is not optimal in maximum

likelihood sense, but it is asymptotically optimal
for high SNR.
 Advantages of BCM
0
10
Overall
Encoded
Uncoded
-1
10

-2
Error Probability

10

-3
10

-4
10

-5
10
0 1 2 3 4 5 6 7
SNR per Bit

8-ASK by BCM vs uncoded, AWGN channel

 Advantages of BCM
-1
10
Overall
Encoded
Uncoded

-2
10
Error Probability

-3
10

-4
10

-5
10
6 8 10 12 14 16 18 20
SNR per Bit

8-ASK by BCM vs
fast Rayleigh fading channel
 Summary
The key point for a power-efficient design of MLC schemes is the proper
assignment of individual rates to the component codes
Various information-theoretic parameters (capacity, coding exponent, and
cutoff rate) of the equivalent channels of an MLC scheme lead to various
design rules for coded modulation schemes based
The capacity of MLC schemes is independent of the particular labeling.
In combination with channel coding, signal shaping provides further gain by
reducing average transmit power
MLC approach provides flexible transmission rates, because it decouples the
dimensionality of the signal constellation from the code rate