Consider the convolutional encoder with k = 1, n = 2, and K = 3 of Figure 7.11(a). a. Given that the


Consider the convolutional encoder delay k = 1, n = 2, and K = 3 of Figure 7.11(a).

a. Given that the encoder is initially in narrate A = "00" and that the continuity x = "101000 . . ." (starting from the left) is presented to it, determine the selfsame (encoded) continuity, y. (Use the trellis diagram of Figure 7.12 to easily clear-up this application.)

b. Suppose now that the continuity y = "11 10 00 10 10 00 00 . . ." was produced and following pestilential aggravate a stunning utensil and was accepted at the other end delay two errors, that is, y* = "10 11 00 10 10 00 00 . . . ." Using the Viterbi algorithm (as in Figure 7.15), decode the accepted string and check whether the decoder is worthy of correcting the errors (as you understand, it should, owing this code’s open separation is 5).