NDLI: An efficient decoding algorithm for tailbiting codes on wireless channels

Content Provider	IEEE Xplore Digital Library
Author	Ortin, J. Garcia, P. Gutierrez, F. Valdovinos, A.
Copyright Year	2009
Description	Author affiliation: Aragon Institute for Engineering Research (I3A), University of Zaragoza, Maria de Luna, 1, 50018, Zaragoza, Spain (Ortin, J.; Garcia, P.; Gutierrez, F.; Valdovinos, A.)
Abstract	Tailbiting convolutional codes will be used for several applications in new cellular mobile radio systems. This encoding method does not reset the encoder memory at the end of each data block, avoiding the overhead of the zero tail and improving the efficiency, especially when encoding short data blocks. Nevertheless, the absence of a known tail highly increases the complexity of the decoding process. This fact added to the heavy computational burden of maximum likelihood (ML) decoding have made necessary the development of decoding algorithms which achieve good performance in terms of computational complexity and error correction capabilities. In this work we propose a novel decoding algorithm for tailbiting codes which is suitable for wireless environments with steep variations in channel conditions. The proposed method performs two different Viterbi decodings of the received data. In the first one, the most likely state is estimated with a modified version of the soft-output Viterbi algorithm (SOVA). The second one consists of a conventional Viterbi decoding which employs the state estimated in the previous step as the initial and final states of the trellis. Simulations results obtained in an orthogonal frequency division multiplexing (OFDM) system over a wireless channel are close to the performance of the maximum-likelihood decoding and other proposed algorithms.
Starting Page	672
Ending Page	676
File Size	167610
Page Count	5
File Format	PDF
ISBN	9781424435845
DOI	10.1109/ISWCS.2009.5285310
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-09-07
Publisher Place	Italy
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Convolutional codes Maximum likelihood estimation Viterbi algorithm OFDM Tail Error correction State estimation Computational complexity Maximum likelihood decoding Land mobile radio
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

Improved SOVA-based decoding algorithm for tailbiting codes on wireless channels

A circular Viterbi algorithm for decoding tailbiting convolutional codes

Low complexity MAP decoding of tailbiting convolutional codes

Low complexity algorithm for soft decoding of convolutional codes

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

Two step SOVA-based decoding algorithm for tailbiting codes

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

Convolutional codes for channels with deletion errors

Maximum weight basis decoding of convolutional codes

An efficient decoding algorithm for tailbiting codes on wireless channels

Similar Documents

Improved SOVA-based decoding algorithm for tailbiting codes on wireless channels

A circular Viterbi algorithm for decoding tailbiting convolutional codes

Low complexity MAP decoding of tailbiting convolutional codes

Low complexity algorithm for soft decoding of convolutional codes

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

Two step SOVA-based decoding algorithm for tailbiting codes

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

Convolutional codes for channels with deletion errors

Maximum weight basis decoding of convolutional codes

An efficient decoding algorithm for tailbiting codes on wireless channels