Analysis of Efficient Encoder for Low Density Parity Check Codes

Abstract

Shannon proposed his theorem in 1948 called Shannon’s Limit which seeks to impose an upper limit on the maximum rate achievable on any communication channel. The various codes invented so far try to achieve this limit but do not do so. Here, we try to study, design and implement codes called the Low Density Parity Check Codes, which offer the promise of achieving a rate close to the Shannon’s Limit. Many Coding algorithms exist for implementing the LDPC Codes. We attempt a study of all these coding algorithms and hence select a suitable one and implement the same. Then an analysis of the encoder so implemented is attempted and suitable improvements are suggested. All the targets so selected were achieved. A critical parameter affecting the encoding process was analysed, and a suitable replacement algorithm for the affected process was designed and implemented.