On the Construction and Performance of LDPC Codes

dc.contributor.author Sindhu Tejaswini, B. N.
dc.contributor.author Lal, Rajendra Prasad
dc.contributor.author Venkaiah, V. Ch
dc.date.accessioned 2022-03-27T06:01:57Z
dc.date.available 2022-03-27T06:01:57Z
dc.date.issued 2017-01-01
dc.description.abstract Low-Density-Parity-Check (LDPC) codes are excellent error correcting codes performing very close to the Shannon’s limit, enabling efficient and reliable communication. Ever since their importance was known, a lot of research has gone into the construction/designing of efficient LDPC codes. Many different construction methods have been proposed so far. This paper explores some of these construction methods and includes their performance results on the Additive White Gaussian Noise (AWGN) channel. In particular, LDPC code construction using cage graphs and permutation matrices are investigated. Irregular LDPC codes have been constructed from regular LDPC codes using an expansion method, followed by their code rate comparison.
dc.identifier.citation Lecture Notes in Networks and Systems. v.8
dc.identifier.issn 23673370
dc.identifier.uri 10.1007/978-981-10-3818-1_39
dc.identifier.uri http://link.springer.com/10.1007/978-981-10-3818-1_39
dc.identifier.uri https://dspace.uohyd.ac.in/handle/1/9155
dc.subject Cage graph
dc.subject Channel coding
dc.subject Code rate
dc.subject Gray code
dc.subject LDPC code
dc.subject Parity-check matrix
dc.subject Quasi-cyclic LDPC
dc.subject SNR-BER plots
dc.title On the Construction and Performance of LDPC Codes
dc.type Book Series. Book Chapter
dspace.entity.type
Files
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description: