BEAST decoding for block codes
(2004) In European Transactions on Telecommunications 15(4). p.297-305- Abstract
- BEAST is a Bidirectional Efficient Algorithm for Searching code Trees. In this paper, it is used for decoding block codes over a binary-input memoryless 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... (More)
- BEAST is a Bidirectional Efficient Algorithm for Searching code Trees. In this paper, it is used for decoding block codes over a binary-input memoryless 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 that assess the error-rate performance and the decoding complexity of BEAST are presented for two longer codes. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/269595
- author
- Bocharova, Irina LU ; Johannesson, Rolf LU ; Kudryashov, Boris LU and Loncar, Maja LU
- organization
- publishing date
- 2004
- type
- Contribution to journal
- publication status
- published
- subject
- in
- European Transactions on Telecommunications
- volume
- 15
- issue
- 4
- pages
- 297 - 305
- publisher
- John Wiley & Sons Inc.
- external identifiers
-
- wos:000223406700002
- scopus:4043133787
- ISSN
- 1541-8251
- DOI
- 10.1002/ett.979
- language
- English
- LU publication?
- yes
- id
- 2fb334de-2cd5-4c02-ae4a-b227a849f2a0 (old id 269595)
- date added to LUP
- 2016-04-01 16:37:42
- date last changed
- 2022-03-30 17:11:31
@article{2fb334de-2cd5-4c02-ae4a-b227a849f2a0,
abstract = {{BEAST is a Bidirectional Efficient Algorithm for Searching code Trees. In this paper, it is used for decoding block codes over a binary-input memoryless 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 that assess the error-rate performance and the decoding complexity of BEAST are presented for two longer codes.}},
author = {{Bocharova, Irina and Johannesson, Rolf and Kudryashov, Boris and Loncar, Maja}},
issn = {{1541-8251}},
language = {{eng}},
number = {{4}},
pages = {{297--305}},
publisher = {{John Wiley & Sons Inc.}},
series = {{European Transactions on Telecommunications}},
title = {{BEAST decoding for block codes}},
url = {{http://dx.doi.org/10.1002/ett.979}},
doi = {{10.1002/ett.979}},
volume = {{15}},
year = {{2004}},
}