Journal of Applied Mathematics

Volume 2015, Article ID 201369, 8 pages

http://dx.doi.org/10.1155/2015/201369

## MIMO Detection for High Order QAM by Canonical Dual Approach

^{1}School of Business Administration, Southwestern University of Finance and Economics, Chengdu 611130, China^{2}Department 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.

#### Abstract

We develop a canonical dual approach for solving the MIMO problem. First, a special linear transformation is introduced to reformulate the original problem into a constrained quadratic programming problem. Then, we derive a canonical dual problem which is piecewise continuous problem with no duality gap. Under certain conditions, the canonical problem becomes a concave maximization dual problem over a convex feasible domain. By getting the stationary point of the canonical dual problem, we can find either an optimal or approximate solution of the original problem. A gradient decent algorithm is proposed to solve the MIMO problem and simulation results are provided to demonstrate the effectiveness of the method.

#### 1. Introduction

In the recent decade, multiple antennae communication systems have developed very fast since it could provide substantial performance gain over their single antenna counterparts [1]. Therefore, how to efficiently detect the signal vector of transmitted symbols becomes an important issue. As a consequent result, the problem of multiple-input-multiple-output detection has been raised up and received considerable attention over several years.

Note that, in the communication scenarios, the signal model is always written in the following form:where is a received signal vector, is a transmitted symbol vector whose elements are drawn from a symbol constellation set, is real matrix that characterizes the input-output relation, and is an additive white Gaussian noise with unit variance. It is worth pointing out that the signal model is sometimes represented in a complex-valued form. But it is easy to reformulate the complex-valued model to a real-valued model (please see [2] for details). The MIMO problem aims to detect the transmitted vector based on the observations and . And the optimal symbol vector which minimizes the error probability can be found by solving the maximum-likelihood (ML) detection problem [3]. It is a very fundamental problem in the communication area. The corresponding problem is as follows: where denotes the 2-norm and each symbol is drawn from a -QAM constellation set (please see [4] for details). In this paper, we suppose . Unfortunately, the MIMO problem is NP-hard [5]. Therefore, researchers have developed a lot of approximation algorithms.

Lattice decoding is an important research direction for the MIMO detection. It has received a lot of attention for its good tradeoff between detection accuracy and complexity [6–8]. Naive lattice decoding (NLD) method relaxes the symbol bound constraints and finds the closest lattice point to the received signal over the whole lattice generated by the channel [6]. In order to further improve the efficiency, some suboptimal lattice decoding methods, such as sampled decoding [9], embedded decoding [10], and lattice reduction-aided (LRA) methods [11], can be combined with lattice decoding method to accelerate the lattice point search. However, since the NLD method completely ignores the symbol bounds, it fails to achieve the optimal diversity-multiplexing tradeoff (DMT) under general MIMO system models [6, 8]. Then, in order to prevent the lattice points going too far away from the origin point, some researchers developed the regularized lattice decoding (RLD) method which adds a quadratic penalization term to the lattice decoding metric [12]. Though the RLD method has been empirically found to be computationally fast for small to moderate problems sizes, its complexity would be prohibitive for large and higher order QAM [13].

Another big family of MIMO detection algorithms is based on semidefinite relaxation (SDR). The SDR method relaxes the ML detection problem into a convex semidefinite programming (SDP) problem which leads to a polynomial-time complexity in the problem dimension. The SDR detector was first developed for the binary phase-shift keying (BPSK) constellation [14] and then extended to QPSK (4-QAM) constellation [15]. Researchers have verified that the SDR detector can provide a constant factor approximation to the optimal log-likelihood value in the low signal-to-noise ration (SNR) region almost surely [16]. Based on that, Wiesel et al. [17] proposed a polynomial-inspired SDR (PI-SDR) method for 16-QAM and proved that PI-SDR achieves an optimal Lagrangian dual lower bound of the ML. Sidiropoulos and Luo [18] designed a bound-constrained SDR (BC-SDR) method which has a special structure. Thus, compared to PI-SDR, BC-SDR makes fast implementations more favorable. Moreover, Mao et al. [19] developed a virtually antipodal SDR (VA-SDR) method for any -QAM (where ). For the relationship and comparisons between these SDR detectors, please see [2]. Though SDP problem has a theoretical low polynomial computational complexity, due to large problem size and slow SDP solvers, the actual computation time is very high in practice.

