Scribd
Upload
104 views2 pages

EE5139R Communication Systems Problem Set 1, 2011/12

This document contains 5 problems related to digital communication systems: 1. It asks to compare analog and digital communication systems for transmitting speech, draw a block diagram of a basic digital transmitter, and explain sampling rates and bandwidth requirements. 2. It asks about pulse code modulation (PCM) source encoding, quantization levels, bandwidth efficiency, and other source encoding techniques. 3. It provides details on the (7,4) Hamming error-control code, asks to write the generator and parity check matrices, and find codewords and error vectors. 4. It asks why large prime numbers are necessary in the Diffie-Hellman key exchange algorithm and what an eavesdropper could do

Uploaded by

krishpri
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
104 views2 pages

EE5139R Communication Systems Problem Set 1, 2011/12

This document contains 5 problems related to digital communication systems: 1. It asks to compare analog and digital communication systems for transmitting speech, draw a block diagram of a basic digital transmitter, and explain sampling rates and bandwidth requirements. 2. It asks about pulse code modulation (PCM) source encoding, quantization levels, bandwidth efficiency, and other source encoding techniques. 3. It provides details on the (7,4) Hamming error-control code, asks to write the generator and parity check matrices, and find codewords and error vectors. 4. It asks why large prime numbers are necessary in the Diffie-Hellman key exchange algorithm and what an eavesdropper could do

Uploaded by

krishpri
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

EE5139R Communication Systems Problem Set 1, 2011/12

1. Consider the design of a communication system that enables a speech signal to be transmitted directly (without any intermediate nodes) from the source to the receiver. (a) Identify the advantages and disadvantages of a digital communication system designed for this purpose, compared to an analog communication system. (b) Name the two best-known analog communication techniques, and explain briey how they work. (c) Draw a block diagram of the simplest digital communication transmitter, based on binary modulation, that can be used for transmission of a speech signal, starting with the microphone and ending with the channel input. Describe the function of each block. (d) If the bandwidth of the speech signal is 10 kHz, explain in precise mathematical detail why it is necessary to sample the signal at above 20 kHz. Explain the consequences of sampling at a lower rate. (e) Suppose we sample the speech signal at a rate of fs samples per second, where fs > 20, 000, and we quantize each sample using m bits. Find the minimum channel bandwidth required for transmission, using baseband binary pulse amplitude modulation (PAM), that satises the Nyquist zero-ISI (inter-symbol interference) criterion. 2. Pulse code modulation (PCM) is the simplest form of source encoding. It simply rounds o the signal level at each sampling instant to the nearest quantization level. (a) Find the minimum bandwidth required for zero-ISI transmission of a PCM signal with Q quantization levels, M -ary baseband modulation, and a sampling rate of fs Hz. (b) If the entropy (or self-information) of the source signal is H bits per sample, how does the bandwidth eciency dened as H/W , where W is the bandwidth computed in part (a), change with Q? Should we increase or decrease Q to improve bandwidth eciency? (c) Suppose we changed Q according to part (b) to improve BW eciency. What is the trade-o for this improvement? (d) Name one other method of source encoding related to PCM, and discuss in what ways it is better, and in what ways it is worse, than PCM.

3. The simplest and arguably most famous example of an error-control code is the (7,4) Hamming code. It takes message vectors m of 4 bits and processes each one with a generator matrix G to produce codewords c that are 7 bits long: c = mG (1)

where m and c are row vectors (by convention), and G is a 4 7 generator matrix with elements in F2 = {0, 1}. Multiplication and addition are dened in F2 as a b = a b mod 2, a + b = (a + b) mod 2.

Let H be the 37 matrix where no two columns are equal, that satises GHT = 0. This is known as the parity check matrix. (a) Write out a G matrix dierent from the one given in class, and the corresponding H matrix. (b) Find the codeword that the message vector (1010) maps to with your Hamming code. (c) Find the one-bit error vector e that produces a syndrome eHT = (111). Find two two-bit error vectors that produce the same syndrome (111). What does this tell you about the error correction ability of the (7,4) Hamming code? 4. In the Die-Hellman key exchange algorithm for encryption, why is it necessary to choose large values for the integers a, b and p? If they were small values, what should Eve the eavesdropper do to decipher the messages transmitted between Bob and Alice? 5. The self-information of a binary random variable X with sample space SX = {0, 1} and P (X = 1) = p is often denoted H(p), given by H(p) = p log2 p (1 p) log2 (1 p). (a) Sketch or plot H(p) as a function of p. (b) Let Y be another binary random variable, independent from X, with P (Y = 1) = q. Let Z = (X, Y ) be a random vector with probability mass function pZ (z) = P (Z = z). Show that the entropy of Z is H(p) + H(q).

You might also like