Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Estimating the list size for BEAST-APP decoding

Publiceringsår: 2005
Språk: Engelska
Sidor: 1126-1130
Publikation/Tidskrift/Serie: 2005 IEEE International Symposium on Information Theory (ISIT)
Dokumenttyp: Konferensbidrag
Förlag: IEEE--Institute of Electrical and Electronics Engineers Inc.


The BEAST-APP decoding algorithm is a low-complexity bidirectional algorithm that searches code trees to find the list of the most likely codewords, which are used to compute approximate a posteriori probabilities (APPs) of the transmitted symbols. It can be applied to APP-decoding of any linear block code, as well as in iterative structures for decoding concatenated block codes. Previous work has shown that the list size sufficient to achieve the performance of true-APP decoding is very small. This paper aims at providing a theoretical justification for this result. The sufficient list size is estimated first via the minimum list distance - a parameter that is defined and analyzed as a key factor that governs the performance of list-based algorithms. Additionally, statistical properties of the codeword likelihoods are investigated and the typical list structure is presented. Preliminary simulation results for iterative BEAST decoding confirm the list-size estimates obtained from both approaches


  • Electrical Engineering, Electronic Engineering, Information Engineering
  • BEAST-APP decoding
  • a posteriori probabilities
  • concatenated block codes
  • linear block code
  • iterative decoding
  • list-size estimates
  • code trees


IEEE International Symposium on Information Theory (ISIT), 2005
  • ISBN: 0-7803-9150-0

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen