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.
| Original language | English |
|---|---|
| Pages (from-to) | 1324-1329 |
| Number of pages | 6 |
| Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
| Volume | E79-A |
| Issue number | 9 |
| State | Published - 1996 |
| Externally published | Yes |
Keywords
- Insertion/deletion error
- Levenshtein distance
- Synchronization error
- Viterbi decoding