Treffer: Minimum Pseudoweight Analysis of 3-Dimensional Turbo Codes

Title:
Minimum Pseudoweight Analysis of 3-Dimensional Turbo Codes
Authors:
ROSNES, Eirik, HELMLING, Michael, I AMAT, Alexandre Graell
Source:
IEEE transactions on communications. 62(7):2170-2182
Publisher Information:
New York, NY: Institute of Electrical and Electronics Engineers, 2014.
Publication Year:
2014
Physical Description:
print, 32 ref
Original Material:
INIST-CNRS
Subject Terms:
Telecommunications, Télécommunications, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Telecommunications et theorie de l'information, Telecommunications and information theory, Théorie de l'information, du signal et des communications, Information, signal and communications theory, Théorie du signal et des communications, Signal and communications theory, Codage, codes, Coding, codes, Canal binaire, Binary channel, Canal binario, Canal bruit blanc gaussien additif, AWGN channels, Code Turbo, Turbo code, Código Turbo, Code concaténé, Concatenated codes, Distance minimale, Minimal distance, Distancia mínima, Décodage itératif, Iterative decoding, Entrelacement, Interlacing, Entrelazado, Estimation a posteriori, A posteriori estimation, Estimación a posteriori, Modèle 3 dimensions, Three dimensional model, Modelo 3 dimensiones, Polytope, Politope, Programmation linéaire, Linear programming, Programación lineal, QPP interleavers, Three-dimensional (3D) turbo codes, graph cover, hybrid concatenated codes, linear programming (LP) decoding, pseudocodewords, pseudoweight, turbo codes, uniform interleaver
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Selmer Center, Department of Informatics, University of Bergen, Bergen 5020, Norway
Simula Research Laboratory, Lysaker 1325, Norway
Mathematical Institute, University of Koblenz-Landau, Koblenz 56070, Germany
Department of Signals and Systems, Chalmers University of Technology, Gothenburg 412 96, Sweden
ISSN:
0090-6778
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=28721842
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Telecommunications and information theory
Accession Number:
edscal.28721842
Database:
PASCAL Archive

Weitere Informationen

In this paper, we consider pseudocodewords of (relaxed) linear programming (LP) decoding of 3-dimensional turbo codes (3D-TCs). We present a relaxed LP decoder for 3D-TCs, adapting the relaxed LP decoder for conventional turbo codes proposed by Feldman in his thesis. We show that the 3D-TC polytope is proper and C-symmetric and make a connection to finite graph covers of the 3D-TC factor graph. This connection is used to show that the support set of any pseudocodeword is a stopping set of iterative decoding of 3D-TCs using maximum a posteriori constituent decoders on the binary erasure channel. Furthermore, we compute ensemble-average pseudoweight enumerators of 3D-TCs and perform a finite-length minimum pseudoweight analysis for small cover degrees. Moreover, an explicit description of the fundamental cone of the 3D-TC polytope is given. Finally, we present an extensive numerical study of small-to-medium block length 3D-TCs, which shows that 1) typically (i.e., in most cases), when the minimum distance dmin and/or the stopping distance hmin is high, the minimum pseudoweight (on the additive white Gaussian noise channel) is strictly smaller than both dmin and hmin and that 2) the minimum pseudoweight grows with the block length, at least for small-to-medium block lengths.