Maximal orders in the design of dense space-time lattice codes

IEEE Transactions on Information Theory

Volumn 54, Issue 10, 2008, Pages 4493-4510

  Hollanti, Camilla ^a,b   Lahtonen, Jyrki ^a,c   Lu, Hsiao Feng ^d,e  

^a UNIVERSITY OF TURKU   (Finland)

^b TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

^c NOKIA RESEARCH CENTER   (United States)

^d NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

^e NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Algebra; Construction industry; Cyclic division algebras (CDAs); Decoding; Dense lattices; Gain; Indexes; Lattices; Maximal orders; Multiple input multiple output (MIMO) channels; Multiple input single output (MISO) channels; Number fields; Quaternions; Space time block codes (STBCs); Sphere decoding

Indexed keywords

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

References (49)

1. J.-C. Guey, M. P. Fitz, M. R. Bell, and W. Y. Kuo, "Signal design for transmitter diversity wireless communication systems over Rayleigh fading channels," in Proc. IEEE Veh. Technol. Conf., 1996, vol. 47, pp. 136-140.
2. S. M. Alamouti, "A simple transmit diversity technique for wireless communication," IEEE J. Sel. Areas Commun., vol. 16, no. 8, pp. 1451-1458, Oct. 1998.
3. J. Hiltunen, C. Hollanti, and J. Lahtonen, "Four antenna space-time lattice constellations from division algebras," in Proc. IEEE Int. Symp. Inf. Theory, Chicago, IL, Jul. 2, 2004, pp. 338-338.
4. J. Hiltunen, C. Hollanti, and J. Lahtonen, "Dense full-diversity matrix lattices for four antenna MISO channel," in Proc. IEEE Int. Symp. Inf. Theory, Adelaide, Australia, Sep. 9, 2005, pp. 1290-1294.
5. 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.
6. B. A. Sethuraman, B. S. Rajan, and V. Shashidhar, "Full-diversity, high-rate space-time block codes from division algebras," IEEE Trans. Inf. Theory, vol. 49, no. 10, pp. 2596-2616, Oct. 2003.
7. J.-C. Belfiore and G. Rekaya, "Quaternionic lattices for space-time coding," in Proc. Inf. Theory Workshop, Paris, France, Apr. 4, 2003, pp. 267-270.
8. J.-C. Belfiore, G. Rekaya, and E. Viterbo, in Proc. IEEE Int. Symp. Inf. Theory, Chicago, IL, Jul. 2, 2004, pp. 308-308.
9. H. Yao and G. W. Wornell, "Achieving the full MIMO diversity-multiplexing frontier with rotation-based space-time codes," in Proc. Allerton Conf. Commun. Control Comput., Oct. 2003, pp. 400-409.
10. J.-C. Belfiore, G. Rekaya, and E. Viterbo, "Algebraic 3 × 3, 4 × 4 and 6 × 6 space-time codes with nonvanishing determinants," in Proc. IEEE Int. Symp. Inf. Theory Appl., Parma, Italy, Oct. 13, 2004.
11. J.-C. Belfiore, F. Oggier, G. Rekaya, and E. Viterbo, "Perfect space-time block codes," IEEE Trans. Inf. Theory, vol. 52, no. 9, pp. 3885-3902, Sep. 2006.
12. T. Kiran and B. S. Rajan, "STBC-schemes with nonvanishing determinant for certain number of transmit antennas," IEEE Trans. Inf. Theory vol. 51, no. 8, pp. 2984-2992, Aug. 2005.
13. V. Shashidhar, B. S. Rajan, and B. A. Sethuraman, "STBC's using capacity achieving designs from crossed-product division algebras," in Proc. IEEE Int. Conf. Commun., Paris, France, Jun. 20-24, 2004, pp. 827-831.
14. V. Shashidhar, B. S. Rajan, and B. A. Sethuraman, "Information-loss-less STBCs from crossed-product algebras," IEEE Trans. Inf. Theory, vol. 52, no. 9, pp. 3913-3935, Sep. 2006.
15. P. Elia, K. R. Kumar, P. V. Kumar, H.-F. Lu, and S. A. Pawar, "Explicit space-time codes achieving the diversity-multiplexing gain tradeoff," IEEE Trans. Inf. Theory, vol. 52, no. 9, pp. 3869-3884, Sep. 2006.
16. G. Wang and X.-G. Xia, "On optimal multi-layer cyclotomic space-time code designs," IEEE Trans. Inf. Theory, vol. 51, no. 3, pp. 1102-1135, Mar. 2005.
17. M. O. Damen, H. E. Gamal, and N. C. Beaulieu, "Linear threaded algebraic space-time constellations," IEEE Trans. Inf. Theory, vol. 49, no. 10, pp. 2372-2388, Oct. 2003.
18. M. O. Damen and H. E. Gamal, "Universal space-time coding," IEEE Trans. Inf. Theory, vol. 49, no. 5, pp. 1097-1119, May 2003.
19. P. Dayal and K. Varanasi, "Algebraic space-time codes with full diversity and low peak-to-mean power ratio," in Proc. Commun. Theory Symp. IEEE GLOBECOM, San Francisco, CA, Dec. 2003, pp. 1946-1951.
20. O. Tirkkonen, A. Boariu, and A. Hottinen, "Minimal nonorthogonality rate 1 space-time block code for 3+ TX antennas," in Proc. IEEE Int. Symp. Spread Spectrum Tech. Appl., Sep. 6-8, 2000, vol. 2, pp. 429-432.
21. L. Zheng and D. Tse, "Diversity and multiplexing: A fundamental tradeoff in multiple-antenna channels," IEEE Trans. Inf. Theory, vol. 49, no. 5, pp. 1073-1096, May 2003.
22. V. Tarokh, N. Seshadri, and A. R. Calderbank, "Space-time codes for high data rate wireless communications: Performance criterion and code construction," IEEE Trans. Inf. Theory, vol. 44, no. 2, pp. 744-765, Mar. 1998.
23. I. Stewart and D. Tall, Algebraic Number Theory. London, U.K.: Chapman & Hall, 1979.
24. V. Tarokh, H. Jafarkhani, and A. R. Calderbank, "Space-time block codes from orthogonal designs," IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 1456-1467, Jul. 1999.
25. O. Tirkkonen, "Optimizing space-time block codes by constellation rotations," in Proc. Finnish Wireless Commun. Workshop, Oct. 2001, pp. 59-60.
26. A. Hottinen and O. Tirkkonen, "Square-matrix embeddable space-time block codes for complex signal constellations," IEEE Trans. Inf. Theory, vol. 48, no. 2, pp. 384-395, Feb. 2002.
27. 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.
28. B. Hassibi, B. M. Hochwald, A. Shokrollah, and W. Sweldens, "Representation theory for high-rate multiple-antenna code design," IEEE Trans. Inf. Theory, vol. 47, no. 6, pp. 2335-2364, Sep. 2001.
29. F. E. Oggier and E. Viterbo, "Algebraic number theory and code design for Rayleigh fading channels," Found. Trends Commun. Inf. Theory, vol. 1, no. 3, Dec. 2004.
30. H. Jafarkhani, "A quasiorthogonal space-time block code," Proc. IEEE Wireless Commun. Netw. Conf., vol. 1, pp. 42-45, Sep. 2000.
31. J. H. Conway and N. J. A. Sloane, Sphere Tackings, Lattices and Groups. New York: Springer-Verlag, 1988.
32. D. Allcock, "New complex- and quaternion-hyperbolic reflection groups," Duke Math. J., vol. 103, pp. 303-333, Jun. 2000.
33. C. Hollanti, J. Lahtonen, K. Ranto, and R. Vehkalahti, "Optimal matrix lattices for MIMO codes from division algebras," in Proc. IEEE Int. Symp. Inf. Theory, Seattle, WA, Jul. 9-14, 2006, pp. 783-787.
34. N. Jacobson, Basic Algebra II. San Francisco, CA: Freeman, 1980.
35. A. A. Albert, Structure of Algebras. New York: Amer. Math. Soc., 1939.
36. I. Reiner, Maximal Orders. London, U.K.: Academic, 1975.
37. C. Hollanti and J. Lahtonen, "A new tool: Constructing STBC's from maximal orders in central simple algebras," in Proc. IEEE Inf. Theory Workshop, Punta del Este, Uruguay, Mar. 13-17, 2006, pp. 322-326.
38. s lattice: A new 4 × 4 space-time code with nonvanishing determinant," in Proc. IEEE Int. Symp. Inf. Theory, Seattle, WA, Jul. 14, 2006, pp. 1006-1010.
39. M. Pohst, "On the computation of lattice vectors of minimal length, successive minima and reduced basis with applications," in Proc. ACM Special Interest Group Symbolic Algebraic Manipulation, 1981, vol. 15, pp. 37-44.
40. E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channel," IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 1639-1642, Jul. 1999.
41. 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.
42. M. O. Damen, A. Chkeif, and J.-C. Belfiore, "Lattice codes decoder for space-time codes," IEEE Commun. Lett., vol. 4, no. 5, pp. 161-163, May 2000.
43. M. O. Damen, H. E. Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," IEEE Trans. Inf. Theory, vol. 49, no. 10, pp. 2389-2402, Oct. 2003.
44. H.-f. (F.) Lu, "Explicit constructions of multi-block space-time codes that achieve the diversity-multiplexing tradeoff," in Proc. IEEE Int. Symp. Inf. Theory, Seattle, WA, 2006, pp. 1149-1153.
45. S. Yang and J.-C. Belfiore, "Optimal space-time codes for the MIMO amplify-and-forward cooperative channel," IEEE Trans. Inf. Theory vol. 53, no. 2, pp. 647-663, Feb. 2007.
46. C. Hollanti and H.-f. (F.) Lu, "Normalized minimum determinant calculation for multi-block and asymmetric space-time codes," in Applied Algebra, Algebraic Algorithms and Error Correcting Codes. Berlin, Germany: Springer-Verlag, 2007, vol. LNCS 4851, pp. 227-237.
47. L. Rónyai, "Algorithmic properties of maximal orders in simple algebras over Q," Computat. Complex. 2, pp. 225-243, 1992.
48. G. Ivanyos and L. Rónyai, "On the complexity of finding maximal orders in algebras over Q," Computat. Complex. 3, pp. 245-261, 1993.
49. Univ. Sydney, "MAGMA computational algebra system," Sydney, Australia [Online]. Available: http://magma.maths.usyd.edu.au/ magma/htmlhelp/text835.htm#8121