kc1 Kap1

Channel Coding I + II
Dirk Wbben
Department of Communications Engineering
Room: N 2380, Phone: 0421/218-2545
Email: wuebben@ant.uni-bremen.de
Lecture Tutor
Tuesday, 08:30 10:00 in N2420 Ronald Bhnke
Room: N2380
Wednesday, 14:00 16:00 in N2250 Phone 218-2545
Dates for exercises will be announced boehnke@ant.uni-bremen.de
during lectures.
http://www.ant.uni-bremen.de/teaching/kc
Preliminaries
Master students:
Channel Coding I and Channel Coding II are elective courses
Written examination at the end of each semester
Diplomstudenten
Kanalcodierung als (Wahl)pflichtfach, mndliche Prfung
Wahlweise dreistndig (Prfung nach 1 Semester)
oder sechsstndig (Prfung nach 2 Semestern)
Documents
Script Kanalcodierung I/II by Volker Khn (in German), these slides and tasks for
exercises are available in the internet http://www.ant.uni-bremen.de/teaching/kc
Exercises
Take place on Wednesday, 14:00-16:00 in Room N2250
Dates will be arranged in the lesson and announced by mailling list
cc@ant.uni-bremen.de
Contain theoretical analysis and tasks to be solved in Matlab
Universitt
Bremen Dirk Wbben Channel Coding I 2
Literature
Books on Channel Coding
B. Friedrichs, Kanalcodierung, Springer Verlag, 1996
M. Bossert, Kanalcodierung, B.G. Teubner Verlag, 1998,
M. Bossert, Channel Coding for Telecommunications, Wiley 1999
R. E. Blahut, Algebraic Codes for Data Transmission, Cambridge University Press, 2003
S. Lin, D. J. Costello, Jr., Error Control Coding: Fundamentals and Applications, Prentice- Hall, 2004
W.C. Huffman, V. Pless, Fundamentals of Error-Correcting Codes, Cambridge University Press, 2003
S. B. Wicker, Error Control Systems for Digital Communications and Storage, Prentice-Hall, 1995
J. Huber, Trelliscodierung, Springer Verlag, 1992
Books on Information Theory

T. M. Cover, J. A. Thomas, Information Theory, Wiley, 1991
R. G. Gallager, Information Theory and Reliable Communication, Wiley, 1968
R. Johannesson, Informationstheorie - Grundlagen der (Tele-)Kommunikation, Addison-Wesley, 1992
General Books on Digital Communication

K. D. Kammeyer, Nachrichtenbertragung, B.G. Teubner, 2004
K.D. Kammeyer, V. Khn, MATLAB in der Nachrichtentechnik, Schlembach, 2001
J. Proakis, Digital Communications, McGraw-Hill, 2001
B. Sklar, Digital Communications, Fundamentals and Applications, Prentice-Hall, 2003
Internet Resources
Universitt
Outline Channel Coding I
Introduction
Declarations and definitions, general principle of channel coding
Structure of digital communication systems
One Lesson of Information Theory
Probabilities, measure of information
SHANNONs channel capacity for different channels
Linear block codes
Properties of block codes and general decoding principles
Bounds on error rate performance
Representation of block codes with generator and parity check matrices
Cyclic block codes (Reed-Solomon and BCH codes)
Convolutional Codes
Structure, algebraic and graphical presentation
Distance properties and error rate performance
Optimal decoding with Viterbi algorithm
Universitt
Outline Channel Coding II
Trelliscoded Modulation (TCM)

Motivation by information theory
TCM of Ungerbck, pragmatic approach by Viterbi, Multilevel codes
Distance properties and error rate performance
Applications (data transmission via modems)
Concatenated Codes
Serial Concatenation
Parallel Concatenation (Turbo Codes)
Iterative Decoding with Soft-In/Soft-Out decoding algorithms
Adaptive Error Control

Automatic Repeat Request (ARQ)
Performance for perfect and disturbed feedback channel
Hybrid FEC/ARQ schemes
Universitt
Introduction
Basics about Channel Coding

General declarations
Basic principles
Applications of Channel Coding
Declarations and definitions, general principle of channel coding
Structure of digital communication systems
Discrete Channel
Statistical description
AWGN and fading channel
Discrete Memoryless Channel (DMC)
Binary Symmetric Channel (BSC and BSEC)
Universitt
General Declarations
Important terms:
Message Amount of transmitted data or symbols by the source
Information Part of message, which is new for the sink
Redundancy Difference of message and information, which is
unknown to the sink
Message = Information + Redundancy
Irrelevance Information, which is not of importance to the sink
Equivocation Information, not stemming from sink of interest
Message is also transmitted in a distinct amount of time
Messageflow Amount of message per time
Informationflow Amount of information per time
Transinformation Amount of error-free information per time transmitted
from the source to the sink
Universitt
Three Main Areas of Coding
Source coding (entropy coding)

Compression of the information stream so that no significant information is lost,
enabling a perfect reconstruction of the information.
Thus, by eliminating superfluous and uncontrolled redundancy the load on the
transmission system is reduced.
Entropy defines the minimum amount of necessary information
Channel coding (error-control coding)

Encoder adds redundancy (additional bits) to information bits in order to detect or
even correct transmission errors
Cryptography
The information is encrypted to make it unreadable to unauthorized persons or to
avoid falsification or deception during transmission.
Decryption is only possible by knowing the encryption key
Claude E. Shannon (1948): A Mathematical Theory of Communication
Universitt
Basic Principles of Channel Coding
Forward Error Correction (FEC)

Added redundancy is used to correct transmission errors at the receiver
Channel condition affects the quality of data transmission errors after
decoding occur if the error-correction capability of the code is passed
No feedback channel is required
varying reliability, constant bit throughput
Automatic Repeat Request (ARQ)
Small amount of redundancy is added to detect transmission errors
retransmission of data in case of a detected error
feedback channel is required
Channel condition affects the throughput
constant reliability, but varying throughput
Hybrid FEC/ARQ
Universitt
Basic Idea of Channel Coding
Add redundancy to the information data in order to detect and/or

correct transmission errors at the receiver
Code is a subset
Channel Coding
Coder is the mapper
Create a vector x of length n>k for an information vector u of length k

In case of a binary alphabet 2n different vectors x exist.
Due to the bijective mapping from u to x only 2k<2n vectors are used.
Find a k-dimensional subset out of an n-dimensional space so that
Minimum distance between elements within the subset is maximized
effects probability of detecting errors
Cardinality of subset is as large as possible
Code rate equals the rate of length of the uncoded and the k
coded sequence and describes the required expansion of the signal Rc =
bandwidth n
Universitt
Visualizing Distance Properties with Code Cube
110 111 110 111 110 111
010 011 010 011 010 011
100 101 100 101 100 101
000 001 000 001 000 001

dmin=1 dmin=2 dmin=3
Code rate Rc = 1 Code rate Rc = 2/3 Code rate Rc = 1/3

No error correction No error correction Correction of single error
No error detection Detection of single error Detection of 2 errors
Universitt
Applications of Channel Coding
Importance of channel coding increased with digital communications

First use for deep space communications:
AWGN channel, no bandwidth restrictions, only few receivers
(costs negligible)
Examples:
Viking (Mars), Voyager (Jupiter, Saturn), Galileo (Jupiter), ...
Mass storage
compact disc, digital versatile disc, magnetic tapes
Digital wireless communications:
GSM, UMTS, WLAN (Hiperlan, IEEE 802.11), ...
Digital wired communications
Modem transmission (V.90, ...)
Digital broadcasting
DAB, DVB
Universitt
Structure of Digital Transmission System
analog
u
analog source
source
source
source encoder
encoder
digital source
Source transmits signal d(t) (e.g. analog speech signal)

