EE 451 Test 1

EE 451

Spring 2011

Instructions: Please write neatly in the space provided. Closed book exam.
One page of notes allowed.

1. (20 points) Fill in the blank.

a. (3 points) A (16, 5) linear binary code has

codewords.

b. (3 points) A (16, 11) linear binary code has a parity check matrix with
rows and
columns.
c. (3 points) A (32, 16) linear binary code has codewords that form a
dimensional subspace of the linear space of binary 32-tuples.
d. (3 points) The dual code to a (16, 11) linear, binary code is
dimensional.
e. (4 points) A (8, 4) linear binary code is used over a binary symmetric
channel with probability of bit error . The codeword (0, 0, 0, 0, 0, 0, 0, 0)
is transmitted. The probability that the received 8-tuple has weight 2 is
.
f. (4 points) A certain (32, 16) linear, binary code has dmin = 8. The code
or less, but
can be used to correct all error patterns of weight
not all error patterns of larger weight.

2. (20 points) A discrete memoryless source, X, has 7 possible output

amplitudes, enumerated as 1, 2, , 7, with the probabilities P (1) = 4/12,
P (2) = 3/12, P (3) = 2/12, P (4) = 1/12, P (5) = 1/12, P (6) = 1/24, and
P (7) = 1/24.
a. (5 points) Compute the entropy, H(X).

b. (15 points) Design a Huffman code for X. List all codewords. Compute
the average codeword length, and compare to the entropy.

3. (20 points) A certain (6, 3) linear binary block code has a non-systematic
generator matrix

0 1 1 1 1 0

G = 0 0 0 1 1 1.
1 1 0 0 1 1
a. (3 points) Find another generator matrix for the code, this generator in
systematic form.
b. (3 points) Find the minimum distance of the code, dmin .
c. (3 points) Find the weight distribution of the code.
d. (3 points) Find a parity check matrix, H, for the code.
e. (3 points) If the code is used only to correct all t = dmin2 1 or fewer
bit error patterns, and assuming the codewords are transmitted over a binary symmetric channel with bit error probability < 0.5, determine the
probability of block decoding error.
f. The standard array has 8 rows and 8 columns, with the first row consisting
of the 8 codewords, beginning with the all-zero codeword, as shown below.
i) (3 points) Select the first column entry for rows 2-7 as the different 1-bit
error patterns, and enter these error patterns beneath the all-zero codeword
in the table. Determine the syndrome for each of the first 7 rows of the
resulting standard array, and enter it in the column labeled syndrome.
ii) (2 points) Fill in the final syndrome in the table. Using the parity check
matrix, find a corresponding weight-2 error pattern as the final entry of the
column headed with the all-zero codeword. Note that the remainder of the
standard array need not be filled in to do this.
Syndrome
Standard Array
s = rH T = (000) v1 = (000000) v2 v3 v4 v5

v6

v7

v8

4) (20 points) A PAM signaling system is diagrammed below, with symbol

sequence an , symbol rate 1/T symbols per second, transmit pulse shape g(t)
shown, and matched filter receiver impulse response h(t) = g(T t). The
P
transmitted PAM waveform is x(t) =
n= an g(t nT ).
A

g(t)

A/2

Symbol
an

PAM
Waveform
Generator
g(t)

x(t)
Channel

Matched
Filter
h(t)

y(t)

T/4 T/2 t

a) (5 points) Determine the value of A so that the PAM transmit pulse, g(t),
is unit energy.

b) (10 points) The matched filter impulse response is h(t) = g(T t). Find,
and accurately sketch, s(t) = g(t) h(t). With the proper value of A from
part a), verify that s(t) is a zero intersymbol interference (ISI) pulse, but
with delay of T sec.

c) (5 points) Accurately sketch the transmitted PAM signal, x(t), for the
symbol sequence an = (3, 1, 3, 1) for n = 0, 1, 2, 3. Beneath this graph,
accurately sketch the matched filter output, y(t).

5. (20 points) A rate-1/2 linear convolutional code has the with feedback
encoder shown below. Note that this encoder results in a systematic bit
stream, in that the input bits appear directly (as every other bit) in the
encoded bit stream.
(1)

v (n)

u(n)

Z1

Z0

(2)

(n)

a. (10 points) Fill out the truth table for the encoder below.
Input
u(n)
0
1
0
1
0
1
0
1

Present State
Next State
Output
(1)
z1 (n) z0 (n)
z1 (n + 1) z0 (n + 1) v (n) v (2) (n)
00
00
00
00
01
11
01
01
10
10
11
11

b. (10 points) Draw the trellis for the encoder. Determine the minimum
distance, dmin of the code, and label two trellis paths that differ by the
minimum distance.