Finite lattice-size effects in MIMO detection

Conference Record - Asilomar Conference on Signals, Systems and Computers

Volumn , Issue , 2008, Pages 2032-2037

  Studer, C ^a   Seethaler, D ^a   Bolcskei H ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

DATA DETECTION; FINITE LATTICES; INFINITE LATTICES; LATTICE-REDUCTION; MIMO DETECTION; MULTIPLE-INPUT MULTIPLE-OUTPUT COMMUNICATION SYSTEMS; SIZE EFFECTS; SPHERE DECODING;

COMMUNICATION SYSTEMS; DIFFUSERS (OPTICAL); ELECTRIC REACTORS; MIMO SYSTEMS; MULTIPLEXING;

SIGNAL DETECTION;

EID: 70349686710     PISSN: 10586393     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSSC.2008.5074789     Document Type: Conference Paper

References (19)

1. A. Burg, M. Borgmann, M. Wenk, M. Zellweger, W. Fichtner, and H. Bölcskei, "VLSI implementation of MIMO detection using the sphere decoding algorithm," IEEE Journal of Solid-State Circuits, vol. 40, no. 7, pp. 1566-1577, July 2005.
2. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Math. of Computation, vol. 44, pp. 463-471, Apr. 1985.
3. H. Yao and G. Wornell, "Lattice-reduction-aided detectors for MIMO communication systems," in Proc. IEEE GLOBECOM, vol. 1, Nov. 2002, pp. 424-428.
4. C. Windpassinger and R. F. H. Fischer, "Low-complexity nearmaximum- likelihood detection and precoding for MIMO systems using lattice reduction," in Proc. IEEE Inf. Theory Workshop, Mar. 2003, pp. 345-348.
5. A. K. Lenstra, H. W. Lenstra, and L. Lovász, "Factoring polynomials with rational coefficients," Mathematische Annalen, vol. 261, no. 4, pp. 515-534, Dec. 1982.
6. M. Taherzadeh, A. Mobasher, and A. K. Khandani, "LLL reduction achieves the receive diversity in MIMO decoding," IEEE Trans. on Inf. Theory, vol. 53, no. 12, pp. 4801-4805, Dec. 2007.
7. W. H. Mow, "Maximum likelihood sequence estimation from the lattice viewpoint," Master's thesis, Chinese University of Hong Kong, Dept. of Information Engineering, June 1991.
8. E. Viterbo and E. Biglieri, "A universal decoding algorithm for lattice codes," Colloque sur le Traitement du Signal et ses Applications (GRETSI), vol. 14, pp. 611-614, Sept. 1993.
9. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Trans. on Inf. Theory, vol. 48, no. 8, pp. 2201-2214, Aug. 2002.
10. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge Univ. Press, 1985.
11. A. H. Banihashemi and A. K. Khandani, "On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis," IEEE Trans. on Inf. Theory, vol. 44, no. 1, pp. 162-171, Jan. 1998.
12. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, 3rd ed. Springer, 1999.
13. J. M. Wills, "Bounds for the lattice point enumerator," Geometriae Dedicata, vol. 40, no. 2, pp. 237-244, Nov. 1991.
14. L. Babai, "On Lovász' lattice reduction and the nearest lattice point problem," Combinatorica, vol. 6, no. 1, pp. 1-13, Mar. 1986.
15. R. Kannan, "Minkowski's convex body theorem and integer programming," Math. of Operations Research, vol. 12, no. 3, pp. 415-440, Aug. 1987.
16. D. Wübben, R. Böhnke, J. Rinas, V. Kudie;hn, and K.-D. Kammeyer, "Efficient algorithm for decoding layered space-time codes," IEE Electronics Letters, vol. 37, no. 22, pp. 1348-1350, Oct. 2001.
17. Y. H. Gan and W. H. Mow, "Complex lattice reduction algorithms for low-complexity MIMO detection," in Proc. IEEE GLOBECOM, Nov. 2005, pp. 2953-2957.
18. D. Wudie;bben, R. Böhnke, V. Kudie;hn, and K.-D. Kammeyer, "MMSE-based lattice-reduction for near-ML detection of MIMO systems," in Proc. ITG/IEEE Workshop on Smart Antennas, Mar. 2004, pp. 106-113.
19. M. Taherzadeh and A. K. Mahmoud, "On the limitations of the naive lattice decoding," in Proc. IEEE Int. Symp. on Inf. Theory, June 2007, pp. 201-204.