DIGITAL COMMUNICATION THEORY

SOLUTION OF ASSIGNMENT # 2
Problem 1.

Problem 2.

Problem 3.

Problem 4.

(a) Coding
Binary digit Sequence {xk}
Bipolar Amplitudes {xk}
Code {yk = xk + xk1}

1 0 1 1 1 0 1 0 0 0 1
+1 1 +1 +1 +1 1 +1 1 1 1 +1
0 0 +2 +2 0 0 0 2 2 0

(b) Decoding decision rule:

If y k = 2 , decide that xk = +1 (or binary one)

If y k = 2 , decide that xk = 1 (or binary zero)

If y k = 0 , decide opposite of the previous decision
0 0
Coded Sequence { y k }

+2 +2 0

2 2 0

Decoded bipolar sequence {xk }

+1 +1 1 +1 1 1 1 +1

Decoded binary sequence {xk }

NOTE: It may be observed that first two symbols cannot be directly decoded. The problem can be resolved by using
different starting symbol (as in part (d)) . However, this type of problem does not occur for Precoded Duobinary (as
in part (c)).

(c) Precoded Duobinary

Binary digit Sequence {xk}
Precoded Sequence { w=
xk wk 1 }
k

1
1

0
1

1
0

1
1

1
0

0
0

1
1

0
1

0
1

0
1

1
0

Bipolar Amplitudes {xk}

+1 +1 1 +1 1 1 +1 +1 +1 +1 1
+2 0 0 0 2 0 +2 +2 +2 0
Code {yk = xk + xk1}
Decoding Rule:
If y k = 2 , decide that xk = 1 (or binary zero)
If y k = 0 , decide that xk = +1 (or binary one)
Coded Sequence { y k }

+2 0

Decoded bipolar sequence {xk }

1 +1 +1 +1 1 +1 1 1 1 +1

Decoded binary sequence {xk }

(d) Duobinary codes

Binary digit Sequence {xk}
Bipolar Amplitudes {xk}
Code {yk = xk + xk1}
Decoding
Coded Sequence { y k }

2 0

+2 +2 +2 0

0 0 1 1 1 0 1 0 0 0 1
1 1 +1 +1 +1 1 +1 1 1 1 +1
2 0 +2 +2 0 0 0 2 2 0
2 0

+2 +2 0

2 2 0

1 +1 +1 +1 1 +1 1 1 1 +1

Decoded bipolar sequence {xk }

Decoded binary sequence {xk }
Precoded Duobinary
Binary digit Sequence {xk}
Precoded Sequence { w=
xk wk 1 }
k
Bipolar Amplitudes {xk}
Code {yk = xk + xk1}
Decoding
Coded Sequence { y k }

0
0
0

1
0
0

1
1
1

1
1
0

0
1
1

1
0
1

0
1
0

0
0
0

0
0
0

1
0
0

1
1

1 1 +1 1 +1 +1 1 1 1 1 +1
2 0 0 0 +2 0 2 2 2 0
2 0

+2 0

2 2 2 0

Decoded bipolar sequence {xk }

1 +1 +1 +1 1 +1 1 1 1 +1

Decoded binary sequence {xk }

Problem 5.