Achieving a vanishing SNR gap to exact lattice decoding at a subexponential complexity

IEEE Transactions on Information Theory

Volumn 58, Issue 6, 2012, Pages 3692-3707

  Singh, Arun Kumar ^a   Elia, Petros ^a   Jaldén, Joakim ^b  

^a EURECOM   (France)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Computational complexity; detection; lattice decoding; MIMO; performance complexity tradeoff

Indexed keywords

CHANNEL DIMENSION; CODEWORD; COMPUTATIONAL RESOURCES; ERROR PERFORMANCE; EXACT SOLUTION; FADING STATISTICS; HIGH RATE; LATTICE CODES; LATTICE DECODING; LATTICE REDUCTION; PERFORMANCE-COMPLEXITY TRADEOFF; SHARP CONTRAST; SPHERE DECODERS; SPHERE DECODING; TIMEOUT POLICY;

COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; ERROR DETECTION; MIMO SYSTEMS;

COMPUTATIONAL COMPLEXITY;

EID: 84861359992     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2012.2190709     Document Type: Conference Paper

References (48)

1. E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels," IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 1639-1642, Jul. 1999.
2. D. Micciancio, "The hardness of the closest vector problem with preprocessing," IEEE Trans. Inf. Theory, vol. 47, no. 3, pp. 1212-1215, Mar. 2001.
3. 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.
4. V. Pauli and L. Lampe, "On the complexity of sphere decoding for differential detection," IEEE Trans. Inf. Theory, vol. 53, no. 4, pp. 1595-1603, Apr. 2007.
5. M. Taherzadeh and A. K. Khandani, "On the limitations of the naïve lattice decoding," IEEE Trans. Inf. Theory, vol. 56, no. 10, pp. 4820-4826, Oct. 2010.
6. A. Ghasemmehdi and E. Agrell, "Faster recursions in sphere decoding," IEEE Trans. Inf. Theory, vol. 57, no. 6, pp. 3530-3536, Jun. 2011.
7. D. Seethaler, J. Jaldén, C. Studer, and H. Bölcskei, "On the complexity distribution of sphere decoding," IEEE Trans. Inf. Theory, vol. 57, no. 9, pp. 5754-5768, Sep. 2011.
8. J. Jaldén and P. Elia, "Sphere decoding complexity exponent for decoding full rate codes over the quasi-static MIMO channel," IEEE Trans. Inf. Theory, Feb. 2011, arXiv:1102.1265.
9. L. Zheng and D. N. C. Tse, "Diversity and multiplexing:Afundamental tradeoff in multiple-antenna channels," IEEE Trans. Inf. Theory, vol. 49, no. 5, pp. 1073-1096, May 2003.
10. A. D. Murugan, H. E. 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.
11. H. E. 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.
12. J. Jaldén and P. Elia, "The complexity of sphere decoding perfect codes under a vanishing gap to ML performance," in Proc. IEEE Int. Symp. Inf. Theory, Jul.-Aug. 2011, pp. 2836-2840.
13. J. Jaldén and P. Elia, "DMT optimality of LR-aided linear decoders for a general class of channels, lattice designs, and system models," IEEE Trans. Inf. Theory, vol. 56, no. 10, pp. 4765-4780, Oct. 2010.
14. J. Pan and W.-K. Ma, "A lagrangian dual relaxation approach to ML MIMO detection: Reinterpreting regularized lattice decoding," in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process., Prague, Czech Republic, May 2011, pp. 3084-3087.
15. M. O. Damen, H. E. 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-2401, Oct. 2003.
16. D. Seethaler, J. Jaldén, C. Studer, and H. Bölcskei, "Tail behavior of sphere-decoding complexity in random lattices," in Proc. IEEE Int. Symp. Inf. Theory, Jun. 2009, pp. 729-733.
17. A. K. Lenstra, H. W. Lenstra, and L. Lovász, "Factoring polynomials with rational coefficients," Matematische Annalen, vol. 261, no. 4, pp. 515-534, Dec. 1982.
18. J. Radon, "Lineare scharen orthogonaler matrizen," in Abh. Math. Sem. Hamburg I. Cambridge, U.K.: Cambridge Univ. Press, 1923.
19. H. E. Gamal and M. O. Damen, "Universal space-time coding," IEEE Trans. Inf. Theory, vol. 49, no. 5, pp. 1097-1119, May 2003.
20. B. A. Sethuraman, B. S. Rajan, and V. Shashidhar, "Full-diversity, high-rate, space-time block codes from division algebras," IEEE Trans. Inf. Theory, vol. 49, no. 10, pp. 2596-2616, Oct. 2003.
21. S. Tavildar and P. Viswanath, "Approximately universal codes over slow-fading channels," IEEE Trans. Inf. Theory, vol. 52, no. 7, pp. 3233-3258, Jul. 2006.
22. P. Elia, K. R. Kumar, S. A. Pawar, P. Vijay Kumar, and H.-F. Lu, "Explicit space-time codes achieving the diversity-multiplexing gain tradeoff," IEEE Trans. Inf. Theory, vol. 52, no. 9, pp. 3869-3884, Sep. 2006.
23. F. Oggier, G. Rekaya, J.-C. Belfiore, and E. Viterbo, "Perfect space-time block codes," IEEE Trans. Inf. Theory, vol. 52, no. 9, pp. 3885-3902, Sep. 2006.
24. L. Zhao, W. Mo, Y. Ma, and Z. Wang, "Diversity and multiplexing tradeoff in general fading channels," IEEE Trans. Inf. Theory, vol. 53, no. 4, pp. 1547-1557, Apr. 2007.
25. A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications, 2nd ed. New York: Springer-Verlag, 1998.
26. H. Yao and G. W. Wornell, "Lattice-reduction-aided detectors for MIMO communication systems," in Proc. IEEE Global Conf. Commun., Taipei, Taiwan, Nov. 2002, pp. 424-428.
27. 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. 2003, pp. 345-348.
28. D. Wübben, D. Seethaler, J. Jaldén, and G. Matz, "Lattice reduction: A survey with applications to wireless communication," IEEE Signal Process. Mag., vol. 28, no. 3, pp. 70-91, Jun. 2011.
29. C. Ling, "On the proximity factors of lattice reduction-aided decoding," IEEE Trans. Signal Process., vol. 59, no. 6, pp. 2795-2808, Jun. 2011.
30. J. Jaldén, D. Seethaler, and G. Matz, "Worst-and average-case complexity of LLL lattice reduction in MIMO wireless systems," in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process., Las Vegas, NV, Apr. 2008, pp. 2685-2688.
31. P. Elia and J. Jaldén, "General DMT optimality of LR-aided linear MIMO-MAC transceivers with worst-case complexity at most linear in sum-rate," in Proc. IEEE Inf. Theory Workshop, Cairo, Egypt, Jan. 2010, pp. 1-5.
32. L. Babai, "On Lovász' lattice reduction and the nearest lattice point problem," Combinatorica, vol. 6, no. 1, pp. 1-13, 1986.
33. S. Loyka and G. Levin, "Finite-SNR diversity-multiplexing tradeoff via asymptotic analysis of large MIMO systems," IEEE Trans. Inf. Theory, vol. 56, no. 10, pp. 4781-4792, Oct. 2010.
34. M. El-Khamy, H. Vikalo, B. Hassibi, and R. McEliece, "Performance of sphere decoding of block codes," IEEE Trans. Commun., vol. 57, no. 10, pp. 2940-2950, Oct. 2009.
35. M. Hansen, B. Hassibi, A. G. Dimakis, and W. Xu, "Near-optimal detection in MIMO systems using Gibbs sampling," in Proc. IEEE Int. Conf. Commun., Honolulu, HI, Dec. 2009, pp. 1-6.
36. 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.
37. C. Studer and H. Bölcskei, "Soft-input soft-output single tree-search sphere decoding," IEEE Trans. Inf. Theory, vol. 56, no. 10, pp. 4827-4842, Oct. 2010.
38. J. Goldberger and A. Leshem, "MIMO detection for high-order QAM based on a Gaussian tree approximation," IEEE Trans. Inf. Theory, vol. 57, no. 8, pp. 4973-4982, Aug. 2011.
39. M. Samuel and M. Fitz, "Iterative sphere detectors for imperfect channel state information," IEEE Trans. Commun., vol. 59, no. 10, pp. 2796-2807, Oct. 2011.
40. S. Liu, C. Ling, and D. Stehle, "Decoding by sampling: A randomized lattice algorithm for bounded distance decoding," IEEE Trans. Inf. Theory, vol. 57, no. 9, pp. 5933-5945, Sep. 2011.
41. Z. Chengwei, C. Xuezheng, J. McAllister, and R.Woods, "Real-valued fixed-complexity sphere decoder for high dimensional QAM-MIMO systems," IEEE Trans. Signal Process., vol. 59, no. 9, pp. 4493-4499, Sep. 2011.
42. T. Datta, N. Kumar, A. Chockalingam, and B. S. Rajan, "A novel MCMC algorithm for near-optimal detection in large-scale uplink mulituser MIMO systems," in Proc. Inf. Theory Appl. Workshop, Feb. 2012.
43. J. W. Choi, B. Shim, and A. C. Singer, "Efficient soft-input soft-output tree detection via an improved path metric," IEEE Trans. Inf. Theory, vol. 58, no. 3, pp. 1518-1533, Mar. 2012.
44. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge, U.K.: Cambridge Univ. Press, 1985.
45. V. Raghavan, A. Sayeed, and N. Boston, "When is Limited Feedback for Transmit Beamforming Beneficial?," in Proc. Int. Symp. Inf. Theory, 2005, pp. 1544-1548.
46. A. Tulino and S. Verdtu, "Random matrix theory and wireless communications," Found. Trends Commun. Inf. Theory, vol. 1, pp. 1-182, Jun. 2004.
47. M. Taherzadeh, A. Mobasher, and A. K. Khandani, "LLL reduction achieves the receive diversity in MIMO decoding," IEEE Trans. Inf. Theory, vol. 53, no. 12, pp. 4801-4805, Dec. 2007.
48. D. Wübben, R. Bohnke, V. Kuhn, and K.-D. Kammeyer, "Near-maximum-likelihood detection of MIMO systems using MMSE-based lattice reduction," in Proc. IEEE Int. Conf. Commun., Paris, France, Jun. 2004, pp. 798-802.