Trellis Complexitv Versus the oding Gain of Lattices I1
Vahid Tarokh · 1996
For an arbitrary rational lattice L with gain y, the average number of states (respectively, branches) in any given trellis diagram of I; is bounded below by a function of y. It is proved that this function grows exponentially in y. In the reverse direction, it is proved that given E > 0, for arbitrarily large values of y, there exist lattices of gain y with an average number of branches and states less than exp (y('+')).