The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

BEAST decoding for block codes

På svenska

Author

Summary, in English

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

Publishing year

2004

Language

English

Pages

173-178

Publication/Series

ITG-Fachbericht

Issue

181

Document type

Conference paper

Publisher

VDI Verlag GMBH

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Conference name

5th International ITG Conference on Source and Channel Coding (SCC´04)

Conference date

2004-01-14 - 2004-01-16

Conference place

Erlangen, Germany

Status

Published

ISBN/ISSN/Other

  • ISSN: 0932-6022