Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2015, Article ID 201369, 8 pages
http://dx.doi.org/10.1155/2015/201369
Research Article

MIMO Detection for High Order QAM by Canonical Dual Approach

1School of Business Administration, Southwestern University of Finance and Economics, Chengdu 611130, China
2Department of Industrial Engineering & Management, National Chiao Tung University, Hsinchu 300, Taiwan

Received 25 October 2014; Accepted 23 March 2015

Academic Editor: Panayotis Takis Mathiopouloss

Copyright © 2015 Ye Tian and Jr-Fong Dang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. Tse and P. Viswanath, Fundamentals of Wireless Communication, Cambridge University Press, Cambridge, UK, 2005.
  2. W.-K. Ma, C.-C. Su, J. Jalden, T.-H. Chang, and C.-Y. Chi, “The equivalence of semidefinite relaxation MIMO detectors for higher-order QAM,” IEEE Journal on Selected Topics in Signal Processing, vol. 3, no. 6, pp. 1038–1052, 2009. View at Publisher · View at Google Scholar · View at Scopus
  3. S. Verdú, Multiuser Detection, Cambridge University Press, Cambridge, UK, 1998.
  4. M. O. Damen, H. El Gamal, and G. Caire, “On maximum-likelihood detection and the search for the closest lattice point,” IEEE Transactions on Information Theory, vol. 49, no. 10, pp. 2389–2402, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. S. Verdú, “Computational complexity of optimum multiuser detection,” Algorithmica, vol. 4, no. 3, pp. 303–312, 1989. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. H. El Gamal, G. Caire, and M. Damen, “Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels,” IEEE Transactions on Information Theory, vol. 50, no. 6, pp. 968–985, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. A. K. Singh, P. Elia, and J. Jaldèn, “Achieving a vanishing SNR gap to exact lattice decoding at a subexponential complexity,” IEEE Transactions on Information Theory, vol. 58, no. 6, pp. 3692–3707, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. M. Taherzadeh and A. K. Khandani, “On the limitations of the naive lattice decoding,” IEEE Transactions on Information Theory, vol. 56, no. 10, pp. 4820–4826, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. S. Liu, C. Ling, and D. Stehlè, “Decoding by sampling: a randomized lattice algorithm for bounded distance decoding,” IEEE Transactions on Information Theory, vol. 57, no. 9, pp. 5933–5945, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. L. Luzzi, D. Stehlè, and C. Ling, “Decoding by embedding: correct decoding radius and DMT optimality,” IEEE Transactions on Information Theory, vol. 59, no. 5, pp. 2960–2973, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. D. Wübben, D. Seethaler, J. Jaldèn, and G. Matz, “Lattice reduction,” IEEE Signal Processing Magazine, vol. 28, no. 3, pp. 70–91, 2011. View at Publisher · View at Google Scholar · View at Scopus
  12. 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 Transactions on Information Theory, vol. 56, no. 10, pp. 4765–4780, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. J. Jaldèn and B. Ottersten, “On the complexity of sphere decoding in digital communications,” IEEE Transactions on Signal Processing, vol. 53, no. 4, pp. 1474–1484, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. P. H. Tan and L. K. Rasmussen, “The application of semidefinite programming for detection in CDMA,” IEEE Journal on Selected Areas in Communications, vol. 19, no. 8, pp. 1442–1449, 2001. View at Publisher · View at Google Scholar · View at Scopus
  15. W.-K. Ma, T. N. Davidson, K. M. Wong, and P.-C. Ching, “A block alternating likelihood maximization approach to multiuser detection,” IEEE Transactions on Signal Processing, vol. 52, no. 9, pp. 2600–2611, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. M. Kisialiou and Z.-Q. Luo, “Performance analysis of quasi-maximum-likelihood detector based on semi-definite programming,” in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '05), vol. 3, pp. III433–III436, March 2005. View at Publisher · View at Google Scholar · View at Scopus
  17. A. Wiesel, Y. C. Eldar, and S. Shamai, “Semidefinite relaxation for detection of 16-QAM signaling in MIMO channels,” IEEE Signal Processing Letters, vol. 12, no. 9, pp. 653–656, 2005. View at Publisher · View at Google Scholar · View at Scopus
  18. N. D. Sidiropoulos and Z.-Q. Luo, “A semidefinite relaxation approach to MIMO detection for high-order QAM constellations,” IEEE Signal Processing Letters, vol. 13, no. 9, pp. 525–528, 2006. View at Publisher · View at Google Scholar · View at Scopus
  19. Z. Mao, X. Wang, and X. Wang, “Semidefinite programming relaxation approach for multiuser detection of QAM signals,” IEEE Transactions on Wireless Communications, vol. 6, no. 12, pp. 4275–4279, 2007. View at Publisher · View at Google Scholar · View at Scopus
  20. E. Viterbo and J. Boutros, “A universal lattice code decoder for fading channels,” IEEE Transactions on Information Theory, vol. 45, no. 5, pp. 1639–1642, 1999. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. J. Goldberger and A. Leshem, “MIMO detection for high-order QAM based on a Gaussian tree approximation,” IEEE Transactions on Information Theory, vol. 57, no. 8, pp. 4973–4982, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. J. Pan, W.-K. Ma, and J. Jaldèn, “MIMO detection by Lagrangian dual maximum-likelihood relaxation: reinterpreting regularized lattice decoding,” IEEE Transactions on Signal Processing, vol. 62, no. 2, pp. 511–524, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. D. Y. Gao, Duality Principles in Nonconvex Systems: Theory, Methods and Applications, vol. 39 of Nonconvex Optimization and its Applications, Springer, Berlin, Germany, 2000. View at Publisher · View at Google Scholar · View at MathSciNet
  24. D. Y. Gao, “Canonical duality theory and solutions to constrained nonconvex quadratic programming,” Journal of Global Optimization, vol. 29, no. 4, pp. 377–399, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  25. D. Y. Gao, “Solutions and optimality criteria to box constrained nonconvex minimization problems,” Journal of Industrial and Management Optimization, vol. 3, no. 2, pp. 293–304, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  26. D. Y. Gao, L. T. Watson, D. R. Easterling, W. I. Thacker, and S. C. Billups, “Solving the canonical dual of box- and integer-constrained nonconvex quadratic programs via a deterministic direct search algorithm,” Optimization Methods & Software, vol. 28, no. 2, pp. 313–326, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. V. Latorre and D. Y. Gao, “Canonical dual solutions to nonconvex radial basis neural network optimization problem,” Neurocomputing, vol. 134, pp. 189–197, 2014. View at Publisher · View at Google Scholar · View at Scopus
  28. X. Zhou, D. Y. Gao, and C. Yang, “Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems,” Applied Mathematics and Computation, vol. 227, pp. 246–255, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  29. S.-C. Fang, D. Y. Gao, R.-L. Sheu, and S.-Y. Wu, “Canonical dual approach to solving 0-1 quadratic programming problems,” Journal of Industrial and Management Optimization, vol. 4, no. 1, pp. 125–142, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  30. Z. Wang, S.-C. Fang, D. Y. Gao, and W. Xing, “Global extremal conditions for multi-integer quadratic programming,” Journal of Industrial and Management Optimization, vol. 4, no. 2, pp. 213–225, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  31. Z. Wang, S.-C. Fang, D. Y. Gao, and W. Xing, “Canonical dual approach to solving the maximum cut problem,” Journal of Global Optimization, vol. 54, no. 1, pp. 341–351, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  32. M. Grant and S. Boyd, CVX: Matlab Software for Disciplined Programming, Version 1.2, 2010, http://cvxr.com/cvx/.