Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · IEEE Transactions on Communications · 1989

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

Q. Wang, V.K. Bhargava

Cited by 39Abstract and details only

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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Cite this paper

APA 7

Wang, Q., & Bhargava, V. (1989). An efficient maximum likelihood decoding algorithm for generalized tail biting convolutional codes including quasicyclic codes. IEEE Transactions on Communications, 37(8), 875–879. https://doi.org/10.1109/26.31187

MLA 9

Wang, Q., and V.K. Bhargava. “An efficient maximum likelihood decoding algorithm for generalized tail biting convolutional codes including quasicyclic codes.” IEEE Transactions on Communications, vol. 37, no. 8, 1989, pp. 875–79, https://doi.org/10.1109/26.31187.

Chicago

Wang, Q., and V.K. Bhargava. 1989. “An efficient maximum likelihood decoding algorithm for generalized tail biting convolutional codes including quasicyclic codes.” IEEE Transactions on Communications 37 (8): 875–79. https://doi.org/10.1109/26.31187.

Harvard

Wang, Q. and Bhargava, V. (1989) ‘An efficient maximum likelihood decoding algorithm for generalized tail biting convolutional codes including quasicyclic codes’, IEEE Transactions on Communications, 37(8), pp. 875–879. Available at: https://doi.org/10.1109/26.31187.

BibTeX
@article{wang1989efficient,
  title = {{An efficient maximum likelihood decoding algorithm for generalized tail biting convolutional codes including quasicyclic codes}},
  author = {Wang, Q. and Bhargava, V.K.},
  journal = {IEEE Transactions on Communications},
  volume = {37},
  number = {8},
  pages = {875--879},
  year = {1989},
  doi = {10.1109/26.31187}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers