On APP-decoding using BEAST

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

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

Details

Authors
Organisations
Research areas and keywords

Subject classification (UKÄ) – MANDATORY

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • probability, decoding, maximum likelihood, AWGN channels, channel coding
Original languageEnglish
Title of host publicationInternational Symposium on Information Theory. ISIT 2004. Proceedings.
Pages345
Number of pages1
Publication statusPublished - 2004
Publication categoryResearch
Peer-reviewedYes
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
CountryUnited States
CityChicago, IL
Period2004/06/272004/07/02