CONSTRUCTION OF REGULAR LDPC LIKE CODES BASED ON FULL RANK CODES AND THEIR ITERATIVE DECODING USING A PARITY CHECK TREE
Low density parity check (LDPC) codes are capacity-approaching codes, which means that practical constructions exist that allow the noise threshold to be set very close to the theoretical Shannon limit for a memory less channel. LDPC codes are finding increasing use in applications like LTE-Networks...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
ICT Academy of Tamil Nadu
2011-09-01
|
Series: | ICTACT Journal on Communication Technology |
Subjects: | |
Online Access: | http://ictactjournals.in/paper/5_Paper_400_405.pdf |
_version_ | 1818664017899552768 |
---|---|
author | H. Prashantha Kumar U. Sripati K. Rajesh Shetty |
author_facet | H. Prashantha Kumar U. Sripati K. Rajesh Shetty |
author_sort | H. Prashantha Kumar |
collection | DOAJ |
description | Low density parity check (LDPC) codes are capacity-approaching codes, which means that practical constructions exist that allow the noise threshold to be set very close to the theoretical Shannon limit for a memory less channel. LDPC codes are finding increasing use in applications like LTE-Networks, digital television, high density data storage systems, deep space communication systems etc. Several algebraic and combinatorial methods are available for constructing LDPC codes. In this paper we discuss a novel low complexity algebraic method for constructing regular LDPC like codes derived from full rank codes. We demonstrate that by employing these codes over AWGN channels, coding gains in excess of 2dB over un-coded systems can be realized when soft iterative decoding using a parity check tree is employed. |
first_indexed | 2024-12-17T05:26:04Z |
format | Article |
id | doaj.art-0826989fc56b4eb8888da30c713d0012 |
institution | Directory Open Access Journal |
issn | 0976-0091 2229-6948 |
language | English |
last_indexed | 2024-12-17T05:26:04Z |
publishDate | 2011-09-01 |
publisher | ICT Academy of Tamil Nadu |
record_format | Article |
series | ICTACT Journal on Communication Technology |
spelling | doaj.art-0826989fc56b4eb8888da30c713d00122022-12-21T22:01:52ZengICT Academy of Tamil NaduICTACT Journal on Communication Technology0976-00912229-69482011-09-0123400405CONSTRUCTION OF REGULAR LDPC LIKE CODES BASED ON FULL RANK CODES AND THEIR ITERATIVE DECODING USING A PARITY CHECK TREEH. Prashantha Kumar0U. Sripati1K. Rajesh Shetty2Department of Electronics and Communication Engineering, National Institute of Technology Karnataka, IndiaDepartment of Electronics and Communication Engineering, National Institute of Technology Karnataka, IndiaDepartment of Electronics and Communication Engineering, National Institute of Technology Karnataka, IndiaLow density parity check (LDPC) codes are capacity-approaching codes, which means that practical constructions exist that allow the noise threshold to be set very close to the theoretical Shannon limit for a memory less channel. LDPC codes are finding increasing use in applications like LTE-Networks, digital television, high density data storage systems, deep space communication systems etc. Several algebraic and combinatorial methods are available for constructing LDPC codes. In this paper we discuss a novel low complexity algebraic method for constructing regular LDPC like codes derived from full rank codes. We demonstrate that by employing these codes over AWGN channels, coding gains in excess of 2dB over un-coded systems can be realized when soft iterative decoding using a parity check tree is employed.http://ictactjournals.in/paper/5_Paper_400_405.pdfLDPC CodesFull Rank CodesConjugacy ClassTransform Domain Components Parity Check TreeSoft Iterative Decoding |
spellingShingle | H. Prashantha Kumar U. Sripati K. Rajesh Shetty CONSTRUCTION OF REGULAR LDPC LIKE CODES BASED ON FULL RANK CODES AND THEIR ITERATIVE DECODING USING A PARITY CHECK TREE ICTACT Journal on Communication Technology LDPC Codes Full Rank Codes Conjugacy Class Transform Domain Components Parity Check Tree Soft Iterative Decoding |
title | CONSTRUCTION OF REGULAR LDPC LIKE CODES BASED ON FULL RANK CODES AND THEIR ITERATIVE DECODING USING A PARITY CHECK TREE |
title_full | CONSTRUCTION OF REGULAR LDPC LIKE CODES BASED ON FULL RANK CODES AND THEIR ITERATIVE DECODING USING A PARITY CHECK TREE |
title_fullStr | CONSTRUCTION OF REGULAR LDPC LIKE CODES BASED ON FULL RANK CODES AND THEIR ITERATIVE DECODING USING A PARITY CHECK TREE |
title_full_unstemmed | CONSTRUCTION OF REGULAR LDPC LIKE CODES BASED ON FULL RANK CODES AND THEIR ITERATIVE DECODING USING A PARITY CHECK TREE |
title_short | CONSTRUCTION OF REGULAR LDPC LIKE CODES BASED ON FULL RANK CODES AND THEIR ITERATIVE DECODING USING A PARITY CHECK TREE |
title_sort | construction of regular ldpc like codes based on full rank codes and their iterative decoding using a parity check tree |
topic | LDPC Codes Full Rank Codes Conjugacy Class Transform Domain Components Parity Check Tree Soft Iterative Decoding |
url | http://ictactjournals.in/paper/5_Paper_400_405.pdf |
work_keys_str_mv | AT hprashanthakumar constructionofregularldpclikecodesbasedonfullrankcodesandtheiriterativedecodingusingaparitychecktree AT usripati constructionofregularldpclikecodesbasedonfullrankcodesandtheiriterativedecodingusingaparitychecktree AT krajeshshetty constructionofregularldpclikecodesbasedonfullrankcodesandtheiriterativedecodingusingaparitychecktree |