NDLI: Low complexity syndrome algorithm for the decoding of convolutional codes

Content Provider	Springer Nature Link
Author	Antoine, Jacques Husson, Lionel Wautier, Armelle Paul, Nicolas Dany, Jean Claude Brouet, Jérôme
Copyright Year	2005
Abstract	Le décodage au sens du maximum de vraisemblance des codes convolutifs est effectué de manière classique à l’aide l’algorithme de Viterbi (Va). Nous proposons un décodeur à entrées fermes ou pondérées dans lequel l’algorithme de Viterbi, associé à une métrique appropriée, est employé pour identifier le vecteur d’erreur plutôt que le message d’information. Ce type de décodage permet d’éviter la mise en uvre d’un nombre important d’opérations Acs (Addition Comparaison Sélection). Nous montrons que les performances atteintes sont optimales pour un décodage à décisions fermes et très proches de l’optimum dans le cas d’entrées pondérées, tout en procurant une réduction de la complexité qui est d’autant plus importante que le rapport Ec/No (énergie par bit transmis sur densité de puissance monolatérale de bruit) est élevé (par exemple, pour des rapports Ec/No supérieurs à 3 dB, plus de 80 % des opérations ACS peuvent être évitées). Nous proposons également un algorithme permettant de rejeter un paquet sans avoir à effectuer les itérations de l’algorithme de Viterbi.The decoding of convolutional codes in the maximum likelihood sense is carried out in a traditional way with the Viterbi algorithm (Va). We proposed a soft and hard input decoder where theVa, associated with an relevant metric, is applied to identify the error vector rather than the information message. In this paper, we show that, with this type of decoding, the exhaustive computation of a majority ofAcs (Add Compare Select) is unnecessary. Moreover, we show that optimal performance is achieved in the case of a hard input decoder, and that performance closed to the optimum is achieved in the case of a soft input decoder, while offering of a reduction of the complexity which is all the more important than the Ec/No ratio is high (e. g. for ratio Ec/No greater than 3 dB, more than 80 % of theAcs can be avoided). We also propose an algorithm allowing rejecting a frame without having to carry out any iteration of theVa.
Starting Page	1080
Ending Page	1102
Page Count	23
File Format	PDF
ISSN	00034347
Journal	Annales Des Télécommunications
Volume Number	60
Issue Number	7-8
e-ISSN	19589395
Language	English
Publisher	Springer-Verlag
Publisher Date	2005-01-01
Publisher Place	Paris
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Error correcting code Convolutional code Decoding Computing complexity Viterbi decoding Simulation 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

Reduced complexity decoding of convolutional codes based on the M-algorithm and the minimal trellis

Preventing a pitfall in trellis-based decoding of polynomial block codes

An efficiently implementable maximum likelihood decoding algorithm for tailbiting codes

High-level synthesis for behavioral design of the MAP algorithm for turbo decoder

Design of cyclic shift interleavers for Turbo Codes

Convolutional Decoding in the Presence of Synchronization Errors

A new identity concerning the weight enumerator of binary linear block codes

Multimedia forward error correcting codes for wirelessLAN

On unequal error protection for LZSS compressed data

Low complexity syndrome algorithm for the decoding of convolutional codes

Similar Documents

Reduced complexity decoding of convolutional codes based on the M-algorithm and the minimal trellis

Preventing a pitfall in trellis-based decoding of polynomial block codes

An efficiently implementable maximum likelihood decoding algorithm for tailbiting codes

High-level synthesis for behavioral design of the MAP algorithm for turbo decoder

Design of cyclic shift interleavers for Turbo Codes

Convolutional Decoding in the Presence of Synchronization Errors

A new identity concerning the weight enumerator of binary linear block codes

Multimedia forward error correcting codes for wirelessLAN

On unequal error protection for LZSS compressed data

Low complexity syndrome algorithm for the decoding of convolutional codes