article

Two step SOVA-based decoding algorithm for tailbiting codes

Authors:

Jorge Ortín,

Paloma García,

Fernando Gutiérrez,

Antonio ValdovinosAuthors Info & Claims

IEEE Communications Letters, Volume 13, Issue 7

Pages 510 - 512

https://doi.org/10.1109/LCOMM.2009.090810

Published: 01 July 2009 Publication History

Abstract

In this work we propose a novel decoding algorithm for tailbiting convolutional codes and evaluate its performance over different channels. The proposed method consists on a fixed two-step Viterbi decoding of the received data. In the first step, an estimation of the most likely state is performed based on a SOVA decoding. The second step consists of a conventional Viterbi decoding that employs the state estimated in the previous step as the initial and final states of the trellis. Simulations results show a performance close to that of maximum-likelihood decoding.

References

[1]

R. V. Cox and C. W. Sundberg, "An efficient adaptative circular Viterbi algorithm for decoding generalized tailbiting convolutional codes," IEEE Trans. Veh. Technol., vol. 43, pp. 57-68, Feb. 1994.

Crossref

Google Scholar

[2]

R. Y. Shao, S. Lin, and M. P. C. Fossorier, "Two decoding algorithms for tailbiting codes," IEEE Trans. Commun., vol. 10, pp. 1658-1665, Oct. 2003.

Crossref

Google Scholar

[3]

H.-T. Pai, Y. S. Han, T.-Y. Wu, P.-N. Chen, and S.-L. Shieh, "Low-complexity ML decoding for convolutional tail-biting codes," IEEE Commun. Lett., vol. 12, pp. 883-885, Dec. 2008.

Crossref

Google Scholar

[4]

J. Hagenauer and P. Hoeher, "A Viterbi algorithm with soft-decision outputs and its applications," in IEEE Global Telecommunications Conference , Dallas, USA, Nov. 1989.

Google Scholar

[5]

IEEE Std 802.16e-2005: Amendment to IEEE Std 802.16, IEEE Std., 2005.

Google Scholar

[6]

Evolved Universal Terrestrial Radio Access (E-UTRA); Multiplexing and Channel Coding, 3rd Generation Partnership Project Std. 3GPP TS 36.212 V8.2.0, 2008.

Google Scholar

Cited By

View all

Ortín JGarcía PGutiérrez FValdovinos A(2018)A* based algorithm for reduced complexity ML decoding of tailbiting codesIEEE Communications Letters10.1109/LCOMM.2010.072310.10029514:9(854-856)Online publication date: 13-Dec-2018
https://dl.acm.org/doi/10.1109/LCOMM.2010.072310.100295
Ortin JGarcia PGutierrez FValdovinos AMerani M(2010)Improved SOVA-based decoding algorithm for tailbiting codes on wireless channelsProceedings of the 5th IEEE international conference on Wireless pervasive computing10.5555/1856330.1856342(63-68)Online publication date: 5-May-2010
https://dl.acm.org/doi/10.5555/1856330.1856342

Index Terms

Two step SOVA-based decoding algorithm for tailbiting codes
1. Mathematics of computing
  1. Information theory
    1. Coding theory
2. Security and privacy
  1. Cryptography
    1. Mathematical foundations of cryptography

Index terms have been assigned to the content through auto-classification.

Recommendations

A* based algorithm for reduced complexity ML decoding of tailbiting codes

The A* algorithm is a graph search algorithm which has shown good results in terms of computational complexity for Maximum Likelihood (ML) decoding of tailbiting convolutional codes. The decoding of tailbiting codes with this algorithm is performed in ...
Soft Convolutional Codes Decoding Algorithm for Concatenated Codes in Visible Light Communication

In this paper, we propose a new decoding algorithm for soft convolutional codes and concatenated codes in visible light communication (VLC) systems. RLL codes are used to control the dimming in VLC since each codeword has same 1s and 0s, hard RLL ...
Sliding window algorithm for TBCC decoding

This study modifies the wrap-around Viterbi algorithm (WAVA) for tailbiting convolutional codes (TBCCs). The proposed modification is based on the fact that it is unnecessary to decode a codeword of TBCCs from the beginning of the codeword. WAVA must ...

Comments

Information & Contributors

Information

Published In

IEEE Communications Letters Volume 13, Issue 7

July 2009

96 pages

ISSN:1089-7798

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 July 2009

Received: 07 April 2009

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ortín JGarcía PGutiérrez FValdovinos A(2018)A* based algorithm for reduced complexity ML decoding of tailbiting codesIEEE Communications Letters10.1109/LCOMM.2010.072310.10029514:9(854-856)Online publication date: 13-Dec-2018
https://dl.acm.org/doi/10.1109/LCOMM.2010.072310.100295
Ortin JGarcia PGutierrez FValdovinos AMerani M(2010)Improved SOVA-based decoding algorithm for tailbiting codes on wireless channelsProceedings of the 5th IEEE international conference on Wireless pervasive computing10.5555/1856330.1856342(63-68)Online publication date: 5-May-2010
https://dl.acm.org/doi/10.5555/1856330.1856342

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

A* based algorithm for reduced complexity ML decoding of tailbiting codes

Soft Convolutional Codes Decoding Algorithm for Concatenated Codes in Visible Light Communication

Sliding window algorithm for TBCC decoding

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations