[1] S. M. Alamouti, "A simple transmit diversity technique for
wireless communications," IEEE Journal on Selected Areas
Communications, vol. 16, pp. 1451-1458, October 1998.
[2] K. Azarian, H. El Carnal, and P. Schniter, "On the
achievable diversity-multiplexing tradeoff in half-duplex cooperative
channels," IEEE Transactions on Information Theory, vol. 51, no.
12, December 2005.
[3] E. Bayer-Fluckiger, 'Lattices and number felds,"
Contemporary Mathematics, vol. 241, pp. 69-84, 1999.
[4] E. Bayer-Fluckiger, F. Oggier, and E. Viterbo, "New
algebraic constructions of rotated [Z.sup.n]-lattice constellations for
the Rayleigh fading channel," IEEE Transactions on Information
Theory, vol. 50, no. 4, pp. 702-714, 2004.
[5] J.-C. Belfre and A. M. Cipriano, 'Space-time coding for
non-coherent channels," in Space-Time Wireless Systems: From Array
Processing to MIMO Communications, (H. Boelcskei, D. Gesbert, C.
Papadias, and A. J. van der Veen, eds.), ch. 10, Cambridge University
Press, June 2006.
[6] J.-C. Before and G. Rskaya, "Quaternionic lattices for
space-time coding," in Proceedings of ITW 2003, Paris, April 2003.
[7] J.-C. Belfre, G. Rskaya, and E. Viterbo, 'The golden code:
A 2 x 2 full-rate space-time code with non-vanishing determinants,"
IEEE Transactions on Information Theory, vol. 51, no. 4, April 2005.
[8] E. Biglieri, J. Proakis, and S. Shamai, 'Fading channels:
Information-theoretic and communications aspects," IEEE
Transactions on Information Theory, vol. 44, no. 6, 1998.
[9] H. Bolcskei and A. Paulraj, 'Space-frequency codes for
broadband fading channels," in Proceedings of ISIT 2001, p. 219,
Washington DC, June 2001.
[10] D. Champion, J.-C. Belfere, G. Rskaya, and E. Viterbo,
'Partitionning the golden code: A framework to the design of
space-time coded modulation," Canadian Workshop on Information
Theory, Montreal, 2006.
[11] J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices
and Groups. New York: Springer-Verlag, 1988.
[12] M. O. Damen, K. Abed-Meraim, and J.-C. Belfere, 'Diagonal
algebraic space-time block codes," IEEE Transactions on Information
Theory, vol. 48, pp. 628-636, March 2002.
[13] M. O. Damen, A. Chkeif, and J.-C. Belfere, 'Lattice code
decoder for space-time codes," Communications Letters, vol. 4, pp.
161-163, May 2000.
[14] M. O. Damen, A. Tewfk, and J.-C. Belfere, 'A construction
of a space-time code based on number theory," IEEE Transactions on
Information Theory, vol. 48, pp. 753-760, March 2002.
[15] P. Dayal and M. K. Varanasi, 'An optimal two transmit
antenna space-time code and its stacked extensions," in Proceedings
of Asilomar Conference on Signals, Systems and Computers, 2003.
[16] P. Dayal and M. K. Varanasi, 'Distributed QAM-based
space-time block codes for efficient cooperative multiple-access
communication," submitted to IEEE Transactions on Information
Theory, accepted for publication, March 2006.
[17] H. El Carnal, G. Caire, and M. O. Damen, 'Lattice coding
and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO
Channels," IEEE Transactions on Information Theory, vol. 50, no. 6,
pp. 968-985, 2004.
[18] H. El Carnal and M. Damen, "Universal space-time
coding," IEEE Transactions on Information Theory, vol. 49, no. 5,
May 2003.
[19] P. Elia, P. V. Oggier, and F. Kumar, 'Asymptotically
optimal cooperative wireless networks with reduced signaling
complexity," Special Issue on the IEEE Journal on Selected Areas in
Communications on Cooperative Communications and Networking, vol. 25,
no. 2, February 2007.
[20] P. Elia, K. R,aj Kumar, S. A. Pawar, P. Vijay Kumar, and H.-F.
Lu, 'Explicit space-time codes achieving the diversity-multiplexing
gain tradeoff," IEEE Transactions on Information Theory, vol. 52,
no. 9, September 2006.
[21] P. Elia, B. A. Sethuraman, and P. V. Kumar, 'Perfect
space-time codes with minimum and non-minimum delay for any number of
antennas," International Conference on Wireless Networks,
Communications and Mobile Computing, 2005.
[22] G. D. Forney, R. G. Callager, G. R. Lang, F. M. Longstaff, and
S. U. Qureshi, 'Efficient modulation for band-limited
channels," IEEE Journal on Selected Areas in Communications, vol.
2, pp. 632-647, September 1984.
[23] G. D. Forney and L.-F. Wei, 'Multidimensional
constellations. I. Introduction, figures of merit, and generalized cross
constellations," IEEE Journal on Selected Areas Communications,
vol. 7, pp. 877-892, August 1989.
[24] G. J. Foschini, 'Layered space-time architecture for
wireless communication in a fading environment when using multi-element
antennas," Bell Labs Techical Journal, pp. 41-59, 1996.
[25] G. J. Foschini and M. J. Cans, 'On limits of wireless
communication in a fading environment when using multiple
antennas," Wireless Personal Communications, pp. 311-335, March
1998.
[26] A. R. Hammons and H. El Gamal, 'On the theory of
space-time codes for PSK modulation," IEEE Transactions on
Information Theory, vol. 46, no. 2, pp. 524-542, October 2000.
[27] B. Hassibi and B. M. Hochwald, 'High-rate codes that are
linear in space and time," IEEE Transactions on Information Theory,
vol. 48, pp. 1804-1824, July 2002.
[28] B. Hassibi and H. Vikalo, 'On sphere decoding algorithm.
I. Expected complexity," IEEE Transactions on Signal Processing,
vol. 53, pp. 2806-2818, August 2005.
[29] B. M. Hochwald and T. L. Marzetta, "Unitary space-time
modulation for multiple-antenna communications in Rayleigh flat
fading," IEEE Transactions on Information Theory, vol. 46, pp.
543-564, March 2000.
[30] C. Hollanti and J. Lahtonen, 'Maximal orders in the
design of dense space-time lattice codes," submitted to IEEE
Transactions on Information Theory, September 2006.
[31] C. Hollanti, J. Lahtonen, K. Ranto, and R. Vehkalahti,
'Optimal matrix lattices for MIMO codes from division
algebras," in Proceedings of ISIT, Seattle, 2006.
[32] Y. Hong, E. Viterbo, and J.-C. Belfere, "Golden
space-time trellis coded modulation," IEEE Transactions on
Information Theory, vol. 53, no. 5, pp. 1689-1705, May 2007.
[33] A. Hottinen, O. Tirkkonen, and R. Wichman, Multi-Antenna
Transceiver Techniques for 3G and Beyond. John Wiley & Sons Ltd,
2003.
[34] Y. Jing and B. Hassibi, 'Distributed space-time-coded
protocols for exploiting cooperative diversity in wireless
network," IEEE Transactions on Information Theory, vol. 49, October
2003.
[35] Y. Jing and B. Hassibi, 'Distributed space-time coding in
wireless relay networks," IEEE Transactions on Wireless
Communications, vol. 5, December 2006.
[36] T. Kiran and B. Sundar Rajan, 'STBC-schemes with
non-vanishing determinant for certain number of transmit antennas,"
IEEE Transactions on Information Theory, vol. 51, no. 8, August 2005.
[37] T. Kiran and B. Sundar Rajan, 'Distributed space-time
codes with reduced decoding complexity," in Proceedings of ISIT,
Seattle, 2006.
[38] X.-B. Liang, 'Orthogonal designs with maximal
rates," IEEE Transactions on Information Theory, vol. 49, no. 10,
pp. 2468-2503, October 2003.
[39] H. Liao and X.-G. Xia, 'Some designs of full rate
Space-Time codes with nonvanishing determinant," IEEE Transactions
on Information Theory, vol. 53, no. 8, pp. 2898-2908, 2007.
[40] H.-F. Lu and P. Vijay Kumar, "A unifed construction of
space-time codes with optimal rate-diversity tradeoff," IEEE
Transactions on Information Theory, vol. 51, no. 5, pp. 1709-1730, 2005.
[41] F. Oggier, 'On the optimality of the golden code,"
in Proceedings of the Information Theory Workshop, Chengdu, 2006.
[42] F. Oggier and B. Hassibi, "An algebraic coding scheme for
wireless relay networks with multiple-antenna nodes," submitted to
IEEE Transactions on Signal Processing, March 2006.
[43] F. Oggier and E. Viterbo, "Algebraic number theory and
code design for R,ayleigh fading channels," Foundations and Trends
in Communications and Information Theory, vol. 1, 2004.
[44] F. E. Oggier, G. Rskaya, J.-C. Belfere, and E. Viterbo,
'Perfect space time block codes," IEEE Transactions on
Information Theory, vol. 52, no. 9, September 2006.
[45] R. S. Pierce, Associative Algebras. New York: Springer-Verlag,
1982. [46] K. R,aj Kumar and G. Caire, 'Construction of structured
LaST codes," in Proceedings of ISIT, pp. 2834-2838, Seattle, 2006.
[47] K. R,aj Kumar, S. A. Pawar, P. Elia, P. Vijay Kumar, and B.
Sethuraman, 'Codes achieving the DM tradeoff of the MIMO-AR,Q
Channel," in Proceedings of IEEE International Symposium on
Information Theory, pp. 901-905, Adelaide, September 2005.
[48] P. Samuel, Theorie algebrique des nombres. Hermann, 1971.
[49] W. Scharlau, Quadratic and Hermitian Forms. Springer Verlag,
1985.
[50] B. A. Sethuraman and B. Sundar Rajan, "An algebraic
description of orthogonal designs and the uniqueness of the alamouti
code," in Proceedings of the Global Telecommunications Conference,
2002.
[51] B. A. Sethuraman and B. Sundar Rajan, 'Full-rank,
full-rate STBCs from division algebras," in Proceedings of the
Information Theory Workshop, Bangalore, 2002.
[52] B. A. Sethuraman, B. Sundar Rajan, and V. Shashidhar,
'Full-diversity, highrate space-time block codes from division
algebras," IEEE Transactions on Information Theory, vol. 49, no.
10, October 2003.
[53] V. Shashidhar, B. Sundar Rajan, and B. A. Sethuraman,
Information-lossless space-time block codes From crossed-product
algebras," IEEE Transactions on Information Theory, vol. 52, no. 9,
September 2006.
[54] I. N. Stewart and D. O. Tall, Algebraic Number Theory. Chapman
and Hall, 1979.
COPYRIGHT 2007 Now Publishers,
Inc. Reproduced with permission of the copyright holder. Further reproduction or distribution is prohibited without permission.
Copyright 2007, Gale Group. All rights
reserved. Gale Group is a Thomson Corporation Company.
NOTE: All illustrations and photos have been removed from this article.