Compressive Coded Modulation

for
Seamless Rate Adaptation

Ravindra Padsala [140010741014]

CONTENTS
1.
2.
3.
4.
5.
6.
7.

Introduction.
Related Background.
Compressive Coded Modulation.
RP Code Design.
Belief Propagation Decoding.
Evaluation Result.
Conclusion.

1. INTRODUCTION
The end-to-end performance of wireless communication
depends on the effective processing in both the source and
channel.
First from receiver side only.
There is many uncompressed data into the network.
If the data redundancy in transmission is utilized it will
boost communication efficiency.
Used wireless channel is time-varying and subject to
fading, additive noise and interference.
The success of AMC depends on the instant and accurate
channel estimation, which cannot be obtained
simultaneously.

1. INTRODUCTION[Cont.]
As it is not practical to require all applications to compress
their data before transmission.
A question is, it is possible to achieve high-efficiency
compression at PHY? A straightforward answer would be
no, because conventional data techniques, such as
Huffman coding and arithmetic coding, need sufficient
information for a specific data type. This requirement
usually cannot be fulfilled because PHY contains small
sets of hybrid data. Besides, application data have already
been represented by streams of bits instead of logical data
structures at PHY. It would require change to the entire
network to get more information.

2. RELATED BACKGROUND

A. Joint Source - Channel Coding

Joint source-channel coding (JSCC), in its broad sense,
covers all schemes that jointly considering source coding
and channel coding.
JSCC can be classified into three categories.
1. The first category usually applies to image/video
transmission.
2. The second category jointly consider the compression of
correlated sources and channel protection.
3. The third category for both compression and protection of
a single source.

2. RELATED BACKGROUND
B. Coded Modulation
The trellis coded modulation (TCM) proposed by
Ungerboeck is the first scheme of coded modulation
used. [Euclidian Distance]
Multilevel coded (MLC) modulation is another elegant way
for coded modulation. [Hamming Distance]
Bit-interleaved coded modulation (BICM) can solve issue
of robustness under a Rayleigh channel.
The discovery of turbo code & the rediscovery of LDPC
codes are advance development in contemporary coded
modulation. However, they lack rate adaptation
capability, and they have to rely on separate adaptive
modulation to change the rate when channel varies.

2. RELATED BACKGROUND

C. Rate Adaptation

Rate adaptation is the techniques which adjust the

modulation, coding, power and other protocol parameters
based on varying channel conditions. The most well-known
rate adaptation technique is adaptive modulation and
coding (AMC).
Hybrid automatic repeat request (HARQ) is a supplemental
technique to AMC which has incremental redundancy
scheme.
Gudipati and Katti propose a scheme named Strider which
appends a minimum distance transformer (MDT) after
existing coding and modulation. This is best for all three to
achieve smooth and blind rate adaptation in a wide range
of channel condition.

3. Compressive Coded Modulation

A. RCM Overview
B. CCM for Sparse Binary Sources

2. RELATED BACKGROUND
D. Compressive Sensing
The bit-to-symbol mapping in Rate Compatible Modulation
(RCM) converts source bits into multilevel symbols through
weighted sum operation. It is essentially a Compressive
Sensing (CS) scheme with binary input.
Compressive Sensing (CS) theory states that n-dimensional
signal having a sparse or compressible representation can
be reconstructed from m linear measurements even if
m<n.

3. Compressive Coded Modulation

A. RCM Overview
B. CCM for Sparse Binary Sources

3. Compressive Coded Modulation

A. RCM Overview

3. Compressive Coded Modulation

B. CCM for Sparse Binary Sources
For a sparse binary source, the bit-to-symbol mapping
serves dual purposes in data compression and channel
coding.
We name this process Random Projection(RP) coding.
According to the CS theory, the number of symbols (M)
required to decode the source is proportional to the source
sparsity.

4. RP CODE DESIGN
Design Principles

5. Belief Propagation Decoding

1. Initialization
2. Computation at constraint nodes with probability
distribution.
3. Computation at variable nodes.
First multiplication of variable nodes.
Then for each neighbouring constraint node v compute via
division and normalization.
4.
For each node v original sparse or compressible
representation.

5. Belief Propagation Decoding

6. Evaluation Result

LOS = Line-of-Sight. & NLOS=Non-Line-of-Sight.

CCM=Compressive Coding Modulation
HARQ= Hybrid automatic repeat request
BICM=Bit-interleaved Coded Modulation

7. Conclusion
In this paper a novel compressive coded modulation
scheme is described which is capable of achieving
simultaneously both source compression and seamless
rate adaptation.
In this novel scheme, data compression is elegantly
embedded into coded modulation through a virtually rate
less multilevel code named RP code.

THANK
YOU