The design of structured regular LDPC codes with large girth

To cut down the hardware implementation cost this paper presents an efficient method to construct large girth Quasi-Cyclic low density parity check (QC-LDPC) codes. The row groups are paired two times the row weight, which has the complexity as compared to the connection of individual columns and rows. The complexity of directing within groups estimates on the transposition employed to connect rows and columns between groups. The newly obtained codes are incorporated with diversity techniques and are employed as a forward error correction codes to cater for some anti-jamming (AJ) competences in the presence of partial band noise jamming (PBNJ). The robustness of two girth-twelve QC-LDPC codes is evidenced by comparing it with randomly constructed LDPC codes and QC-LDPC codes proposed in [14].

show abstract

Row Division Method to Generate QC-LDPC Codes

Yahya

Sidek

Salleh

et al. 2009

2009 Fifth Advanced International Conference on Telecommunications

View full text Add to dashboard Cite

show abstract

Encoder implementation with fpga for non-binary LDPC codes

Chen

Liang

Guo

et al. 2012

2012 18th Asia-Pacific Conference on Communications (APCC)

View full text Add to dashboard Cite

Efficient encoding of cycle codes on graphs with large girths

Chen

Yin

2008

2008 International Conference on Communications, Circuits and Systems

View full text Add to dashboard Cite

Low-density parity-check (LDPC) codes of column weight two, also called cycle codes, can be constructed based on connected simple graphs. In this paper, efficiently encodable cycle codes and modified Repeat-Accumulate codes based on Hamiltonian graphs with large girths are devised. Specifically, the Hamiltonian property of the graphs is exploited to obtain efficient encoder structures and a concise description for the Hamiltonian graph named LCF (Lederberg-Coxeter-Frucht) notation is used to reduce the complexity of the encoders, especially the storage requirement. Then, using the Hamiltonian property and the LCF notation, structured cycle codes with large girths and low encoding complexity are devised. Simulation results also reveal that the proposed structured codes exhibit better performance compared with other structured cycle codes.

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

The design of structured regular LDPC codes with large girth

Cited by 21 publications

References 11 publications

Row Division Method to Generate QC-LDPC Codes

Row Division Method to Generate QC-LDPC Codes

Encoder implementation with fpga for non-binary LDPC codes

Efficient encoding of cycle codes on graphs with large girths

Contact Info

Product

Resources

About