DR.

NAVEED MUFTI

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
LAST WEEK
 ERROR CORRECTION CODES
 CONCEPTS AND TERMINOLOGY
 HAMMING CODE BASICS
 HAMMING CODE CONSTRUCTION TABLE
 HAMMING CODING EXAMPLES
 HAMMING DECODING EXAMPLES
 NOTES ON HAMMING
 VARIANT OF HAMMING
 COMPARISON OF BLOCK/CONVOLUTIONAL CODES
 TARGET OF ERROR CONTROL
UNIVERSITY OF ENGINEERING DEPARTMENT OF
& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
THIS WEEK
 CONVOLUTIONAL CHANNEL CODING
 CONVOLUTIONAL ENCODER BASICS
 TREE DIAGRAM OF ENCODER
 TRELLIS DIAGRAM OF ENCODER
 ENCODING
 VITERBI DECODING ALGORITHM
 DECODER TRELLIS
 DECODING

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
LEARNING OUTCOMES
 AT THE END OF THIS LECTURE, STUDENTS
SHOULD BE ABLE TO
 ILLUSTRATE THE WORKING OF CONVOLUTIONAL
ENCODER VIA TREE AND TRELLIS DIAGRAMS
 INFER THE OUTPUT/INPUT SEQUENCE FROM THE
ENCODER TREE/TRELLIS DIAGRAMS
 CONSTRUCT AND INTERPRET DECODER TRELLIS
 UNDERSTAND THE WORKING PRINCIPLES OF
VITERBI DECODING
 INTERPRET WHAT WAS TRANSMITTED VIA VITERBI
DECODING

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
CONVOLUTIONAL CHANNEL CODES
 (n,k,K) NOTATION
 RATE=1/2 , K=3
 DIFFERENT WAYS OF WRITING

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
CONVOLUTIONAL
CODER-TREE
DIAGRAM

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
TRELLIS DIAGRAM

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
TRELLIS DIAGRAM
 NODES OF TRELLIS CHARACTERIZE THE ENCODER STATES;
 STATE OF CONVOLUTIONAL ENCODER IS REPRESENTED BY
CONTENTS OF RIGHTMOST K-1 STAGES IN ENCODER
REGISTER
 FIRST ROW NODES CORRESPOND TO STATE a=00, 2ND ROW
CORRESPONDS TO b=10, 3RD TO c=01 & 4TH TO d=11
 ON THE TWO OUTGOING BRANCHES, ONE CORRESPONDS
TO I/P BIT 0 WHILE OTHER TO I/P BIT 1
 THE FIXED STRUCTURE IN TRELLIS PREVAILS AFTER DEPTH
K IS REACHED
 AT THIS POINT & THEREAFTER, EACH OF THE STATES CAN BE
ENTERED FROM EITHER TWO PRECEDING STATES. ALSO,
EACH OF THE STATES CAN TRANSITION TO ONE OF THE TWO
STATES

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
TRELLIS DIAGRAM
 ONE TIME-INTERVAL SECTION OF A FULLY
FORMED TRELLIS STRUCTURE COMPLETELY
DEFINES THE CODE
 AT EACH UNIT OF TIME, TRELLIS REQUIRES 2^K-1
NODES TO REPRESENT 2^K-1 POSSIBLE ENCODER
STATES

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
TRELLIS DIAGRAM
 INITIALLY ALL REGISTERS ARE INITIALIZED TO 0.
 SO RIGHTMOST 2 STAGES OF ENCODER REGISTER SHOW 00
(STATE a).
 IF 0 ENTERS THE ENCODER REGISTER’S FIRST STAGE.
 O/P OF ENCODER IS 00.
 RIGHTMOST REGISTER CONTENTS, AFTER TRANSITION, ARE
STILL 00 (STATE a)
 THEN, IF 1 ENTERS AS SECOND I/P BIT
 THE O/P OF ENCODER NOW IS 11.
 AFTER TRANSITION, CENTRAL REGISTER WILL HAVE A 1 AS
ITS CONTENT, 3RD REGISTER WILL HAVE 0 AS ITS CONTENT.
 NOW RIGHTMOST 2 STAGES HAVE 10 (STATE b).
 IF THE FIRST BIT TO ENTER WAS 1, THEN..?
UNIVERSITY OF ENGINEERING DEPARTMENT OF
& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
TRELLIS DIAGRAM

CORRESPONDS TO I/P SEQUENCE 0 1 1 0 1.

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
VITERBI CONVOLUTIONAL
DECODING ALGORITHM
 DISCOVERED & ANALYZED BY VITERBI IN 1967
 PERFORMS MAXIMUM LIKELIHOOD DECODING
 INVOLVES CALCULATING A MEASURE OF
