Coding Techniques

Advanced RF and Wireless Techniques

slide 1

COMP 1160

Objectives

Understand what channel coding is and why it is needed

Discuss the difference between waveform and structured

coding

Discuss the difference between ARQ and FEC

Discuss the behavior of different coding techniques

Analyze linear block coding

Analyze Humming code

Design a single error correcting code

Advanced RF and Wireless Techniques

slide 2

COMP 1160

What is Channel Coding?

Class of signal transformations designed to improve

communication performance and enabling the transmitted

signals to better withstand against channel distortions

such as noise, interference, and fading.

Channel coding can be divided into two major classes:

1.

Waveform coding: signal design (part of modulation

techniques)

2.

Structured coding: adding redundancy (will be focused

on in this lecture)

Advanced RF and Wireless Techniques

slide 3

COMP 1160

Waveform Coding

Waveform Coding
deals with transforming the transmitted waveform into
better waveform robust to channel distortion
Improving detector performance.
Examples:
Antipodal signaling
Orthogonal signaling
Bi-orthogonal signaling
M-ary signaling
Trellis-coded modulation

Advanced RF and Wireless Techniques

slide 4

COMP 1160

Structured Coding

Structured Coding
Adding redundancy bits to control the errors.

There are two types of structured redundancy:

Automatic Repeat reQuest (ARQ), utilizes parity bits (redundant

bits added to data) to detect that an error has been made and
requires two-way link for dialogue between the transmitter and
receiver.
Forward Error Correction (FEC), requires a one way link only,

since in this case the parity bits are designed for both the
detection and correction of errors.
Advanced RF and Wireless Techniques

slide 5

COMP 1160

Automatic Repeat reQuest (ARQ)

Required a two-ways link between TX and Rx

Need a buffer at the TX side (more complexity)
Slower data transmission due to retransmission

There are three different types of ARQ:

Stop-and-Wait ARQ
Go-Back-N ARQ
Selective-Repeat ARQ
Advanced RF and Wireless Techniques

slide 6

COMP 1160

Stop-and-Wait ARQ

Advanced RF and Wireless Techniques

slide 7

COMP 1160

Go-Back-N ARQ

Advanced RF and Wireless Techniques

slide 8

COMP 1160

Selective-Repeat ARQ

Advanced RF and Wireless Techniques

slide 9

COMP 1160

Forward Error Correction (FEC)

FEC is a structured sequences coding

Adding structured redundancy (or redundant bits).

The redundant bits are used to detect and correct errors.
Improves overall performance of the communication system.
Doesnt require ACK.
Faster than ARQ

FEC Types are:

Linear Codes
Repetition Codes
Block Codes
Hamming Codes
Reed-Solomon Codes
Cyclic Codes

Non-Linear codes

Convolution codes
Turbo codes

Advanced RF and Wireless Techniques

slide 10

COMP 1160

Repetition Codes

Repetition Code (R3) & Majority Vote Decoding

Binary Symmetrical Channel (BSC) 1
Input Data

Encoded Data

111

000

1-Pe

Pe

Tx

Rx
Pe

1-Pe

The receiver will use the majority vote decoding (i.e. if the numbers
of ones more the number of zeroes, then the detected bit will be 1).
If the number of zeroes more than the number of ones, then the
detected bit will 0.
If I/P is 1
If I/P is 0

Tx is 111
TX is 000

Received
triplet

111

110

101

100

011

010

001

000

Detected
bit

Advanced RF and Wireless Techniques

slide 11

COMP 1160

Example of FEC

1-Pe

Pe

Tx
Pe
0

1-Pe

Rx
0

0.1

Advanced RF and Wireless Techniques

slide 12

COMP 1160

Linear Block Codes

Data bits

k bits

n bits
Coded
output

Encoder

k
Data bits

n-k

FEC bits

n (block length)

Step (1): the information sequence is segmented into massage blocks,

each block consisting of k successive bits.

Step (2): the encoder add n-k bits generated from linear combination
of the massage bits. The result called codeward.

This is called (n,k) block code or systematic linear block code.

Coding Rate (CR) = k/n (also called code efficiency)

CR = 1/2 , 2/3 ,

Smaller CR is more robust but less efficient

CR = 1/2 means 100 % redundancy --

Advanced RF and Wireless Techniques

slide 13

Maximum robustness

COMP 1160

Linear Block Codes

Advanced RF and Wireless Techniques

slide 14

COMP 1160

Linear Block Codes

Advanced RF and Wireless Techniques

slide 15

COMP 1160

Linear Block Codes

Advanced RF and Wireless Techniques

slide 16

COMP 1160

Linear Block Codes

Messages

Codewords

Weight

000

000 000

001

001 110

010

010 101

011

011 011

100

100 011

101

101 101

110

110 110

111

111 000

Advanced RF and Wireless Techniques

slide 17

COMP 1160

Linear Block Codes

Advanced RF and Wireless Techniques

slide 18

COMP 1160

Linear Block Codes

Advanced RF and Wireless Techniques

slide 19

COMP 1160

Linear Block Codes

Advanced RF and Wireless Techniques

slide 20

COMP 1160

Linear Block Codes

Advanced RF and Wireless Techniques

slide 21

COMP 1160

Linear Block Codes

Advanced RF and Wireless Techniques

slide 22

COMP 1160

Linear Block Codes

Advanced RF and Wireless Techniques

slide 23

COMP 1160

Linear Block Codes

1.

Find the generator matrix G of this code?

2. Find the parity check matrix H of this code?

3. Find the minimum distance dmin of this code?
4. How many bits this code will be able to correct?

5. Calculate the syndrome for the received codeword R=[0 1 0 1 1 0] ?

6. Does this received codeword have an error? In which bit?
Advanced RF and Wireless Techniques

slide 24

COMP 1160

Linear Block Codes

Messages

Codewords

Weight

000

000 000

001

001 101

010

010 011

011

011 110

100

100 110

101

101 001

110

110 101

111

111 000

Advanced RF and Wireless Techniques

slide 25

dmin=3

COMP 1160