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