By Topic

Trellis complexity versus the coding gain of lattices. II

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
V. Tarakh ; Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada ; I. F. Blake

For pt.I see ibid., vol. 42, no.6, p.1796-1802, 1996. Every rational lattice has a finite trellis diagram which can be employed for maximum-likelihood decoding over the additive white Gaussian noise channel via the Viterbi algorithm. For an arbitrary rational lattice L with gain γ, the average number of states (respectively, branches) in any given trellis diagram of L is bounded below by a function of γ. It is proved that this function grows exponentially in γ. In the reverse direction, it is proved that given ∈>0, for arbitrarily large values of γ, there exist lattices of gain γ with an average number of branches and states less than exp(γ(1+∈)). Trellis diagrams of block codes obtained from truncated convolutional codes are employed to show that, inside the trellis model, the problem of decoding lattices is not much harder than exponential

Published in:

IEEE Transactions on Information Theory  (Volume:42 ,  Issue: 6 )