TY - GEN
T1 - Soft syndrome decoding of trellis coded modulation codes
AU - Ariel, Meir
AU - Snyders, Jakov
PY - 1993
Y1 - 1993
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0027211556&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0027211556
SN - 0780308786
T3 - Proceedings of the 1993 IEEE International Symposium on Information Theory
SP - 25
BT - Proceedings of the 1993 IEEE International Symposium on Information Theory
PB - Publ by IEEE
T2 - Proceedings of the 1993 IEEE International Symposium on Information Theory
Y2 - 17 January 1993 through 22 January 1993
ER -