The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

On APP-decoding using BEAST

På svenska

Author

Summary, in English

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

Publishing year

2004

Language

English

Pages

345-345

Publication/Series

International Symposium on Information Theory. ISIT 2004. Proceedings.

Document type

Conference paper

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

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

Conference name

IEEE International Symposium on Information Theory (ISIT), 2004

Conference date

2004-06-27 - 2004-07-02

Conference place

Chicago, IL, United States

Status

Published

ISBN/ISSN/Other

  • ISBN: 0-7803-8280-3