The bases associated with trellises of a lattice
It is well known that the trellises of lattices can be employed to decode efficiently. It was proved in [1] and [2] that if a lattice L has a finite trellis under the coordinate system {W-i}(i=1)(n) then there must exist a basis (b(1), b(2),..., b(n)) of L such that W-i span(b(i)) for 1 <= i <= n. In this letter, we prove this important result in a completely different method, and give an efficient method to compute all bases of this type.
trellises lattices dual lattices viterbi algorithm