Iterative decoding algorithms updating likelihood and channel values based on interim hard decision results

M. Ariyoshi, Iwao Sasase

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper presents novel decoding algorithms for turbo codes, in which the likelihood and channel values are updated in order for those values to become closer to the true values thorough the iterative decoding procedure. The criteria for updating the likelihood and channel values are proposed, those are based on the simple means to compare the interim hard decision results from each of component decoders.

Original languageEnglish
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages174
Number of pages1
Publication statusPublished - 2000
Event2000 IEEE International Symposium on Information Theory - Serrento, Italy
Duration: 2000 Jun 252000 Jun 30

Other

Other2000 IEEE International Symposium on Information Theory
CountryItaly
CitySerrento
Period00/6/2500/6/30

Fingerprint

Iterative decoding
Turbo codes
Decoding

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Ariyoshi, M., & Sasase, I. (2000). Iterative decoding algorithms updating likelihood and channel values based on interim hard decision results. In IEEE International Symposium on Information Theory - Proceedings (pp. 174)

Iterative decoding algorithms updating likelihood and channel values based on interim hard decision results. / Ariyoshi, M.; Sasase, Iwao.

IEEE International Symposium on Information Theory - Proceedings. 2000. p. 174.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ariyoshi, M & Sasase, I 2000, Iterative decoding algorithms updating likelihood and channel values based on interim hard decision results. in IEEE International Symposium on Information Theory - Proceedings. pp. 174, 2000 IEEE International Symposium on Information Theory, Serrento, Italy, 00/6/25.
Ariyoshi M, Sasase I. Iterative decoding algorithms updating likelihood and channel values based on interim hard decision results. In IEEE International Symposium on Information Theory - Proceedings. 2000. p. 174
Ariyoshi, M. ; Sasase, Iwao. / Iterative decoding algorithms updating likelihood and channel values based on interim hard decision results. IEEE International Symposium on Information Theory - Proceedings. 2000. pp. 174
@inproceedings{6d91f8b8f5dc432194abfe4c2ff7e870,
title = "Iterative decoding algorithms updating likelihood and channel values based on interim hard decision results",
abstract = "This paper presents novel decoding algorithms for turbo codes, in which the likelihood and channel values are updated in order for those values to become closer to the true values thorough the iterative decoding procedure. The criteria for updating the likelihood and channel values are proposed, those are based on the simple means to compare the interim hard decision results from each of component decoders.",
author = "M. Ariyoshi and Iwao Sasase",
year = "2000",
language = "English",
pages = "174",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

TY - GEN

T1 - Iterative decoding algorithms updating likelihood and channel values based on interim hard decision results

AU - Ariyoshi, M.

AU - Sasase, Iwao

PY - 2000

Y1 - 2000

N2 - This paper presents novel decoding algorithms for turbo codes, in which the likelihood and channel values are updated in order for those values to become closer to the true values thorough the iterative decoding procedure. The criteria for updating the likelihood and channel values are proposed, those are based on the simple means to compare the interim hard decision results from each of component decoders.

AB - This paper presents novel decoding algorithms for turbo codes, in which the likelihood and channel values are updated in order for those values to become closer to the true values thorough the iterative decoding procedure. The criteria for updating the likelihood and channel values are proposed, those are based on the simple means to compare the interim hard decision results from each of component decoders.

UR - http://www.scopus.com/inward/record.url?scp=0034450079&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034450079&partnerID=8YFLogxK

M3 - Conference contribution

SP - 174

BT - IEEE International Symposium on Information Theory - Proceedings

ER -