Viterbi Decoding Considering Synchronization Errors
Summary :
Viterbi decoding is known as a decoding scheme that can realize maximum likelihood decoding. However, it is impossible to continue it without re-synchronization even if only an insertion/deletion error occurs in a channel. In this paper, we show that Levenshtein distance is suitable for the metric of Viterbi decoding in a channel where not only symbol errors but also insertion/deletion errors occur under some conditions and we propose a kind of Viterbi decoding considering insertion/deletion errors.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E79-A No.9 pp.1324-1329
- Publication Date
- 1996/09/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
- Coding Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Takuo MORI, Hideki IMAI, "Viterbi Decoding Considering Synchronization Errors" in IEICE TRANSACTIONS on Fundamentals,
vol. E79-A, no. 9, pp. 1324-1329, September 1996, doi: .
Abstract: Viterbi decoding is known as a decoding scheme that can realize maximum likelihood decoding. However, it is impossible to continue it without re-synchronization even if only an insertion/deletion error occurs in a channel. In this paper, we show that Levenshtein distance is suitable for the metric of Viterbi decoding in a channel where not only symbol errors but also insertion/deletion errors occur under some conditions and we propose a kind of Viterbi decoding considering insertion/deletion errors.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e79-a_9_1324/_p
Copy
@ARTICLE{e79-a_9_1324,
author={Takuo MORI, Hideki IMAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Viterbi Decoding Considering Synchronization Errors},
year={1996},
volume={E79-A},
number={9},
pages={1324-1329},
abstract={Viterbi decoding is known as a decoding scheme that can realize maximum likelihood decoding. However, it is impossible to continue it without re-synchronization even if only an insertion/deletion error occurs in a channel. In this paper, we show that Levenshtein distance is suitable for the metric of Viterbi decoding in a channel where not only symbol errors but also insertion/deletion errors occur under some conditions and we propose a kind of Viterbi decoding considering insertion/deletion errors.},
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - Viterbi Decoding Considering Synchronization Errors
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1324
EP - 1329
AU - Takuo MORI
AU - Hideki IMAI
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E79-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 1996
AB - Viterbi decoding is known as a decoding scheme that can realize maximum likelihood decoding. However, it is impossible to continue it without re-synchronization even if only an insertion/deletion error occurs in a channel. In this paper, we show that Levenshtein distance is suitable for the metric of Viterbi decoding in a channel where not only symbol errors but also insertion/deletion errors occur under some conditions and we propose a kind of Viterbi decoding considering insertion/deletion errors.
ER -
English
