Yangon Technological University

Department of Electronic Engineering

EcE- 51002 Modern

Communication Systems I

Lecture-2

By Daw Win Thu Zar, Associate Professor

19/1/2023
1
Codes

Source Codes
• is to take the source data and make it smaller.

Channel Codes
• is to find codes which transmit quickly,
contain many valid code words and can
correct or at least detect many errors.

2
 Channel Codes
• Channel codes are used to add redundancy to the
codes.
• Redundancy adds extra information about the data
into the signal.
• This extra information ensures that the data is
received correctly at the information sink.
• Hence, channel codes increase the BER of the signal.

3
 Error Control Coding (ECC)
• Noise or error is the main problem in the signal which disturbs the
reliability of communication system.
• ECC is the coding procedure done to control the occurrences of errors.
• These techniques help in Error Detection and Error Correction.
• Designing codes for the reliable transmission of digital information over a
noisy channel.
• Codes can either correct or merely detect errors.
– Codes that can detect errors are called error-detecting codes.
– Codes that can correct errors are called error-correcting codes

• There are many different error correcting codes depending upon the
mathematical principles applied to them.
• But, historically, these codes have been classified into Linear block codes
and Convolution codes.

4
 Block Codes
Data/message, m Codeword, C
Block encoder
k n
Information bits
2𝑘 distinct message 2𝑘 distinct codeword

• Data sequence is divided into sequence blocks k bits long

• Each k-bit block is converted into an n-bit block, where n > k.
• The encoder generates a block of n coded bits from k information bits and
we call this as the resultant block code.
• The resultant block code is called (n, k) block code and the ratio k/n is
called the code rate.
𝑘
𝑅=
𝑛

5
Linear Block Codes
• An (n,k) block code indicates that the codeword has n number of bits and k is the
number of bits for the original binary message
• A code is said to be linear if any two code words in the code can be added in
modulo-2 arithmetic to produce a third code word in the code

Code Vectors
Any n-bit code word can be visualized in an n-dimensional space as a vector whose
elements having coordinates equal the bits in the code word

For example a code word 101 can be written in a row vector notation as (1 0 1)

Matrix representation of block codes

The code vector can be written in matrix form:
A block of k message bits can be written in the form of 1-by-k matrix

6
• Modulo-2 operations
– The encoding and decoding functions involve the binary arithmetic
operation of modulo-2
– Rules for modulo-2 operations are:

Modulo-2 Modulo-2
Addition Multiplication
0⊕0 = 0 0.0 =0
1⊕1 = 0 1.1 =1
0⊕1 = 1 0.1 =0
1⊕0 = 1 1.0 =0

7
Convolution Codes

8
 The Structure of Finite Fields
(Abelian Group)
• A field is a collection of objects that can be added, subtracted, multiplied and divided.
• To define fields, we begin by defining Abelian Group.
• An Abelian group is a set with a binary operation that has the basic property of addition.

Wireless

Wired

9
Finite Fields of Galosis Fields

10
Polynomials over Finite Fields

11
Polynomial Addition

12
Characteristics of a Field and the
Ground Field

13
Examples

14
Extension Fields

15
Polynomial Multiplication

16
 Example-7.1-1 GF(4)

Multiplication Table:
?

17
Notes

18
Example-7.1-2 GF(8)

19
Example: GF(8)

20