Sökning: onr:"swepub:oai:research.chalmers.se:86d921c3-4604-432e-bacf-fe0ce881bd4a" >
Successive Cancella...
Successive Cancellation Decoding of Single Parity-Check Product Codes: Analysis and Improved Decoding
-
- Coskun, Mustafa C. (författare)
- Technische Universität München (TUM),Technical University of Munich (TUM),Technical University of Munich
-
- Liva, G. (författare)
- Deutsches Zentrums für Luft- und Raumfahrt (DLR),German Aerospace Center (DLR),German Aerospace Center (DLR)
-
- Graell I Amat, Alexandre, 1976 (författare)
- Chalmers University of Technology
-
visa fler...
-
- Lentmaier, Michael (författare)
- Lund University,Lunds universitet,Kommunikationsteknologi,Forskargrupper vid Lunds universitet,LTH profilområde: AI och digitalisering,LTH profilområden,Lunds Tekniska Högskola,Communications Engineering,Lund University Research Groups,LTH Profile Area: AI and Digitalization,LTH Profile areas,Faculty of Engineering, LTH
-
- Pfister, Henry D. (författare)
- Duke University
-
visa färre...
-
(creator_code:org_t)
- 2023
- 2023
- Engelska.
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448 .- 1557-9654. ; 69:2, s. 823-841
- Relaterad länk:
-
http://dx.doi.org/10...
-
visa fler...
-
https://doi.org/10.1...
-
https://research.cha...
-
https://lup.lub.lu.s...
-
visa färre...
Abstract
Ämnesord
Stäng
- A product code with single parity-check component codes can be described via the tools of a multi-kernel polar code, where the rows of the generator matrix are chosen according to the constraints imposed by the product code construction. Following this observation, successive cancellation decoding of such codes is introduced. In particular, the error probability of single parity-check product codes over binary memoryless symmetric channels under successive cancellation decoding is characterized. A bridge with the analysis of product codes introduced by Elias is also established for the binary erasure channel. Successive cancellation list decoding of single parity-check product codes is then described. For the provided example, simulations over the binary input additive white Gaussian channel show that successive cancellation list decoding outperforms belief propagation decoding applied to the code graph. Finally, the performance of the concatenation of a product code with a high-rate outer code is investigated via distance spectrum analysis. Examples of concatenations performing within 0.7 dB from the random coding union bound are provided.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Maskinteknik -- Produktionsteknik, arbetsvetenskap och ergonomi (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Mechanical Engineering -- Production Engineering, Human Work Science and Ergonomics (hsv//eng)
- 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 -- Signalbehandling (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Signal Processing (hsv//eng)
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering (hsv//eng)
Nyckelord
- Codes
- product codes
- Successive cancellation decoding
- Product codes
- Polar codes
- list decoding
- Maximum likelihood decoding
- Encoding
- Generators
- multi-kernel polar codes
- Error probability
- Codes
- Encoding
- Error probability
- Generators
- list decoding
- Maximum likelihood decoding
- multi-kernel polar codes
- Polar codes
- Product codes
- product codes
- Successive cancellation decoding
Publikations- och innehållstyp
- art (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas