NDLI: Two decoding algorithms for tailbiting codes

Content Provider	IEEE Xplore Digital Library
Author	Shao, R.Y. Shu Lin Fossorier, M.P.C.
Copyright Year	1972
Abstract	The paper presents two efficient Viterbi decoding-based suboptimal algorithms for tailbiting codes. The first algorithm, the wrap-around Viterbi algorithm (WAVA), falls into the circular decoding category. It processes the tailbiting trellis iteratively, explores the initial state of the transmitted sequence through continuous Viterbi decoding, and improves the decoding decision with iterations. A sufficient condition for the decision to be optimal is derived. For long tailbiting codes, the WAVA gives essentially optimal performance with about one round of Viterbi trial. For short- and medium-length tailbiting codes, simulations show that the WAVA achieves closer-to-optimum performance with fewer decoding stages compared with the other suboptimal circular decoding algorithms. The second algorithm, the bidirectional Viterbi algorithm (BVA), employs two wrap-around Viterbi decoders to process the tailbiting trellis from both ends in opposite directions. The surviving paths from the two decoders are combined to form composite paths once the decoders meet in the middle of the trellis. The composite paths at each stage thereafter serve as candidates for decision update. The bidirectional process improves the error performance and shortens the decoding latency of unidirectional decoding with additional storage and computation requirements. Simulation results show that both proposed algorithms effectively achieve practically optimum performance for tailbiting codes of any length.
Starting Page	1658
Ending Page	1665
Page Count	8
File Size	545162
File Format	PDF
ISSN	00906778
Volume Number	51
Issue Number	10
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2003-10-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Viterbi algorithm Iterative decoding Maximum likelihood decoding Iterative algorithms Block codes Convolutional codes Information theory Sufficient conditions Delay Computational modeling
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

An efficient adaptive circular Viterbi algorithm for decoding generalized tailbiting convolutional codes

Two step SOVA-based decoding algorithm for tailbiting codes

Low-complexity ML decoding for convolutional tail-biting codes

Iterative maximum-likelihood trellis decoding for block codes

Concatenated convolutional codes with interleavers

A* Based Algorithm for Reduced Complexity ML Decoding of Tailbiting Codes

Reliability-Output Decoding of Tail-Biting Convolutional Codes

Twin-stack decoding of recursive systematic convolutional codes

A unified structure of trellis-based soft-output decoding algorithms for turbo codes

Two decoding algorithms for tailbiting codes

Similar Documents

An efficient adaptive circular Viterbi algorithm for decoding generalized tailbiting convolutional codes

Two step SOVA-based decoding algorithm for tailbiting codes

Low-complexity ML decoding for convolutional tail-biting codes

Iterative maximum-likelihood trellis decoding for block codes

Concatenated convolutional codes with interleavers

A* Based Algorithm for Reduced Complexity ML Decoding of Tailbiting Codes

Reliability-Output Decoding of Tail-Biting Convolutional Codes

Twin-stack decoding of recursive systematic convolutional codes

A unified structure of trellis-based soft-output decoding algorithms for turbo codes

Two decoding algorithms for tailbiting codes