PROJECT TITLE :
Construction of Binary LDPC Convolutional Codes Based on Finite Fields
Employing a finite field approach, a completely unique algebraic construction of low-density parity-check (LDPC) convolutional codes with fast encoding property is proposed. According to the matrices of quasi-cyclic (QC) codes made based on the multiplicative groups of finite fields and therefore the algebraic property that a binary circulant matrix is isomorphic to a finite ring, we tend to first generate a polynomial-kind parity-check matrix of an LDPC convolutional code under a given rate over a given finite field. Then some connected modifications are created upon the initial polynomial-type matrix to get the new one with fast encoding property. Simulation results show that the proposed LDPC convolutional codes have smart performance with the iterative belief propagation decoding algorithm.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here