DocumentCode
1316455
Title
Trellis complexity versus the coding gain of lattices. I
Author
Tarokh, Vahid ; Blake, Ian F.
Author_Institution
Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada
Volume
42
Issue
6
fYear
1996
fDate
11/1/1996 12:00:00 AM
Firstpage
1796
Lastpage
1807
Abstract
The best possible tradeoff between the coding gain and trellis complexity for lattices is studied. Three trellis complexity functions are defined for lattices as a measure of minimum trellis decoding complexity per dimension required for achieving a coding gain γ. The properties of these functions are studied from an analytic perspective. It is also shown that the trellis decoding complexity per dimension is lower-bounded by an explicit power of γ
Keywords
computational complexity; lattice theory; maximum likelihood decoding; trellis codes; coding gain; complexity functions; lattices; lower-bound; minimum trellis decoding complexity; trellis complexity; Block codes; Convolutional codes; Councils; Gain measurement; Galois fields; Laboratories; Lattices; Linear code; Maximum likelihood decoding; Modulation coding;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.556675
Filename
556675
Link To Document