NDLI: A new bidirectional algorithm for decoding trellis codes

Content Provider	IEEE Xplore Digital Library
Author	Senk, V. Radivojac, P.
Copyright Year	2001
Description	Author affiliation: Sch. of Eng., Novi Sad Univ., Yugoslavia (Senk, V.)
Abstract	A new parallel procedure for decoding trellis codes with a large constraint length is simulated and compared to the bidirectional stack algorithm. The systolic organization of processing units arranged in two mutually connected arrays enables the decoding effort to be unaffected by single correctable bursts of errors whose branch length is not greater than some /spl tau/, where /spl tau/ is not greater than the code memory length. During the course of decoding, the algorithm produces a set of tentative decisions of increasing reliability, until it reaches the final decision. Every tentative decision is composed of a portion of a forward and backward path, connected via a tunnel of length /spl tau/. After each new tentative decision is made, a new set of discarding criteria is produced. According to these criteria, a vast number of partially explored paths is discarded from all the stacks, speeding up the decoding procedure. The results show a significant reduction in decoding effort (measured by the number of extended paths in parallel) compared to known sequential procedures.
Sponsorship	IEEE
Starting Page	34
Ending Page	36
File Size	275596
Page Count	3
File Format	PDF
ISBN	0780364902
DOI	10.1109/EURCON.2001.937757
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2001-07-04
Publisher Place	Slovakia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Decoding Convolutional codes Tree graphs Error correction codes Block codes Viterbi algorithm Tail Error probability Hamming distance
Content Type	Text
Resource Type	Article

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

The bidirectional stack algorithm

A new decoding algorithm for trellis codes over groups

On Complexity Of Trellis Structure Of Linear Block Codes

ML decoding for convolutional code for short codeword of short constraint length and alternate use of block code

Simplified trellis decoding of block codes by selective pruning

MAP algorithms for decoding linear block codes based on sectionalized trellis diagrams

A Class of Dc-Free Subcodes of Convolutional Codes

Bidirectional Viterbi Decoding using the Levenshtein Distance Metric for Deletion Channels

An Interactive Visual Debugging Tool for Viterbi Trellis Decoding of 2D Codes

A new bidirectional algorithm for decoding trellis codes

Similar Documents

The bidirectional stack algorithm

A new decoding algorithm for trellis codes over groups

On Complexity Of Trellis Structure Of Linear Block Codes

ML decoding for convolutional code for short codeword of short constraint length and alternate use of block code

Simplified trellis decoding of block codes by selective pruning

MAP algorithms for decoding linear block codes based on sectionalized trellis diagrams

A Class of Dc-Free Subcodes of Convolutional Codes

Bidirectional Viterbi Decoding using the Levenshtein Distance Metric for Deletion Channels

An Interactive Visual Debugging Tool for Viterbi Trellis Decoding of 2D Codes

A new bidirectional algorithm for decoding trellis codes