A matrix is said to be sparse when the number of ones is smaller than the number of
zeros in the matrix.
An LDPC code is called a Regular LDPC code if the number of 1s in each row of
the sparse \(H\) matrix is identical (say, equal to \(w_r\)) and the number of 1s in
each
column of \(H\) is also identical (say, equal to \(w_c\))
Procedure:
Step 1: Choose the type of parity check matrix from the options provided.
Step 2: Click on "Check" to verify the selected option.
Step 3: Click on "Yes" if the given parity check matrix defines an LDPC
code, else click on "No". The "Next" button will appear only if the answer is correct.
Step 4: After clicking on the "Next" button, the next question will appear.
Enter the rate of the LDPC code by entering the numerator and denominator of the rate. Click
on "Check" to verify the rate. Click on "Previous" to go back to the previous question. You
can proceed to next task by clicking on the "Tanner Graph for LDPC Codes" tab.
Consider the given parity check matrix : \(H\) =
Parity check matrix goes here.
Check if the parity check matrix is non-sparse, a
sparse but irregular or a sparse but regular matrix and check one of
the options below.
Does the above parity check matrix define a LDPC code?
Calculate the rate of the above parity check matrix of a LDPC code. Enter the numerator and
denominator of the rate as a simplified fraction.