Advanced

A simple one sweep algorithm for optimal APP symbol decoding of linear block codes

Johansson, Thomas LU (1998) IEEE International Symposium on Information Theory (ISIT), 1998 p.231-231
Abstract
We propose a simple optimal a posteriori probability (APP) symbol decoding algorithm for linear block codes, which requires one forward recursion in a trellis.
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
host publication
1998 IEEE International Symposium on Information Theory, 1998. Proceedings.
pages
231 - 231
conference name
IEEE International Symposium on Information Theory (ISIT), 1998
conference location
Cambridge, MA, United States
conference dates
1998-08-16 - 1998-08-21
external identifiers
  • scopus:84890389681
ISBN
0-7803-5000-6
DOI
10.1109/ISIT.1998.708835
language
English
LU publication?
yes
id
3e8687fe-7e2b-4f15-b7da-11a2cc7a2283 (old id 1157768)
alternative location
http://ieeexplore.ieee.org/iel4/5721/15310/00708835.pdf
date added to LUP
2008-06-10 11:14:43
date last changed
2018-11-21 21:14:24
@inproceedings{3e8687fe-7e2b-4f15-b7da-11a2cc7a2283,
  abstract     = {We propose a simple optimal a posteriori probability (APP) symbol decoding algorithm for linear block codes, which requires one forward recursion in a trellis.},
  author       = {Johansson, Thomas},
  isbn         = {0-7803-5000-6},
  language     = {eng},
  location     = {Cambridge, MA, United States},
  pages        = {231--231},
  title        = {A simple one sweep algorithm for optimal APP symbol decoding of linear block codes},
  url          = {http://dx.doi.org/10.1109/ISIT.1998.708835},
  year         = {1998},
}