Figure (a) : Convolution encoder Scanned with CamScannerMey, Code Trellis: ooe0 Ed yore? VEG pe 594 mat. 10 Figure (b)+ Code trellis of. convolution encoder, Description: |Let's represent, the. received Signal by Convolutional. encodjng operates continuously on data input ga, Hence there are non code vector and blocks as such. Let's assume that the transmission error probability of symbol 1's and 0's is same, Metric: It is the discrepancy between the received Signal y ang the decoded signal at particular node, Surviving path : This is the path of the decoded signal with minimum metric. 4: : Algorithm : In, viterbi decoding, a metric is assigned to each surviving path. Y is, decodes as the surviving path with smallest metric. Consider the following examples.s (1) Let the signal being received is. encoded by encoder as shown in figure (a). “For this encoder code trellis diagram is shown in figure (b). For a single bit input the encoder transmits two bits output v, and v2. These Outputs are received at the decoder and Tepresented by’Y’. (2) Assume that the decoder is at state ag then from figure (b) Next state will be ‘'a' or 'b'. Let.us assume Y = 11 01 11 be the six Teceived bits, Two branches are shown from ap. One branch is at next node 41 Tepresenting decoded signal as 00 and other branch is at b; Tepresenting decoded signal as 11; ‘ Scanned with CamScannerBranen | nee 4 we pe tuitative or Li 2 a4 Poth disere pa _~K (melrienis tee No XN © ™ N bh) Or — rain metric is by tero The branch from agby represents decoded output as 11 which ig same a8 the received signal, i.e. 11. Thus there is no discrepancy peteen the received signal and decoded Signal. Hence metric of that panch is zero. Similarly, metric of branch froma Ag toa, is two (2). (3) When the next part of bits Y=01 is Teceived at node ay > and by then from figure (b), stateay and by ,-can divide into four possible state as shown below. : : ‘ 00 Oe 2 <=, a4 ~ \ 1 eS Se) “eb, Be oes eile x0 4 - cz ve Osan ~~ 10) ~~~ a2 e figure there are four possible next state From above 10, 01 ayyb9,¢y anddy along with decoded outputs 00, 11, respectively, The encircled number near ap,b7,c2 anddy indicate For example, the path metric of the path metric emerging from 9. i it Y =I] is shown The similar operation for received bit Y =I]! Scanned with CamScannerCy 1 \ 10, x @ ern 0 @ zo) Above figure shows the nodes with their Tight hand side at the end of sixth bit of Y, common to each node and between these two Pp higher metrics than other path coming to th cancelled. Therefore four paths with lower m decoder and the decoding Continues to next re Path metric, Thus two Paths are ath, Which are havin lat particular Node are etrics are Stored jn the SON the ceived bit, Yella an oy 10, 0 1. Hao VeRO Of ot OO BR BETO! oq 10 fic As @ ‘ Figure : Viterbi decoding Above figure shows'the continuation for a message 12 bit. The received bit Y are marked at the top of the decoded value of output. (Y+E) which is marked at bottom, From above figure, node ayy Since’ this pat and hence Y is decoded only one path arrives with metric two (2)at h is lowest Metric, it is the surviving path from this path. All the decoded values of Output are taken from the Outputs of this path. __ In this way coding is done. ‘This is also called maximum likehood decoding. Scanned with CamScanner