Skip navigation
Please use this identifier to cite or link to this item: http://repository.iitr.ac.in/handle/123456789/16655
Title: Structured LDPC codes with Linear complexity encoding
Authors: Bhardwaj V.
Pathak N.P.
Kumar A.
Published in: Proceedings of 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009
Abstract: Low Density Parity Check (LDPC) codes have stimulated a lot of interest in recent years due to their capacity approaching performance and availability of fast decoding algorithms. The existing encoding scheme for LDPC code usually incurs too high complexity and should be changed to encoding scheme with low complexity An elementary Turbo Structured Tanner graph construction and encoding scheme for a family of regular LDPC codes attaining desired high girth is studied in this paper. The construction provides flexibility in choice of parameters like column weight (j ≥ 2), row weight k and arbitrary girth g. Turbo Structured low density parity check (TS-LDPC) codes are regular LDPC codes with their Tanner graph consists of two trees connected by an interleaver. Linear complexity is attained with few alterations and restrictions of in Tanner graph of Turbo Structured LDPC codes. Simulation results demonstrates that not only the bit error rate (BER) performance of TSLDPC codes at low signal to noise ratio (SNR) is comparable with error performance of corresponding Random LDPC codes, with better error performance at high SNR but linear encoding considerably reduces simulation time.. © 2009 IEEE.
Citation: Proceedings of 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009, (2009), 200- 203. Kunming, Yunnan
URI: https://doi.org/10.1109/CMC.2009.316
http://repository.iitr.ac.in/handle/123456789/16655
Issue Date: 2009
Keywords: Bit error rate performance
Choice of parameters
Encoding schemes
Error performance
Fast decoding algorithms
High snr
Interleaver
Ldpc codes
Linear complexity
Linear encoding
Low complexity
Low density parity checks
Low signal-to-noise ratios
Low-density parity-check codes
Simulation results
Simulation time
Tanner graphs
Acoustic intensity
Bit error rate
Block codes
Decoding
Graph theory
Mobile computing
Signal to noise ratio
Trees (mathematics)
Encoding (symbols)
ISBN: 9.78E+12
Author Scopus IDs: 26433117600
7005642176
57202315437
Author Affiliations: Bhardwaj, V., Department of Electronics and Computer Engineering, Indian Institute of Technology, Roorkee- 247667, India
Pathak, N.P., Department of Electronics and Computer Engineering, Indian Institute of Technology, Roorkee- 247667, India
Kumar, A., Department of Electronics and Computer Engineering, Indian Institute of Technology, Roorkee- 247667, India
Corresponding Author: Bhardwaj, V.; Department of Electronics and Computer Engineering, Indian Institute of Technology, Roorkee- 247667, India; email: vvinaybhardwaj@gmail.com
Appears in Collections:Conference Publications [ECE]

Files in This Item:
There are no files associated with this item.
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.