Source coding samples, quantizes and compresses analog signal
Digital Source: comprises analog source and source coding, delivers
digital data vector u = (u0 u1 uk-1) of length k
Universitt
analog
u x
analog source
source channel
channel
source
source encoder
encoder encoder
encoder
digital source
Channel encoder adds redundancy to u so that errors in
x = (x0 x1 xn-1) can be detected or even corrected
Channel encoder may consist of several constituent codes
Code rate: Rc = k / n
Universitt
analog
u x
analog source
source channel
channel modulator
modulator
source
source encoder
encoder encoder
encoder
digital source
physical
physical
channel
channel
Modulator maps discrete vector x onto analog waveform
and moves it into the transmission band y
demodulator
demodulator
Physical channel represents transmission medium
Multipath propagation intersymbol interference (ISI) discrete channel
Time varying fading, i.e. deep fades in complex
envelope Discrete channel: comprises analog part of
Additive noise modulator, physical channel and analog part
of demodulator
Demodulator: Moves signal back into baseband and
performs lowpass filtering, sampling, quantization
Universitt
analog
u x
analog source
source channel
channel modulator
modulator
source
source encoder
encoder encoder
encoder
digital source
physical
physical
channel
channel
u y
channel
channel demodulator
demodulator
decoder
decoder
discrete channel
Channel decoder:
Estimation of u on the basis of received vector y
y need not to consist of hard quantized values (0,1)
Since encoder may consist of several parts,
decoder may also consist of several modules
Universitt
analog
u x
analog source
source channel
channel modulator
modulator
source
source encoder
encoder encoder
encoder
digital source
physical
physical
feedback channel
channel
channel
u y
source
source channel
channel
sink
sink demodulator
demodulator
decoder
decoder decoder
decoder
discrete channel
Citation of Massey:
The purpose of the modulation system is to create a good discrete channel from the
modulator input to the demodulator output, and the purpose of the coding system is
to transmit the information bits reliably through this discrete channel at the highest
practicable rate.
Universitt
Discrete Channel
discrete
xiAin yiAout
channel
Discrete channel comprises analog parts of modulator and

demodulator as well as physical transmission medium
Discrete input alphabet Ain={X0, ..., X|A |-1}
in
Discrete output alphabet Aout={Y0, ..., Y|Aout|-1}
Probabilities: Pr{X}, Pr{Y}
Joint probability of event X,Y: Pr{X,Y} Pr { X , Y } = Pr {Y X } Pr { X }
Transition probabilities: Pr{Y | X} { }

= Pr X Y Pr {Y }
Universitt
Discrete Channel
Description of discrete channel by transition diagram

Pr{Y0 | X0}
X0 Y0
Pr{Y1 | X0}
X1 Y1
X|A Y|A
in|-1 out|-1
Restrictions in this lecture

Binary input alphabet (BPSK): Ain={-1,+1}
Output alphabet depends on quantization
No quantization Aout=R
Hard decision (1-bit) Aout=Ain
Universitt
Discrete Channel
Pr { X , Y }
A-posteriori probabilities: {
Pr X Y = } Pr {Y }
For statistical independent elements
Pr { X , Y } Pr { X } Pr {Y }
Pr { X , Y } = Pr { X } Pr {Y } {
Pr X Y = } Pr {Y }
=
Pr {Y }
= Pr { X }
General probability relations
Pr {a } = 1
i
X Ain
Pr { X } =
Y Aout
Pr {Y } = 1
i
Pr {a} = Pr {a, b j } Pr {Y } = Pr { X , Y } Pr { X } = Pr { X , Y }
j X Ain Y Aout
Pr {a , b } = 1
i j
i j
X Ain Y Aout
Pr { X , Y } = 1
Universitt
Bayes Rule
Bayes Rule
Pr {a, b} Pr {b} Pr {Y }
Pr {b a} =
Pr {a}
= Pr {a b}
Pr {a} {
Pr {Y X } = Pr X Y } Pr { X }
Attention
Pr {Y , X } Pr {Y }
{
Pr X Y = } = =1 and Pr {Y X } = 1
X Ain X Ain Pr {Y } Pr {Y } Y Aout
Pr { X , Y }
but
Y Aout
{
Pr X Y = } Y Aout Pr {Y }
1
Example
Universitt
Baseband Transmission
XX , NN
n(t ) Es
iTs X2
xi x (t ) yi
N0 / 2 N2
g T (t ) channel
channel g R (t )
f
2B
Time-continuous, band-limited signal x(t)R Sampling f A = 1 T s = 2 B

x ( t ) = xi g ( t iTs )
{ }
i
Average Power per period = 2 BEs = Es / Ts = E X

2 2
X
Average Energy of each (real) transmit symbol Es =E X { 2

} T
s
Noise with spectral density (of real noise) NN = N 0 / 2

Power N = N 0 B = N 0 ( 2Ts )
2
X2 E
Signal to Noise Ratio (after matched filtering) S/N = 2 = s
N N0 2
Universitt
Bandpass Transmission
1 ej0 t
2 ej0 t n (t ) 2
xi x (t ) xBP (t ) yBP (t ) y + (t ) yi
g T (t ) Re {i} channel
channel g R (t )
j H {i}
Transmit real part of complex signal shifted to a carrier frequency f0

