List sequence MAP decoding
(2002) GLOBECOM'02 - IEEE Global Telecommunications Conference, 2002 2. p.1037-1041- Abstract
- A list sequence (LS) maximum a posteriori probability (MAP) decoding algorithm for convolutional codes, that takes into account bitwise a priori probabilities and produces a rank ordered list of [script L] sequence MAP estimates, can be obtained by modification of the metric increments of the serial list Viterbi algorithm. In this paper, we study the performance of LS-MAP decoding with genie-assisted error detection on the additive white Gaussian noise channel. Computer simulations and approximate analytical expressions, based on geometrical considerations are presented. We focus on the frame error rate and it is concluded that LS-MAP decoding with [script L] > 1 often exploits a priori information more efficiently than conventional... (More)
- A list sequence (LS) maximum a posteriori probability (MAP) decoding algorithm for convolutional codes, that takes into account bitwise a priori probabilities and produces a rank ordered list of [script L] sequence MAP estimates, can be obtained by modification of the metric increments of the serial list Viterbi algorithm. In this paper, we study the performance of LS-MAP decoding with genie-assisted error detection on the additive white Gaussian noise channel. Computer simulations and approximate analytical expressions, based on geometrical considerations are presented. We focus on the frame error rate and it is concluded that LS-MAP decoding with [script L] > 1 often exploits a priori information more efficiently than conventional single sequence MAP decoding ( [script L] = 1). This leads in many cases to larger relative gains with LS-MAP than LS-ML decoding as [script L] increases. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/610649
- author
- Leanderson, Carl Fredrik LU and Sundberg, Carl-Erik W.
- organization
- publishing date
- 2002
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- List sequence maximum a posteriori probability (LS-MAP) decoding
- host publication
- Conference Record / IEEE Global Telecommunications Conference
- volume
- 2
- pages
- 1037 - 1041
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- GLOBECOM'02 - IEEE Global Telecommunications Conference, 2002
- conference location
- Taipei, Taiwan
- conference dates
- 2002-11-17 - 2002-11-21
- external identifiers
-
- wos:000182118500206
- other:CODEN: CRIEET
- scopus:0036967164
- DOI
- 10.1109/GLOCOM.2002.1188352
- language
- English
- LU publication?
- yes
- id
- 9ad1e31f-22df-4dd5-b6cc-8313fd1ec3f1 (old id 610649)
- date added to LUP
- 2016-04-04 12:12:00
- date last changed
- 2022-02-13 22:31:19
@inproceedings{9ad1e31f-22df-4dd5-b6cc-8313fd1ec3f1,
abstract = {{A list sequence (LS) maximum a posteriori probability (MAP) decoding algorithm for convolutional codes, that takes into account bitwise a priori probabilities and produces a rank ordered list of [script L] sequence MAP estimates, can be obtained by modification of the metric increments of the serial list Viterbi algorithm. In this paper, we study the performance of LS-MAP decoding with genie-assisted error detection on the additive white Gaussian noise channel. Computer simulations and approximate analytical expressions, based on geometrical considerations are presented. We focus on the frame error rate and it is concluded that LS-MAP decoding with [script L] > 1 often exploits a priori information more efficiently than conventional single sequence MAP decoding ( [script L] = 1). This leads in many cases to larger relative gains with LS-MAP than LS-ML decoding as [script L] increases.}},
author = {{Leanderson, Carl Fredrik and Sundberg, Carl-Erik W.}},
booktitle = {{Conference Record / IEEE Global Telecommunications Conference}},
keywords = {{List sequence maximum a posteriori probability (LS-MAP) decoding}},
language = {{eng}},
pages = {{1037--1041}},
publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
title = {{List sequence MAP decoding}},
url = {{http://dx.doi.org/10.1109/GLOCOM.2002.1188352}},
doi = {{10.1109/GLOCOM.2002.1188352}},
volume = {{2}},
year = {{2002}},
}