LDPC Encoding Based on the Primitive Polynomial

Low-Density Parity-Check (LDPC) code is a class of error-correcting codes which have limited capacity. For long code lengths, LDPC codes can even outperform Turbo codes. LDPC is regarded as one of the key technologies that realize the high-speed broadband wireless networks in the future. In this thesis, a new encoding method of LDPC is attempted to construct the parity check matrix from the point of view of primitive polynomial. That is to say, the matrix is made use of primitive polynomial and the technology of ranks decomposition. Matlab is implemented to do a number of computer-aided simulations for getting the performance of the primitive LDPC encoding.