Professional Documents
Culture Documents
EZIO BIGLIERI
Politecnico di Torino (Italy)
1
CODING FOR THE FADING CHANNEL
• Is Euclidean distance
the best criterion?
2
MOST OF THE COMMON WISDOM
ON CODE DESIGN
IS BASED ON HIGH-SNR GAUSSIAN CHANNEL:
3
FOR DIFFERENT CHANNEL MODELS,
DIFFERENT DESIGN CRITERIA MUST BE USED
4
FOR EXAMPLE, EVEN ON LOW-SNR
GAUSSIAN CHANNELS
MINIMUM-EUCLIDEAN DISTANCE IS NOT
THE OPTIMUM CRITERION
low SNR
high SNR
5
WIRELESS CHANNELS DIFFER
CONSIDERABLY FROM HIGH-SNR
GAUSSIAN CHANNELS:
6
CODING FOR THE FADING CHANNEL
7
COHERENCE BANDWIDTH
DEFINITION:
1
----------------------
DELAY SPREAD
☞ OPERATIONAL MEANING:
Frequency separation at which two frequency
components of TX signal undergo
independent attenuations 8
COHERENCE TIME
DEFINITION:
1
---------------------------
DOPPLER SPREAD
☞ OPERATIONAL MEANING:
Time separation at which two time
components of TX signal undergo
9
independent attenuations
FADING-CHANNEL CLASSIFICATION
Bx
flat selective
in in time
time and frequency
Bc
flat
flat in
in time and
frequency
frequency
Tc Tx
10
MOST COMMON MODEL FOR FADING
• channel is frequency-flat
• channel is time-flat (fading is “slow”)
11
MOST COMMON MODEL FOR FADING
• FREQUENCY-FLAT CHANNEL:
12
MOST COMMON MODEL FOR FADING
• SLOW FADING :
Received signal:
r(t ) = R exp jΘ x(t ) + n(t ), 0<t <T
This is constant over
a symbol interval
13
COHERENT DEMODULATION
Received signal:
14
CHANNEL-STATE INFORMATION
1
bit error probability, binary antipodal signals
0.1
RAYLEIGH
0.01 FADING
0.001
GAUSSIAN
CHANNEL
0.0001
0.00001
0 10 20 30
17
MOST COMMON MODEL FOR CODING
FULLY-INTERLEAVED CHANNEL
18
DESIGNING OPTIMUM CODES
Design criterion:
A consequence:
22
ROBUST CODES
23
CODING FOR THE FADING CHANNEL
24
A ROBUST SCHEME: BICM
25
A ROBUST SCHEME: BICM
11 10 11 concurrent path
∑ p( r | s )
s∈Si ( b )
i
whereS (b)set of symbols whose label is b in position i
is the
01
● ●
EXAMPLE:
11 ● ● 00 S1 (0) ●
● 28
10
A ROBUST SCHEME: BICM
so we can combine:
• A powerful modulation scheme
• A powerful code (turbo codes, …)
29
EXAMPLE
: 16QAM, 3bits/2 dimensions
2 1.2 3 2 1
3 1.6 4 2.4 2
4 1.6 4 2.8 2
5 2.4 6 3.2 2
6 2.4 6 3.6 3
7 3.2 8 3.6 3
8 3.2 8 4 3
30
ANTENNA DIVERSITY & CHANNEL INVERSION
• Antenna diversity
• Channel inversion as a power-allocation
technique
31
CODING FOR THE FADING CHANNEL
• Antenna diversity
32
ANTENNA DIVERSITY (order M)
-2
10
BER
-4 U4, M=1
10
J4, M=1
-6
10
U4, M=16
J4, M=16
36
Most of the analyses are concerned with the
FULLY-INTERLEAVED CHANNEL
HOWEVER,
☞ Consequently, at least
L=20,000 x 0.01 = 200 symbols
are affected approximately by the same fading gain
38
FACTS
39
FACTS
40
BLOCK-FADING CHANNEL MODEL
41
BLOCK-FADING CHANNEL MODEL
1 M
N
2
N
3
N .. N
n=NM ..
• Each block of length N is affected by the same fadin
Special cases:
44
System where this model is appropriate:
4 4
3 3
2 2 2
1 1 1
t
M=4 (half-rate GSM) 45
System where this model is appropriate:
1 2 1
M=2
46
COMPUTING ERROR PROBABILITIES
“Channel use” is now the transmission
of a block of N coded symbols
48
Relevant parameter for
design
Minimum Hamming block-distance
D between
code words on block basis:
49
EXAMPLE (N=4)
Block #1 Block #2
00 00 00 00
11 11
11 Dmin =2
00
10
10
01
01
11
4 binary symbols 4 binary symbols 50
Bound on Dmin
R
Dmin ≤ 1 + M 1 −
log2 S
51
Example: Coding in GSM
Dmin ≤ 5
achieved by the code. (With S=4 the upper bound
would increase to 7).
54
CODING FOR THE FADING CHANNEL
• Power control
55
PROBLEM:
How to encode if CSI is known at
the transmitter (and at the receiver)
56
We have:r (t ) = R x(t ) + n(t )
Assume R is known to transmitter
and receiver
γ
If: xt = st
R
(channel inversion) then the fading channel
is turned into a Gaussian channel
57
annel inversion is common
spread-spectrum systems
th near-far imbalance
58
CODING FOR THE FADING CHANNEL
59
MULTIPLE-ANTENNA MODEL
t r
60
CHANNEL CAPACITY
1%-outage capacity
(upper curves)
for Rayleigh channel
vs. SNR and
number of
antennas
Note: at 0-dB SNR,
25 b/s/Hz are
available with t=r=32!
t=r
(SNR is P/N at each receive antenna) 64
CHANNEL CAPACITY
1%-outage capacity
per dimension
(upper curves)
for Rayleigh
channel
vs. SNR and
number of
antennas
t=r 65
ACHIEVABLE RATES
66
SPACE-TIME CODING
(Alamouti, 1998)
67
SPACE-TIME CODING
The signals received in two adjacent time slots are
r0 = r (t ) = h0 s0 + h1s1 + n0
∗ ∗
r1 = r (t + T ) = − h s + h1s0 + n1
0 1
~ ∗
s0 = h0 r0 + h1r1∗
~ ∗
s = h r −h r ∗
1 1 0 0 1
68
SPACE-TIME CODING
So that:
~ 2 2
s0 = h0 + h1 s0 + noise
~ 2 2
s1 = h0 + h1 s1 + noise
70
SPACE-TIME CODING
MRRC=
maximum-
ratio
receive
combining SNR (dB) 71
SPACE-TIME CODING
72
SPACE-TIME CODING
(Tarokh, Seshadri, Calderbank, et al.)
Example:
Space-time code achieving diversity 2 with
one receive antenna (“2-space-time code”),
and diversity 4 with two receive antennas
73
SPACE-TIME CODING
30 31 32 33 74
SPACE-TIME CODING
• If yjn denotes the signal received at antenna j
at time n, the branch metric for a transition labeled
q1 q2 … qt is
r t 2
∑
j =1
y nj − ∑ hi , j qi
i =1
75
SPACE-TIME CODING
76
TURBO-CODED MODULATION
(Stefanov and Duman, 1999)
77
TURBO-CODED MODULATION
78