0% found this document useful (0 votes)
40 views9 pages

1 Convolutional Channel Coding: 1.1 The Diagram

This document discusses convolutional channel coding and the Viterbi algorithm for maximum likelihood decoding of convolutional codes. It describes the basic components of convolutional encoding including the encoder, trellis diagram, and impulse response. It then explains the Viterbi algorithm which reduces decoding complexity from exponential to linear by tracking the most likely path through the trellis and eliminating less likely paths when they merge at each state. The algorithm uses path metrics based on Hamming distance to track the surviving path with the lowest cumulative distance at each time.

Uploaded by

ramgopal_1991
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
40 views9 pages

1 Convolutional Channel Coding: 1.1 The Diagram

This document discusses convolutional channel coding and the Viterbi algorithm for maximum likelihood decoding of convolutional codes. It describes the basic components of convolutional encoding including the encoder, trellis diagram, and impulse response. It then explains the Viterbi algorithm which reduces decoding complexity from exponential to linear by tracking the most likely path through the trellis and eliminating less likely paths when they merge at each state. The algorithm uses path metrics based on Hamming distance to track the surviving path with the lowest cumulative distance at each time.

Uploaded by

ramgopal_1991
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Communication Capstone Design 1

1 Convolutional Channel Coding

References:
• Sklar, Digital Communications, Chapter 7, Sections 7.1 - 7.3
• Proakis, Contemporary Communication Systems, Chapter 8,
Section 8.3.2
1.1 The diagram

Convolutional
Viterbi Channel
Channel
Decoder
Encoder (Lab 3)
(Lab 3)
nk

composite
equalizer
channel Ck
(Lab 1) + Gk
(Lab 2)

• Channel coding provides additional protection against ISI and


fading
• Code rate, k/n, measures the amount of added redundancy
• We shall consider only the most commonly used binary
convolutional encoders with k = 1.

Electrical Engineering
Communication Capstone Design 2

1.2 Channel encoder and impulse response

Rate 1/2 convolutional encoder

• k = 1, n = 2, K = 3
• K : constraint length (filter length); each output bit is not only
a function of the current input bit, but also a function of the
K − 1 bits that precede it.
• exclusive modulo-2 operators
• no block size in convolutional code (unlike block code)
• Connection vectors: g1 = [ 1 1 1 ], and g2 = [ 1 0 1 ]
• impulse response: the response of the encoder to a single 1-bit
that moves through it.
Electrical Engineering
Communication Capstone Design 3

Example

Electrical Engineering
Communication Capstone Design 4

1.3 State diagram

Rate 1/2 encoder state diagram


• State: the contents of the rightmost K − 1 stages (thus 2K−1
states)
• Knowledge of the current state together with knowledge of the
next input determine the next output
• Two transitions, corresponding to the two possible input bits,
from each state
• each transition generates n output bits.
• transitions are not arbitrary
Electrical Engineering
Communication Capstone Design 5

1.4 Tree diagram and trellis diagram

Encoder trellis diagram

• Trellis and tree diagram provides the dimension of time to the


state diagram

• A solid line denotes the output generated by an input bit 0, and


a dashed line denotes the output generated by an input bit 1.
• Each note of the trellis characterizes a state - there are 2K−1
states at each unit of time
• Each of the states can be entered from either of two preceding
states; each of the states can transition to one of two states
• output words (coded bits) appear as labels of the trellis
branches
Electrical Engineering
Communication Capstone Design 6

1.5 Maximum likelihood decoding

Encoding : m =⇒ U
Received sequence (binary, after detection) : Z = U + n

• Since the encoded bits are no longer isolated (i.e., the


convolutional code has memory), the maximum likelihood
decoder maximizes the likelihood function over the entire
sequence:
m0 = argm max P (Z|U(m))

0
• MA decoding = finding the codeword U(m ) that is the closest
in Hamming distance to Z.
• However, there are 2L possible sequences in an L branch word!

Electrical Engineering
Communication Capstone Design 7

1.6 The Viterbi algorithm

Decoder trellis diagram

• The Viterbi algorithm reduces the decoding cost by taking


advantage of the trellis structure
• Complexity reduced from O(2L) to O(L)
• When two paths enter the same state, the one having the best
metric is chosen (the surviving path)
• The selection of surviving paths is performed for all states
(2K−1), at each time
• The Viterbi algorithm is a true ML decoder
Electrical Engineering
Communication Capstone Design 8

1.7 Path metric

Merging paths
• Each branch of the decoder trellis is labeled with the Hamming
distance between the received code symbols and the branch
code word for that time interval.
• The cumulative Hamming path metric at a given time is the
sum of the branch Hamming distance along that path up to
time ti
• When two paths merge to a single state, the one with a higher
cumulative Hamming path metric is eliminated (why?)
• The winning path metric for each state is the state metric for
that state at time ti.There are no more winning paths than the
number of states at each time.
• If equal value, one arbitrary path is eliminated.
• Decoding delay can be five times the constraint length: 5K

Electrical Engineering
Communication Capstone Design 9

Example

Electrical Engineering

You might also like