An algebraic family of complex lattices for fading channels with application to space-time codes

IEEE Transactions on Information Theory

Volumn 51, Issue 12, 2005, Pages 4184-4202

  Dayal, Pranav ^a,b   Varanasi, Mahesh K ^a  

^a UCB 450   (United States)

^b QUALCOMM INC   (United States)

Author keywords

Algebraic number theory; Energy minimization; Fading channels; Lattices; Lenstra Lenstra Lov sz (LLL) algorithm; Modulation diversity; Number fields; Product distance; Signal space diversity; Space time coding; Successive minima (SM)

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); DIVERSITY RECEPTION; ENCODING (SYMBOLS); MATRIX ALGEBRA; MODULATION; NUMBER THEORY; NUMERICAL METHODS; PROBABILITY; RAYLEIGH FADING; SIGNAL TO NOISE RATIO;

ALGEBRAIC NUMBER THEORY; ENERGY MINIMIZATION; FADING CHANNELS; FULL MODULATION DIVERSITY; LENSTRA-LENSTRA-LOVASZ (LLL) ALGORITHM; NUMBER FIELD SEARCH ALGORITHM; PRODUCT DISTANCE; SIGNAL SPACE DIVERSITY; SPACE-TIME CODING; SUCCESSIVE MINIMA (SM);

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 29144497940     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2005.858923     Document Type: Article

References (30)

1. J. Boutros and E. Viterbo, "Signal space diversity: A power- and bandwidth-efficient diversity technique for the Rayleigh fading channel," IEEE Trans. Inf. Theory, vol. 44, no. 4, pp. 1453-1467, Jul. 1998.
2. X. Giraud and J.-C. Belfiore, "Constellations matched to the Rayleigh fading channels," IEEE Trans. Inf. Theory, vol. 42, no. 1, pp. 106-115, Jan. 1996.
3. J. Boutros, E. Viterbo, C. Rastello, and J.-C. Belfiore, "Good lattice constellations for both Rayleigh fading and Gaussian channels," IEEE Trans. Inf. Theory, vol. 42, no. 2, pp. 502-518, Mar. 1996.
4. V. M. DaSilva and E. S. Sousa, "Fading-resistant modulation using several transmitter antennas," IEEE Trans. Commun., vol. 45, no. 10, pp. 1236-1244, Oct. 1997.
5. X. Giraud, E. Boutillon, and J.-C. Belfiore, "Algebraic tools to build modulation schemes for fading channels," IEEE Trans. Inf. Theory, vol. 43, no. 3, pp. 938-952, May 1997.
6. Y. Xin, Z. Wang, and G. B. Giannakis, "Space-time diversity systems based on linear constellation precoding," IEEE Trans. Wireless Commun., vol. 2, no. 2, pp. 294-309, Mar. 2003.
7. M. O. Damen, K. Abed-Meraim, and J.-C. Belfiore, "Diagonal algebraic space-time block codes," IEEE Trans. Inf. Theory, vol. 48, no. 3, pp. 628-636, Mar. 2002.
8. E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels," IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 1639-1642, Jul. 1999.
9. M. O. Damen, "Joint coding/decoding in a multiple access system, application to mobile communications," Ph.D. dissertation, École Nationale Supérieure des Télécommunications, Paris, France, 1999.
10. H. El Gamal and M. O. Damen, "Universal space-time coding," IEEE Trans. Inf. Theory, vol. 49, no. 5, pp. 1097-1119, May 2003.
11. N. Prasad and M. K. Varanasi, "D-BLAST lattice codes for MIMO block Rayleigh fading channels," in Proc. Allerton Conf. on Communication, Control, and Computing, Monticello, IL, Oct. 2002.
12. N. Prasad and M. K. Varanasi, "Optimizing the performance of d-blast lattice codes for MIMO fading channels," in Proc. IEEE Intl. Conf. Personal Wireless Communications, New Delhi, India, Dec. 2002, pp. 61-65.
13. P. W. Wolniansky, G. J. Foschini, G. D. Golden, and R. A. Valenzuela, "V-BLAST: An architecture for realizing very high data rates over the rich-scattering wireless channel," in Proc. Int. Symp. Signals, Systems and Electronics, Pisa, Italy, Sep. 1998, pp. 295-300.
14. P. Morandi, Field and Galois Theory. New York: SpringerVerlag, 1996.
15. J. Esmonde and M. R. Murty, Problems in Algebraic Number Theory. New York: Springer-Verlag, 1999.
16. D. A. Marcus, Number Fields. New York: Springer-Verlag, 1977.
17. H. Cohen, Computational Algebraic Number Theory. New York: Springer-Verlag, 1993.
18. Z. I. Borevich and I. R. Shafarevich, Number Theory. Orlando, FL: Academic, 1966.
19. C. Lamy and J. Boutros, "On random rotations diversity and minimum MSE decoding of lattices," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1584-1589, Jul. 2000.
20. M. Pohst and H. Zassenhaus, Algorithmic Algebraic Number Theory. Cambridge, U.K.: Cambridge Univ. Press, 1989.
21. J. W. S. Cassels, An Introduction to the Geometry of Numbers, 2nd ed. Berlin, Germany: Springer-Verlag, 1971.
22. J. Blomer, "Closest vectors, successive minima, and dual HKZ-bases of lattices," in Proc. 17th ICALP (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2000, vol. 1853,, pp. 248-259.
23. M. Pohst, "On the computation of lattice vectors of minimal length, successive minima and reduced basis with application," ACM SIGSAM, vol. 15, pp. 37-44, 1981.
24. J. Conway and N. J. Sloane, Sphere Packings, Lattices and Groups. New York: Springer-Verlag, 1988.
25. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Trans. Inf. Theory, vol. 48, no. 8, pp. 2201-2214, Aug. 2002.
26. A. K. Lenstra, H. W. Lenstra Jr, and L. Lovász, "Factoring polynomials with rational coefficients," Math. Ann., vol. 261, pp. 515-534, 1982.
27. M. Olivier, J. Buchmann, D. Ford, M. Pohst, F. Diaz, A. Schwarz, and P. Letard. Number felds database. [Online] ftp://pari.math.u-bordeaux.fr/ pub/numberfields
28. J. Kluners and G. Malle. A Database for Number Fields. [Online] http://www.mathematik.uni-kassel.de/~klueners/minimum/miuimum.html
29. M. Pohst. KANT/KASH: Computational Algebraic Number Theory/KAnt SHell. [Online]. Available: http://www.math.tu-berlin.de/~kant/kash.html
30. M. Daberkow, C. Fieker, J. Kluners, M. Pohst, K. Roegner, and K. Wildanger, "Kant v4," J. Symbolic Comp., vol. 24, no. 3/4, pp. 267-283, Sep. 1997.