Performance bound and trellis-code design criterion for discrete memoryless channels and finite-delay symbol-by-symbol decoding

Author

Baccarelli, Enzo ; Cusani, Roberto ; Blasio, Guido Di

Author_Institution

Dept. of INFOCOM, Rome Univ., Italy

Volume

45

Issue

10

fYear

1997

fDate

10/1/1997 12:00:00 AM

Firstpage

1192

Lastpage

1199

Abstract

A new tight analytical upper bound is presented for the performance of finite-delay symbol-by-symbol (SBS) Abend-Fritchman-like decoding of trellis-encoded data crossing arbitrary (eventually time-varying) discrete memoryless channels (DMCs). On the basis of this bound, a related criterion for the optimal design of trellis codes with SBS decoding is then proposed. It gives rise to an effective procedure for the construction of good trellis codes (generally time varying and nonlinear) with assigned decoding complexity

Keywords

computational complexity; decoding; memoryless systems; time-varying channels; trellis codes; Abend-Fritchman-like decoding; decoding complexity; discrete memoryless channels; finite-delay symbol-by-symbol decoding; optimal design; performance bound; tight analytical upper bound; time-varying channels; trellis code design; Additives; Associate members; Convolutional codes; Detectors; Maximum likelihood decoding; Maximum likelihood detection; Maximum likelihood estimation; Memoryless systems; Performance analysis; Upper bound;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.634682

Filename

634682