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

T. Schaub, J. W. Modestino

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

5 Citations (Scopus)

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)
Title of host publicationConference Record - International Conference on Communications
PublisherIEEE
Pages1612-1616
Number of pages5
StatePublished - 1986

Fingerprint

Decoding
Reed-Solomon codes
Convolutional codes

ASJC Scopus subject areas

  • Media Technology

Cite this

Schaub, T., & Modestino, J. W. (1986). ERASURE DECLARING VITERBI DECODER AND ITS IMPLICATIONS TO CONCATENATED CODING SYSTEMS. In Conference Record - International Conference on Communications (pp. 1612-1616). IEEE.

ERASURE DECLARING VITERBI DECODER AND ITS IMPLICATIONS TO CONCATENATED CODING SYSTEMS. / Schaub, T.; Modestino, J. W.

Conference Record - International Conference on Communications. IEEE, 1986. p. 1612-1616.

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

Schaub, T & Modestino, JW 1986, ERASURE DECLARING VITERBI DECODER AND ITS IMPLICATIONS TO CONCATENATED CODING SYSTEMS. in Conference Record - International Conference on Communications. IEEE, pp. 1612-1616.
Schaub T, Modestino JW. ERASURE DECLARING VITERBI DECODER AND ITS IMPLICATIONS TO CONCATENATED CODING SYSTEMS. In Conference Record - International Conference on Communications. IEEE. 1986. p. 1612-1616
Schaub, T. ; Modestino, J. W. / ERASURE DECLARING VITERBI DECODER AND ITS IMPLICATIONS TO CONCATENATED CODING SYSTEMS. Conference Record - International Conference on Communications. IEEE, 1986. pp. 1612-1616
@inproceedings{2bec93fce40849e0b1b37eab7be7ac3d,
title = "ERASURE DECLARING VITERBI DECODER AND ITS IMPLICATIONS TO CONCATENATED CODING SYSTEMS.",
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.",
author = "T. Schaub and Modestino, {J. W.}",
year = "1986",
language = "English (US)",
pages = "1612--1616",
booktitle = "Conference Record - International Conference on Communications",
publisher = "IEEE",

}

TY - GEN

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

AU - Schaub, T.

AU - Modestino, J. W.

PY - 1986

Y1 - 1986

N2 - 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.

AB - 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.

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

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

M3 - Conference contribution

SP - 1612

EP - 1616

BT - Conference Record - International Conference on Communications

PB - IEEE

ER -