vioft2nntf2t|tblJournal|Abstract_paper|0xf4ff13e0070000007d4b010001000300 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.
H. Prashantha Kumar1, U. Sripati2 and K. Rajesh Shetty3
Department of Electronics and Communication Engineering, National Institute of Technology Karnataka, India
LDPC Codes, Full Rank Codes, Conjugacy Class, Transform Domain
Components Parity Check Tree, Soft Iterative Decoding
| January | February | March | April | May | June | July | August | September | October | November | December |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| Published By :
ICTACT
Published In :
ICTACT Journal on Communication Technology
( Volume: 2 , Issue: 3 , Pages: 400-405 )
Date of Publication :
September 2011
Page Views :
117
Full Text Views :
|