Trellis complexity and minimal trellis diagrams of lattices

IEEE Transactions on Information Theory

Volumn 44, Issue 5, 1998, Pages 1829-1847

  Banihashemi, Amir H ^a,b,c   Blake, Lan F ^a,b,c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b CARLETON UNIVERSITY   (Canada)

^c HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Korkin zolotarev reduced basis, lattices, minimal trellis, successive minima, trellis complexity, trellis decoding

Indexed keywords

ALGORITHMS; DECODING;

KORKIN-ZOLOTAREV REDUCED BASIS;

TRELLIS CODES;

EID: 0032163459     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.705562     Document Type: Article

References (40)

1. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, vol. IT-20, pp. 284-287, 1974.
2. A. H. Banihashemi, "Decoding complexity and trellis structure of lattices," Ph.D. dissertation, E&CE Dept., Univ. Waterloo, Waterloo, Ont., Canada, 1997.
3. A. H. Banihashemi and I. F. Blake, "On the trellis complexity of root lattices and their duals," submitted to IEEE Trans. Inform. Theory, Apr. 1997.
4. A. H. Banihashemi and A. K. Khandani, "On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis," IEEE Trans. Inform. Theory, vol. 44, pp, 162-171, Jan. 1998.
5. E. Biglieri and A. Spalvieri, "Performance evaluation of coded modulation schemes based on binary lattices," IEEE Trans. Commun., vol. 43, pp. 269-276, 1995.
6. J. Boutros, E. Viterbo, C. Rastello, and J.-C. Belfiore, "Good lattice constellations for both Rayleigh fading and Gaussian channels," IEEE Trans. Inform. Theory, vol. 42, pp. 502-518, Mar. 1996.
7. A. R. Calderbank and N. J. A. Sloane, "New trellis codes based on lattices and codes," IEEE Trans. Inform. Theory, vol. IT-33, pp. 177-195, Mar. 1987.
8. F. Chen, Z. Gao, and J. Villasenor, "Lattice vector quantization of generalized Gaussian sources," IEEE Trans. Inform. Theory, vol. 43, pp. 92-103, Jan. 1997.
9. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, 2nd ed. New York: Springer-Verlag, 1993.
10. R. de Buda, "Some optimal codes have structure," IEEE J. Select. Areas Commun., vol. 7, pp. 893-899, Aug. 1989.
11. M. V. Eyuboglu and G. D. Forney, Jr., "Lattice and trellis quantization with lattice- and trellis-bounded codebooks-High-rate theory for memoryless sources," IEEE Trans. Inform. Theory, vol. 39, pp. 46-59, Jan. 1993.
12. J. Feigenbaum, G. D. Forney, Jr., B. H. Markus, R. J. McEliece, and A. Vardy, "Introduction to the Special Issue on Codes and Complexity," IEEE Trans. Inform. Theory, vol. 42, pp. 1649-1657, Nov. 1996.
13. G. D. Forney, Jr., "Final report on a coding system design for advanced solar missions," Contract NAS2-3637, NASA Ames Res. Ctr., Moffet Field, CA, Dec. 1967.
14. _, "Coset codes-Part II: Binary lattices and related codes," IEEE Trans. Inform. Theory, vol. 34, pp. 1152-1187, Sept. 1988.
15. _, "Density/length profiles and trellis complexity of lattices," IEEE Trans. Inform. Theory, vol. 40, pp. 1753-1772, Nov. 1994.
16. _, "Approaching the capacity of the AWGN channel with coset codes and multilevel coset codes," Sept. 1996, preprint.
17. _, private communication.
18. G. D. Forney, Jr., R. G. Gallager, G. R. Lang, F. M. Longstaff, and S. U. Qureshi, "Efficient modulation for band-limited channels," IEEE J. Select. Areas Commun., vol. 2, pp. 632-647, Sept. 1984.
19. 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, Sept. 1993.
20. P. M. Gruber and C. G. Lekkerkerker, Geometry of Numbers, 2nd ed. Amsterdam, The Netherlands: North-Holland, Elsevier, 1987.
21. G. B. Horn and F. R. Kschischang, "On the intractability of permuting a block code to minimize trellis complexity," IEEE Trans. Inform. Theory, vol. 42, pp. 2042-2048, Nov. 1996.
22. R. Kannan, "Minkowski's convex body theorem and integer programming," Math. Operations Res., vol. 12, no. 3, pp. 415-440, Aug. 1987.
23. A. Korkin and G. Zolotarev, "Sur les formes quadratiques," Math. Ann. 6, pp. 366-389, 1873.
24. F. R. Kschischang, "The trellis structure of maximal fixed-cost codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1828-1838, Nov. 1996.
25. J. C. Lagarias, H. W. Lenstra, and C. P. Schnorr, "Korkin Zolotarev bases and successive minima of a lattice and its reciprocal," Combinatorica W, pp. 333-348, 1990.
26. T. Linder, C. Schlegel, and K. Zeger, "Corrected proof of de Buda's theorem," IEEE Trans. Inform. Theory, vol. 39, pp. 1735-1737, Sept. 1993.
27. F. J. Mac Williams and N. J. A. Sloane, The Theory of Error-Correcting Codes, 2nd ed. Amsterdam, The Netherlands: North-Holland, 1978.
28. J. L. Massey, "Foundation and methods of channel encoding," in Proc. Int. Conf. Information Theory and Systems (Berlin, Germany, 1978), NTG-Fachberichte, vol. 65, pp. 148-157.
29. R. J. McEliece, "On the BCJR trellis for linear block codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1072-1092, July 1996.
30. G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization. New York: Wiley, 1988.
31. C. P. Schnorr, "A hierarchy of polynomial time lattice basis reduction algorithms," Theor. Comp. Sci., vol. 53, pp. 201-224, 1987.
32. A. Schrijver, Theory of Linear and Integer Programming. New York: Wiley, 1986.
33. V. Tarokh and I. F. Blake, "Trellis complexity versus the coding gain of lattices I," IEEE Trans. Inform. Theory, vol. 42, pp. 1796-1807, Nov. 1996.
34. _, "Trellis complexity versus the coding gain of lattices II," IEEE Trans. Inform. Theory, vol. 42, pp. 1808-1816, Nov. 1996.
35. V. Tarokh and A. Vardy, "Upper bounds on trellis complexity of lattices," IEEE Trans. Inform. Theory, vol. 43, pp. 1294-1300, July 1997.
36. R. Urbanke and B. Rimoldi, "Lattice codes can achieve capacity on the AWGN channel," submitted to IEEE Trans. Inform. Theory, Sept. 1995.
37. 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, Nov. 1996.
38. 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.
39. R. Zamir and M. Feder, "On lattice quantization noise," IEEE Trans. Inform. Theory, vol. 42, pp. 1152-1159, July 1996.
40. "Special Issue on Codes and Complexity," IEEE Trans. Inform. Theory, vol. 42, pt. I, pp. 1649-2064, Nov. 1996.