On APP-decoding using BEAST

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

• Författare: Irina Bocharova; Rolf Johannesson; Boris Kudryashov; Maja Loncar
• Avdelning/ar: Institutionen för elektro- och informationsteknik
• Publiceringsår: 2004
• Språk: Engelska
• Sidor: 345-345
• Publikation/Tidskrift/Serie: International Symposium on Information Theory. ISIT 2004. Proceedings.
• Länkar: http://dx.doi.org/10.1109/ISIT.2004.1365382
• Dokumenttyp: Konferensbidrag
• Ämne: Electrical Engineering, Electronic Engineering, Information Engineering
• Nyckelord: 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/Övrigt: ISBN: 0-7803-8280-3