Near maximum-likelihood decoding of Generalized LDPC and Woven graph codes
(2013) IEEE International Symposium on Information Theory, 2013 p.3005-3009- Abstract
- Relations between Generalized LDPC codes, nonbinary LDPC codes, and woven graph codes are considered. Focus is on rather short codes suitable, for example, for coding control signaling information in mobile communications. In particular, codes of lengths less than 200 bits are studied. Low-complexity near maximum-likelihood (ML) decoding for these classes of codes is introduced and analyzed. Frame error rate (FER) performance of the new decoding procedure is compared with the same performance of ML and belief propagation (BP) decoding. It is shown that unlike BP decoding whose performances are mainly governed by the girth of the Tanner graph the new decoding procedure has performances which significantly depend on the minimum distance and... (More)
- Relations between Generalized LDPC codes, nonbinary LDPC codes, and woven graph codes are considered. Focus is on rather short codes suitable, for example, for coding control signaling information in mobile communications. In particular, codes of lengths less than 200 bits are studied. Low-complexity near maximum-likelihood (ML) decoding for these classes of codes is introduced and analyzed. Frame error rate (FER) performance of the new decoding procedure is compared with the same performance of ML and belief propagation (BP) decoding. It is shown that unlike BP decoding whose performances are mainly governed by the girth of the Tanner graph the new decoding procedure has performances which significantly depend on the minimum distance and spectrum of the woven code. Short woven graph codes with large minimum distances are tabulated. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/4390460
- author
- Bocharova, Irina LU ; Kudryashov, Boris LU ; Makarov, Nikolay and Johannesson, Rolf LU
- organization
- publishing date
- 2013
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- IEEE International Symposium on Information Theory (ISIT)
- pages
- 5 pages
- conference name
- IEEE International Symposium on Information Theory, 2013
- conference location
- Istanbul, Turkey
- conference dates
- 2013-07-07 - 2013-07-12
- external identifiers
-
- scopus:84890356798
- ISSN
- 2157-8095
- 2157-8117
- DOI
- 10.1109/ISIT.2013.6620777
- language
- English
- LU publication?
- yes
- id
- ba9b394e-8e99-49e2-a08c-2d9ab7e27e33 (old id 4390460)
- date added to LUP
- 2016-04-04 07:48:18
- date last changed
- 2024-01-12 02:37:06
@inproceedings{ba9b394e-8e99-49e2-a08c-2d9ab7e27e33, abstract = {{Relations between Generalized LDPC codes, nonbinary LDPC codes, and woven graph codes are considered. Focus is on rather short codes suitable, for example, for coding control signaling information in mobile communications. In particular, codes of lengths less than 200 bits are studied. Low-complexity near maximum-likelihood (ML) decoding for these classes of codes is introduced and analyzed. Frame error rate (FER) performance of the new decoding procedure is compared with the same performance of ML and belief propagation (BP) decoding. It is shown that unlike BP decoding whose performances are mainly governed by the girth of the Tanner graph the new decoding procedure has performances which significantly depend on the minimum distance and spectrum of the woven code. Short woven graph codes with large minimum distances are tabulated.}}, author = {{Bocharova, Irina and Kudryashov, Boris and Makarov, Nikolay and Johannesson, Rolf}}, booktitle = {{IEEE International Symposium on Information Theory (ISIT)}}, issn = {{2157-8095}}, language = {{eng}}, pages = {{3005--3009}}, title = {{Near maximum-likelihood decoding of Generalized LDPC and Woven graph codes}}, url = {{http://dx.doi.org/10.1109/ISIT.2013.6620777}}, doi = {{10.1109/ISIT.2013.6620777}}, year = {{2013}}, }