Scholars@Duke

Trellis complexity versus the coding gain of lattices I

Publication ,  Journal Article
Tarokh, V; Blake, LF
Published in: IEEE Transactions on Information Theory
December 1, 1996
Published version (DOI)

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 γ. © 1996 IEEE.

Duke Scholars

Vahid Tarokh
Author Vahid Tarokh Electrical and Computer Engineering

Published In

IEEE Transactions on Information Theory

DOI

10.1109/18.556675

ISSN

0018-9448

Publication Date

December 1, 1996

Volume

42

Issue

6 PART 1

Start / End Page

1796 / 1807

Related Subject Headings

  • Networking & Telecommunications
  • 4613 Theory of computation
  • 4006 Communications engineering
  • 1005 Communications Technologies
  • 0906 Electrical and Electronic Engineering
  • 0801 Artificial Intelligence and Image Processing
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Tarokh, V., & Blake, L. F. (1996). Trellis complexity versus the coding gain of lattices I. IEEE Transactions on Information Theory, 42(6 PART 1), 1796–1807. https://doi.org/10.1109/18.556675
Tarokh, V., and L. F. Blake. “Trellis complexity versus the coding gain of lattices I.” IEEE Transactions on Information Theory 42, no. 6 PART 1 (December 1, 1996): 1796–1807. https://doi.org/10.1109/18.556675.
Tarokh V, Blake LF. Trellis complexity versus the coding gain of lattices I. IEEE Transactions on Information Theory. 1996 Dec 1;42(6 PART 1):1796–807.
Tarokh, V., and L. F. Blake. “Trellis complexity versus the coding gain of lattices I.” IEEE Transactions on Information Theory, vol. 42, no. 6 PART 1, Dec. 1996, pp. 1796–807. Scopus, doi:10.1109/18.556675.
Tarokh V, Blake LF. Trellis complexity versus the coding gain of lattices I. IEEE Transactions on Information Theory. 1996 Dec 1;42(6 PART 1):1796–1807.

Published In

IEEE Transactions on Information Theory

DOI

10.1109/18.556675

ISSN

0018-9448

Publication Date

December 1, 1996

Volume

42

Issue

6 PART 1

Start / End Page

1796 / 1807

Related Subject Headings

  • Networking & Telecommunications
  • 4613 Theory of computation
  • 4006 Communications engineering
  • 1005 Communications Technologies
  • 0906 Electrical and Electronic Engineering
  • 0801 Artificial Intelligence and Image Processing