BEAST decoding for block codes
(2004) 5th International ITG Conference on Source and Channel Coding (SCC´04) p.173-178- Abstract
- 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... (More)
- 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 (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/629009
- author
- Bocharova, Irina LU ; Johannesson, Rolf LU ; Kudryashov, Boris LU and Loncar, Maja LU
- organization
- publishing date
- 2004
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- ITG-Fachbericht
- issue
- 181
- pages
- 173 - 178
- publisher
- VDI Verlag GMBH
- conference name
- 5th International ITG Conference on Source and Channel Coding (SCC´04)
- conference location
- Erlangen, Germany
- conference dates
- 2004-01-14 - 2004-01-16
- ISSN
- 0932-6022
- language
- English
- LU publication?
- yes
- id
- e47a1707-7f81-453d-9704-0cf0ff4cc354 (old id 629009)
- date added to LUP
- 2016-04-01 15:53:37
- date last changed
- 2019-09-17 13:30:16
@inproceedings{e47a1707-7f81-453d-9704-0cf0ff4cc354, abstract = {{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}}, author = {{Bocharova, Irina and Johannesson, Rolf and Kudryashov, Boris and Loncar, Maja}}, booktitle = {{ITG-Fachbericht}}, issn = {{0932-6022}}, language = {{eng}}, number = {{181}}, pages = {{173--178}}, publisher = {{VDI Verlag GMBH}}, title = {{BEAST decoding for block codes}}, year = {{2004}}, }