Linear encoding of LDPC codes using approximate lower triangulation with postprocessing

Islam, Mohammad Rakibul; Kim, Dong Ha

doi:10.1109/pimrc.2009.5450159

Cited by 4 publications

(2 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A modification on this method has been proposed in [6]. In [6], the lower part of the H matrix obtained in ALT format is deleted by brute force as shown in fig.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Modified approximate lower triangular encoding of LDPC codes

Dutta

Pramanik

2015

2015 International Conference on Advances in Computer Engineering and Applications

View full text Add to dashboard Cite

LDPC codes have become the most popular error control code in various fields like telecommunication, magnetic recording etc. due to their high error correcting capability. The Approximate Lower Triangular (ALT) encoding is the most commonly used encoding technique of LDPC codes. This technique though elegant suffers from the shortcoming that when a particular sub matrix of the H matrix obtained after ALT encoding is singular, the technique fails. In this paper a new algorithm is proposed to handle this shortcoming. In this work a new algorithm is proposed to bring any rectangular sparse LDPC matrix into a rectangular part and a square upper triangular part. This algorithm is implemented to encode a general H matrix. This algorithm is further appended to the ALT format of LDPC encoding and another efficient encoding technique is proposed for LDPC code. Both the proposed techniques have a pre-processing step followed by the actual encoding step. Scatter plots of the H matrices (after preprocessing) are shown. BER performance of the new Modified ALT technique is compared with the existing Systematic Approximate Lower Triangular method. The proposed algorithm gives better BER performance.

show abstract

“…A modification on this method has been proposed in [6]. In [6], the lower part of the H matrix obtained in ALT format is deleted by brute force as shown in fig.…”

Section: Introductionmentioning

confidence: 99%

“…In [6], the lower part of the H matrix obtained in ALT format is deleted by brute force as shown in fig. 2.…”

Section: Introductionmentioning

confidence: 99%