SIMILARITY (DISTANCE) BETWEEN RECEIVED
SIGNAL AT TIME ti & ALL TRELLIS PATHS
ENTERING EACH STATE AT TIME ti
 ELIMINATES LEAST LIKELY PATHS

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
VITERBI METRICS
 THE DECODING ALGORITHM USES TWO
METRICS:
 THE BRANCH METRIC (BM)
 a measure of the “distance” between what was transmitted and
what was received
 defined for each arc in the trellis
 Is the Hamming distance between the expected parity bits and
the received ones
 THE PATH METRIC (PM)
 a value associated with a state in the trellis (i.e., a value
associated with each node)
 corresponds to the Hamming distance over the most likely
path from the initial state to the current state in the trellis.
UNIVERSITY OF ENGINEERING DEPARTMENT OF
& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
VITERBI CONVOLUTIONAL
DECODING ALGORITHM
 FOR SIMPLICITY, BINARY SYMMETRIC CHANNEL ASSUMED
 START AT TIME t1 IN 00 STATE
 SAME ENCODER AS USED PREVIOUSLY
 2 POSSIBLE TRANSITIONS LEAVING EVERY STATE
 FULL TRELLIS STRUCTURE EVOLVES AFTER TIME t3
 AT EACH TIME INTERVAL, EACH BRANCH WORD IS LABELED
WITH HAMMING DISTANCE BETWEEN RECEIVED CODE
SYMBOLS & BRANCH WORD CORRESPONDING TO SAME
BRANCH FROM ENCODER TRELLIS

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
 VITERBI CONVOLUTIONAL
DECODING ALGORITHM
 ENCODER TRELLIS
 BRANCH WORDS SEEN ON ENCODER TRELLIS
CHARACTERIZE THE ENCODER AND ARE KNOWN A
PRIORI TO BOTH ENCODER & DECODER

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
 VITERBI CONVOLUTIONAL
DECODING ALGORITHM
 DECODER TRELLIS
 LABELS ON DECODER TRELLIS ARE ACCUMULATED BY DECODER ON THE FLY
