%Homework Assignment 2
%Jay Joshi.
%CWID - A20339855
%
clc;
clear all;
close all;
p = 3; m = 5; % chosing numbers
pol = gfprimfd(m,'max',p); % Find primitive polynomials for a Galois field
fprintf('\n
Laboratory # 2
Table of Contents
Part 1: Install VMWare Hypervisor (ESX v 6.5) on System.1
Part 2: Install Ubuntu on the VM created from Part 1.3
Part 3: Run the Program.9
System Configuration:
1. OS:
STATEMENT OF PURPOSE
Every new step in our lives provides us with an opportunity to imbibe a new experience and learn
something new. I believe that learning is a never-ending process. I have always be
Chapter 2
1. Let m be a positive number. If m is not a prime, prove that the setcfw_1,2, , 1 is not a group
under modulo- multiplication.
2. Construct a table for (23 ) based on the primitive polynomi
An Introduction to Low-Density Parity Check Codes
Daniel J. Costello, Jr.
Department of Electrical Engineering
University of Notre Dame
August 10, 2009
The author gratefully acknowledges the help of T
ECE 519
Coding for Reliable Communications Course Syllabus
Spring 2016
Instructor: Guillermo Atkin
Office:
SH 335, 312-567-6810
Office Hours: T and R: 10:30 to noon
e-mail:
[email protected]
Primitive Polynomials for the Field GF(3)
Degree 2 through Degree 11
Peter M. Maurer
Dept. of Computer Science
Baylor University
Waco, Texas 76798
Degree 2
112
122
Degree 3
1021
1121
1201
1211
Degree
function turbo_dec(varargin)
%Input in the following order: SNR (dB), number of decoder
iterations, number of
imulations required
%codeword length
K = 128;
param.K = K;
if ~nargin
SNR = 6;
iter_len =
5:.6Part a: If X | l is a factor of g[X], then an arbitrary codeword v(X] can be written as
v(X] = (X + 1]a(X] = Xa(X] + af]
where apt") is a polynomial of degree n l or less. Thus, v(X] is the sum of
Homework
1. Use matlab to find all the primitive polynomials for
A. (2% )
B. (2' )
2. Given the polynomial = 1 + - + . + % + / in the
GF(2). Check if p(X) is irreducible with reference to
Project#1
Project Report: (Submit to the Blackboard no hardcopies)
Section A. LDCP Code
The project report must include:
1) Give a brief description of the LDPC encoder and Decoder;
Requirement:
a) Re
5.3
We need to show that g(X) divides X21 + 1. Note
that
g(X) = (X + 1)(X3 + X2 + 1)(X6 + X4 + X2 + X + 1) .
As can be seen from any table enumerating the minimal polynomials of the elements of ttF (2
Solution :
Let C denote the binary cyclic code (n, k) with generator polynomial g(X). We know
that g(X) divides X n + 1. Since C contains both even and odd weight codewords,
X + 1 does not divide g(X)
Assignment 1
A. You have a base machine that has a uniprocessor. Your software
development team has developed an application for a quad-core
processor. The application is 60% parallelizable (that is,
Homework 3
Part 1:
1. A telephone-based menu system is being designed for a magazine
subscription service system. There are seven magazines available: National
Geographic, Travel and Leisure, Entrepre
5
4
3. Program with Matlab to: find out at least two primitive polynomials for each of GF (3 ) , GF (5 ) , and
GF (73 ) ; construct
GF (73 ) using the primitive polynomial
polynomial and vector repres
TAKE HOME EXAM 1
DHRUV RAJAN SAXENA
A20348805
3. Program with Matlab to find at least two primitive polynomials in (35), (54) and
(73) .
Construct (73) using the primitive polynomial () = 3 + 6 2 + 5
HOMEWORK 1
1. Consider the (15,11) cyclic Hamming code generated by () = 1 + + 4 .
a. Determine the parity polynomial () of this code.
b. Determine the generator polynomial of its dual code.
c. Find t
3. Program with Matlab to: find out at least two primitive polynomials for each of (35 ), (54 ), and (73 );
construct (73 ) using the primitive polynomial () = 3 + 6 2 + 5 + 4, obtain the power, polyn
%Assignment #2
%Primitive Polynomials For GF(3^5)
clc
clear all;
close all;
p = 7;
m = 3;
% We use the primitive polynomial X^3+6X^2+5^X+4 for GF(7^3).
prim_poly = [4 5 6 1]; % for primitive polynomia