Sec.4 - Channel Coding and Error Control - Chapt-04

CS 6910 Pervasive Computing
Spring 2007
Section 4 (Ch.4):
Channel Coding and Error

Control
Prof. Leszek Lilien
Department of Computer Science
Western Michigan University
Slides based on publishers slides for 1st and 2nd edition of:
Introduction to Wireless and Mobile Systems by Agrawal & Zeng
2003, 2006, Dharma P. Agrawal and Qing-An Zeng. All rights reserved.
Some original slides were modified by L. Lilien, who strived to make such modifications clearly
visible. Some slides were added by L. Lilien, and are 2006-2007 by Leszek T. Lilien.
Requests to use L. Liliens slides for non-profit purposes will be gladly granted upon a written
request.
1
Chapter 4
Channel Coding and Error Control
Copyright 2003, Dharma P. Agrawal and Qing-An Zeng. All rights reserved
(Modified by
Outline
We skip some sections in this Chapter
You have to use it on your own if needed (e.g., for your project)
Introduction
Linear Block Codes
Cyclic Codes
Cyclic Redundancy Check (CRC)
Convolutional Codes
Interleaver
Information Capacity Theorem
Turbo Codes
ARQ (Automatic Repeat Request) Techniques
Stop-and-wait ARQ
Go-back-N ARQ
Selective-repeat ARQ
4.1. Introduction
Why need channel coding for radio communication?

Why need error control for radio communication?
Severe transmission problems
In terrestrial mobile communications due to:

Multipath fading
Low S/N (signal-to-noise) ratio
In satellite communications due to:

Limited xmitting power for forward channels
(downlink )
E.g., reflections / diffractions / scattering in cellular

wireless communications
Limited satellite energy resources
=> Need means to improve transmissions

Channel coding and error control forare such means
Copyright
Dharma
P. Agrawal and Qing-An Zeng. All rights reserved
2007
by2003,
Leszek
T. Lilien
4.1. Introduction cont. 1
=> Need channel coding and error control to improve

transmissions
Channel coding (CC)

= coding (discrete digital) information into a form suitable
for transmission, with emphasis on enhanced
reliability
CC adds redundancy that allows for info restoration

or recovery when needed
Price paid: need broader bandwidth
CC ensures proper transmission quality
Measured by
Bit error quality (BER) / Frame error quality (FER)
See where channel coding/decoding is done (next

slide)
Copyright
Dharma
2007
by2003,
Leszek
T. Lilien
Channel coding/decoding in a wireless

communication system
Information to
be transmitted Source
coding
Channel
Channel
coding
coding
Modulation
Transmitter
Channel
Information
received
Source
decoding
Channel
Channel
decoding
decoding
Demodulation
Receiver
CC includes error control

Error control = at least error detection , preferably
also error correction
Error detection w/o error correction is insufficient

Means transmission failure since requires for
retransmission
Copyright
Dharma
2007
by2003,
Leszek
T. Lilien
Error Correction (EC)
The key EC idea:

Transmit enough redundant data to allow receiver to
recover from errors all by itself
No sender retransmission required
Major categories of EC codes

(really: forward error correction FEC)
Linear block codes
Cyclic codes
Reed-Solomon codes
Convolutional codes
Turbo codes
(Modified by
4.2. Linear Block Codes
Information is divided into blocks of length k
r parity bits or check bits are added to each block

Total length: n = k + r
Code rate:
R = k/n = k/(k + r)
Decoder looks for code word closest to received vector

Received vector = code vector + error vector
Tradeoffs between
Efficiency
Reliability
Encoding/decoding complexity
*** SKIP *** 4.3. Cyclic Codes (are Block Codes)

It is a linear block code which uses a shift register to perform encoding
and decoding
The code word with n bits is expressed as
c(x)=c1xn-1 +c2xn-2+ cn
where each ci is either a 1 or 0.
c(x) = m(x) xn-k + cp(x)
where cp(x) = remainder from dividing m(x) xn-k by generator g(x)
if the received signal is c(x) + e(x) where e(x) is the error.
To check if received signal is error free, the remainder from dividing
c(x) + e(x) by g(x) is obtained(syndrome). If this is 0 then the received
signal is considered error free else error pattern is detected from
known error syndromes.
10
4.4. Cyclic Redundancy Check (CRC)
Cyclic redundancy code (CRC) is an error-checking code.
Xmitter appends an extra n-bit sequence to every frame

Called Frame Check Sequence (FCS)
FCS holds redundant information about the frame
Helps receivers to detect/correct errors in received frames
CRC is based on polynomial manipulations using modulo

arithmetic
Blocks of input bits treated as coefficient sets for polynomials (called message
polynomials)
E.g., for message 11001, message polynomial is: 1 * x4 + 1 * x3 + 0 * x2 + 0 * x1 + 1 * x0
CRC also uses another polynomial - with constant coefficients (called the generator
polynomials)
Polynomial manipulations using modulo arithmetic are applied to the 2 polynomials
11
Most Common CRC Polynomials
Code
Generator polynomial
g(x)
Parity check
bits
CRC-12
1+x+x2+x3+x11+x12
12
CRC-16
1+x2+x15+x16
16
CRC-CCITT
1+x5+x12+x16
16
CRC-32
(used by DoD) |
(see text)
32
(Modified by 12
4.5. Convolutional Codes
Among most commonly used channel codes
E.g., in GSM and IS-95
Encoding of information stream rather than information blocks

Output (encoded bits) depends not only on current input bits but
also on past data bits
Easy implementation using shift register
M - max. # of (past) stages (a.k.a. memory size ) affecting output

Assuming k inputs and n outputs
Decoding most often based on the Viterbi Algorithm
(Modified by 13
4.6. Interleaver
Interleaving is heavily used in wireless

communication for protection against burst errors
Recall:
Burst error a contiguous sequence of symbols, received over a
data transmission channel, such that:
(a) the first symbol and the last symbol are in error, and
(b) there exists no contiguous subsequence of m correctly
received symbols within the error burst
The last symbol in a burst and the first symbol in the following
burst are separated by m correct bits or more
The length of a burst of errors in a frame is defined as the
number of bits from the first error to the last, inclusive
Block interleaver - most common interleaver

Concept next slide
Copyright
Dharma
2007
by2003,
Leszek
T. Lilien
14
Concept of Interleaver
1) Sender writes rowby-row into buffer
2) Read col-by-col
from buffer onto
link
1) Write col-by-col
from link into buffer
2) Receiver reads rowby-row from buffer
15
How Interleaver Works An Example
[LTL] Interleaver disperses burst error into 4 discrete errors
It is much easier to correct 4 discrete 1-bit errors, than to correct

