CONVOLUTIONAL CODES a 8.1 CONVOLUTIONAL CODES . The main difference between block codes discussed in Previous units and the convolutional codes (refer section 5.6 for definitions) is the following, In “block codes”, a block of ‘n’ digits generated by the encoder ina particular time-unit depends only on the block of ‘k? input message digits within that time unit, In “convolutional codes” » a block of ‘n’ code digits generated by the encoder in a time unit depends on not only the block of ‘k’ Message digits within that time unit, but also on the preceding (m ~ 1) blocks of message digits (m> 1), Usually the values of ‘k’ and ‘n’ will be small. Like block codes, convolutio However, block codes are better si correction. nal codes can be desi; igned to either detect or correct errors, uited for r error detections and convolutional codes for error Encoding of convolutio: nal codes can be accomplished Several practical procedures have been developed for decodi ODER FOR CONVOLUTIONAL CODES : —A convolutional encoder, shown in its general form in figure Message digits and generates se using simple shift Tegisters and ing. 8.1, takes sequences of ‘quences of code digits, In any time unit consisting of k digits is fed into the encoder and the encoder generate: of ‘n’ code digits (k 2, 1, 3) convol figure 8.4. tional codes using time-domain approach can be nal encoder as shown in m+ 2, 1,3) of example 82 interms ny be defn ve of gue 84 1 12 al encoder ( i nal encoder ‘The time-domain bhaviour of a binary com : 0 set of “meimpudse responses”. The Tae eficency of hee” a elltntormation Theory 2nd Coding an impulse responses to characte umber of impulse respons encoder generates TWO convolutional sums, given by - yor!= 8 top adder, the output sequence, oP = cf 2: From equation (8.3), «For For j= inthe piven ences takes values 1 and 2 and Ivars from 10 ™=3: | cP = Vaiss” Let the message sequence be d, 4; dy Ce = dai $4, 8-44,» BP 88 ey “The output sequences are calelated as For j = 1: From equation (8.3), The message sequence d= 1 OL 1d the. generator sequence for the botom aide is co Yseitia” where d= 0 foal | ge 2 4 BP =I % ‘the quantity “P again varies from 1 108. ci) = 4, +42 www (84) For P= 1, equation (8.5) becomes “The message sequence d=d, d,d,d,d,=10111 k CO = 4g 0404001 for the top-adderis | Coe deg 44g 040 wna? ai | a = 4,8) + 8s {gj =0 since there is no connection from output of first flip-flop to the top adder]. = OOO Ma0Fb' ‘The quantity “1” in equation (83) always varies from 1 to (L +m) in general where For!=3, 6,9 = 48° he 8 *° L= number of message sequence bits. = (Ae Oare@eaatst-0 Inthe given encoder and message sequence, L=5 and m=3. « varies from 110 8 For !=4 2 4.50 thee reer *h Forl= 1, equation (8.4) becomes be - MOO asqpqyers ttle 4040+0=(I)()=1 b For !=5, er sage thes +4,g +040 | 7 ae scene eenaneonne re 0 | torl=6, dg rage reer y i oraosuee $4, +dg! (0) ()+(1)(Q)=14+1=0ae Information Theory and Coding For!=7, 6,9 = dg, +4, = 0+0#(1 For!=8, C7 = dg, +4, 8,9 +4,8) = 0+0+04+()()=1 -:. For bottom adder, the output sequence, C= CP CLC, ‘Afler encoding, the two output sequences are mi 0 00 oo ng Lo code-word” for transmission over the channel. The “code-word” at the output of the 90 00 00 00-1 my convolutional encoder is given by E Ri oder output is given by equati = IC" 62, c ©, c¢ oc 6 The enc 2 equation (86) as C= ICI 6%, C” C,%, C, Ge Ce cou » F two modulo-2 adders. In the given encoder. 11 00 00 00 007 11 11 00 00 00) c= 10000001 CH= 11011101 00 00 00 00 1 JIMETHOD (MATRIX METHOD) t ‘The generator sequences g," 2, gy... By 1 top adder and g,° f se C = [11,01 , 00, 01, 01, 01, 00, 11] which is same as before. “sce By, for the bottom adder, can be interlaced and arranged in a matrix form 83 ENCODING OF CONVOLUTIONAL CODES USING TRANSFORM- DOMAIN APPROACH | (From the study of ‘number of rows equal to the number of digits in the message sequence = L. rows and nu of columns =n (L-+m). Such a matrix of order [L] * [n (L+m)] is called “generator ma of the convolutional encoder. In general, for a two modulo-2 adder convolutional encoder, the generator matrix G is given by ‘we know that the convolution integral, which operation in the time domain, is repaced by the multiplication ‘Since a convolutional encoder is a LT finite the adder outputs by applying an appropriate encoder be replaced by & a or elements of the impulse oo | | Fesponse. Thus for “j* number of modulo-2 adders (where “)" varies rom i, We define the generator polynomi a 9G) = G4 x4 oP BH on FBO onl The corresponding output of each ofthe adders is then given by A P(x) = d(x) gO ) “After getting the polynomials atthe lynomial is obtained from C(x) = OO (FX CPOD® 2. (HP) tee FH snvolutional encoder of igure 8. Example 8.3 : Obtain the output ofthe ee In the 2°4 row, the number of ‘0°s is equal to the number of modulo-2 adders. generator matrix G has n(L +m) number of columns, the encoder output will have n(L +m) area one (88) the final encoder output ‘output of each of the adders, one) “In the given encoder of figure 8.4 : 84 sng d=10111 in approach.“ Information Theory and Coding | ca Bay tormeton Teeny end odeg e ruziions (8.11) an ealotion using ea eae 1G "2) in 8.10) we get ‘The generator sequence for ler of figure 8.4 is given by Es stay x= =(1011] = Thee ge “The generator polynomial corresponding fo the top adder is given by equation (8.7) as ge code-word corresponding to + gx + gy B+ gO = 14H He HLH +X “The generator sequence corresponding to the bottom adder of figure 8.4 is given by 22) = (2, 2, 2,9) . The corresponding generator polynomial is 2) = B04 gx +9 2+ gO? = Ltxtxttx i. The top-adder output polynomial is given by equation (8.8) as CO (x) = dex) 800) We have, forthe message d= 1 0111 1, the message polynomi d(x) = 14240 txt COG) = (e+e 4x) (48+) Sletten txt txt tet te eS txb ta? O(a) = 1x7 Similarly the bottom adder output polynomial is given by equation (8.8), with j= 2, as 02) (x) = d(x) g() = (4840 4x) (txt 2+ x) Sltxtete exit extead ttt xtt ad txé xt xs txStx? COQ) = Ltxtxdtxtt xt xT is given by equation (8.9), with n = number of ind the Output sequence using the (a) Time-domain approach, {p) Tansform-domain approach, i: iven by d=10011 method for finding the output of the encoder. sequence is given by Let us use the mat in figure 85, the genera larly for the bottom adder, the generator sequence ge g2J=110 (8.10) arid FCO Ge) WSL SHS Hitt Pe Ces xe ce A, C(x) DEAE Ah KIO xlBe ea ee orang 00 00 00 00) 100 00 00 [G] = ]00 00 11 10 11 00 00 00 00 00 11 10 11 00 10 00 00 00 ‘The output of the convolutional encoder is given by {C] = [4] (6) 00.00 00 00 00 00 11 00 00 =[100 001 00 00 00 00,00 11 10 11 00 1 ! 00 00°00 00 11 (i Transform domain approach ‘The message (d] = [10011] » d(x) = 14x txt = The.generator polynomials are given by OG) = Texte? L f 2 (x) = Lx? is ‘The output polynomial ofthe adders are obtained from equation (8 Q (x) = d(x) 2) For the top adder (j= 1) SES COG) = dex) 208) (Lt? tx4 (tx tx) = ltxtittvtxtes exter tx6 (eltxtttetat given by = (lt +x49 (1 +22) SLEW Axe xd 4 x6 FTF He xt te x5 46 ge output of the encoder COR) = ct =leeage xb = lixsgay ‘The output of the encoder i ERC A hl Hivegeg, 2 Find the code-word corresponding to . dca eat Min ae jem i, Jar ‘The encoder has the parameters n=3,k~1,m=2, ip-flops. Figure 8.6 shows the complete encoder. Qa Fig. 86:12) etilutional coer of example 8S In general, for a 3 modulo-2 adders convolutional encode, the generator matrix G is given 009 : : a : 33, a mnns, In the encoder given b= 58°" [G] matrix has L rows and n(L +m) columns. In m=, Therefore (G] has 5 rows and @) (6 +2) =21 columns given bsInformation Theory and Coding For the bottom-adder (j= 3) CG) = ex 4014) = xe 000 000 000 000 000 000 000 000 111 011 000 000 TEPER C 000 000 000 101 011 000) . xee 000 000 000 000 1 Pattie Pad iii) The output of the is given (Gii) The output of the encoder is given by Rees (C] = [4] [G] (C]=[1LON[ALL 401, 011 000.000 000 000 > es Ii], 101, 011. 600 000 000 y{eoo’ Go 111 101 011 000 000 000 000 000 i111 101 O11 000 ‘og 000 000 000 000 111 101 O11 Leta ays “The output of the encoder is given by eq Co) = (FR +e FxM 4x! Seer re rere rere ee The output of the encoder i = [UL 010, 001, 110, 100, 101, 011] ‘This is the encoder output using time domain approach, Using transform domain approach, let us write down the polynomials as given below : Wehave [d] = (i) Write the generator polynomi of () and compare with that of 0) 2 (= 14x g = (101) +g (x)= 1x7 2 = (111) 929 @)=14xtx ‘The output polynomials forthe three adders are given by equation (8.8) as C(x) = d(x) 9 () forj=1, 2,3. For the top adder (= 1) (x) = d(x) 8) Hipat| = (l+xtdtx') (142), y = Lect Rextt atte te Nb = 14x84 xttx r gg) ‘or the middle-adder (j= 2) wa OPQ) = da) P@)\ OF ig. 8.7 +A (2,14) convolutional encoder of example 86 (8 txte +22) Es ie 8 joes = Lextxtexttrt te txttx® lution input tothe two edders, the neat = Ltxte 4x6 i) Since there is no connection from the inp fi mises) are given bY cope ne g? = [O11 11) forthe top-adder i dl0. Information Theory and Coding 0 1) for the bottom adder. is the message input. ‘The parameters of the encoder are L=5,n=2,k=1,m=4, s. Number of rows in [G] = L=$ Number of columns in (G] = n (L-+m) = 2(5+4)=18 ‘The [G] matrix is then constructed as below [the general form is given in example 8.1), 00 0 11 00 00 00 00 00 00 1 [c] =]00 00 00 00 00 00 00 00 00 00 00 ‘The encoder output is given by [C] = [4] [6] [c}=fo1infoo u 00 00 00 00 00 00 00 00 = (00, y (ii) The message polynomial is given by dx) = 14x? +90 +x4 ‘The corresponding generator polyndmials for the two adders are given by (6) = x22 430 + x4 for the top addér g(x) = x-+x?-+x! for the bottom adder. ‘The output polynomial for the top adder is r (8) = an) (0) B (14240 4x9 (x PE Xt) axtxttd txt txttxtt xs tx bbe txts txt x? (tet att stat sextet for the botiom tom adder is C (&) = dex) gO (yy = (24 9 = xt trate tx tay x) tx tas ag tates RXHM Eee Tay The output of the encoder is given by equation (89) with n=) as C9) = +x CP = textast : NOH At OP ate abate a aI) SEE EAT bh? bla Re “The output of the encoder is (0, obtained in txt 1 which is same as or the (3,4, 1) encoder shown in figure 88, find codeword for inpst wing | (a) Time-domain approach (using generator matrix) | Transform domain approach by consusting ante funtion mati. FF Bottom ‘Adder ople 857 ) convolutional encoder of 2 pler Information Theory and Coding Solution {@) The encoder shown in igure 8.8 consists of two m= 1 stage shift registers, With n= 3 modulo-2 adders and two comm cone atthe input and the other atthe output, The ‘number of input bits entering through input commutator is k=2. For k=2, in general, the input message sequences can be written 2s sequences corre: _«, The output of the given convolutional a zumnber of segment tee al encoder is given by 8? = (8,198, ast) where wt commutator and 3 in output commutator. Therefor this given that &® = (a there is connection from segment (1) of the input ‘commutator as well as from the output of top flip-flop to the top adder. 2 (d] = (110110) 1j=2, a = [h 0}. There is no connection from the output of top flip-flap cs (C)=[110110F111 101 000 000 010 110 000 000 4 | 000 111 101 000 Fori=2,j=1, {0 = [0, 1}. There is no connection from segment (2) ofthe input 000 010 110 000 ‘commutator to the top adder and hence ‘0’. it ScanavomiTaT oT Fori=2,j=2, 2,9 = (1) 000 000 O10 110 Fori=2,j=3, g,0 = [0,0]asthereareno connections from segment (2) ofthe input i ition commutator to the bottom adder and from output of bottom flip-flop to the bottom adder, [C] = [101, 001, 001, 101) “The generator matrix fora (3, 2, m) convolutional code can be written, in general, as (b) The generator po Is corresponding to generator sequences are given by & 1g) = 1x, B= 10, eG) =x d= eP@=1, — gP=[ N>ePo)=1+x% = [> £01) =14 x, g=(0,0) > 8')=0 The generator polynomial matrix also called “TRANSFER. FUNCTION MATRIX’ is then given by a) 8G) 8G) ‘The generator sequences for the encoder of figure 8.8 are given by 1G). 652200) : ext) = (0, 1) @) 6:0) tx eo =['? lex # ‘The information sequence polynomials of message polynomials are @=tloyod x)= 1 +x? go) = [1 10) 74%) = 14 siven by The generator matrix will now have L + L = 2L number of rows and n (L + m) number + of columns. ? “© Inthe example, L=3, n= 3, m=1 e——-—“—FeSCé™rInformation Theory and Coding the state diagram Fam dave sho eonnection between them for various input comnts ot Bl he states ofthe ip lop Spe stte nga, the oda sean es decor ee ‘The code polynomials atthe output ofthe adders are then given by {2%)_C%x)_ CMI] = dl) GO) iy bedrawnse speing =e eyypiex 1 tex A 4.8 : Consider the binary convot as shown inthe flowing, x lex 0 ate tension tale, ste diagram cote oan igure 89. Draw he sate nd the encoded Sequence forthe mes ng cde es: Ut «(Ux aHosaHne, (eC he message (10 ate eade ‘using transform domain approach, ‘Verify the output sequence so o [letaxer need led tie? tad ect] 2 CG) = flee 0 texte’) 3 OMG) = 14x AG) =0 OM @) = Lext ete ‘The output code-word is given by equation (8:9) with n= 3 as fx) = CO (2) +x C (2) $7. C7 (’) = 149+ @) QFE LHP +x +x?) = tte texte? txt _SASTATE DIAGRAMS AND CODE-TREE OF CONVOLUTIONAL CODES ‘The state of an encoder is defined as its shift register contents. For an (n, k, m) code, lon part-1 : State Table “There are 2 flip-flops in the shift register and hence there are 2° = $ states. Let the states | beS,, §,,, and S, represented as shown in table 8.1 with k> 1, the 3 shift register contains k, previous information bits. Defining KA °K, % the total encoder memory (m — represents the memory order which is the maximum any shift register), the encoder state at time when the encoder inputs are a 8 § the binary k-tuple of inputs (4,_ ‘Binary Description | 00 {ud Ped.) and there are a total of 2 ‘m) encodes, K= K, = able for example 88, From figure 8.9, the outputs of the two modulo-2 adders (shown as 10? and bottom det) C1 and C2? can be represented as output sequences given by : 00 = dd, +). forthe topeadier Z (Cm) = 44, forthe bottom-atder xd as shown in table 82. fied and state table is constructed. In part-2, ‘The state transition table can be construct instructed showing clearly the present state, next state, input bits and the correspondingInformation Theory and Coding hea gs ac Maya ESS formation twemry ond Coding pepon| TM nr as ex | cotta, 0 ° 3 w [oo ofoo i! S, to Ae sgiterg =|: tae 8) 10 0, 3, apo TO : L s; 1 ae gay 3 or o 3 0 fo 1 s, w |r o 1fo 0 3, ir 3 3, apo at ; 5 » eu e Eee Fig. 8.10: State diagram for example 8 ‘Table table forexample 88 part-4: Code Tree ‘The state diagram of figure 8.10 Construction of State Transition Table Let the start state of the flip-flops be the cleared state “00” —> S,. Wi ins at “00” > S, state. The two outputs of the adders changes state from “ ew contents of the st Ifthe input is a athis followed. The v |The output code-words register are guiput for any informat =100.The tabular |) upper path is followed and ifthe input isa‘1' then lower represents “node” and horizontal line is called a “branch”, 1 for each input bit are shown onthe branches. The encoder sequence can be traced through the code-tee paths For an information sequence of | 011 1, we can traverse through the code-tre ina path shown by dotted the nodes S, —>S,-»§,-> > $,9 S, produc not the complete code sequence since the total co The numberof fip- ops in the encoder = m~ 2 and hence we require two more and eset the encoder. Hence, 0 obtain the complete code sequence corresponding the tree graph has to be extended, in gener falled “tail of the tree”, Thus the extended tee diagram forthe (2 12) encode, re information sequence 10111 is shown in figure 8 tal of he ue ‘assumed that the inputs are ‘0's From the code-tree, the complete informa column of table 8.2. For the next state 10S, the contents of the flip-flops are analysed and entered in the table, This process is continued for all the states and the table is completed as shown. Part - 3: State Diagram Inthe state diagram of figure Sy 8, S, and S,. Consider the state S,, With S, with output sequence of 00. This is shown as an arrow mark and being labelled as 0(00) > the * the brackets are the output sequences. Wi > S,. This is shown as a line starting from S, and ending at S, with an arrow ards $, and being labelled as 1 (11) -> the *1” outside the bracket is the ide the bracket are the corresponding outputs. In this way, the compete state ime units and this extended partis ‘be oblained by traversing through the state diner rand the input outside. For of figure 8,10. The outputs are given inside the parenthesis i oe information sequence of 10111, we ean now tavese trough the a ga tro Slates from S, o> S.-> $,-? Sy? Ss? Sr? Sx? Se BeNDE out en 01, 10, 01,11} which is same as bane from code-wes- ‘Also note tha are again ‘0's to get the complete sequence: ‘The same output sequence can also -Sovpresrscacecel Fig, B41: Code-tree for example 8.8 | (iv) Verify the output using time-domain a For the top-adder CG) = d(x) (0) CAP sey Uses) Flt t8epex txt textes? +H = lexedted For the bottom-adder t Cex) = d(x) 2 (H) txtegest = ltdee te sixteen’ = levedttd +8 (89) wihas 235 fe xt ex [lexte? +25] Jagteate shea? eltxte -the convolutional encoder: shown in figure 8.12. The code is systematic. iagram Draw the code tree. i the encoder output proguce by the message suenss 10111 ypproach (matrix method).Input —} FF, ae dey Fig. 812 : A 1, 1) convolutional encoder of example 89 Solution Part 1: Since there is only one flip-flop, we have only 2 states. Let the two states be represented and C? = d, CA he state transition table can be constructed as shown in tab | co Ostput ‘Next r . state 4 Si co 7a) ] oe pe luster Pon tg rr re a v s,J 1 1 1 Tie; Baseline for example z Part - 3: State diagram : he There are only two states S, and S, and hence the state diagram appears to be very simple as shown in figure 8.13, \ 088 wi \o aan ©} Fig: 8.13: State diagram for example 8.9 ig, 814 : Codeatree for exemple 89ae ie {oformation Theor For the given message sequence of 10111, we can traverse through the state diagram of figure 8.13 starting fom state Sy S, ~> S, > S, —> 8, -> 8, >, producing the outpur 0,11, 01, OL 10). [Again note that the'last pair of output is obtained oy the input). Part 4: Code Tree: ‘The code-tree corresponding tothe state diagram of figure 8.13 can be drawn as shown in figure 8.14. For the given message sequence of 10111, we can traverse through 01, 01, 10, 00) is same as before. . Verification through time-domain approach : ‘The generator sequences'are given by 20 = (1) and 0) = [1, 0] “The generator matrix has L = 5 rows and n (L.+ m)=2 (5+ 1) = 12 columns given by 1110 00°00 00 00 00 11 10 00 00 00 [G] = }00 00 11 10 00 00 00 00 00 11 10 00 00 00 00 00 11 10 ‘The enéoder output is given by C= d G - C=[10 iJ[t 10 00 00 00 11 10 00 00 00 11 10 00 00 00 11 00 00 00 00 00 00) 00.00 00 00 10 00 1 10, = (11, 10, 11, 01, 01, 10] which is same as before. Example 8.10 : Figire 8.15 shows a (2, 1, 3) convolutional encoder @ Draiw the state diagram (ii) Draw the code tree. FFind the encoder ouput produced the code-tree. z by the message sequence 11101 by traversing through solution Part ~ 1: State Table : ‘There are 3 flip-flops in the shift 5,10 S, be represented as shown in table ‘State Fig. 8.45: A 01,3) convo encoder of example 19 register and hence 7 there ae B <8 states Lethe sates Binary Description ~ISTSIS TS 100 no O10 01 |x ‘Table 8.4: State table for example Bt Part - 2 : State Transition Table : Lookinig at the encoder of figure the outputs are givea by OP- dtd td, and CO = dae ne, ‘The state transmission table can now be constructed as shown i ible 85. Present | Binary | Yopat | Newt | Bary | Ostpat state — |Description state |Description) * 4-1 &-2 4] cm co 3, 000 7 oo [ooo o;o 0 é . L yo [io o oli i 5; Too 0 oo [o 1 0 o|o 2 l uo |i io of .o 3; O10 v rr 2 1 10 ojo zy, T 7 Capt eal) Oi) beet ‘ os 1 fod 8 o T 7 Too S ay ious 8 Vasa 5, 101 ® eae ea) : oo 0 Se or ‘ 10 + o 1 1 3; Tit ‘ Li waka je for example B10 able 85 2 State transition taPued Part - 3: State Diagram : { Figure 8.16 shows the complete state diagram comprising the eight states Sto S,, Fig. 8.16 : State diagram for example 8.10 figure 8.16 can be drawn e given message sequence of path shown by broken lines ‘property may be ¢: ‘has memory of 2 bits. When the third message shifted out of the register. Consequently, after code tre fr example 10 Fig. 817: > tiInformation Theory and Coding 438 4,4, .. and 000 4, d, geners nay be joined together. A ‘the third branch, the message sequences mm: Fig. 8.19 shows the encoder block di is and the pair of nodes labelled lock diagram, to anew form shown in fig. 8.18 which that a code branch Sb Btnas rook ie oe each inputmessage sea eeecfc path trough the eli. For exam from fi to a sPesequence 10111 produces the encoded output as 10, 00, sry agrees with the result obtained in example 8.8. Fig. 8.19 : Convolutional encoder of example 8.11 table: There are 2 flip-flops and hence there are 2? = re are 2 Aip-flops and hence there are 2? =4 sates, Let these states be ‘State Binary Description Depth j=0 Fig. 8.18 : Trellis Diagram for the convolut fering to fig. 8.18, the levels of the trellis are label ‘also sometimes referred to as “depth j”. The first .(L+ m). The correspond to the correspond to the | ‘the states can be reached in these of the trellis. However, in the central portion of the which the level range m Sj (9) Find the encoder output by traversing through the’ state diagram for input message = 3 oe [ord _ sequence of (11101) . , > " { s, n [wd ‘code trellis and obtain the output ofthe encoder forthe same input sequence of ie : 3 “Table 8.27 State transition table for example 811 eyes Information Theory and Coding ‘convolutional Codes (iv) State diagram: Fig. 8.20 shows the state diagram consisting of four states Sy S,,, and From pat (¥) above, It also shows the state transitions based on the slate transition conditions given in wa table 8.7 and the corresponding input and outputs in braf' > 8, > ‘The transition from: and soon. We observe imple 8.12 : For the convolutional (@) Draw state table Heseode shown ng 8.22 (©) Draw state transition table (©) Draw stat (@ Find encoder output for the diagram, Message sequence (10011) by taversing tough he state E, Bangalore - 560 024 | © Draw code trellis for one time unit. § (10011) using the core tell. ain te output forthe same message sequesce (v) By traversing through the state diagram following the} of rants BEQIONE the left node to one of the right nodes when the date input is binary ‘0’ and broken line | ‘when date input is binary ‘1’. The corresponding outputs are also shown. ' Currentstate Transition and output Next state ; S200 se CE 5S, } Fig. 8.22 : Convolutional encoder for example 8.12 E Solution: | @ State table: There are 3 flip-flops and hence there are 2? = 8 states. Let the slate be MS I Sy, Syn S;. These states and their binary descriptions are as shown in able 8.8. t State sf S| S Sy is, t Binary Description 10 } 110. | 001 | 101 7 table for example 8.12 2 adders (®) State transition table: From fig. 8.22, the outputs of the two modulo- © and C® can be represented as output sequences given by 0 = 4+ The state transition table can be constrInformation Theory and Codin Convolutional Codes vs ny and Coding | Code | inary | tmput | Ne ‘Output Cue inalaaae Fret [gerpdon] ¢ win tour Naina oo (| 0 | S 00 ifs tou o> [78 rt 5 100 oalee a 3 an a oT 11s, to 8 0 Se a) 1 |_s. oot 5 o | & TI 1 Sy oo 3 7) 3 oo | s Lot 3, o | % To rs, ot 3 Ti o | & ot 1 | 1 0 Fig, 8.24 : Code trellis or exarmp N transition from one st (6) State diagram: Fig. 8.23 shows the state diagram co TR Ss 7 8.25 also shows the state transitions based on the state tra and the corresponding input and output. 01, 00, 0 is the corresponding output ofthe convolut 1m block codes? -domain approach with ane Fig. 8.23 : State diagram of example 8.12 (4) Theencoder output is obtained by traversing through the state diagram of fig, 8.23 through the path 8, -> 5,2 e $, > 8, > 8, > 8-7 8, > Sp corresponding to input Sen 0 1 with edditiona three 0's, The output of the encoder is given by (11, ll,