Skip navigation
Please use this identifier to cite or link to this item: http://repository.iitr.ac.in/handle/123456789/16655
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBhardwaj V.-
dc.contributor.authorPathak, Nagendra Prasad-
dc.contributor.authorKumar, Arun-
dc.date.accessioned2020-12-02T14:17:16Z-
dc.date.available2020-12-02T14:17:16Z-
dc.date.issued2009-
dc.identifier.citationProceedings of 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009, (2009), 200- 203. Kunming, Yunnan-
dc.identifier.isbn9.78E+12-
dc.identifier.urihttps://doi.org/10.1109/CMC.2009.316-
dc.identifier.urihttp://repository.iitr.ac.in/handle/123456789/16655-
dc.description.abstractLow 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.-
dc.language.isoen_US-
dc.relation.ispartofProceedings of 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009-
dc.subjectBit error rate performance-
dc.subjectChoice of parameters-
dc.subjectEncoding schemes-
dc.subjectError performance-
dc.subjectFast decoding algorithms-
dc.subjectHigh snr-
dc.subjectInterleaver-
dc.subjectLdpc codes-
dc.subjectLinear complexity-
dc.subjectLinear encoding-
dc.subjectLow complexity-
dc.subjectLow density parity checks-
dc.subjectLow signal-to-noise ratios-
dc.subjectLow-density parity-check codes-
dc.subjectSimulation results-
dc.subjectSimulation time-
dc.subjectTanner graphs-
dc.subjectAcoustic intensity-
dc.subjectBit error rate-
dc.subjectBlock codes-
dc.subjectDecoding-
dc.subjectGraph theory-
dc.subjectMobile computing-
dc.subjectSignal to noise ratio-
dc.subjectTrees (mathematics)-
dc.subjectEncoding (symbols)-
dc.titleStructured LDPC codes with Linear complexity encoding-
dc.typeConference Paper-
dc.scopusid26433117600-
dc.scopusid7005642176-
dc.scopusid57202315437-
dc.affiliationBhardwaj, V., Department of Electronics and Computer Engineering, Indian Institute of Technology, Roorkee- 247667, India-
dc.affiliationPathak, N.P., Department of Electronics and Computer Engineering, Indian Institute of Technology, Roorkee- 247667, India-
dc.affiliationKumar, A., Department of Electronics and Computer Engineering, Indian Institute of Technology, Roorkee- 247667, India-
dc.description.correspondingauthorBhardwaj, V.; Department of Electronics and Computer Engineering, Indian Institute of Technology, Roorkee- 247667, India; email: vvinaybhardwaj@gmail.com-
dc.identifier.conferencedetails2009 WRI International Conference on Communications and Mobile Computing, CMC 2009, Kunming, Yunnan, 6-8 January 2009-
Appears in Collections:Conference Publications [ECE]

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


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