Besides, there are some other algorithms for the MIMO problem. Sphere decoder method is a classical one [4, 20]. However, it exhibits exponential complexity with respect to the problem size. Moreover, Goldberger and Leshem [21] proposed a new detection algorithm based on an optimal tree approximation in an unconstrained linear system. They showed that this algorithm outperforms other methods for the loop-free factor graph situation. Recently, Pan et al. [22] proposed a Lagrangian dual relaxation (LDR) for the MIMO problem. This method finds the best diagonally regularized lattice decoder to approximate the ML detector. They proved that the LDR problem yields a duality gap no worse than that of the SDR method.

In this paper, we present a canonical duality approach to the MIMO problem. The canonical duality theory is originally proposed for handling general nonconvex and/or nonsmooth systems [23]. Canonical dual transformation and associated triality theory play a key role in the implementation. It is worth pointing out that the canonical dual transformation may convert a nonconvex and/or nonsmooth primal problem into a piecewise smooth canonical dual problem. And this dual problem has no duality gap in each subregion. Therefore, this powerful tool has a big potential in some global optimization problems and nonconvex nonsmooth analysis [24–28]. Particularly, the canonical duality theory can be applied to the quadratic programming problem with integer constraints. Fang et al. [29] proposed a more general global optimization condition using the canonical duality approach. Wang et al. [30] developed a canonical duality approach for solving multi-integer quadratic programming problems. Thus, this paper adopts the canonical duality approach to study the MIMO problem.

The paper is arranged as follows. In Section 2, we introduce a special linear transformation to reformulate the original problem into a constrained quadratic programming problem. In Section 3, we develop the canonical dual problem for the new reformulation. Then we show that it has no duality gap under certain conditions. Moreover, some global optimality conditions are presented. In Section 4, we propose a gradient decent method to find the stationary points. Comparisons by simulations are provided in Section 5. The last section summarizes the paper and points out some future research directions.

#### 2. Linear Transformation

The MIMO problem can be written as follows:Let and . Note that is real symmetric matrix and is -dimensional real vector. Since is a fixed scalar, problem has the same optimal solutions with the following problem:We first reformulate problem into a constrained quadratic programming problem. Note that the set forms an arithmetic series; that is, the adjacent two elements in the set have a constant gap 2. Therefore, we can take advantage of this special structure.

Let for ; then . Let denote the -dimensional vector with all elements being 1. Then, it is easy to verify that problem is equivalent to the following problem:Problem and problem have the same optimal value. Moreover, once we get an optimal solution of problem , we can use to get the corresponding optimal solution of problem . Now, let and . Since is also a fixed scalar, problem has the same optimal solutions with the following problem:Let denote the feasible domain of problem . Set ; then and . Now, we can define a new set as follows:Note that each element in set is a -dimensional vector with all elements being −1 or 1. Then, we have the following theorem to show the relationship between and .

Theorem 1. *The transformation is a full mapping from to .*

*Proof. *We first show that, for any , the corresponding belongs to . Note that can also be written as = . The first part is always an integer; the possible fraction can only occur in the second part . However, it is easy to verify that this part is always an integer as for , . Moreover, for , and min. Therefore, is an integer between 0 and and belongs to .

Then, we show that, for an arbitrary integer , there exist for such that the transformation holds. If , then can be written as for particular and . Then, let for and . Thus, for . It is easy to verify that . If , since , we have . Therefore, . Then following the similar way, we can write as for particular , . This time, let for and . Thus, for . Consequently, we have = .

Therefore, the transformation is a full mapping from to .

It is worth pointing out that this transformation is a linear mapping. Moreover, since we use the advantage of the special structure of the original problem, the size of the reformulated problem is smaller than the problems derived by some traditional transformation methods [3].

Now, replacing by in problem , we can get the following problem:whereTherefore, from Theorem 1, solving problem is equivalent to solving problem .

Let and ignore the fixed scalar ; we focus on the following problem:

Note that problem has no linear constraints and its feasible domain is merely defined by .

#### 3. Canonical Dual Problem and Global Optimality

Let be a vector and let denote an diagonal matrix with being the diagonal element. Let

Moreover, we define a set as follows:where is the determinant of the matrix .

Then following the work of [30, 31], we can get the canonical dual problem of problem as follows:where is an -dimensional vector with all elements being 1. represents finding all stationary points (critical points) of over .

Moreover, for two vectors , let denote the standard Hadamard product . Then, for the relationship between the primal problem and the dual problem, we have the next two important theorems.

Theorem 2. *If is a stationary point of the dual objective function , then is an integer vector in . Moreover, if is positive definite, then the Hessian matrix of is negative definite.*

*Proof. *Note that since , we have . Thus, = = . Hence, we have . Therefore, = = = = . Therefore, if is a stationary point of , then . This implies that the vector .

Moreover, the Hessian matrix = = = . Thus, if is positive definite, then the Hessian matrix of is negative definite.

Theorem 2 indicates that a stationary point of over is corresponding to a feasible solution of the primal problem .

Theorem 3. *The canonical dual problem is perfectly dual to the primal problem in the sense that if is a stationary point of , then is a KKT point of problem and .*

*Proof. *Note that problem can be written as follows:Its corresponding Lagrangian function isTherefore, the KKT conditions are as follows:Thus, from Theorem 2 and the definition of , it is easy to verify that is a KKT point if is a stationary point of .

Moreover, we haveThe result follows.

KKT conditions provide necessary conditions for local minimizers in a nonconvex programming problem. Next, we show that the canonical dual problem is a concave maximization dual problem over a convex feasible domain under certain conditions. First, we define a subset of set as follows:where indicates that is positive definite. Then, we present the sufficient global optimal conditions.

Theorem 4. *Assume that is a stationary point of and . If , then is a unique global minimizer of over and is a global maximizer of over with*

*Proof. *Note that if , then . Thus, Theorem 2 indicates that the Hessian matrix of is negative definite over . Then we know that the canonical dual function is strictly concave over . Therefore, a stationary point of must be a global maximizer of over . Since the stationary point , Theorem 3 indicates that .

On the other hand, since is a KKT point assured by Theorem 3, we have . Therefore, . Note that is positive definite; therefore is a global minimizer. Therefore, = . Therefore, is a global minimizer of over .

*Above all, we transform the original problem which is a multi-integer quadratic programming problem into a piecewise continuous canonical dual problem by using the canonical duality theory. It is worth pointing out that the original problem and the canonical dual problem have no duality gap over . Moreover, if , the canonical dual problem becomes a concave maximization problem over a convex feasible domain which can be solved very efficiently. To the best of our knowledge, among all the existing methods, strong duality only holds for the Lagrangian dual relaxation (LDR) in the special 2-PAM case [22]. However, the canonical dual problem holds for any order PAM problem over . Therefore, in some sense, the canonical dual problem provides the best dual problem of all.*

*4. Algorithm*

*Note that if is a stationary point of over , then is a feasible solution of problem . Moreover, if , the corresponding solution is the global optimal solution of problem . Therefore, the solution of the dual problem is corresponding to an optimal or approximation solution of problem .*

*The key issue for solving the problem is to avoid the matrix becoming a singular matrix. Since , we have . Thus, . Note that for . Therefore, . Hence, . Therefore, if the matrix is close to a singular matrix, we can perturb the vector to change the value of and avoid the situation.*

*Let denote the infinity norm of vector . Then, we propose an algorithm based on the gradient methods to solve problem .*

*Canonical Dual Algorithm*

*Step 1 (initialization step). *Let , be a sufficiently small number. Let , be the initial feasible solution of problem .

*Step 2. *Let . If , go to Step 4. Otherwise, , where is a nonnegative scalar and ; .

*Step 3. *If , then let and . Go back to Step 2.

*Step 4. *Return and use Theorem 1 to get the corresponding solution .

*5. Comparisons by Simulations*

*In this section, we use simulations to compare the canonical dual method (CDM) with some other benchmarked approximating methods, such as inexact ML sphere decoding (ML-SD) [4], semidefinite relaxation (SDR) [18], and inexact MMSE lattice decoding (MMSE-LD) [11].*

*The channel matrix comprises i.i.d. elements drawn from a zero-mean normal distribution of unit variance. The symbol vector is element-wise i.i.d. uniformly distributed with each element drawn from the standard -QAM constellation set. Moreover, is the additive white Gaussian noise with zero mean and variance . Note that the signal-to-noise ratio (SNR) is defined as , where is the variance of the elements of .*

*We use two different problem sizes as and . And for each case, we test every numerical example under two situations: 16-QAM and 64-QAM. All the simulations are implemented using MATLAB 7.9.0 on a computer with Intel Core 2 CPU 2.50 Ghz and 2 G memory. Moreover, the solvers of cvx [32] are incorporated in solving the SDP problems.*

*Figures 1 and 2 plot the SERs of the various methods versus SNR under different problem sizes for 16-QAM constellations and 64-QAM constellations, respectively.*