Trellis complexity versus the coding gain of lattices I

Vahid Tarokh, Ian F. BlakeIEEE Trans. Information Theory 1996 · DOI · OpenReview

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 /spl gamma/. 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 /spl gamma/.
BibTeX
@article{tarokh1996trellis,
  author = {Vahid Tarokh and Ian F. Blake},
  title = {{Trellis complexity versus the coding gain of lattices I}},
  journal = {IEEE Trans. Information Theory},
  year = {1996},
  doi = {10.1109/18.556675},
}

Loading related content...

Figure