An erasure-declaring Viterbi decoding algorithm (EVDA) is described which is capable of making decoding decisions and of declaring erasures at its output. This algorithm is compared in terms of both performance and complexity to the corresponding maximum a posteriori (MAP) symbol-by-symbol decoding rule. Results indicate comparable performance at considerably reduced complexity. The EDVA is particularly useful for decoding inner convolutional codes in a concatenated coding scheme using Reed-Solomon (RS) outer codes.
|Original language||English (US)|
|Number of pages||5|
|Journal||Conference Record - International Conference on Communications|
|State||Published - Dec 1 1986|
ASJC Scopus subject areas
- Computer Networks and Communications
- Electrical and Electronic Engineering