Scribd
Upload
12 views

Given H Matrix

The document outlines a process for generating a generator matrix (G) from a given parity-check matrix (H) and subsequently creating codewords from information sequences. It includes steps for generating a data vector, calculating minimum distance, and correcting errors in a received codeword using syndrome decoding. The final output displays the corrected codeword and the position of the detected error.

Uploaded by

suryatechintelugu485
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
12 views

Given H Matrix

The document outlines a process for generating a generator matrix (G) from a given parity-check matrix (H) and subsequently creating codewords from information sequences. It includes steps for generating a data vector, calculating minimum distance, and correcting errors in a received codeword using syndrome decoding. The final output displays the corrected codeword and the position of the detected error.

Uploaded by

suryatechintelugu485
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

% Given H Matrix

H = [1 0 1 1 1 0 0;

1 1 0 1 0 1 0;

0 1 1 1 0 0 1]

k = 4;

n = 7;

% Generating G Matrix

% Taking the H Matrix Transpose

P = H';

% Making a copy of H Transpose Matrix

L = P;

% Taking the last 4 rows of L and storing

L((5:7), : ) = [];

% Creating a Identity matrix of size K x K

I = eye(k);

% Making a 4 x 7 Matrix

G = [I L]
% Generate U data vector, denoting all information sequences

no = 2 ^ k

% Iterate through an Unit-Spaced Vector

for i = 1 : 2^k

% Iterate through Vector with Specified Increment

% or in simple words here we are decrementing 4 till we get 1

for j = k : -1 : 1

if rem(i - 1, 2 ^ (-j + k + 1)) >= 2 ^ (-j + k)

u(i, j) = 1;

else

u(i, j) = 0;

end

% To avoid displaying each iteration/loop value

echo off;

end

end

echo on;

% Generate CodeWords

c = rem(u * G, 2)
% Find the min distance

w_min = min(sum((c(2 : 2^k, :))'))

% Given Received codeword

r = [0 0 0 1 0 0 0];

p = [G(:, n - k + 2 : n)];

%Find Syndrome

ht = transpose(H)

s = rem(r * ht, 2)

for i = 1 : 1 : size(ht)

if(ht(i,1:3)==s)

r(i) = 1-r(i);

break;

end

end

disp('The Error is in bit:')

disp(i)
disp('The Corrected Codeword is :')

disp(r)

You might also like