Maximal orders in space-time coding: Construction and decoding

2008 International Symposium on Information Theory and its Applications, ISITA2008

Volumn , Issue , 2008, Pages

  Hollanti, Camilla ^a   Ranted, Kalle ^b  

^a TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

^b UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

CODE-WORDS; CODEBOOKS; CYCLIC DIVISION ALGEBRAS; GOLDEN CODE; HANDY TOOLS; LATTICE VECTORS; MATRIX LATTICE; SINGLE VECTORS; SPACE TIME CODE; SPACE TIME CODING; SPEED-UPS; SPHERE DECODERS; STEP-BY-STEP; UPPER BOUND;

INFORMATION THEORY;

DECODING;

EID: 77951110425     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISITA.2008.4895634     Document Type: Conference Paper

References (17)

1. C. Hollanti, J. Lahtonen, and H.-f. (F.) Lu, "Maximal Orders in the Design of Dense Space-Time Lattice Codes", IEEE Trans. Inf. Theory, vol.54, Oct. 2008. http://arxiv.org/abs/0803.2639
2. C. Hollanti and J. Lahtonen, "A New Tool: Constructing STBCs from Maximal Orders in Central Simple Algebras", in Proc. IEEE ITW 2006, pp. 322-326, Punta del Este, March 13-17, 2006.
3. C. Hollanti, J. Lahtonen, K. Ranto, and R. Vehkalahti, "On the Densest MIMO Lattices from Cyclic Division Algebras", to appear in IEEE Trans. Inf. Theory. Preliminary version of has appeared in ISIT 2006. The full manuscript is available at: http://arxiv.org/abs/cs.IT/0703052.
4. 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, pp. 2596-2616, October 2003.
5. F. Oggier, G. Rekaya, J.-C. Belfiore, and E. Viterbo, "Perfect Space-Time Block Codes", IEEE Trans. Inf. Theory, vol.52, pp. 3885-3902, September 2006.
6. A. A. Albert, Structure of Algebras, AMS, 1939.
7. I. Reiner, Maximal Orders, Academic Press, 1975.
8. L. Zheng and D. Tse, "Diversity and Multiplexing: A Fundamental Tradeoff in Multiple-Antenna Channels", IEEE Trans. Inf. Theory, vol.49, pp. 1073-1096, May 2003.
9. G. Ivanyos and L. Ronyai, "Finding maximal orders in semisimple algebras over Q", Computational Complexity, vol. 3, pp. 245-261, 1993.
10. MAGMA homepage, University of Sydney, Australia: http://magma.maths.usyd. edu.au/
11. M. O. Damen, H. El Gamal, and G. Caire, "On Maximum-Likelihood Detection and the Search for the Closest Lattice Point", IEEE Trans. Inf. Theory, vol. 49, pp. 2389-2402, October 2003.
12. E. Viterbo and J. Boutros, "A Universal Lattice Code Decoder for Fading Channel", IEEE Transactions on Information Theory, vol. 45, pp. 1639-1642, July 1999.
13. J. Lahtonen and R. Vehkalahti, "Dense MIMO Matrix Lattices - A Meeting Point for Class Field Theory and Invariant Theory", in Proc. AAECC- 17, Springer LNCS 4851, pp. 247 256. 2007.
14. C. Hollanti, "Code Controlled Sphere Decoding of Four Efficient MISO Lattices", in Proc. ISITA 2006, Seoul, Oct. 29 Nov. 1, 2006.
15. K. Raj Kumar and Giuseppe Caire, "Space-Time Codes from Structured Lattices", to appear in IEEE Trans. Inf. Theory. Available at: http://www.citebase.org/abstract?id=oai:arXiv.org:0804.1811.
16. C. Hollanti and H.-F. Lu, "Construction Methods for Asymmetric and Multi-Block Space-Time Codes", submitted to IEEE Trans. Inf. Theory, Dec. 2007.
17. H.-F. Lu, C. Hollanti, J. Lahtonen, R. Vehkalahti, Y. Hong, and E. Viterbo, "Optimal Code Construcions for Two-User Multiple Access Channels", under preparation.