1 continuous 4-bit burst error
16
4.7. Turbo Codes
Brief history of turbo codes:

First introduced by C. Berrou et al. only in 1993
Considered as the most efficient FEC coding schemes
Performance close to the (perfect) Shannon Limit at modest complexity!
Turbo codes use known components

Including: simple convolutional or block codes, interleaver,
soft-decision decoder
Turbo codes proposed for
Low-power applications
Such as deep-space and satellite communications,
Interference-limited applications
Such as 3G cellular, PCS (personal communication services), ad hoc networks

and sensornets
17
*** SKIP *** Information Capacity Theorem

(Shannon Limit)
The information capacity (or channel capacity) C of a

continuous channel with bandwidth B Hertz can be
perturbed by additive Gaussian white noise of power
spectral density N0/2, provided bandwidth B satisfies
bits / sec ond

C B log 2 1
N0 B
where: P is the average transmitted power P = EbRb (for an

ideal system, Rb = C).
Eb is the transmitted energy per bit,
Rb is transmission rate.
18
*** SKIP *** Shannon Limit

Rb/B
20
10
Region for which Rb>C

Capacity boundary Rb=C
Shannon Limit
Region for which Rb<C
-1.6
0
10
20
30
Eb/N0 dB
0.1
19
***SKIP*** Turbo Codes: Encoder

