Soft syndrome decoding of trellis coded modulation codes

Meir Ariel*, Jakov Snyders

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A recursive algorithm is presented for accomplishing maximum likelihood soft syndrome decoding of trellis coded modulation codes. It consists of signal-by-signal hard decoding, followed by a search for the most likely error pattern. An error trellis, alternatively a decoding table, is devised for describing error trellis enable identification of the surviving error path by a relatively small number of real additions. In comparison with the Viterbi algorithm, the syndrome decoder achieves substantial reduction in the computational complexity, especially for moderately noisy channels.

Original languageEnglish
Title of host publicationProceedings of the 1993 IEEE International Symposium on Information Theory
PublisherPubl by IEEE
Pages25
Number of pages1
ISBN (Print)0780308786
StatePublished - 1993
EventProceedings of the 1993 IEEE International Symposium on Information Theory - San Antonio, TX, USA
Duration: 17 Jan 199322 Jan 1993

Publication series

NameProceedings of the 1993 IEEE International Symposium on Information Theory

Conference

ConferenceProceedings of the 1993 IEEE International Symposium on Information Theory
CitySan Antonio, TX, USA
Period17/01/9322/01/93

Fingerprint

Dive into the research topics of 'Soft syndrome decoding of trellis coded modulation codes'. Together they form a unique fingerprint.

Cite this