On APP-decoding using BEAST

Irina Bocharova; Rolf Johannesson; Boris Kudryashov; Maja Loncar

doi:10.1109/ISIT.2004.1365382

On APP-decoding using BEAST

Irina Bocharova, Rolf Johannesson, Boris Kudryashov, Maja Loncar

Department of Electrical and Information Technology

Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-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 language	English
Title of host publication	International Symposium on Information Theory. ISIT 2004. Proceedings.
Pages	345
Number of pages	1
DOIs	https://doi.org/10.1109/ISIT.2004.1365382
Publication status	Published - 2004
Event	IEEE International Symposium on Information Theory (ISIT), 2004 - Chicago, IL, United States Duration: 2004 Jun 27 → 2004 Jul 2

Conference

Conference	IEEE International Symposium on Information Theory (ISIT), 2004
Country/Territory	United States
City	Chicago, IL
Period	2004/06/27 → 2004/07/02

Subject classification (UKÄ)

Electrical Engineering, Electronic Engineering, Information Engineering

Free keywords

probability
decoding
maximum likelihood
AWGN channels
channel coding

Access to Document

10.1109/ISIT.2004.1365382

Cite this

@inproceedings{166d4924315349408504a35c64bec81d,

title = "On APP-decoding using BEAST",

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",

keywords = "probability, decoding, maximum likelihood, AWGN channels, channel coding",

author = "Irina Bocharova and Rolf Johannesson and Boris Kudryashov and Maja Loncar",

year = "2004",

doi = "10.1109/ISIT.2004.1365382",

language = "English",

isbn = "0-7803-8280-3",

pages = "345",

booktitle = "International Symposium on Information Theory. ISIT 2004. Proceedings.",

note = "IEEE International Symposium on Information Theory (ISIT), 2004 ; Conference date: 27-06-2004 Through 02-07-2004",

}

TY - GEN

T1 - On APP-decoding using BEAST

AU - Bocharova, Irina

AU - Johannesson, Rolf

AU - Kudryashov, Boris

AU - Loncar, Maja

PY - 2004

Y1 - 2004

N2 - 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

AB - 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

KW - probability

KW - decoding

KW - maximum likelihood

KW - AWGN channels

KW - channel coding

UR - https://www.scopus.com/pages/publications/5044242393

U2 - 10.1109/ISIT.2004.1365382

DO - 10.1109/ISIT.2004.1365382

M3 - Paper in conference proceeding

SN - 0-7803-8280-3

SP - 345

BT - International Symposium on Information Theory. ISIT 2004. Proceedings.

T2 - IEEE International Symposium on Information Theory (ISIT), 2004

Y2 - 27 June 2004 through 2 July 2004

ER -

On APP-decoding using BEAST

Abstract

Conference

Subject classification (UKÄ)

Free keywords

Access to Document

Other files and links

Fingerprint

Cite this