NDLI: A fast searching method for the construction of QC-LDPC codes with large girth

Content Provider	IEEE Xplore Digital Library
Author	Lau, F.C.M. Wai Man Tam
Copyright Year	2012
Description	Author affiliation: Department of Electronic and Information Engineering, Hong Kong Polytechnic University, Hong Kong (Lau, F.C.M.; Wai Man Tam)
Abstract	In this paper, we propose an effective and efficient searching method for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes with a desired girth g. We begin with an arbitrary QC-LDPC code with girth-4 and we evaluate only the number of cycles with length 4. When all the cycles with length 4 are removed by adjusting the elements of the QC-LDPC code, we form a QC-LDPC code with girth-6. Subsequently, we consider only the numbers of cycles with length 4 and length 6. In general, knowing that the current QC-LDPC code has a girth of g', we only consider the numbers of cycles with length up to g' even though g' may be smaller than the desired girth g. By using an adaptive cost function, which is defined as the number of cycles of length g', in the optimization/searching process, we are able to reduce the computational effort tremendously compared with Wang's searching algorithm [1]. Consequently, our proposed method can generate QC-LDPC codes with the desired girth much more efficiently.
Starting Page	000125
Ending Page	000128
File Size	591811
Page Count	4
File Format	PDF
ISBN	9781467327121
ISSN	15301346
e-ISBN	9781467327138
e-ISBN	9781467327114
DOI	10.1109/ISCC.2012.6249279
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-07-01
Publisher Place	Turkey
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Parity check codes Approximation algorithms Cost function Arrays Computers Computational complexity
Content Type	Text
Resource Type	Article
Subject	Signal Processing Mathematics Computer Networks and Communications Computer Science Applications Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A New Construction Method for Large Girth Quasi-Cyclic LDPC Codes with Optimized Lower Bound using Chinese Remainder Theorem

Several Explicit Constructions for (3,L) QC-LDPC Codes with Girth at Least Eight

Construction of Non-Binary LDPC Codes with Very Large Girth

Deterministic Girth-Eight QC-LDPC Codes with Large Column Weight

Construction of girth-eight quasi-cyclic low-density parity-check codes with low encoding complexity

Analysis of balanced cycles of QC-LDPC codes

Construction of One-Coincidence Sequence Quasi-Cyclic LDPC Codes of Large Girth

A Reduced Complexity Linear QC-LDPC Encoding with Parity Vector Correction Technique

Reduced-complexity decoding implementation of QC-LDPC codes with modified shuffling

A fast searching method for the construction of QC-LDPC codes with large girth

Similar Documents

A New Construction Method for Large Girth Quasi-Cyclic LDPC Codes with Optimized Lower Bound using Chinese Remainder Theorem

Several Explicit Constructions for (3,L) QC-LDPC Codes with Girth at Least Eight

Construction of Non-Binary LDPC Codes with Very Large Girth

Deterministic Girth-Eight QC-LDPC Codes with Large Column Weight

Construction of girth-eight quasi-cyclic low-density parity-check codes with low encoding complexity

Analysis of balanced cycles of QC-LDPC codes

Construction of One-Coincidence Sequence Quasi-Cyclic LDPC Codes of Large Girth

A Reduced Complexity Linear QC-LDPC Encoding with Parity Vector Correction Technique

Reduced-complexity decoding implementation of QC-LDPC codes with modified shuffling

A fast searching method for the construction of QC-LDPC codes with large girth