Data
Source
X
Convolutional Encoder
1
Y1
Interleaving
Convolutional Encoder
2
Y2
Y
(Y1, Y2)
X: Information
Yi: Redundancy Information
20
***SKIP*** Turbo Codes: Decoder

De-interleaving
Y1
Convolutional
Decoder 1
Interleaving
Interleaver
Convolutional
Decoder 2
Y2
De-interleaving
X
X: Decoded Information
21
4.8. Automatic Repeat Request (ARQ)
Sometimes CC can detect but cant correct errors

Must ask for retransmission
Can use Automatic Repeat Request (ARQ)
[LTL]
D sends (positive) acknowledgement ACK if received packets correct

If D detects error it cant correct, D sends negative acknowledgement NAK this requests retransmission
Source S
Encoder
Transmitter
Transmit
Controller
Channel
Modulation
Receiver
Demodulation
Destination D
Decoder
Transmit
Controller
Acknowledge
(ACK or NAK)
22
The End of Section 4
23

Sec.4 - Channel Coding and Error Control - Chapt-04

Загружено:

Сведения о документе

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Sec.4 - Channel Coding and Error Control - Chapt-04

Загружено:

Авторское право:

Доступные форматы

CS 6910 Pervasive Computing

Channel Coding and Error

Channel Coding and Error Control

Information Capacity Theorem

Why need channel coding for radio communication?

In terrestrial mobile communications due to:

Low S/N (signal-to-noise) ratio

In satellite communications due to:

E.g., reflections / diffractions / scattering in cellular

Limited satellite energy resources

=> Need means to improve transmissions

4.1. Introduction cont. 1

=> Need channel coding and error control to improve

Channel coding (CC)

CC adds redundancy that allows for info restoration

Price paid: need broader bandwidth

CC ensures proper transmission quality

See where channel coding/decoding is done (next

4.1. Introduction cont. 2

Channel coding/decoding in a wireless

4.1. Introduction cont. 3

CC includes error control

Error detection w/o error correction is insufficient

Error Correction (EC)

The key EC idea:

No sender retransmission required

Major categories of EC codes

Linear block codes

4.2. Linear Block Codes

Information is divided into blocks of length k

r parity bits or check bits are added to each block

Decoder looks for code word closest to received vector

*** SKIP *** 4.3. Cyclic Codes (are Block Codes)

4.4. Cyclic Redundancy Check (CRC)

Cyclic redundancy code (CRC) is an error-checking code.

Xmitter appends an extra n-bit sequence to every frame

Helps receivers to detect/correct errors in received frames

CRC is based on polynomial manipulations using modulo

E.g., for message 11001, message polynomial is: 1 * x4 + 1 * x3 + 0 * x2 + 0 * x1 + 1 * x0

Most Common CRC Polynomials

4.5. Convolutional Codes

Among most commonly used channel codes

E.g., in GSM and IS-95

Encoding of information stream rather than information blocks

Easy implementation using shift register

M - max. # of (past) stages (a.k.a. memory size ) affecting output

Decoding most often based on the Viterbi Algorithm

Interleaving is heavily used in wireless

Block interleaver - most common interleaver

How Interleaver Works An Example

[LTL] Interleaver disperses burst error into 4 discrete errors

It is much easier to correct 4 discrete 1-bit errors, than to correct

4.7. Turbo Codes

Brief history of turbo codes:

Performance close to the (perfect) Shannon Limit at modest complexity!

Turbo codes use known components

Such as deep-space and satellite communications,

Such as 3G cellular, PCS (personal communication services), ad hoc networks

*** SKIP *** Information Capacity Theorem

The information capacity (or channel capacity) C of a

bits / sec ond

where: P is the average transmitted power P = EbRb (for an

*** SKIP *** Shannon Limit

* SKIP * 4.3. Cyclic Codes (are Block Codes)

* SKIP * Information Capacity Theorem

* SKIP * Shannon Limit

SKIP Turbo Codes: Encoder

SKIP Turbo Codes: Decoder