Sökning: id:"swepub:oai:research.chalmers.se:0b971ec3-6f67-46a6-a66e-de39861b04d9" >
Spatially Coupled T...
Spatially Coupled Turbo-Like Codes
-
- Moloudi, Saeedeh (författare)
- Lund University,Lunds universitet,Kommunikationsteknologi,Forskargrupper vid Lunds universitet,Communications Engineering,Lund University Research Groups
-
- Lentmaier, Michael (författare)
- Lund University,Lunds universitet,Kommunikationsteknologi,Forskargrupper vid Lunds universitet,Communications Engineering,Lund University Research Groups
-
- Graell i Amat, Alexandre, 1976 (författare)
- Chalmers University of Technology
-
(creator_code:org_t)
- 2017
- 2017
- Engelska.
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448 .- 1557-9654. ; 63:10, s. 6199-6215
- Relaterad länk:
-
http://publications.... (primary) (free)
-
visa fler...
-
https://portal.resea... (primary) (free)
-
http://dx.doi.org/10...
-
https://doi.org/10.1...
-
https://research.cha...
-
https://lup.lub.lu.s...
-
visa färre...
Abstract
Ämnesord
Stäng
- In this paper, we introduce the concept of spatially coupled turbo-like codes (SC-TCs) as the spatial coupling of a number of turbo-like code ensembles. In particular, we consider the spatial coupling of parallel concatenated codes, introduced by Berrou et al., and that of serially concatenated codes (SCCs), introduced by Benedetto et al. Furthermore, we propose two extensions of braided convolutional codes (BCCs), and a class of turbo-like codes which have an inherent spatially coupled structure, to higher coupling memories, and show that these yield improved belief propagation (BP) thresholds as compared with the original BCC ensemble. We derive the exact density evolution (DE) equations for SC-TCs and analyze their asymptotic behavior on the binary erasure channel. We also consider the construction of families of rate-compatible SC-TC ensembles. Our numerical results show that the threshold saturation of the BP decoding threshold to the maximum a posteriori threshold of the underlying uncoupled ensembles occurs for large enough coupling memory. The improvement of the BP threshold is especially significant for SCCs and BCCs, whose uncoupled ensembles suffer from a poor BP threshold. For a wide range of code rates, SC-TCs show close-to-capacity performance as the coupling memory increases. We further give a proof of threshold saturation for SC-TC ensembles with identical component encoders. In particular, we show that the DE of SC-TC ensembles with identical component encoders can be properly rewritten as a scalar recursion. This allows us to define potential functions and prove threshold saturation using the proof technique recently introduced by Yedla et al.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Telekommunikation (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Telecommunications (hsv//eng)
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Kommunikationssystem (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Communication Systems (hsv//eng)
- 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)
Nyckelord
- Braided codes
- density evolution
- potential function
- threshold saturation
- turbo codes
- spatially coupled codes
- serially concatenated codes
Publikations- och innehållstyp
- art (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas