Scribd
Upload
277 views

Channel Coding Exam

This summarizes a coursework document for an electronics communications and control course. The coursework involves completing exercises on filters, source coding, channel coding, and error detection/correction using a Hamming code. It provides context that the coursework is worth 5% of the course grade and should take up to 5 hours to complete. It also provides tips for achieving a high mark such as showing workings, properly labeling figures, and using MATLAB.

Uploaded by

Muhammad Tariq Sadiq
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
277 views

Channel Coding Exam

This summarizes a coursework document for an electronics communications and control course. The coursework involves completing exercises on filters, source coding, channel coding, and error detection/correction using a Hamming code. It provides context that the coursework is worth 5% of the course grade and should take up to 5 hours to complete. It also provides tips for achieving a high mark such as showing workings, properly labeling figures, and using MATLAB.

Uploaded by

Muhammad Tariq Sadiq
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

ELEC1011 Communications and Control

Coursework 2: Filters, Source Coding and


Channel Coding

Introduction
This coursework contributes 5% of your mark for ELEC1011 Communications
and Control. It is therefore worth half a credit and should take you up to 5
hours to complete it. Please do not spend any more time than this since Im
sure you have better things to be doing!
Besides discussing ideas with your classmates, you are required to work entirely on your own to produce a write-up, which only needs to include the figures,
calculations and comments that are directly requested in the exercises below.
Your write-up can contain a combination of hand-written work, computer printouts and pages from this document. When you are finished, you need to print
out a receipt from C-BASS
https://handin.ecs.soton.ac.uk/handin/0910/ELEC1011/2/
You then need to staple your receipt together with your write-up and submit it
at the ECS reception before 4pm on 05/05/2010.
Here are some tips that will help you get a high mark in this coursework:
Include your workings for each calculation in your write-up.
Each figure in your write-up should have well labelled and accurately
annotated axes, as well as a relevant title and/or legend that identifies
which signals are shown.
If you draw your figures by hand, make sure you use a ruler.
You may like to use Matlab to help you complete the exercises and to
produce the figures.
If you notice any mistakes in this document or have any queries about it,
please email me at [email protected]
Have fun, Rob Maunder.

Filters

Figure 1 provides a schematic for an RLC circuit.


a) Show that the transfer function of the RLC circuit shown in Figure 1 is given
by H(j) = 1/(1 + jX), where X = (1012 2 1)/104 .

C = 1 nF
L = 1 mH

vi (t)

R = 100 k

vo (t)

Figure 1: RLC circuit.


b) Show that the corresponding amplitude response is given by |H(j)| =
1/ 1 + X 2 .
c) Show that the corresponding phase response is given by H(j) = tan1 (X).
d) Determine the amplitude and phase response at the angular frequencies
[102 , 103 , 104 , 105 , 106 , 107 , 108 , 109 , 1010 ].
e) Using these results, sketch a Bode plot for the RLC circuit shown in Figure 1.
f ) Determine an expression for the output signal vo (t) in the case where the
input signal is given by vi (t) = A cos(2f t+), where A = 3 V, f = 2 kHz
and = 45 .
g) State the type of filter that is provided by the RLC circuit of Figure 1.
h) Derive an expression for the filters 3 dB bandwidth in terms of R, L and
C.
i) Use your expression or Bode plot to state the filters 3 dB bandwidth.

Huffman Coding

Table 1 provides the probabilities of occurrence for the letters of the alphabet,
when used in the English language. A Huffman codebook has been designed
based on these probabilities of occurrence and the resultant codewords are also
shown in Table 1.
a) Calculate the entropy H of the letters of the alphabet, when used in the
English language.
b) Calculate the average codeword length L for the Huffman codebook provided
in Table 1.
c) Calculate the Huffman coding efficiency R.
d) Determine the bit sequence that results from the Huffman coding of the
letter sequence HUFFMAN.

Letter i
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z

Probability of
occurrence pi
0.0856
0.0139
0.0279
0.0378
0.1304
0.0289
0.0199
0.0528
0.0627
0.0013
0.0042
0.0339
0.0249
0.0707
0.0797
0.0199
0.0012
0.0677
0.0607
0.1045
0.0249
0.0092
0.0149
0.0017
0.0199
0.0008

Huffman
codeword ci
1111
010110
01010
11010
100
10100
110111
0100
0111
1101101110
11011010
10101
00010
1100
1110
00000
1101101101
1011
0110
001
00011
1101100
010111
1101101111
00001
1101101100

Table 1: The letters of the alphabet, their probabilities of occurrence when used
in the English language and the allocated Huffman codewords.

Figure 2: Binary tree for the Huffman codebook of Table 1.

e) Complete the binary tree shown in Figure 2 so that it describes the Huffman
codebook of Table 1.
f ) Decode the bit sequence 0110111101111100001011010100001010111. You
may find your binary tree useful for this.

Arithmetic Coding

A particular source generates the symbols [A, C, G, T] with the probabilities [0.4,
0.3, 0.2, 0.1], respectively. An arithmetic coding scheme is used to encode and
decode these symbols. Figure 3 provides a diagram that may be used to assist
the encoding and decoding of sequences comprising seven symbols.
a) Draw diagonal lines between the horizontal bars of Figure 3 to show the
range that is expanded during the encoding of each symbol in the sequence
GATTACA. Using at least six decimal places1 , label each of the vertical lines
in Figure 3 with the values that separate the adjacent ranges. State the
final range that results from the encoding of the symbol sequence GATTACA.
b) Draw a binary tree to determine the shortest bit sequence that represents a
decimal value in the final range that you identified for the above symbol
sequence.
c) Calculate to at least six decimal places, the decimal value that is represented
by the arithmetic encoded bit sequence 11101101111111.
d) Using a copy of Figure 3, determine the seven symbols that are represented
by the above bit sequence.
e) Explain why arithmetic coding can potentially achieve a higher coding efficiency than Huffman coding.

Hamming Coding

The generator matrix G and


Hamming code are given by

1 1 0 1
1 0 1 1

1 0 0 0

G=
0 1 1 1
0 1 0 0

0 0 1 0
0 0 0 1

the parity check matrix H of the k/n = 4/7

0
H= 0
1

0
1
0

0
1
1

1
0
0

1
0
1

1
1
0

1
1
1

The n = 7-bit encoded sequence y = [ y1 y2 y3 y4 y5 y6 y7 ]T is given


by y = Gx, where x = [ x1 x2 x3 x4 ]T is the k = 4-bit source sequence.
1 You can get Matlab to show more than four decimal places by using the format long
command.

Figure 3: Diagram that may be used to assist the arithmetic encoding and
decoding of sequences comprising seven symbols.

i
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

[0
[0
[0
[0
[0
[0
[0
[0
[1
[1
[1
[1
[1
[1
[1
[1

xi
0 0
0 0
0 1
0 1
1 0
1 0
1 1
1 1
0 0
0 0
0 1
0 1
1 0
1 0
1 1
1 1

yi
0 ]T [ 0 0 0 0 0 0 0 ]T
1 ]T [
]T
0 ]T [
]T
1 ]T [
]T
0 ]T [
]T
1 ]T [
]T
0 ]T [
]T
1 ]T [
]T
0 ]T [
]T
1 ]T [
]T
0 ]T [
]T
1 ]T [
]T
0 ]T [
]T
1 ]T [
]T
0 ]T [
]T
1 ]T [
]T

Table 2: Hamming code mappings between the various permutations of the


k = 4-bit source sequence x and the n = 7-bit encoded sequence y.

2
4

3
3
3

4
3
3
4

7
4
4
3
3

8
4
4
3
3
3
3
4

d(yi, yj )

6
3
3
4
4
4

9 10 11 12 13 14 15 16
3 3 4 4 4 4 3 7 1
3 3 4 4 4 4
3 2
4 3 3 3 7 4 4 3
4 4 3
7 3 4 4 4
4 4 3 7 3 3 4 4 5
4 4 7 3 3 3 4 4 6
3 7 4 4 4
3 3 7
3 4 4 4 4 3 3 8
4 3
3 3 4 4 9
3 3 3 3 4 4 10
4 4 4
3 11
4 4 3 3 12
4 3 3 13
3 3 14
15 i

Table 3: Hamming distances between pairs of encoded sequences.

5
3
3

a) Using the generator matrix G, express each of y1 , y2 , y3 , y4 , y5 , y6 and y7


as modulo-2 sums of x1 , x2 , x3 and x4 .
b) Using your expressions, complete the table of mappings provided in Table 2.
c) In Table 3, fill in the 10 missing Hamming distances d(yi , yj ) between the
encoded sequences yi and yj from Table 2.
d) Using Table 3, state the minimum Hamming distance dmin = mini6=j [d(yi , yj )]
between any pair of different encoded sequences in Table 2.
=
e) In the case where y = [ 1 0 1 1 0 1 0 ]T is transmitted but y
[ 1 0 0 1 0 1 0 ]T is received, determine the permutation of yi
. State
from Table 2 that has the minimum Hamming distance from y
whether the transmission error can be corrected and/or detected.
=
f ) In the case where y = [ 1 0 1 0 1 0 1 ]T is transmitted but y
[ 0 0 0 0 1 0 1 ]T is received, determine the permutation of yi
. State
from Table 2 that has the minimum Hamming distance from y
whether the transmission errors can be corrected and/or detected.
=
g) In the case where y = [ 0 1 0 1 0 1 0 ]T is transmitted but y
[ 1 1 0 0 1 1 0 ]T is received, determine the permutation of yi
. State
from Table 2 that has the minimum Hamming distance from y
whether the transmission errors can be corrected and/or detected.
h) Explain how the Hamming codes ability to correct and/or detect these
transmission errors can be predicted by considering the value of dmin .
is received, the n k = 3-bit syndrome
When the n = 7-bit encoded sequence y
s = [ s1 s2 s3 ]T is given by s = H
y.
= [ 1 0 1 0 1
i) In the case where the sequence y
one bit error is received, determine the syndrome s.

0 ]T containing

= [ 1
j) Explain how the erroneous bit in y
identified using the syndrome s.

0 ]T can be

= [ 1 0 1 0 1 1 0 ]T using the synk) Correct the erroneous bit in y


drome s and state the corresponding source sequence x.

You might also like