High-Rate QC LDPC Codes of Short and Moderate Length with Good Girth Profile
(2012) 7th International Symposium on Turbo Codes & Iterative Information Processing p.150-154- Abstract
- Irregular QC LDPC codes with parity-check matrices having different degree distributions are studied. A new algorithm for finding regular and irregular QC LDPC codes with a good girth profile as well as a good sliding-window girth is presented. As examples, simulation results for QC LDPC codes with good girth profile, rate R=4/5, and lengths about 1000, 2000, and 4000, constructed from base matrices with proper degree distributions are given. Their simulated BER and FER performances for belief propagation decoding are compared with the best previously known irregular QC LDPC codes of the same rate and length. It is shown that the constructed codes outperform the best previously known codes of same rate and lengths.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/2856648
- author
- Bocharova, Irina LU ; Hug, Florian LU ; Johannesson, Rolf LU and Kudryashov, Boris LU
- organization
- publishing date
- 2012
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), 2012
- pages
- 150 - 154
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- 7th International Symposium on Turbo Codes & Iterative Information Processing
- conference location
- Gothenburg, Sweden
- conference dates
- 2012-08-27 - 2012-08-31
- external identifiers
-
- scopus:84870846866
- ISBN
- 978-1-4577-2114-4
- DOI
- 10.1109/ISTC.2012.6325217
- language
- English
- LU publication?
- yes
- id
- 533e0140-da9c-40de-9606-55698a3a11b9 (old id 2856648)
- date added to LUP
- 2016-04-04 11:06:49
- date last changed
- 2022-02-21 04:11:52
@inproceedings{533e0140-da9c-40de-9606-55698a3a11b9, abstract = {{Irregular QC LDPC codes with parity-check matrices having different degree distributions are studied. A new algorithm for finding regular and irregular QC LDPC codes with a good girth profile as well as a good sliding-window girth is presented. As examples, simulation results for QC LDPC codes with good girth profile, rate R=4/5, and lengths about 1000, 2000, and 4000, constructed from base matrices with proper degree distributions are given. Their simulated BER and FER performances for belief propagation decoding are compared with the best previously known irregular QC LDPC codes of the same rate and length. It is shown that the constructed codes outperform the best previously known codes of same rate and lengths.}}, author = {{Bocharova, Irina and Hug, Florian and Johannesson, Rolf and Kudryashov, Boris}}, booktitle = {{7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), 2012}}, isbn = {{978-1-4577-2114-4}}, language = {{eng}}, pages = {{150--154}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, title = {{High-Rate QC LDPC Codes of Short and Moderate Length with Good Girth Profile}}, url = {{https://lup.lub.lu.se/search/files/5697532/2856650.pdf}}, doi = {{10.1109/ISTC.2012.6325217}}, year = {{2012}}, }