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 for block codes

Publiceringsår: 2004
Språk: Engelska
Sidor: 173-178
Publikation/Tidskrift/Serie: ITG-Fachbericht
Nummer: 181
Dokumenttyp: Konferensbidrag
Förlag: VDI-Verlag GmBH


BEAST is a Bidirectional Efficient Algorithm for Searching code Trees. In this paper, it is used for decoding block codes over the additive white Gaussian noise (AWGN) channel. If no constraints are imposed on the decoding complexity (in terms of the number of visited nodes during the search), BEAST performs maximum-likelihood (ML) decoding. At the cost of a negligible performance degradation, BEAST can be constrained to perform almost-ML decoding with significantly reduced complexity. The benchmark for the complexity assessment is the number of nodes visited by the Viterbi algorithm operating on the minimal trellis of the code. The decoding complexity depends on the trellis structure of a given code, which is illustrated by three different forms of the generator matrix for the (24, 12, 8) Golay code. Simulation results are also presented for two other codes


  • Electrical Engineering, Electronic Engineering, Information Engineering


5th International ITG Conference on Source and Channel Coding (SCC)
  • ISSN: 0932-6022

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