Meny

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

BEAST decoding - asymptotic complexity

Publiceringsår: 2005
Språk: Engelska
Publikation/Tidskrift/Serie: 2005 IEEE Information Theory Workshop
Dokumenttyp: Konferensbidrag

Sammanfattning

BEAST is a bidirectional efficient algorithm for searching trees that performs soft-decision maximum-likelihood (ML) decoding of block codes. The decoding complexity of BEAST is significantly reduced compared to the Viterbi algorithm. An analysis of the asymptotic BEAST decoding complexity verifies BEAST's high efficiency compared to other algorithms. The best of the obtained asymptotic upper bounds on the BEAST decoding complexity is better than previously known bounds for ML decoding in a wide range of code rates.

Disputation

Nyckelord

  • Technology and Engineering
  • maximum likelihood decoding
  • tree searching
  • block codes
  • decision trees
  • computational complexity

Övriga

IEEE IT SOC Information Theory Workshop 2005 on Coding and Complexity
2005-08-29/2005-09-01
Rotorua, New Zealand
Published
Yes
  • ISBN: 0-7803-9480-1

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