On the complexity distribution of sphere decoding

IEEE Transactions on Information Theory

Volumn 57, Issue 9, 2011, Pages 5754-5768

  Seethaler, Dominik ^a   Jaldén, Joakim ^b   Studer, Christoph ^c   Bölcskei, Helmut ^d  

^a RobArt   (Austria)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^c Rice University   (United States)

^d ETH ZURICH   (Switzerland)

Author keywords

Closest lattice point problem; complexity distribution; MIMO wireless; random lattices; sphere decoding

Indexed keywords

AVERAGE COMPLEXITY; BASIS MATRIX; COMPLEXITY DISTRIBUTION; INFINITE LATTICES; LATTICE POINTS; LATTICE-REDUCTION; LLL ALGORITHM; PREPROCESSING TECHNIQUES; RANDOM LATTICE; REFINED ANALYSIS; SPHERE DECODING; SYMMETRIC COMPLEXES; V-BLAST ALGORITHM;

ALGORITHMS; DATA COMMUNICATION EQUIPMENT; DATA COMMUNICATION SYSTEMS; DECODING; MIMO SYSTEMS; TRANSFER MATRIX METHOD;

SPHERES;

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

References (36)

1. 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.
2. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in alattice, including a complexity analysis", Math. Comp., vol. 44, pp. 463-471, Apr. 1985.
3. W. H. Mow, "Maximum likelihood sequence estimation from the lattice viewpoint", in Proc. ICCS/ISITA, Singapore, Nov. 1992, vol. 1, pp. 127-131.
4. E. Viterbo and E. Biglieri, "A universal decoding algorithm for lattice codes", in GRETSI 14-ème Colloq., Juan-les-Pins, France, Sep. 1993, pp. 611-614.
5. E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels", IEEE Trans. Inf. Theory, vol. 45, no. 7, pp. 1639-1642, Jul. 1999.
6. 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, no. 10, pp. 2389-2402, Oct. 2003.
7. 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 J. Solid-State Circuits, vol. 40, no. 7, pp. 1566-1577, Jul. 2005.
8. C. Studer, A. Burg, and H. Bölcskei, "Soft-output sphere decoding: Algorithms and VLSI implementation", IEEE J. Sel. Areas Commun., vol. 26, no. 2, pp. 290-300, Feb. 2008.
9. J. Savage, "The distribution of the sequential decoding computation time", IEEE Trans. Inf. Theory, vol. 12, no. 2, pp. 143-147, Apr. 1966.
10. I. M. Jacobs and E. R. Berlekamp, "A lower bound to the distribution of computation for sequential decoding", IEEE Trans. Inf. Theory, vol. 13, no. 2, pp. 167-174, Apr. 1967.
11. B. Hassibi and H. Vikalo, "On the sphere decoding algorithm I. Expected complexity", IEEE Trans. Signal Process., vol. 53, no. 8, pp. 2806-2818, Aug. 2005.
12. H. Vikalo and B. Hassibi, "On the sphere decoding algorithm II. Generalizations, second-order statistics, and applications to communications", IEEE Trans. Signal Process., vol. 53, no. 8, pp. 2819-2834, Aug. 2005.
13. J. Jaldén and B. Ottersten, "On the complexity of sphere decoding in digital communications", IEEE Trans. Signal Process., vol. 53, no. 4, pp. 1474-1484, Apr. 2005.
14. D. Seethaler and H. Bölcskei, "Performance and complexity analysis of infinity-norm sphere-decoding", IEEE Trans. Inf. Theory, vol. 56, no. 3, pp. 1085-1105, Mar. 2010.
15. G. D. Golden, G. J. Foschini, R. A. Valenzuela, and P. W. Wolniansky, "Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture", Electron. Lett., vol. 35, pp. 14-16, Jan. 1999.
16. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups. New York: Springer, 1988.
17. A. Papoulis, Probability, Random Variables, and Stochastic Processes, 3rd ed. New York: McGraw-Hill, 1991.
18. A. D. Murugan, H. El Gamal, M. O. Damen, and G. Caire, "A unified framework for tree search decoding: Rediscovering the sequential decoder", IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 933-953, Mar. 2006.
19. C. Studer, D. Seethaler, and H. Bölcskei, "Finite lattice-size effects in MIMO detection", in Proc. 42nd Asilomar Conf. Signals, Systems, and Computers, Pacific Grove, CA, Oct. 2008, pp. 2032-2037.
20. A. H. Banihashemi and A. K. Khandani, "On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis", IEEE Trans. Inf. Theory, vol. 44, no. 1, pp. 162-171, Jan. 1998.
21. B. M. Hochwald and S. ten Brink, "Achieving near-capacity on a multiple-antenna channel", IEEE Trans. Inf. Theory, vol. 51, no. 3, pp. 389-399, Mar. 2003.
22. R. Böhnke, D. Wübben, V. Kühn, and K. D. Kammeyer, "Reduced complexity MMSE detection for BLAST architectures", in Proc. IEEE Globecom, San Francisco, CA, Dec. 2003, vol. 4, pp. 2258-2262.
23. Handbook of Convex Geometry, P. M. Gruber and J. M. Wills, Eds. Amsterdam, The Netherlands: North Holland, 1993, vol. B.
24. 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.
25. D. Tse and P. Viswanath, Fundamentals of Wireless Communication. Cambridge, U. K.: Cambridge Univ. Press, 2005.
26. Y. Jiang, X. Zheng, and J. Li, "Asymptotic performance analysis of V-BLAST", in Proc. IEEE Globecom, St. Louis, MO, Nov. 2005, vol. 6, pp. 3882-3886.
27. A. M. Tulino and S. Verdú, Random Matrix Theory and Wireless Communications. Hanover, MA: Now Publishers, 2004.
28. M. Abramowitz and I. Stegun, Handbook of Mathematical Functions. New York: Dover, 1965.
29. A. K. Lenstra, H. W. Lenstra, Jr., and L. Lovász, "Factoring polynomials with rational coefficients", Math. Ann., vol. 261, pp. 515-534, 1982.
30. M. Seysen, "Simultaneous reduction of a lattice basis and its reciprocal basis", Combinatorica, vol. 13, pp. 363-376, 1993.
31. D. Wübben, R. Böhnke, J. Rinas, V. Kühn, and K. D. Kammeyer, "Efficient algorithm for decoding layered space-time codes", Electron. Lett., vol. 37, no. 22, pp. 1348-1350, Oct. 2001.
32. H. El Gamal, G. Caire, and M. O. Damen, "Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels", IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 968-985, Jun. 2004.
33. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge, U. K.: Cambridge Univ. Press, 1993.
34. Y. H. Gan, C. Ling, and W. H. Mow, "Complex lattice reduction algorithm for low-complexity MIMO detection", IEEE Trans. Signal Process., vol. 57, no. 7, pp. 2701-2710, Jul. 2009.
35. R. J. Muirhead, Aspects of Multivariate Statistical Theory. Hoboken, NJ: Wiley, 2005.
36. M. Taherzadeh, A. Mobasher, and A. K. Khandani, "Communication over MIMO broadcast channels using lattice-basis reduction", IEEE Trans. Inf. Theory, vol. 53, no. 12, pp. 4567-4582, Dec. 2007.