TUTORIAL -6

1) Consider a rate 2/3 convolutional code defined by

G(D) =

1 2 D

1 + D 1 + D + D2 D D + D2

This code is used with an 8-PSK signal set that uses Gray coding (the three bits per symbol are assigned such that the codes for two adjacent symbols differ only in 1 bit location). The throughput of this TCM scheme is 2 bits/sec/Hz. (i) How many states are there in the trellis diagram of the encoder? (ii) Find the free Euclidean distance. (iii) Find the asymptotic coding gain with respect to uncoded QPSK, which has a throughput of 2 bits/sec/Hz (iv) Suppose instead Gray coding, natural mapping is performed, i.e., s0 000, s1 001,., s7 111. Find the free Euclidean distance. (v) Hence in this case, find the asymptotic coding gain with respect to uncoded QPSK, which has a throughput of 2 bits/sec/Hz.

2) For each of the following signal constellations, determine a signal partition. Compute the minimum distance between signal points at each level of the tree.

3) For the encoder shown here

employed with an 8-PSK constellation partitioned as in figure 7.6(Information theory, coding and cryptography by R.Bose). i) Draw the trellis of convolutional encoder ii) Draw the trellis for the trellis coder, labeling the state transitions with the subsets from the constellation iii) Determine the minimum free distance between paths which deviate from the all zero path, but for non-parallel paths and the parallel paths. Determine the minimum free distance for the code. Assume ES=1. iv) Determine the coding gain of the system, compared with 4-PSK.