On APP-decoding using BEAST

Irina Bocharova, Rolf Johannesson, Boris Kudryashov, Maja Loncar

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingpeer-review

Abstract

Good approximations of code-symbol a-posteriori probabilities (APPs) are obtained using a list of the most likely codewords, instead of the whole code-book. This list is found by bidirectional efficient algorithm for searching code trees (BEAST), whose complexity is shown to be lower than of the known trellis-based algorithms
Original languageEnglish
Title of host publicationInternational Symposium on Information Theory. ISIT 2004. Proceedings.
Pages345
Number of pages1
DOIs
Publication statusPublished - 2004
EventIEEE International Symposium on Information Theory (ISIT), 2004 - Chicago, IL, United States
Duration: 2004 Jun 272004 Jul 2

Conference

ConferenceIEEE International Symposium on Information Theory (ISIT), 2004
Country/TerritoryUnited States
CityChicago, IL
Period2004/06/272004/07/02

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering

Free keywords

  • probability
  • decoding
  • maximum likelihood
  • AWGN channels
  • channel coding

Fingerprint

Dive into the research topics of 'On APP-decoding using BEAST'. Together they form a unique fingerprint.

Cite this