Skip to main content Accessibility help
  • Print publication year: 2014
  • Online publication date: December 2013

4 - MIMO detection


Detection of MIMO encoded signals, be it for spatial multiplexing or space-time coding or SM, is one of the crucial receiver functions in MIMO wireless communication [1]. Compared to detection in SISO or SIMO communication in fading channels, detection in MIMO communication is more involved. This is because, in addition to fading, the receive antennas encounter spatial interference due to simultaneous transmission from multiple transmit antennas. Efficient detection of signals in the presence of this spatial interference is therefore a demanding task, and sophisticated signal processing algorithms are needed for this purpose. Consequently, design, analysis, and implementation of efficient algorithms for MIMO detection continues to attract the attention of researchers and system developers.

Often, the roots of several MIMO detection algorithms in the literature can be traced to algorithms for multiuser detection (MUD) in CDMA which have been studied since the mid-1980s [2]. This is because CDMA systems and MIMO systems are both described by a linear vector channel model with the same structural format. In the case of a CDMA system the channel matrix is defined by the normalized cross-correlations between the signature sequences of the active users, whereas the channel matrix in a MIMO system is defined by the spatial signatures between the transmit and receive antennas.

[1] D., Tse and P., Viswanath, Fundamentals of Wireless Communication. Cambridge, UK: Cambridge University, 2005.
[2] S., Verdu, Multiuser Detection. Cambridge, UK: Cambridge University Press, 1998.
[3] T., Kailath, H., Vikalo, and B., Hassibi, “MIMO receive algorithms,” in Space-Time Wireless Systems: From Array Processing to MIMO Communications, H., Bolcskei, D., Gesbert, C. B., Papadias, and A., jan van der veen, Eds. Cambridge, UK: Cambridge University Press, 2006, ch. 15.
[4] G. J., Foschini, “Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas,” Bell Labs. Tech. J., vol. 1, no. 2, pp. 41–59, 1996.
[5] P. W., Wolniansky, G. J., Foschini, G. D., Golden, and R. A., Valenzuela, “V-BLAST: an architecture for realizing very high data rates over the rich-scattering wireless channel,” in URSI Intl. Symp. Signals, Systems and Electronics (ISSSE), Sept.-Oct. 1998, pp. 295–300.
[6] R., Kohno, “Pseudo-noise sequences and interference cancellation techniques for spread spectrum systems – spread spectrum theory and techniques in Japan,” IEICE Trans. Commun., vol. E74-B, no. 5, pp. 1083–1092, Jun. 2003.
[7] P., Patel and J., Holtzman, “Analysis of a simple successive interference cancellation scheme in a DS/CDMA system,” IEEE J. Sel. Areas in Commun., vol. 12, no. 5, pp. 796–807, Jun. 1994.
[8] B., Hassibi, “An efficient square-root algorithm for BLAST,” in IEEE ICASSP'2000, Istanbul, vol. 2, Jun. 2000, pp. 737–740.
[9] C. P., Schnoor and M., Euchner, “Lattice basis reduction: improved practical algorithms and solving subset sum problems,” Mathematical Programming, vol. 66, pp. 181–191, 1994.
[10] B., LaMacchia, “Basis reduction algorithms and subset sum problems,” Master's Thesis, MIT, May 1991.
[11] M., Seysen, “Simultaneous reduction of a lattice basis and its reciprocal basis,” Combinatorica, vol. 13, pp. 363–376, 1993.
[12] D., Seethaler, G., Matz, and F., Hlawatsch, “Low complexity MIMO data detection using Seysen's lattice reduction algorithm,” in IEEE ICASSP'2007, Honolulu, HI, Apr. 2007, pp. 53–57.
[13] E., Viterbo and J., Boutros, “A universal lattice code decoder for fading channels,” IEEE Trans. Inform. Theory, vol. 45, no. 5, pp. 1639–1642, Jul. 1999.
[14] 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.
[15] 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.
[16] Y., Wang and K., Roy, “A new reduced complexity sphere decoder with true lattice boundary awareness for multi-antenna systems,” in IEEE ISCAS'2005, Kobe, vol. 5, May 2005, pp. 4963–4966.
[17] L. G., Barbero and J. S., Thompson, “Fixing the complexity of the sphere decoder for MIMO detection,” IEEE Trans. Wireless Commun., vol. 7, no. 6, pp. 2131–2142, Jun. 2008.
[18] P. H., Tan and L. K., Rasmussen, “The application of semidefinite programming for detection in CDMA,” IEEE J. Sel. Areas Commun., vol. 19, no. 8, pp. 1442–1449, Aug. 2001.
[19] P. H., Tan and L. K., Rasmussen, “Multiuser detection in CDMA – a comparison of relaxations, exact, and heuristic search methods,” IEEE Trans. Wireless Commun., vol. 3, no. 5, pp. 1802–1809, Sep. 2004.
[20] N. D., Sidiropoulos and Z.-Q., Luo, “A semidefinite relaxation approach to MIMO detection for high-order QAM constellations,” IEEE Signal Process. Lett., vol. 13, no. 9, pp. 525–528, Sep. 2006.
[21] J., Luo, K. R., Pattipati, P. K., Willett, and F., Hasegawa, “Near-optimal multiuser detection in synchronous CDMA using probabilistic data association,” IEEE Commun. Lett., vol. 5, no. 9, pp. 361–363, Sep. 2001.
[22] D., Pham, K. R., Pattipati, P. K., Willet, and J., Luo, “A generalized probabilistic data association detector for multiantenna systems,” IEEE Commun. Lett., vol. 8, no. 4, pp. 205–207, Apr. 2004.
[23] Y., Kabashima, “A CDMA multiuser detection algorithm on the basis of belief propagation,” J. Phys. A: Math. Gen., vol. 36, pp. 11111–11121, Oct. 2003.
[24] M. N., Kaynak, T. M., Duman, and E. M., Kurtas, “Belief propagation over SISO/MIMO frequency selective fading channels,” IEEE Trans. Wireless Commun., vol. 6, no. 6, pp. 2001–2005, Jun. 2007.
[25] B. M., Hochwald, T. L., Marzetta, and V., Tarokh, “Multiple-antenna channel hardening and its implications for rate feedback and scheduling,” IEEE Trans. Inform. Theory, vol. 50, no. 9, pp. 1893–1909, Sep. 2004.
[26] H. Q., Ngo, E. G., Larsson, and T. L., Marzetta, “Uplink power efficiency of multiuser MIMO with very large antenna arrays,” in Allerton Conf. on Commun., Contr., and Comput., Monticello, IL, Sep. 2011, pp. 1272–1279.
[27] J., Hoydis, S., ten Brink, and M., Debbah, “Massive MIMO in the UL/DL of cellular networks: how many antennas do we need?IEEE J. Sel. Areas in Commun., vol. 31, no. 2, pp. 160–171, Feb. 2013.
[28] K. V., Vardhan, S. K., Mohammed, A., Chockalingam, and B. S., Rajan, “A low-complexity detector for large MIMO systems and multicarrier CDMA systems,” IEEE J. Sel. Areas Commun., vol. 26, no. 3, pp. 473–485, Apr. 2008.
[29] S. K., Mohammed, A., Zaki, A., Chockalingam, and B. S., Rajan, “High-rate spacetime coded large-MIMO systems: low-complexity detection and channel estimation,” IEEE J. Sel. Topics Signal Process., vol. 3, no. 6, pp. 958–974, Dec. 2009.
[30] S. K., Mohammed, A., Chockalingam, and B. S., Rajan, “Low-complexity near-MAP decoding of large non-orthogonal STBCs using PDA,” in IEEE ISIT'2009, Seoul, Jun.-Jul. 2009, pp. 1998–2002.
[31] P., Som, T., Datta, N., Srinidhi, A., Chockalingam, and B. S., Rajan, “Low-complexity detection in large-dimension MIMO-ISI channels using graphical models,” IEEE J. Sel. Topics Signal Process., vol. 5, no. 8, pp. 1497–1511, Dec. 2011.
[32] T., Datta, N. A., Kumar, A., Chockalingam, and B. S., Rajan, “A novel MCMC algorithm for near-optimal detection in large-scale uplink mulituser MIMO systems,” in ITA'2012, San Diego, CA, Feb. 2012, pp. 69–77.
[33] X., Zhu and R. D., Murch, “Performance analysis of maximum-likelihood detection in a MIMO antenna system,” IEEE Trans. Commun., vol. 50, no. 2, pp. 187–191, Feb. 2002.
[34] N., Srinidhi, T., Datta, A., Chockalingam, and B. S., Rajan, “Layered tabu search algorithm for large-MIMO detection and a lower bound on ml performance,” IEEE Trans. Commun., vol. 59, no. 11, pp. 2955–2963, Nov. 2011.
[35] H., Yao and G. W., Wornell, “Lattice-reduction-aided detectors for MIMO communication systems,” in IEEE GLOBECOM'2002, Taipei, vol. 1, Nov. 2002, pp. 424–428.
[36] A. K., Lenstra, H. W., Lenstra, and L., Lovasz, “Factoring polynomials with rational coefficients,” Math. Ann., vol. 261, pp. 515–534, 1982.
[37] M. O., Damen, H., El Gamal, and G., Caire, “On maximum-likelihood detection and the search for the closest lattice point,” IEEE Trans. Inform. Theory, vol. 49, no. 10, pp. 2389–2402, Oct. 2003.