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 the decoding procedure. Methods for degenerating the 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
