DocumentCode
3072056
Title
New upper bounds on trellis complexity of lattices
Author
Banihashemi, Amir H. ; Blake, Ian F.
Author_Institution
Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada
fYear
1997
fDate
29 Jun-4 Jul 1997
Firstpage
435
Abstract
For trellis diagrams of lattices, we derive a range of upper bounds on different complexity measures (state, edge, and label group complexities, and also the number of distinct paths). These constructive bounds which are in terms of dimension, and the successive minima or the determinant of the lattice, both outperform and generalize the similar results of Tarokh and Vardy (1996)
Keywords
block codes; computational complexity; decoding; block codes; complexity measures; determinant; dimension; edge complexity; label group complexity; lattice decoding; state complexity; successive minima; trellis complexity; upper bounds; Block codes; Decoding; H infinity control; Integral equations; Laboratories; Lattices; Milling machines; Postal services; Scholarships; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location
Ulm
Print_ISBN
0-7803-3956-8
Type
conf
DOI
10.1109/ISIT.1997.613372
Filename
613372
Link To Document