Asymptotic analysis of A∗ maximum-likelihood decoding with reliability reordering

O. Milenkovic, Bane V Vasic

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We investigate the computational complexity of the A∗ algorithm with reliability reordering, applied to maximum-likelihood (ML) decoding of block codes. Extensive computer simulations show that A∗ decoding with reliability reordering offers good average computational performance, but up to date there is no accurate analytical description of the decoding complexity. By using the theory of order statistics, we derive asymptotic bounds for the maximum decoding complexity as well as approximations for the average decoding complexity of the algorithm for large noise levels. The analysis shows that reordering is a key feature of the algorithm that allows for substantial computational savings.

Original languageEnglish (US)
Title of host publicationProceedings - 2003 IEEE Information Theory Workshop, ITW 2003
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages316-319
Number of pages4
ISBN (Print)0780377990, 9780780377998
DOIs
StatePublished - 2003
Event2003 IEEE Information Theory Workshop, ITW 2003 - Paris, France
Duration: Mar 31 2003Apr 4 2003

Other

Other2003 IEEE Information Theory Workshop, ITW 2003
CountryFrance
CityParis
Period3/31/034/4/03

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Information Systems
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Asymptotic analysis of A∗ maximum-likelihood decoding with reliability reordering'. Together they form a unique fingerprint.

  • Cite this

    Milenkovic, O., & Vasic, B. V. (2003). Asymptotic analysis of A∗ maximum-likelihood decoding with reliability reordering. In Proceedings - 2003 IEEE Information Theory Workshop, ITW 2003 (pp. 316-319). [1216757] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITW.2003.1216757