COLLEGE OF ENGINEERING

DEPARTMENT OF ELECTRICAL, ELECTRONICS & COMPUTER ENGINEERING

2017/2018 SECOND SEMESTER EXAMINATION
EEE 512 DIGITAL COMMUNICATION
INSTRUCTIONS: Answer Four (4) Questions only TIME ALLOWED: 2 hours 30 minutes

Question 1
(a) An alphabet consists of the letters A, B, C, and D, each letter is coded into sequence of two binary
(on-off) pulses. The A is represented by 00, B by 01, the C by 10, and D by 11. Each individual is 5ms
i. Calculate the average rate of transmission of information, if the different letters are equally
likely to occur
ii. If the probability of occurrence each letter is respectively, 𝑃𝐴 = 1⁄5 , 𝑃𝐵 = 1⁄4 , 𝑃𝐶 =
1⁄ , 𝑃 = 3⁄ , find the average rate of transmission of information in bits/s
4 𝐷 10
[8 marks]
(b) Compute the required channel capacity for the transmission of digitized TV picture, assuming a
signal-to-noise ratio of 50dB and a transmission bandwidth of 50 MHz [3 marks]

(c) Distinguish between source and channel coding [4 marks]

,,

Question 2
(a) A Communication system is used to transmit one of 16 possible signals. Suppose that the
transmission is accomplished by encoding the signals into binary digits
i. What will be the pulse sequence for the 13th and 7th symbol?
ii. If each binary digit requires 1 µs for transmission, how much information in bits does the
system transmit in 8 µs? Assume that the signals are equally likely to occur
iii. If the symbols are sent directly without encoding, it is found that each symbol requires 3 µs
for transmission. What is the information rate in bits/s in this case?
[9 marks]

(b) At the input of an ideal receiver the transmitted is 100 KHz while the bandwidth at the output is
12.5KHz. If the input has 𝑆⁄𝑁 ratio of 15db, what is the 𝑆⁄𝑁 ratio at the demodulator output.
[4 marks]
(c) Give two main significance of digital communication. [2 marks]

,
Question 3
(a) A cyclic (7, 3) code has its generator polynomial 𝑔(𝑥) = 𝑥 4 + 𝑥 2 + 1
i. Find the G matrix for this code
ii. Find all possible codes. What is the minimum distance of the code? Show that it is single error
correcting
iii. Select any 3-bit data sequence. Use the remainder theorem to find the parity-check bits
compare with the corresponding code word in ii
[7 marks]
(b) A discrete memoryless channel is used to transmit eight symbols A, B, C, D, E, F, G and H, with
corresponding probabilities: 0.35, 0.23, 0.15, 0.10, 0.08, 0.05, 0.03 and 0.01 respectively.
i. Determine the code of the distribution using Huffman and Shannon technique
ii. Which of the code is optimal?
iii. Justify your answer
[8 marks]

Question 4
(a) Define the term “Discrete Memoryless Channel” [ 2 marks]

(b) A DMC with Input 𝑥1 , 𝑥2 , 𝑥3…………….. 𝑥𝑛 and output 𝑦1, 𝑦2, 𝑦3 … … . 𝑦𝑛

i. Use a suitable diagram to represent a DMC
ii. Generate its Channel matrix
[5 marks]

(c) Fig 1 shows a discrete memory less channel

Transmitter Receiver Decision

0.9
𝑃0 =0.8 0 0 0

𝑃1 =0.2 1 1 1
0.3
i. Find the probability of error 𝑃𝑒
ii. Find the probability of receiving 0 (𝑃0𝑟 )and 1 (𝑃1𝑟 )
iii. Find 𝑃𝑒 if the decisions are reversed i.e. received 1’s are called 0’s and vice versa
[8 marks]
Question 5
(a) Discuss the practical applications of Huffman coding. [5 marks]
(b) A binary symmetric channel is shown below. Find the rate of information transmission over this
channel when p=04; assume that the symbol rate is 5000/sec [9 marks]

p
0 0

1 1
p

(c) State one reason why the above figure is called a binary symmetric channel [1 mark]

Question 6
(a) List (5) lossless compression techniques and indicate one area of applications of each.
[5 marks]

(b) A binary message consists of words which are 5 bits long. The message words are to be encoded
using a single-error-correcting code. The first 5 bits of each code word must be the message bits
𝑑1 , 𝑑2 , 𝑑3 , 𝑑4 𝑎𝑛𝑑 𝑑5 while the remaining bits are check bits.
i. What is the minimum number of check bit?
ii. Formulate the Parity check matrix (P) and Generator matrix (G)
iii. Construct the appropriate H matrix for the code
iv. Find the syndrome at the receiver if there is an error in 𝑑5

[10 marks]

GOODLUCK