Performance and complexity analysis of infinity-norm sphere-decoding

IEEE Transactions on Information Theory

Volumn 56, Issue 3, 2010, Pages 1085-1105

  Seethaler, Dominik ^a,c   Bölcskei, Helmut ^b  

^a ETH Zurich ^*  (Austria)

^b ETH ZURICH   (Switzerland)

^c VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Algorithmic complexity; Data detection; Hardware complexity; Infinity norm; Maximum likelihood; Multiple input multiple output (MIMO) wireless

Indexed keywords

ALGORITHMIC COMPLEXITY; DATA DETECTION; HARDWARE COMPLEXITY; INFINITY NORM; MULTIPLE-INPUT-MULTIPLE-OUTPUT;

DECODING; DIFFUSERS (OPTICAL); FADING CHANNELS; MAXIMUM LIKELIHOOD ESTIMATION; PARALLEL PROCESSING SYSTEMS; RAYLEIGH FADING; RECEIVING ANTENNAS;

COMPUTATIONAL COMPLEXITY;

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

References (47)

1. A. Paulraj, R. Nabar, and D. Gore, Introduction to Space-TimeWireless Communications. Cambridge, U.K.: Cambridge Univ. Press, 2003.
2. A. Burg, VLSI Circuits for MIMO Communication Systems. Konstanz: Hartung-Gorre Verlag, 2006.
3. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Math. Comp., vol.44, pp. 463-471, Apr. 1985.
4. W. H. Mow, "Maximum likelihood sequence estimation from the lattice viewpoint," in Proc. ICCS/ISITA 1992, Singapore, Nov. 1992, vol.1, pp. 127-131.
5. 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.
6. 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.
7. 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.
8. 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.
9. 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.
10. B. Hassibi and H. Vikalo, "On the sphere decoding algorithm I. Expected complexity," IEEE Trans. Signal Process., vol.53, pp. 2806-2818, Aug. 2005.
11. H. Kaeslin, Digital Integrated Circuit Design: From VLSI Architectures to CMOS Fabrication. Cambridge, U.K.: Cambridge Univ. Press, 2008.
12. F. Boccardi and G. Caire, "The p-sphere encoder: Peak-power reduction by lattice precoding for the MIMO Gaussian broadcast channel," IEEE Trans. Commun., vol.54, no.11, pp. 2085-2091, Nov. 2006.
13. 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, pp. 2819-2834, Aug. 2005.
14. 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.
15. R. Gowaikar and B. Hassibi, "Statistical pruning for near-maximum likelihood decoding," IEEE Trans. Signal Process., vol.55, pp. 2661-2675, Jun. 2007.
16. J. Jaldén and B. Ottersten, "On the complexity of sphere decoding in digital communications," IEEE Trans. Signal Process., vol.53, pp. 1474-1484, Apr. 2005.
17. A. Papoulis, Probability, Random Variables, and Stochastic Processes, 3rd ed. New York: McGraw-Hill, 1991.
18. D. E. Knuth, "Big omicron and big omega and big theta," Association for Computing Machinery SIGACT News, vol.8, no.2, pp. 18-24, 1976.
19. 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.
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. C. P. Schnorr and M. Euchner, "Lattice basis reduction: Improved practical algorithms and solving subset sum problems," Math. Programming, vol.66, no.2, pp. 181-191, Sep. 1994.
22. K. Su and I. J. Wassell, "A new ordering for efficient sphere decoding," in Proc. IEEE ICC 2005, Seoul, Korea, May 2005, pp. 1906-1910.
23. L. Babai, "On Lovász' lattice reduction and the nearest lattice point problem," Combinatorica, vol.6, pp. 1-13, 1986.
24. C. Windpassinger and R. F. H. Fischer, "Low-complexity near-maximum- likelihood detection and precoding for MIMO systems using lattice reduction," in Proc. IEEE Inf. Theory Workshop, Paris, France, Mar./Apr. 2003, pp. 345-348.
25. V. Tarokh, N. Seshadri, and A. R. Calderbank, "Space-time codes for high data rate wireless communications: Performance criterion and code construction," IEEE Trans. Inf. Theory, vol.44, no.2, pp. 744-765, Mar. 1998.
26. 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.
27. H. Lu, Y. Wang, P. Kumar, and K. Chugg, "Remarks on space-time codes including a new lower bound and an improved code," IEEE Trans. Inf. Theory, vol.49, no.10, pp. 2752-2757, Oct. 2003.
28. S. Loyka and F. Gagnon, "Performance analysis of the V-BLAST algorithm: An analytical approach," IEEE Trans.Wireless Commun., vol.3, no.4, pp. 1326-1337, Jul. 2004.
29. M. Taherzadeh, A. Mobasher, and A. Khandani, "LLL lattice-basis reduction achieves the maximum diversity in MIMO systems," in Proc. IEEE ISIT 2005, Adelaide, Australia, Sep. 2005, pp. 1300-1304.
30. C. Ling, "Towards characterizing the performance of approximate lattice decoding in MIMO communications," in Proc. ITG Conf. Source and Channel Coding, Munich, Germany, Apr. 2006.
31. C. Ling, "Approximate lattice decoding: Primal versus dual basis reduction," in Proc. IEEE ISIT 2006, Seattle, WA, Jul. 2006, pp. 1-5.
32. A. Mobasher and A. K. Khandani, "On the limitations of the naive lattice decoding," in Proc. IEEE ISIT 2007, Nice, France, Jun. 2007, pp. 201-204.
33. C. Windpassinger, L. H.-J. Lampe, and R. F. H. Fischer, "From lattice- reduction-aided detection towards maximum-likelihood detection in MIMO systems," in Proc. IASTED Int. Conf. Wireless and Opt. Commun., Banff, Canada, Jul. 2003, pp. 144-148.
34. J. Jaldén and G. Matz, "MIMO receiver diversity in general fading," in Proc. IEEE ICASSP 2008, Las Vegas, NV, Mar./Apr. 2008, pp. 2837-2840.
35. A. M. Tulino and S. Verdú, Random Matrix Theory and Wireless Communications. Hanover, MA: Now, 2004.
36. J. Behboodian, "On the distribution of a symmetric statistic from a mixed population," Technometrics, vol.14, no.4, pp. 919-923, Nov. 1972.
37. M. O. Damen, A. Chkeif, and J. C. Belfiore, "Lattice code decoder for space-time codes," IEEE Commun. Lett., vol.4, no.5, pp. 161-163, May 2000.
38. J. Jaldén and B. Ottersten, "On the limits of sphere decoding," in Proc. IEEE ISIT 2005, Adelaide, Australia, Sep. 2005, pp. 1691-1695.
39. H. A. David and H. N. Nagaraja, Order Statistics, 3rd ed. Hoboken, NJ: Wiley, 2003.
40. K. Ball, "An elementary introduction to modern convex geometry," in MSRI Book Series, Flavors of Geometry. Cambridge, U.K.: Cambridge Univ. Press, 1997, vol.31, pp. 1-58.
41. Y. H. Gan and W. H. Mow, "Complex lattice reduction algorithms for low-complexity MIMO detection," in Proc. IEEE Globecom 2005, St. Louis, MO, Nov. 2005, vol.5, pp. 2953-2957.
42. R. J. Muirhead, Aspects of Multivariate Statistical Theory. Hoboken, NJ: Wiley, 2005.
43. M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions. New York: Dover, 1965.
44. W. Gautschi, "The incomplete gamma functions since Tricomi," in Tricomi's Ideas and Contemporary Applied Mathematics. Rome, Italy: Atti dei Convegni Lincei, Accademia Nationale dei Lincei, 1998, pp. 203-237.
45. M. Merkle, "Some inequalities for the chi square distribution function and the exponential function," Arch. Math., vol.60, no.5, pp. 451-458, 1993.
46. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
47. M. Bagnoli and T. Bergstrom, "Log-concave probability and its applications," Econom. Theory, vol.26, no.2, pp. 445-469, Aug. 2005.