## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

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 Channel Encoder (Lab 3) nk composite channel Ck (Lab 1)

Viterbi Channel Decoder (Lab 3)

+

equalizer 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 (ﬁlter 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))

• •

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

0

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 ﬁve times the constraint length: 5K

Electrical Engineering

Communication Capstone Design

9

Example

Electrical Engineering

- Error Probability Performance for BPSK Using Viterbi Algorithm
- Applications in Transportation
- Matlab Filters
- Series.pdf
- Final 1212
- ANN-assisted Booth Multiplier for Design of Convolutional Encoder for Application in Wireless Communication
- 2sat (1)
- Vite Rbi
- APRIL 2009.pdf
- Project Part II_16914285
- steppingstonemodi
- 05959967
- ex-11
- Convolution
- 10.1109@SCOPES.2016.7955729
- Hybrids Crypt Hash 256
- 015_scalability_dataScience
- Linear Programming Problems
- SVM Tutorial Part1
- Algorithm
- BSI05_adba
- manevitz01a.pdf
- MIMO Communications
- Compute FFT Twiddle Factors
- Methodology
- CYK Algorithm
- Modified Artificial Bee Colony Algorithm for Ed
- Random Forests
- Condition Number as Voltage Collapse Index
- Image Mosaic Using FAST Corner Detection.pdf

- Constitution
- DAC0808
- lec1
- Ups Types
- DS005672
- Robotics
- Stepper Motor Driving
- FACTS-t&d
- FACTS-Applications in Transmission Networks
- History of Ias
- ram....elec 1
- Electricity
- 8085
- Micro Programs
- Micro Programs
- 38586868 Wireless Stepper Motor Control
- Introduction to Per Unit Calculations
- Grid_Interactive Solar Inverters_Anil Tuladhar
- 2P3a_0061

Close Dialog## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Loading