Publikationer
On APP-decoding using BEAST
Avdelning/ar:
Publiceringsår: 2004
Språk: Engelska
Sidor:
Publikation/Tidskrift/Serie: International Symposium on Information Theory. ISIT 2004. Proceedings.
Dokumenttyp: Konferensbidrag
Sammanfattning
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
Disputation
Nyckelord
- Technology and Engineering
- probability
- decoding
- maximum likelihood
- AWGN channels
- channel coding
Övrigt
2004 IEEE International Symposium on Information Theory
2004-06-27/2004-07-02
Chicago, Ill.
Published
Yes
- ISBN: 0-7803-8280-3
