Publications [#336912] of Vahid Tarokh

Papers Published

1. Tarokh, V; Blake, LF, Trellis complexity versus the coding gain of lattices I, Ieee Transactions on Information Theory, vol. 42 no. 6 PART 1 (December, 1996), pp. 1796-1807, Institute of Electrical and Electronics Engineers (IEEE) [doi]
   (last updated on 2023/06/01)

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