BEAST decoding of block codes obtained via convolutional codes

Irina Bocharova, Marc Handlery, Rolf Johannesson, Boris Kudryashov

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)

Abstract

BEAST is a bidirectional efficient algorithm for searching trees. In this correspondence, BEAST is extended to maximum-likelihood (ML) decoding of block codes obtained via convolutional codes. First it is shown by simulations that the decoding complexity of BEAST is significantly less than that of the Viterbi algorithm. Then asymptotic upper bounds on the BEAST decoding complexity for three important ensembles of codes are derived. They verify BEAST's high efficiency compared to other algorithms. For high rates, the new asymptotic bound for the best ensemble is in fact better than previously known bounds.
Original languageEnglish
Pages (from-to)1880-1891
JournalIEEE Transactions on Information Theory
Volume51
Issue number5
DOIs
Publication statusPublished - 2005

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • bidirectional search of trees
  • asymptotical decoding complexity
  • decoding of block codes
  • decoding
  • convolutional codes
  • maximum-likelihood (ML)

Fingerprint

Dive into the research topics of 'BEAST decoding of block codes obtained via convolutional codes'. Together they form a unique fingerprint.

Cite this