xBP ( t ) = 2 Re { x ( t ) e j t } = 2 x ' ( t ) cos (0t ) x '' ( t ) sin (0t )
0 xBP(t)R
With x(t)C the complex envelope of the data signal
Re{} results in two spetra around -f0 and f0
Received signal yBP (t ) = xBP (t ) hBP (t ) + nBP (t )
Transformation to basis band
Analytical signal achieved by Hilbert transformation (suppress f<0)
+
yBP ( t ) = yBP ( t ) + j H { yBP ( t )} doubles spectrum for f >0
Low pass signal yTP ( t ) = ( t ) e j0t

1 +
2
yBP
Universitt
Equivalent Baseband Representation
X BP X BP , N BP N BP
XX , NN
1
2
Es
2 X
X2
1
N2 E = Es 2
r
s N2
2
N0 / 2
N0 2
-f0 f0 f f
B
B B
Equivalent received signal
xBP ( t ) hBP ( t ) + nBP ( t ) e 0 = x ( t ) h ( t ) + n ( t )
1 + j t
y (t ) =
2
X2 2 B Es 2 Es
S/N = 2 = =
N 2B N0 2 N0
In this semester, only real signals are investigated (BPSK)
Signal is only given in the real part X2 E
S/N = 2 = s
Only the real part of noise is of interest N N0 2
Universitt
Probability Density Functions for AWGN Channel
( y X ) 2
ni
exp
1
p y| x ( y | X ) =

xi yi
2 N
2 2 2
N
signal-to-noise-ratio Es/N0 = 2 dB signal-to-noise-ratio Es/N0 = 6 dB

0.8 0.8
p y ( ) p y ( )
0.6 p y|x ( | = 1) p y|x ( | = +1) 0.6
0.4 0.4
p y|x ( | = 1) p y|x ( | = +1)
0.2 0.2
0 0
-4 -2 0 2 4 -4 -2 0 2 4

ddd
ddd
Universitt
Error Probability of AWGN Channel
Signal-to-Noise-Ratio S/N
S Es Ts Es Es : symbol energy
= = N0/2: noise density
N N 0 2 Ts N 0 2
Error Probability for antipodal modulation (+ Es Ts , Es Ts )
Pe = Pr {error xi = 1} = p y| x | = Es Ts d = pn + Es Ts d

0
( ) 0
( )
p ( | = ) p ( )
0 0
= Pr {error xi = +1} = y| x Es Ts d = n Es Ts d

+ E T
exp
( ) d
2

1 s s
=

2 N 0
2 2 N2
Universitt
Error Probability of AWGN Channel
With N = N2 = N 0 2 Ts the error probability becomes

exp d ( )
2
+ E T

1 s s
Pe =

N 0 Ts 0 N 0 Ts
Using the substitution = + Es Ts ( ) N 0 Ts
Es

with error function complement

d = erfc

1 2 1
Pe = 2
0
e erfc ( ) = 1 erf ( ) = e 2
d
Es N 0
2 N
(
or = + Es Ts ) N 0 2 Ts
2 Es
d = Q e
2 2
1 1
Pe = Q ( ) = d
N0
2
e with 2
2 Es N0 2
2
Universitt
Probability Density Functions for Frequency
Nonselective Rayleigh Fading Channel
2 s2 exp ( 2 s2 ) for 0
i ni
p ( ) =

xi ri yi
0 else
0.1 0.1 0.1
0.08 0.08 0.08
0.06 0.06 0.06
0.04 0.04 0.04
0.02 0.02 0.02
0 0 0
0 2 4 -4 -2 0 2 4 -4 -2 0 2 4
i ri yi
Universitt
Bit Error Rates for AWGN and Flat Rayleigh
Channel (BPSK modulation)
AWGN channel:
0
10
AWGN
Rayleigh
Pb =
1
2
erfc ( Es / N 0 )
( )
-2
10
=Q 2 Es / N 0
Pb 17 dB
Flat Rayleigh fading channel:
1 Es / N 0
-4
10
Pb = 1
2 1 + Es / N 0
-6
Channel coding for fading
10
0 10 20 30
channels essential
Es / N0 in dB (time diversity)
Universitt
Rice Fading Channel
If line-of-sight connection exist for , its real part is non-central Gaussian distributed
Rice factor K determines power ratio between line-of-sight path and scattered paths
K = 0 : Rayleigh fading channel
K : AWGN channel ni
K
(no fading)
1+ K
xi
yi
1
1+ K
' ai = K
1+ K
+ 1
1+ K
'[k ]
Coefficient [k] has Rayleigh distributed magnitude with average power 1

Relation between total average power and variance: P = (1 + K ) 2H
Magnitude is Rician distributed 2 2 / 2 K K

2 e I 0 2 2 for 0
p|| () =

0 else
Universitt
Discrete Memoryless Channel (DMC)
Transition probabilities of a discrete memoryless channel (DMC)
n 1
Pr {y x} = Pr { y0 , y1 ,, yn 1 x0 , x1 ,, xn 1} = Pr { yi xi }
i =0
The probability, that exactly m errors occur at distinct positions in a sequence of

n is given by
Pr {m bit of n incorrect} = Pem (1 Pe )
nm
Probability, that in a sequence of length n exactly m errors occur (at any place)
n m
Pr {m error in a sequence of length n} = Pe (1 Pe )
nm
With n =

n! giving the number of possibilities to choose m
m m ! ( n m ) ! elements out of n different elements, without
regarding the succession (combinations)
Universitt
Binary Symmetric Channel (BSC and BSEC)
Binary Symmetric Channel (BSC)

Es
Pr {Y0 X 1} = Pr {Y1 X 0 } = Pe = erfc
1
0
X0 1-Pe Y0
2 N
Pr {x = y} = Pr { x0 = y0 , x1 = y1 , , xn 1 = yn 1}
Pe
Pe
n 1
= Pr { xi yi } = (1 Pe )
X1 Y1 n
1-Pe
i =0
Pr {x y} = 1 Pr {x = y} = 1 (1 Pe ) n Pe
n
Binary Symmetric Erasure Channel (BSEC)

1 Pe Pq
1-Pe-Pq
y=x

X0 Y0
Pr { x y} =
Pq
Pe
y =?

Pq

Y2
Pe
Pq Pe yx
X1 Y1
1-Pe-Pq
Universitt

kc1 Kap1

Transféré par

Informations du document

Titre original

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

kc1 Kap1

Transféré par

Droits d'auteur :

Formats disponibles

Channel Coding I + II

Books on Information Theory

General Books on Digital Communication

Trelliscoded Modulation (TCM)

Adaptive Error Control

Basics about Channel Coding

Structure of digital communication systems

Source coding (entropy coding)

Channel coding (error-control coding)

Claude E. Shannon (1948): A Mathematical Theory of Communication

Forward Error Correction (FEC)

Add redundancy to the information data in order to detect and/or

Create a vector x of length n>k for an information vector u of length k

110 111 110 111 110 111

010 011 010 011 010 011

100 101 100 101 100 101

000 001 000 001 000 001

Code rate Rc = 1 Code rate Rc = 2/3 Code rate Rc = 1/3

Importance of channel coding increased with digital communications

Source transmits signal d(t) (e.g. analog speech signal)

Discrete channel comprises analog parts of modulator and

Discrete output alphabet Aout={Y0, ..., Y|Aout|-1}

Probabilities: Pr{X}, Pr{Y}

Joint probability of event X,Y: Pr{X,Y} Pr { X , Y } = Pr {Y X } Pr { X }

Transition probabilities: Pr{Y | X} { }

Description of discrete channel by transition diagram

Restrictions in this lecture

General probability relations

Time-continuous, band-limited signal x(t)R Sampling f A = 1 T s = 2 B

Average Power per period = 2 BEs = Es / Ts = E X

Average Energy of each (real) transmit symbol Es =E X { 2

Noise with spectral density (of real noise) NN = N 0 / 2

Transmit real part of complex signal shifted to a carrier frequency f0

Low pass signal yTP ( t ) = ( t ) e j0t

signal-to-noise-ratio Es/N0 = 2 dB signal-to-noise-ratio Es/N0 = 6 dB

0.6 p y|x ( | = 1) p y|x ( | = +1) 0.6

With N = N2 = N 0 2 Ts the error probability becomes

Using the substitution = + Es Ts ( ) N 0 Ts

0.1 0.1 0.1

0.08 0.08 0.08

0.06 0.06 0.06

0.04 0.04 0.04

0.02 0.02 0.02

Coefficient [k] has Rayleigh distributed magnitude with average power 1

Magnitude is Rician distributed 2 2 / 2 K K

The probability, that exactly m errors occur at distinct positions in a sequence of

Binary Symmetric Channel (BSC)

Binary Symmetric Erasure Channel (BSEC)

Vous aimerez peut-être aussi