TRELLIS COMPLEXITY VERSUS THE CODING GAIN OF LATTICES .1.

Authors
TAROKH V BLAKE IF
Citation
V. Tarokh et If. Blake, TRELLIS COMPLEXITY VERSUS THE CODING GAIN OF LATTICES .1., IEEE transactions on information theory, 42(6), 1996, pp. 1796-1807
Citations number
25
Categorie Soggetti
Information Science & Library Science","Engineering, Eletrical & Electronic
Journal title
IEEE transactions on information theory → ACNP
ISSN journal
00189448
Volume
42
Issue
6
Year of publication
1996
Part
1
Pages
1796 - 1807
Database
ISI
SICI code
0018-9448(1996)42:6<1796:TCVTCG>2.0.ZU;2-E
Abstract
The best possible tradeoff between the coding gain and trellis complex ity for lattices is studied, Three trellis complexity functions are de fined for lattices as a measure of minimum trellis decoding complexity per dimension required for achieving a coding gain gamma. The propert ies of these functions are studied from an analytic perspective, It is also shown that the trellis decoding complexity per dimension is lowe r-bounded by an explicit power of gamma.