Sökning: id:"swepub:oai:lup.lub.lu.se:01dcb0fe-35aa-4775-adc4-4a2f7252d0c8" >
Generalized LDPC Co...
Generalized LDPC Codes with Convolutional Code Constraints
-
- Farooq, M. U. (författare)
- Lund University,Lunds universitet,Kommunikationsteknologi,Forskargrupper vid Lunds universitet,Communications Engineering,Lund University Research Groups
-
- Moloudi, S. (författare)
- Ericsson AB
-
- Lentmaier, M. (författare)
- Lund University,Lunds universitet,Trådlös kommunikation (master),Utbildningsprogram, LTH,Lunds Tekniska Högskola,Kommunikationsteknologi,Forskargrupper vid Lunds universitet,Wireless communication (M.Sc.),Educational programmes, LTH,Faculty of Engineering, LTH,Communications Engineering,Lund University Research Groups
-
(creator_code:org_t)
- 2020
- 2020
- Engelska 6 s.
-
Ingår i: 2020 IEEE International Symposium on Information Theory (ISIT). - 9781728164328 - 9781728164335 ; , s. 479-484
- Relaterad länk:
-
http://dx.doi.org/10...
-
visa fler...
-
https://lup.lub.lu.s...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- Braided convolutional codes (BCCs) are a class of spatially coupled turbo-like codes that can be described by a (2), (3)-regular compact graph. In this paper, we introduce a family of (d v , d c )-regular GLDPC codes with convolutional code constraints (CC-GLDPC codes), which form an extension of classical BCCs to arbitrary regular graphs. In order to characterize the performance in the waterfall and error floor regions, we perform an analysis of the density evolution thresholds as well as the finite-length ensemble weight enumerators and minimum distances of the ensembles. In particular, we consider various ensembles of overall rate R = 1/3 and R = 1/2 and study the trade-off between variable node degree and strength of the component codes. We also compare the results to corresponding classical LDPC codes with equal degrees and rates. It is observed that for the considered LDPC codes with variable node degree d v > 2, we can find a CC-GLDPC code with smaller d v that offers similar or better performance in terms of BP and MAP thresholds at the expense of a negligible loss in the minimum distance.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Annan elektroteknik och elektronik (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Other Electrical Engineering, Electronic Engineering, Information Engineering (hsv//eng)
Publikations- och innehållstyp
- kon (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas