An efficient maximum likelihood decoding algorithm for generalized tail biting convolutional codes including quasicyclic codes

TitleAn efficient maximum likelihood decoding algorithm for generalized tail biting convolutional codes including quasicyclic codes
Publication TypeJournal Article
Year of Publication1989
AuthorsWang, Q., and V. K. Bhargava
JournalCommunications, IEEE Transactions on
Volume37
Pagination875 -879
Date Publishedaug.
ISSN0090-6778
Keywordscomputer simulation, convolutional codes, decoding, error correction codes, generalised tail biting codes, maximum likelihood decoding algorithm, noisy channels, quasicyclic codes, short total memory length, soft-decision decoding, suboptimal algorithms, Viterbi algorithm
Abstract

The complexity of the algorithm is shown to be asymptotically equal to that of the Viterbi algorithm and is very close for practical noisy channels. The latter is shown by means of computer simulation. The algorithm can be applied directly in an environment where soft-decision decoding is required or preferred. However, depending on the environment, some simplifications may be possible and/or necessary, resulting in suboptimal algorithms. Codes suitable for use with the algorithm should have short total memory length

URLhttp://dx.doi.org/10.1109/26.31187
DOI10.1109/26.31187

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2021 The University of British Columbia