Decoding lattice partitions with application to decoding coset codes

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


Several new algorithms for decoding lattice partitions are presented. They apply to Viterbi decoding of multidimensional trellis codes based on these partitions. In [1, 2], trellisbased algorithms were presented for decoding the lattice partitions. The new algorithms can achieve about 50% reduction of the complexity of decoding the lattice partitions in terms of real additions/comparisons compared with the algorithms of [1, 2]. The complexity of the resulting overall Viterbi decoding algorithms still shows a modest improvement. An algorithm for soft decision decoding the first-order Reed-Muller code (8, 4, 4) or the Gosset lattice is also presented. It involves at most 17 real operations, thus, improving the best known algorithm.
Original languageEnglish
Title of host publicationProceedings of the 1993 IEEE International Symposium on Information Theory (San Antonio TX, USA, 17-22 January 1993)
PublisherInstitute of Electrical and Electronics Engineers
Number of pages1
ISBN (Print)0-7803-0878-6
Publication statusPublished - 1993


Dive into the research topics of 'Decoding lattice partitions with application to decoding coset codes'. Together they form a unique fingerprint.

Cite this