Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

BEAST decoding for block codes

In English

Författare

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

Publiceringsår

2004

Språk

Engelska

Sidor

173-178

Publikation/Tidskrift/Serie

ITG-Fachbericht

Issue

181

Dokumenttyp

Konferensbidrag

Förlag

VDI Verlag GMBH

Ämne

  • 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/Övrigt

  • ISSN: 0932-6022