Upper bounds on trellis complexity of lattices

IEEE Transactions on Information Theory

Volumn 43, Issue 4, 1997, Pages 1294-1300

  Tarokh, Vahid ^a,b   Vardy, Alexander ^a,c  

^a IEEE   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c University of Illinois at Urbana Champaign   (United States)

Author keywords

Coding gain; Lattices; Trellis complexity; Trellis decoding

Indexed keywords

BLOCK CODES; COMPUTATIONAL COMPLEXITY; THEOREM PROVING; TRELLIS CODES;

CODING GAIN;

DECODING;

EID: 0031185608     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.605598     Document Type: Article

References (20)

1. E. Biglieri and A. Spalvieri, "Performance evaluation of coded modulation schemes based on binary lattices," IEEE Trans. Commun., vol. 43, pp. 269-276, 1995.
2. n," SIAM J. Discr. Math., vol. 9, pp. 597-601, 1996.
3. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups. New York: Springer-Verlag, 1988.
4. _, "Low-dimensional lattices V: Integral coordinates for integral lattices," Proc. Roy. Soc. London, vol. A426, pp. 211-232, 1989.
5. G. D. Forney, Jr., "The Viterbi algorithm," Proc. IEEE, vol. 61, pp. 268-278, 1973.
6. _, "Coset codes II: Binary lattices and related codes," IEEE Trans. Inform. Theory, vol. 34, pp. 1152-1187, 1988.
7. _, "Dimension/length profiles and trellis complexity of lattices," IEEE Trans. Inform. Theory, vol. 40, pp. 1753-1772, 1994.
8. _, personal communication, July 1996.
9. G. D. Forney, Jr. and M. D. Trott, "The dynamics of group codes: State spaces, trellis diagrams and canonical encoders," IEEE Trans. Inform. Theory, vol. 39, pp. 1491-1513, 1993.
10. P. M. Gruber and C. G. Lekkerkerker, Geometry of Numbers, 2nd ed. New York: Elsevier, 1987.
11. G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. Oxford, U.K.: Oxford Univ. Press, 1979.
12. S. Lang, "Conjectured Diophantine estimates on elliptic curves," in Collection of Papers Dedicated to I. R. Shafarevich. Boston, MA: Birkhauser, 1983.
13. J. L. Massey, "Foundation and methods of channel encoding," in Proc. Int. Conf. on Information Theory and Systems. Berlin, Germany: NTG-Fachberichte, vol. 65, 1978, pp. 148-157.
14. H.-V. Niemeier, "Definite quadratische Formen der Dimension 24 und Diskriminante l," J. Number Theory, vol. 5, pp. 142-178, 1973.
15. V. Tarokh and I. F. Blake, "Trellis complexity versus the coding gain of lattices I," IEEE Trans. Inform. Theory, vol. 42, pp. 1796-1807, 1996.
16. _, "Trellis complexity versus the coding gain of lattices II," IEEE Trans. Inform. Theory, vol. 42, pp. 1808-1816, 1996.
17. V. Tarokh, A. Vardy, and K. Zeger, "Sequential decoding of lattice codes," preprint.
18. A. Vardy, "Trellis structure of block codes," in Handbook of Coding Theory, R. A. Brualdi, W. C. Huffman, and V. Pless, Eds. Amsterdam, The Netherlands: Elsevier, to be published.
19. A. Vardy and F. R. Kschischang, "Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis," IEEE Trans. Inform. Theory, vol. 42, pp. 2027-2033, 1996.
20. J. K. Wolf, "Efficient maximum-likelihood decoding of linear block codes using a trellis," IEEE Trans. Inform. Theory, vol. IT-24, pp. 76-80, 1978.