EE6058 ASSIGNMENT NO.

5
DATE ASSIGNED: DATE DUE: READING: Friday, May 14, 1998 Friday, May 21, 1998 Chapter 9.

PROBLEM 5.1. Write a MATLAB routine that takes as an input two real vectors, a long vector X of length N, and short vector b of length n, where N > 10n. The output of the routine should be an integer k1 that identies the portion of X that is closest to b, in the sense that the correlation between X(k1 + (0:n-1)) and b has a maximal absolute value. Assume that both X and b are complex valued. Hint: one method to do this is to convolve X with a lter matched to b using the conv command, and then detect the peak of the absolute value of the lter output. PROBLEM 5.2. (a) Create four directories, as described below (using Unix commands):
mkdir PROJ; mkdir PROJ/Share; mkdir PROJ/Cheating; mkdir PROJ/Pics

(b) (c)

copy the send.m program from the project website to the PROJ directory copy the image eye.jpg to the PROJ/Pics directory The MATLAB program send.m will help you get started on the project.

(d)

Execute the program send.m. The following MATLAB command will read the recorded waveform into MATLAB:
r = auread(Share/recorded.au);

Write a MATLAB program to nd the integer index i0 such that r(i0) corresponds to the very rst training symbol. (Hint: consider Problem 5.1). This solves the synchronization problem. PROBLEM 5.3. Consider a BPSK system with alphabet {1, 1} and folded spectrum Sh(z) = 2M(z)M*(1 z*), where M(z) = 1 + z1 z2. Suppose the transmitter sends L = 4 symbols, a = {a0 a3}, and the receiver observes the following after a whitenedmatched lter: r = {r0, r1, r2, } = {0, 1, 2, 3, 4, 5, 6, 7, 8, }. Use the Viterbi algorithm to nd the decisions made by the minimum-distance sequence detector. PROBLEM 5.4. Consider a 4-QAM system with alphabet {1 j, 1 + j, 1 j, 1 + j} and folded spectrum Sh(e j) = 5 + 4cos(). Suppose the transmitter sends L = 3 symbols, a = {a0 a2}, and the receiver observes the following after a whitened-matched lter: r = {r0, r1, r2, } = {0, 1 + j, 2, 3 + j, 4, 5 + j, 6, 7 + j, 8, 9 + j, }. Use the Viterbi algorithm to nd the decisions made by the minimum-distance sequence detector.