Decoding lattice partitions with application to decoding coset codes

F.W. Sun; H.C.A. Tilborg, van

doi:10.1109/ISIT.1993.748381

Decoding lattice partitions with application to decoding coset codes

F.W. Sun, H.C.A. Tilborg, van

Discrete Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Abstract

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 language	English
Title of host publication	Proceedings of the 1993 IEEE International Symposium on Information Theory (San Antonio TX, USA, 17-22 January 1993)
Publisher	Institute of Electrical and Electronics Engineers
Pages	66-
Number of pages	1
ISBN (Print)	0-7803-0878-6
DOIs	https://doi.org/10.1109/ISIT.1993.748381
Publication status	Published - 1993

Access to Document

10.1109/ISIT.1993.748381

Cite this

@inproceedings{84c8bb8063094a9b8e1f6c4bc4865714,

title = "Decoding lattice partitions with application to decoding coset codes",

abstract = "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.",

author = "F.W. Sun and {Tilborg, van}, H.C.A.",

year = "1993",

doi = "10.1109/ISIT.1993.748381",

language = "English",

isbn = "0-7803-0878-6",

pages = "66--",

booktitle = "Proceedings of the 1993 IEEE International Symposium on Information Theory (San Antonio TX, USA, 17-22 January 1993)",

publisher = "Institute of Electrical and Electronics Engineers",

address = "United States",

}

Decoding lattice partitions with application to decoding coset codes. / Sun, F.W.; Tilborg, van, H.C.A.
Proceedings of the 1993 IEEE International Symposium on Information Theory (San Antonio TX, USA, 17-22 January 1993). Institute of Electrical and Electronics Engineers, 1993. p. 66-.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Decoding lattice partitions with application to decoding coset codes

AU - Sun, F.W.

AU - Tilborg, van, H.C.A.

PY - 1993

Y1 - 1993

N2 - 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.

AB - 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.

U2 - 10.1109/ISIT.1993.748381

DO - 10.1109/ISIT.1993.748381

M3 - Conference contribution

SN - 0-7803-0878-6

SP - 66-

BT - Proceedings of the 1993 IEEE International Symposium on Information Theory (San Antonio TX, USA, 17-22 January 1993)

PB - Institute of Electrical and Electronics Engineers

ER -

Decoding lattice partitions with application to decoding coset codes

Abstract

Access to Document

Fingerprint

Cite this