(AS CODE SYMBOLS ARE RECEIVED,
 EACH BRANCH IS LABELED WITH HAMMING DISTANCE BETWEEN RECEIVED
CODE SYMBOLS & EACH OF THE BRANCH WORDS FOR THAT TIME INTERVAL

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
VITERBI CONVOLUTIONAL
DECODING ALGORITHM
 THE METRIC ENTERED ON A DECODER TRELLIS
BRANCH REPRESENTS THE DIFFERENCE (DISTANCE)
BETWEEN WHAT WAS RECEIVED & WHAT SHOULD
HAVE BEEN RECEIVED HAD THE BRANCH WORD
ASSOCIATED WITH THAT BRANCH BEEN
TRANSMITTED
 THESE METRICS DESCRIBE A CORRELATION-LIKE
MEASURE BETWEEN A RECEIVED BRANCH WORD &
EACH OF THE CANDIDATE BRANCH WORDS
 DECODING ALGORITHM USES THESE HAMMING
DISTANCE METRICS TO FIND THE MOST LIKELY
(MINIMUM DISTANCE) PATH THROUGH TRELLIS

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
VITERBI DECODING
 IF ANY TWO PATHS IN TRELLIS MERGE TO A SINGLE
STATE, ONE OF THEM CAN ALWAYS BE ELIMINATED
IN SEARCH FOR OPTIMUM PATH
 2 PATHS SHOWN THAT MERGE AT TIME t5 TO STATE 00

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
VITERBI
DECODING
 CUMULATIVE HAMMING PATH METRIC OF A GIVEN
PATH AT TIME ti
 SUM OF BRANCH HAMMING DISTANCE METRICS ALONG
THAT PATH UPTO TIME ti
 UPPER PATH HAS METRIC 4, LOWER HAS 1
 UPPER PATH CANNOT BE A PORTION OF OPTIMUM PATH
 AT EACH TIME ti, THERE ARE 2^K-1 STATES IN TRELLIS
 EACH STATE CAN BE ENTERED BY MEANS OF TWO PATHS
 VITERBI DECODING CONSISTS OF COMPUTING THE
METRICS FOR TWO PATHS ENTERING EACH STATE &
ELIMINATING ONE OF THEM

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
VITERBI DECODING-t1
 RECEIVED SEQUENCE: 11 01 01 10 01
 AT TIME t1 RECEIVED CODE SYMBOLS ARE 11
 FROM STATE 00, THE ONLY POSSIBLE
TRANSITIONS ARE TO STATE 00 OR 10
 00->00 HAS BRANCH METRIC 2
 00->10 HAS BRANCH METRIC 0

ENCODER TRELLIS DECODER TRELLIS

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
VITERBI DECODING-t2
 AT TIME t2, THERE ARE 2 POSSIBLE BRANCHES
LEAVING EACH STATE
 CUMULATIVE METRICS OF THESE BRANCHES ARE LABELLED
CORRESPONDING TO THE TERMINATING STATE
 RECEIVED SEQUENCE: 11 01 01 10 01

ENCODER TRELLIS DECODER TRELLIS

UNIVERSITY OF ENGINEERING DEPARTMENT OF
& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
VITERBI DECODING-t3
 AT TIME t3, THERE ARE AGAIN 2 BRANCHES DIVERGING FROM
EACH STATE
 AS A RESULT THERE ARE 2 PATHS ENTERING EACH STATE AT t4
 ONE PATH ENTERING EACH STATE CAN BE ELIMINATED (ONE
HAVING LARGER CUMULATIVE PATH METRIC)

ENCODER TRELLIS DECODER TRELLIS

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
VITERBI DECODING-t4
 SURVIVING PATH INTO EACH STATE IS SHOWN IN FIG
 AT THIS POINT IN DECODING PROCESS, THERE IS ONLY A
SINGLE SURVIVING PATH, TERMED THE COMMON STEM
BETWEEN t1 & t2
 THE DECODER CAN NOW DECIDE THAT THE STATE
TRANSITION WHICH OCCURRED BETWEEN t1 & t2 WAS 00->10
 SINCE THIS TRANSITION IS PRODUCED BY INPUT BIT 1, DECODER
OUTPUTS 1 AS THE FIRST DECODED BIT

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
VITERBI DECODING
 NOTICE THAT FIRST BIT WAS NOT DECODED UNTIL
THE PATH METRIC COMPUTATION HAD PROCEEDED
TO A MUCH GREATER DEPTH IN TRELLIS
 THERE IS A DECODING DELAY
 AT EACH SUCCEEDING STEP IN DECODING PROCESS,
THERE WILL ALWAYS BE 2 POSSIBLE PATHS
ENTERING EACH STATE; ONE OF THE TWO WILL BE
ELIMINATED BY COMPARING PATH METRICS

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
VITERBI DECODING-t5
 FIG 1 SHOWS NEXT STEP IN DECODING PROCESS
 AT TIME t5, THERE ARE 2 PATHS ENTERING EACH
STATE (ONE OF EACH PAIR CAN BE ELIMINATED)
 FIG 2 SHOWS SURVIVORS AT TIME t5

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
VITERBI DECODING-t6
 WE CANNOT YET MAKE A DECISION ABOUT SECOND
INPUT DATA BIT BECAUSE THERE ARE STILL 2 PATHS
LEAVING STATE 10 NODE AT TIME t2

 IN FIG 2, DECODER OUTPUTS ONE AS SECOND DECODED

BIT, CORRESPONDING TO SINGLE SURVIVING PATH
BETWEEN t2 & t3

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
VITERBI DECODING-a TO d

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
VITERBI DECODING-e TO f

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
DECODING
 AT THIS STAGE, IF I ASK YOU THAT
 DECODING HAS TO STOP
 PICK THE PATH WITH MAX LIKELIHOOD AT t6
 WHICH PATH WILL YOU PICK?
 a->b->d->c->b->d
 Path Metric=1
 WHAT WILL BE THE DECODED OUTPUT?
 11011
 WHAT WAS THE INPUT BIT SEQUENCE?

 HAS YOUR DECODER CORRECTLY DECODED THE MESSAGE BITS?

 YES
 WAS THERE AN ERROR IN RECEIVED SEQUENCE?
 YES
 HAS THE ERROR AFFECTED THE FINAL DECISION?
 NO
 SUCCESSFUL ERROR DETECTION AND CORRECTION?
 YES

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
CATASTROPHIC ERROR
 AN EVENT WHEREBY A FINITE NUMBER OF CODE
SYMBOL ERRORS CAUSE AN INFINITE NUMBER
OF DECODED DATA BIT ERRORS

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
CODING GAIN

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
 THE REDUCTION IN THE REQUIRED Eb/N0
TO ACHIEVE A SPECIFIC PB OF THE
CODED SYSTEM OVER AN UNCODED
CODING GAIN SYSTEM, WITH SAME MODULATION AND
CHANNEL CHARACTERISTICS

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI
 END OF LECTURE

UNIVERSITY OF ENGINEERING DEPARTMENT OF

& TECHNOLOGY MARDAN TELECOMMUNICATION ENGINEERING DR NAVEED MUFTI