DAR ES SALAAM INSTITUTE OF TECHNOLOGY

DEPARTMENT OF ELECTRONICS AND TELECOMMUNICATIONS EGINEERING

TEST 2: SEMESTER I
SIGNAL TRANSMISSION ANALYSIS: ETU 07312
BENG 11 T
Question One:
Analog signal is band-limited to 4 kHz, sampled at the Nyquist rate, and samples are quantized
into 8 levels. If the quantization levels
1
s ,
2
s ,
3
s , ,
8
s (symbols) are assumed independent
and occurs with probabilities given below:

. y probabilit with
, y probabilit with
, y probabilit with
, y probabilit with
, y probabilit with
, y probabilit with
, y probabilit with
, y probabilit with
32
1
8
32
1
7
16
1
6
16
1
5
16
1
4
8
1
3
8
1
2
2
1
1

=
s
s
s
s
s
s
s
s
X
a) Solution:

8
2 8
4
2 4
3
2 3
2
2 2
1
2 1
1
log ...
1
log
1
log
1
log
1
log
p
p
p
p
p
p
p
p
p
p H + + + + + =
32 log
32
1
32 log
32
1
16 log
16
1
16 log
16
1
16 log
16
1
8 log
8
1
8 log
8
1
2 log
2
1
2 2 2 2 2 2 2 2
+ + + + + + + =
5
32
1
5
32
1
4
16
1
4
16
1
4
16
1
3
8
1
3
8
1
1
2
1
+ + + + + + + =
symbol bits 3125 . 2 15625 . 0 15625 . 0 25 . 0 25 . 0 25 . 0 375 . 0 375 . 0 5 . 0 = + + + + + + + =
The information rate R is
) (m rH R =
But,
2
1
sec symbols 8000 4000 2 = = r
Hence,
sec bits 18500 3125 . 2 8000 = = R
b) If this communication system transmits symbols (messages) in the following sequence:
2
s ,
1
s , and then
4
s using Shannon-Fano algorithm as a source encoder and linear block
coding as a channel encoder as shown in Figure Q1:
i) Write the resulting codes of the source encoder for the symbols
1
s ,
2
s , and
4
s .
The Shannon-Fano coding technique is used as shown

Symbol Probability I II III IV V Code-word
1
s 0.5 0 0
2
s 0.125 1 0 0 100
3
s 0.125 1 0 1 101
4
s 0.0625 1 1 0 0 1100
5
s 0.0625 1 1 0 1 1101
6
s 0.0625 1 1 1 0 1110
7
s 0.03125 1 1 1 1 0 11110
8
s 0.03125 1 1 1 1 1 11111

Hence, codes of the source encoder for the symbols
1
s ,
2
s , and
4
s are as follows:
Symbol Code-word
1
s 0
2
s 100
4
s 1100

ii) The generator matrix of the linear block code shown in Figure E1 is obtained from
matrix:

0
1
1
1

1
1
1
0

1
0
1
1

1 0 0 0
0 1 0 0
0 0 1 0
0 0 0 1
(
(
(
(

= G
1
3
2
1
iii) The code words sent to the transmitter is the block code output. For this matter,
sequence of the output is 0, 100, and 1100. This gives two data words (blocks) and
two code words. For our choice let the data codes be 0100 and 1100.
dG c =

| |
0
1
1
1
1
1
1
0
1
0
1
1

1 0 0 0
0 1 0 0
0 0 1 0
0 0 0 1
0100
1
(
(
(
(
(
(
(

=

k
p
k
I
c

| || || | ... ) 0 0 ( ) 1 0 ( ) 0 1 ) 0 0 ( ) 0 0 ( ) 0 0 ( ) 1 1 ( ) 0 0 ( ) 0 0 ( ) 0 0 ( ) 0 1 ( ) 1 0 (
1
= c
| || || | ... ) 1 0 ( ) 1 0 ( ) 1 1 ) 0 0 ( ) 1 0 ( ) 0 0 ( ) 1 1 ( ) 1 0 ( ) 1 0 ( ) 0 0 ( ) 0 1 ( ) 0 0 (
| | ) 0 0 ( ) 1 0 ( ) 1 1 ( ) 1 0 (
| || || || || | ) 0 0 ( ) 1 0 ( ) 0 0 ( ) 0 0 ( ) 0 0 ( ) 0 0 ( ) 0 0 ( ) 1 0 ( ) 0 0 ( ) 0 0 (
1
= c
| | | | ) 0 0 ( ) 1 0 ( ) 0 0 ( ) 1 0 (
| || || || || || | | | ) 1 0 ( ) 1 0 ( ) 1 0 ( ) 1 1 ( ) 1 1 ( ) 1 0 ( ) 1 1 (
1
= c
| || || || || || | | | 1 1 1 0 0 1 0 ) 1 ( ) 1 ( ) 1 ( ) 0 ( ) 0 ( ) 1 ( ) 0 (
1
= = c
| |
0
1
1
1
1
1
1
0
1
0
1
1

1 0 0 0
0 1 0 0
0 0 1 0
0 0 0 1
1100
1
(
(
(
(
(
(
(

=

k
p
k
I
c

| || || | ... ) 0 0 ( ) 1 0 ( ) 0 1 ) 0 1 ( ) 0 0 ( ) 0 0 ( ) 1 1 ( ) 0 1 ( ) 0 0 ( ) 0 0 ( ) 0 1 ( ) 1 1 (
2
= c
| || || | ... ) 1 0 ( ) 1 0 ( ) 1 1 ) 0 1 ( ) 1 0 ( ) 0 0 ( ) 1 1 ( ) 1 1 ( ) 1 0 ( ) 0 0 ( ) 0 1 ( ) 0 1 (
| | ) 0 0 ( ) 1 0 ( ) 1 1 ( ) 1 1 (
| || || || || | ) 0 0 ( ) 1 1 ( ) 0 0 ( ) 0 0 ( ) 0 0 ( ) 0 0 ( ) 0 0 ( ) 1 0 ( ) 0 0 ( ) 0 1 (
2
= c
| | | | ) 0 0 ( ) 1 1 ( ) 0 0 ( ) 1 0 (
| || || || || || | | | ) 0 0 ( ) 0 1 ( ) 0 0 ( ) 0 0 ( ) 0 0 ( ) 0 1 ( ) 0 1 (
2
= c
| || || || || || | | | 0 1 0 0 0 1 1 ) 0 ( ) 1 ( ) 0 ( ) 0 ( ) 0 ( ) 1 ( ) 1 (
2
= = c
Hence code word sent is 0 1 0 0 0 1 1 1 1 1 0 0 1 0
2 1
= c c
2
1
2