KLS GOGTE INSTITUTE OF TECHNOLOGY, BELAGAVI

Department of Electronics & Communication Engineering

Error Control Coding (14ESC41)

Miniprojects
1. Write MATLAB code to check whether the given polynomial is irreducible and primitive.
[Akshata]
2. How many roots does f (X ) = X 4 + a 3X 3 + X 2 + a X + a 3 over GF(23) have [where a is a
primitive element of GF(23)]? Find the roots (see Table). Write the MATLAB function to
verify your result. [Shruti, Jyoti]
3. Divide f (X ) = X 4 + a 3X 3 + X 2 + aX + a 3 over GF(23) by g (X ) = X 2 + aX + a 5 over the
same field (a is a primitive element of the field). Find the quotient and the remainder (use
Table). Write the MATLAB function to verify your result. [Sushma, Umapathi]

4.
Linear Binary Codes:
The goal of this part of the computer exercise is to gain familiarity with simulating the
performance of a linear binary block code. The simulation results should be consistent with the
theoretical expressions for probability of decoding error or probability of undetected error.
Consider C(8,4) example.
Simulate the performance of this (8,4) binary code used on a binary symmetric channel of bit
error rate . When using a random number generator, at the beginning of your simulation specify
the initial seed to equal the last four digits of your student ID number. Specifically:
a. Simulate the code performance when used for error detection only. Use a binary source
of equally likely zeros and ones of length N = 10,000, and BSC bit error probabilities of
= 0.1 and 0.05. Compare the simulation probability of undetected error to the
theoretical value. Include a detailed derivation of the theoretical probability of
undetected error.
b. Simulate the code performance when used for error correction only. Implement the
maximum likelihood decoder and compare the simulation results to the theoretical
expressions for BSC bit error probabilities of = 0.1, 0.03, 0.01, and 0.003. Use N =
200,000 source bits (50,000 blocks of 4 bits/block). Include a detailed derivation of the
theoretical probability of decoder block error, as well as bit error (including any
assumptions used to arrive at the bit error probability expression).
[ Nafeesa, Sagar, Seema]
5.
Pulse Amplitude Modulation :
The goal of this part of the computer exercise is to gain familiarity with random number
generators useful in simulating communication system performance. For each generation of
random variables, use an initial seed equal to the last four digits of your student ID (except
where indicated differently). For example, if your student ID ends in the digits 1234, then prior
to each generation of random numbers using Matlab, use the command rand(state,1234) if
Page 1 of 2

generating a uniform random variable, or randn(state,1234) if using the Gaussian random

number generator.
1. Use a Gaussian random number generator to generate N realizations of a Gaussian random
variable with mean 2.0 and variance 3.0. Plot the histogram for N = 100, and N = 10,000
in the same figure. Normalize the histogram so that it approximates the probability
density function. Specify the number of bins you use for the histogram, and state why
you selected that number of bins.

[Dhanashri, Anuradha, Samuddeta, Nirmala, Dakshata]

6. Implement and demonstrate the Meggitt decoder in MATLAB. [Shivkumar]
7. Write a MATLAB simulation code to find the relationship between the BER and decoding
depth. (Convolutional Codes) [Manjushree, Supriya]
Display Date: 15.02.2016

Final Demo: 20.03.2016

Final Report Submission: 28.03.2016

Faculty Incharge

HOD
Page 2 of 2