NDLI: Bounds on the error probability ofml decoding for block and turbo-block codes

Please wait, while we are loading the content...

Polynomial description of linear block codes and its applications to soft-input, soft-output decoding : Description polynomiale des codes en blocs linéaires et ses applications au décodage à entrée et à sortie pondérées

Multiple parallel concatenation of circular recursive systematic convolutional (Crsc) codes

New results on serial concatenated and accumulated-convolutional turbo code performance

Bounds on the error probability ofml decoding for block and turbo-block codes

Comparison of iterative decoder performance with union bounds for short frame turbo codes

Selection of component codes for turbo coding based on convergence properties

Design and performance of a product code turbo encoding-decoding prototype

Design of a 30 Mbit/s, flexible frame length turbo-block-decoder

On turbo encodedBicm

Serial concatenation of interleaved convolutional codes andM-ary continuous phase modulations : Concaténation série de codes convolutifs et de modulations à phase continuem-aires séparés par un entrelaceur

Iterative rake receiver with map channel estimation for ds-cdma systems : Récepteur en râteauiteratif avec estimation de canal au maximuma posteriori pour systèmes amrc

Annales Des Télécommunications : Volume 54, Issue 1-2, January 1999

Annales Des Télécommunications : Volume 53

Annales Des Télécommunications : Volume 52

Bounds on the error probability ofml decoding for block and turbo-block codes

Content Provider	Springer Nature Link
Author	Sason, Igal Shamai Shitz, Shlomo
Copyright Year	1999
Abstract	The performance of either structured or random turbo-block codes and binary, systematic block codes operating over the additive white Gaussian noise (Awgn) channel, is assessed by upper bounds on the error probalities of maximum likelihood (Ml) decoding. These bounds on the block and bit error probability which depend respectively on the distance spectrum and the input-output weight enumeration function (Iowef) of these codes, are compared, for a variety of cases, to simulated performance of iterative decoding and also to some reported simulated lower bounds on the performance ofMl decoders. The comparisons facilitate to assess the efficiency of iterative decoding (as compared to the optimalMl decoding rule) on one hand and the tightness of the examined upper bounds on the other. We focus here on uniformly interleaved and parallel concatenated turbo-Hamming codes, and to that end theIowefs of Hamming and turbo-Hamming codes are calculated by an efficient algorithm. The usefulness of the bounds is demonstrated for uniformly interleaved turbo-Hamming codes at rates exceeding the cut-off rate, where the results are compared to the simulated performance of iteratively decoded turbo-Hamming codes with structured and statistical interleavers. We consider also the ensemble performance of ‘repeat and accumulate’ (Ka) codes, a family of serially concatenated turbo-block codes, introduced by Divsalar, Jin and McEliece. Although, the outer and inner codes possess a very simple structure: a repetitive and a differential encoder respectively, our upper bounds indicate impressive performance at rates considerably beyond the cut-off rate. This is also evidenced in literature by computer simulations of the performance of iteratively decodedRa codes with a particular structured interleaver.Les performances sur canal gaussien de turbo codes en bloc binaires systématiques, avec entrelacement structuré ou aléatoire sont estimées, à l’aide de bornes supérieures sur les probabilités d’erreurs, pour un décodage à maximum de vraisemblance. Ces bornes relatives à des blocs ou à des bits dépendent respectivemet du spectre des distances et de la fonction d’énumération des poids d’entrée et de sortie des codes. Ces bornes sont comparées, pour différents cas de figure, aux performances du décodage itératif obtenues par simulation et à certaines bornes inférieures présentées dans la lit-térature. Ces comparaisons permettent de juger de l’efficacité du décodage itératif vis-à-vis du décodage à maximum de vraisemblance, et d’évaluer la pertinence des bornes supérieures d’erreurs proposées dans cet article. Une attention particulière est portée aux codes turbo-Hamming avec concaténation parallèle et entrelacement uniforme (ou statistique). Les fonctions d’énumeration de poids pour les codes de Hamming et les codes turbo-Hamming sont calculées à l’aide d’algorithmes originaux. L’utilité des bornes d’erreurs proposées pour les codes turbo-Hamming est démontrée, pour des débits qui vont bien au delà de la coupure, par une bonne concordance avec les résultats de simulation relatifs au décodage itératif, et cela pour différents types d’entrelacement. Nous considérons également le cas particulier des codesRa (répétition et accumulation) et d’une famille de codes en bloc à concaténation série et entrelacement uniforme introduite par Divsalar, Jin et McEliece. Les codes extérieur et intérieur y ont une structure très simple: un codeur à répétition et un codeur différentiel respectivement. Malgré cela les performances que l’on peut observer à partir des bornes supérieures de probabilités d’erreurs ou des simulations relatives au décodage itératif sont impressionnantes, y compris au delà du débit de coupure.
Starting Page	183
Ending Page	200
Page Count	18
File Format	PDF
ISSN	00034347
Journal	Annales Des Télécommunications
Volume Number	54
Issue Number	3-4
e-ISSN	19589395
Language	French
Publisher	Springer-Verlag
Publisher Date	1999-01-01
Publisher Place	Paris
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Code correcteur erreur Probabilité erreur Code bloc Turbo code Maximum vraisemblance Décodage Entrelacement Iteration Décision pondérée Canal gaussien Communications Engineering, Networks Information Systems and Communication Service Signal, Image and Speech Processing Computer Communication Networks Information and Communication, Circuits R & D/Technology Policy
Content Type	Text
Resource Type	Article
Subject	Electrical and Electronic Engineering

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Comparison of iterative decoder performance with union bounds for short frame turbo codes

Code division multiple access based on independent codes and turbo decoding

On multiple slice turbo codes

How we implemented block turbo codes?

On turbo encodedBicm

Polynomial description of linear block codes and its applications to soft-input, soft-output decoding : Description polynomiale des codes en blocs linéaires et ses applications au décodage à entrée et à sortie pondérées

Selection of component codes for turbo coding based on convergence properties

New results on serial concatenated and accumulated-convolutional turbo code performance

A comparison of turbo codes using different trellis terminations

Bounds on the error probability ofml decoding for block and turbo-block codes

Similar Documents

Comparison of iterative decoder performance with union bounds for short frame turbo codes

Code division multiple access based on independent codes and turbo decoding

On multiple slice turbo codes

How we implemented block turbo codes?

On turbo encodedBicm

Polynomial description of linear block codes and its applications to soft-input, soft-output decoding : Description polynomiale des codes en blocs linéaires et ses applications au décodage à entrée et à sortie pondérées

Selection of component codes for turbo coding based on convergence properties

New results on serial concatenated and accumulated-convolutional turbo code performance

A comparison of turbo codes using different trellis terminations

Bounds on the error probability ofml decoding for block and turbo-block codes