7 Determine the average energy of a set of M PAM signals of the form inl) = SnVO, m= 1,2, Osr 10, madl 2, Detestine gy for m = +2, 43, by convolving the impulse response of the equalizer with the channel response. 8.49 In LOS microwave radio transmission, the signal arrives at the receiver via two propagation paths, the direct path and a delayed path that occurs due to signal reflection from surrounding terrain, Suppose that the received signal has the form r(t) =s() +as(¢—T)+n(0) ‘where s(t) is the transmitted signal, isthe attenuation (a < 1) of the secondary path and n(¢) is AWGN. 1, Determine the output ofthe demodulator att = T and? = 27 that employes 2 filter matched to s(). 2. Determine the probability of error for a symbol-by-symbol detector ifthe transmitted signat is binary antipodal and the detector ignores the ISL ‘3, What is the error-rate performance of a simple (one-tap) (DFE) that esti- ‘mates a and removes the IST? Sketch the detector structure that employs & DFE. 84h 8.50 Repeat Problem 3-4 using the MMSE as the criterion for optimizing the-tap ‘coefficients, Assume that the noise power spectrum is 0.1 WiH{z.9.22, In Example 9.5.1, find the minimum distance of the code. Which code word(s) is(are) minimum weight? Example 95.1 ‘A(G,2) code is defined by € = (00000, 19100, 01111, 11011} Its very easy to verify that cis code is linear If the mapping between the information sequences and code words is given by 00» 00000 oro 10> 10100 01 the special propety mentioned above is satisfied as wel. If the mapping is piven by 00+ 10100 os + 01 10 00000 1 non the special property isnot stsied. However, in both cases the ode sHnea. Now we define some of the basic parameters that characterize a code. Definition 9.5.2. The Hamming distance between two code words ¢ and 6) is the number of components at which the two code words differ, and is denoted by de.g)4 Definition 9.5.3. The Hamming weight, or simply the weight of a code word @ is the number of nonzero components of the code word and is denoted by w(e:). Definition 9.5.4. The minimum distance of a code is the minimum Hamming distance between any two different code words; ie., dria = tain d(C €3) 5) fal Definition9.5.5. The minimum weight of a code is the minimum of the weight® of the code words except the all-zero code word, Wain = main w(e:) 952) ‘From now on Hamming distance is dencted by d and Enclidean distance is denoted by @®. {9.29 Compare the block error probability of an uncoded system with a system that uses a (15, 11) Hamming code, The transmission rate is R = 10* bps and the chennel is AWGN with a received power of 1 W and noise power-spectral density of 4. ‘The modulation scheme is binary PSK and soft-decision decoding is employed. Answer the question when hard decision is employed.9.41 A convolutional code is described by g=f 0 0 @=0 0 1) ge=0 1 1. Draw the encoder comesponding to this code. 2, Draw the state-transition diagram for this code. 3. Draw the trellis diagram for this code. . 4, Find the transfer function and the free distance of this code, 5. Verify whether this code is catastrophic or not. 9.43 The block diagram of a binary convolutional code is shown in Figure P-9.43. —s, | igure P.9.43, 1. Draw the state diagrain for the code. 2. Find 7(D), the transfer function of the code, 3. Whats dino, the minimum free distance of the code? ‘4 Assume that a message has been encoded by this code and transmited ¢Xer a binary-symmettic channel with an error probability of p= 10" tt (yzteceived sequence isr= (110, 110, 10, 111,010, 101, 104), using the Viterbi algorithm find the transmitted bit sequence. Find an upper bound to biterror probability ofthe code when the above inary-symmetrc channel is employed, Make aay reasonable approxivne, tions,