TA. Draw the state diagram, tree diagram, and trellis diagram for the K = 3, rate } code nerated by g(X) = x4 x a(X) =14+X aX) =1+X+ 22 KS o 9, x) = KEKE Gow) = 1X Qa(x) = lex tx72. rate }, binary convolutional code with the partially completed state diagram shown in Figure P7.1, find the complete state diagram and sketch a diagram. for the encoder. Compldar: K=3 n=2 kel 7.3. Draw the state diagram, tree diagram, and trellis diagram for the convolutional encoder characterized by the block diagram in Figure P7.2. Digan. & toll74, Suppose that you were trying to find the quickest way to get from London to Vienna by boat or train. The diagram in Figure P7.3 was constructed from various schedules. ‘The labels on each path are travel times. Using the Viterbi algorithm, find the fastest Figure P73 418. Consider the convolutional encoder shown in Figure P74, (a) Write the connection vectors and polynomials for this encoder. (b) Draw the state diagram, tree diagram, and trellis diagram, 2 d = |+x 2 ; xe weet tte come . q Lv Digan ob =e coro. de cool Ae a "ES Diegoma te Oe WS 10,7 @ 1 00.16, An encoder diagram is shown in Figure P7.5. Find the encoder output for an input sequence 1001010, 2 J cenere x 1601010 000 ye @ 1 Ol WI ot 00, Input allows the shift of two message h and the rate efficiency of the eros. What will be the code se- Ca) K=4