MIMO receive algorithms

Space-Time Wireless Systems: From Array Processing to MIMO Communications

Volumn 9780521851053, Issue , 2006, Pages 302-321

  Kailath, Thomas ^a   Vikalo, Haris ^b   Hassibi, Babak ^b  

^a STANFORD UNIVERSITY   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GAUSSIAN NOISE (ELECTRONIC); MAXIMUM LIKELIHOOD; NONLINEAR PROGRAMMING; WIRELESS TELECOMMUNICATION SYSTEMS;

ADDITIVE GAUSSIAN NOISE; AVERAGE PROBABILITY OF ERROR; DIMENSIONAL VECTORS; LINEAR AND TIME INVARIANTS; LINEAR COMBINATIONS; MULTI-ANTENNA WIRELESS; NON-LINEAR OPTIMIZATION; TRANSMITTED DATA SYMBOL;

SIGNAL RECEIVERS;

EID: 84926130212     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511616815.016     Document Type: Chapter

References (25)

1. Agrell, E., Eriksson, T., Vardy, A., and Zeger, K. (2002). Closest point search in lattices. IEEE Trans. Inf. Theory, 48 (8), 2001-2214.
2. Ajtai, M. (1998). The shortest vector problem in L^ is NP-hard for randomized reductions. In Proc. 30th Ann. ACM Symp. Theory of Comput., 10-19.
3. Banihashemi, A. H. and Khandani, A. K. (1998). On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis. IEEE Trans. Inf. Theory, 44 (2), 162-171.
4. Brutel, C. and Boutros, J. (1999). Euclidean space lattice decoding for joint detection in CDMA systems. In Proc. 1999 IEEE Inf. Theory and Commun. Workshop, 129.
5. Conway, J. H. and Sloane, N. J. (1993). Sphere Packings, Lattices and Graphs (Springer-Verlag).
6. Damen, M. O., Chkeif, A., and Belfiore, J. C. (2000). Lattice codes decoder for space-time codes. IEEE Commun. Lett., 4, 161-163.
7. Damen, M. O., Gamal, H. E., and Caire, G. (2003). On maximum-likelihood detection and the search for the closest lattice point. IEEE Trans. Inf. Theory, 49 (10), 2389-2402.
8. Fincke, U. and Pohst, M. (1985). Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Math. Comp., 44 (170), 463-471.
9. Foschini, G. J. (1996). Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas. Bell Labs Tech. J., 1 (2), 41-59.
10. Grotschel, M., Lovasz, L., and Schriver, A. (1993). Geometric Algorithms and Combinatorial Optimization (Springer Verlag), second edn.
11. Hassibi, B. (1999). An efficient square-root algorithm for BLAST. Submitted to IEEE Trans. Signal Process. URL http://mars.bell-labs.com.
12. Hassibi, B. and Hochwald, B. (2002). High-rate codes that are linear in space and time. IEEE Trans. Inf. Theory, 48 (7), 1804-1824.
13. Hassibi, B. and Vikalo, H. (2005). On the sphere decoding algorithm I. Expected complexity. IEEE Trans. Signal Process., 53, 2806-2818.
14. Hochwald, B. M. and ten Brink, S. (2003). Achieving near-capacity on a multiple-antenna channel. IEEE Trans. Commun., 51 (3), 389-399.
15. Kailath, T., Sayed, A. H., and Hassibi, B. (2000). Linear Estimation (Prentice-Hall, Englewood Cliffs, NJ).
16. Kannan, R. (1983). Improved algorithms on integer programming and related lattice problems. In Proc. 15th Ann. ACM Symp. Theory of Comput., 193-206.
17. Korkin, A. and Zolotarev, G. (1873). Sur les formes quadratiques. Math. Ann., 6, 366-389.
18. Lagarias, J. C, Lenstra, H. W., and Schnorr, C. P. (1990). Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal. Combinatorica, 10, 333 348.
19. Pohst, M. (1981). On the computation of lattice vectors of minimal length, successive minima and reduced basis with applications. ACM SIGSAM Bull., 15, 37-44.
20. Schnorr, C. P. and Euchner, M. (1994). Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program., 66 (2), 181-199.
21. Stefanov, A. and Duman, T. M. (2001). Turbo-coded modulation for systems with transmit and receive antenna diversity over block fading channels: system model, decoding approaches, and practical considerations. IEEE J. Sei. Areas Commun., 19 (5).
22. Verdu, S. (1998). Multiuser Detection (Cambridge Univ. Press).
23. Vikalo, H. (2003). Sphere Decoding Algorithms for Digital Communications. Ph.D. thesis, Stanford University.
24. Vikalo, H., Hassibi, B., and Kailath, T. (2004). Iterative decoding for MIMO channels via modified sphere decoder. IEEE Trans. Wireless Commun., 3 (6).
25. Viterbo, E. and Boutros, J. (2000). A universal lattice code decoder for fading channels. IEEE Trans. Inf. Theory, 45, 1639-1642.