ERASURE DECLARING VITERBI DECODER AND ITS IMPLICATIONS TO CONCATENATED CODING SYSTEMS.

T. Schaub, J. W. Modestino

Research output: Contribution to journalConference articlepeer-review

5 Scopus citations

Abstract

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 languageEnglish (US)
Pages (from-to)1612-1616
Number of pages5
JournalConference Record - International Conference on Communications
StatePublished - Dec 1 1986

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'ERASURE DECLARING VITERBI DECODER AND ITS IMPLICATIONS TO CONCATENATED CODING SYSTEMS.'. Together they form a unique fingerprint.

Cite this