Symbol-Level Precoding Design for Max-Min SINR in Multiuser MISO Broadcast Channels
In this paper, we address the symbol level precoding (SLP) design problem under max-min SINR criterion in the downlink of multiuser multiple-input single-output (MISO) channels. First, we show that the distance preserving constructive interference regions (DPCIR) are always polyhedral angles (shifted pointed cones) for any given constellation point with unbounded decision region. Then we prove that any signal in a given unbounded DPCIR has a norm larger than the norm of the corresponding vertex if and only if the convex hull of the constellation contains the origin. Using these properties, we show that the power of the noiseless received signal lying on an unbounded DPCIR is an strictly increasing function of two parameters. This allows us to reformulate the originally non-convex SLP max-min SINR as a convex optimization problem. We discuss the loss due to our proposed convex reformulation and provide some simulation results.
Multiuser interference (MUI) is a major performance limiting factor in multiuser systems, which reduces the maximum reliable transmission rate of individual users. One approach to mitigate the MUI is to precompensate for its undesired effect on the received signal through some signal processing at the transmitter , which is known as multiuser precoding.
The multiuser precoding problem is usually expressed as a constrained optimization problem (see , and the references therein). In general, the design problem aims at keeping a balance between some network-centric and user-centric objectives/requirements, depending on the network’s operator strategy. Power and sum-rate are commonly regarded as network-centric criteria . On the other hand, as a user-centric criterion, signal-to-interference-plus-noise ratio (SINR) is an effective measure of quality-of-service (QoS) in multiuser interference channels . In particular, both bit error rate (BER) and capacity, which are two relevant criteria from a practical point of view, are closely related with maximizing SINR. Taking into account different types of optimization criteria, some well-known formulations for the multiuser precoding problem are power minimization with SINR constraints , SINR balancing , and (weighted) sum-rate maximization . In this paper, we mainly focus on the SINR balancing problem through ensuring max-min fairness among users.
Conventional linear multiuser precoding techniques try to design the precoder in order to mitigate the MUI. This requires the knowledge of the instantaneous channel state information (CSI) to calculate the precoder matrix. Following the notion of constructive interference (CI), one can turn the MUI into a useful source of signal power instead of treating it as an unwanted distortion . Accordingly, in addition to CSI, the instantaneous data information (DI) of all users are used to design the precoder, which leads to introducing symbol-level precoding (SLP) . When compared to conventional schemes, it has been shown that significant gains can be achieved, but at the cost of higher transmitter complexity . In SLP scheme, one may also form a virtual multicast formulation to directly find the optimal transmit vector, as proposed in , instead of finding the precoder matrix.
The SINR balancing problem in multiuser multiple-input single-output (MISO) channels has been extensively investigated for conventional precoding techniques, and addressed in both multicast (single data stream) and broadcast (independent data streams) downlink scenarios. The problem is not convex in general and hence, alternate optimization approaches have been proposed. The authors in  prove that the max-min SINR problem for downlink multicasting is NP-hard; however, it can be solved approximately through semidefinite relaxation. For downlink broadcast channels, it is shown in  that the power minimization and the max-min SINR are inverse problems. Using this property, the SINR optimization problem can be solved through iteratively solving the power optimization. Furthermore, direct solutions for max-min SINR are provided in  via conic optimization, where the problem is formulated as a quasiconvex standard generalized eigenvalue program (GEVP). Using the concept of uplink-downlink duality, in  it is verified that the global optimum of max-min SINR is equivalently obtained from solving a dual uplink problem, which has an easier-to-handle analytical structure.
Concerning SLP design in multiuser downlink channels, the optimization constraints push each user’s (noiseless) received signal to a predefined region, called constructive interference region (CIR), enhancing (or guaranteeing a certain level of) the detection accuracy. This causes the constraints to depend on both the constellation set and the decision regions. In , the non-convex SLP max-min SINR problem is solved using its relation to the power minimization via a bisection search. The proposed method is restricted to PSK constellations and has high computational complexity. This problem is also studied in  and an alternate convex formulation is provided for PSK constellations. However, there is no general solution method or convex formulation for the SLP max-min SINR problem being valid for generic constellations of any order and shape.
In this paper, our goal is to find alternate convex formulations for the originally non-convex SLP max-min SINR problem, based on the definition of distance preserving constructive interference regions (DPCIR) . To obtain such reformulation, we first show that any DPCIR associated with a boundary constellation point is always a polyhedral angle, and hence unbounded. Then, we prove that any signal in a given unbounded DPCIR has a norm larger than the corresponding vertex under the necessary and sufficient condition that the constellation contains the origin in its convex hull. Based on these two results, we derive two alternate convex formulations for the SLP max-min SINR. This is done by noticing that the noise-free received signal at each user’s receiver is an increasing function of two parameters.
The remainder of this paper is organized as follows. In Section II, we describe our system model. In Section III, we overview the DPCIRs and their properties. We discuss the SLP max-min SINR in Section IV and reformulate it as alternate convex problems. In Section V, we provide some simulation results. Finally, we conclude the paper in Section VI.
Notations: We use uppercase and lowercase bold-faced letters to denote matrices and vectors, respectively, and lowercase normal letters to denote scalars. For matrices and vectors, denotes the transpose operator. For vectors, represents the norm, and (or ) denotes componentwise inequality. and denote the respectively real-part and imaginary-part operators. For any set , denotes the cardinality of .
Ii System Model
We consider the downlink of a multiuser MISO broadcast channel, where a base station (BS) transmits independent data streams to users. The BS is equipped with transmit antennas while each user has a single receive antenna. A complex channel vector is assumed between the BS’s transmit antennas and the -th user, which is denoted by . It is further assumed that perfect channel knowledge is available to the BS.
At a given symbol time, independent symbols are to be sent to users (throughout the paper, we drop the symbol’s time index to simplify the notation). We collect these symbols in users’ symbol vector with denoting the symbol intended for the -th user. Each symbol is drawn from a finite equiprobable two-dimensional constellation set. Without loss of generality, we assume an -ary constellation set with unit average power for all users. The user’s symbol vector is mapped onto transmit antennas. This is done by a symbol-level precoder yielding the BS’s transmit vector . The received signal at the -th user’s receiver is then , where is the complex additive white Gaussian noise at the -th receiver. Again without loss of generality, we assume identical noise distributions across the receivers, i.e., . From the received scalar , the user may apply the maximum-likelihood (ML) decision rule to detect its own symbol .
Iii Distance Preserving Constructive Interference Regions
In this section, we provide an overview of DPCIRs and their properties which will be useful in formulating the SLP design problem. Hereafter, we denote each complex-valued constellation point by its equivalent real-valued vector notation, hence the set of points in is denoted by .
The DPCIRs can be described based on the hyperplane representation of ML decision regions . For the equiprobable constellation set , the ML decision rule corresponds to the Voronoi regions of which are bounded by hyperplanes. For a given constellation point and one of its neighboring points , the hyperplane separating the Voronoi regions of and is given by , where (or any non-zero scalar multiplication of ), and . This hyperplane indicates a decision boundary (Voronoi edge) between and , which splits plane into two halfspaces. The closed halfspace contains the decision region of , where is the inward normal and determines the offset from the origin. The Voronoi region of is then given by intersecting all such halfspaces, i.e.,
where denotes the set of neighboring points of with . Each Voronoi region can be either an unbounded or bounded polyhedron, depending on the relative location of in . It can be easily verified that all types of polyhedra (i.e., bounded or unbounded), and hence the Voronoi regions, are convex sets . The Voronoi region (1) can be expressed in a more compact form as
where and contain and , respectively, for all .
For any hyperplane , the set of points represents a parallel hyperplane with the orthogonal distance in the direction of . Let denote the distance between and . Since the DPCIRs are defined so as to not decrease the original distances between the constellation points, the distance preserving margin is equal to . Therefore, the DPCIR associated with can be described as
where is the vector containing for all . Similar to , is the intersection of a number of closed halfspaces and thus is a polyhedron. Furthermore, the bounding hyperplanes of are parallel to their corresponding Voronoi edges. It is straightforward to show that the following properties hold for DPCIRs:
For any and , we have
, where equality holds only when .
From the constellation set , one can easily derive its convex hull , i.e., the smallest convex set containing (see Fig. 1). The set of points belonging to the boundary of is denoted by , and the set of interior points of , i.e., , is shown by . It follows from (3) that if is bounded, then . On the other hand, for an unbounded , the associated is an unbounded polyhedron (more specifically, a polyhedral angle as depicted in Fig. 1) which is uniquely characterized using the two following lemmas.
A point lies on the boundary of (or is a vertex of) iff its Voronoi region is unbounded [10, Lemma 2.2].
For every with unbounded , is a polyhedral angle with a vertex at , and each of its edges is perpendicular to one of the two line segments connecting to its two neighboring points on .
See Appendix A-A. ∎
Lemma 2 implicitly states that neither changing the location of any constellation point nor adding a new constellation point on does not affect for any , as they both keep the direction of unchanged for all . This leads to the following two lemmas.
For any constellation point , we have iff contains the origin. Equality is achieved only when .
See Appendix A-B. ∎
If , there exists at least one constellation point for which for any , , where .
If , for any and any with , let define . Having , it follows from the definition of convex hull that . If , then which contradicts our assumption. Hence there must exist at least one constellation point, say , for which and therefore none of contains the origin, as required. ∎
To proceed, it is more convenient to express the linear inequalities of (3) by an equivalent set of linear equations as
The linear equations in (4) indicate that any can be specified as the intersection point of hyperplanes, each of which is parallel to a boundary hyperplane of but has a different offset due to the term . Finally, we state the following theorem which is the main result of this section.
For any constellation point with as expressed in (4), function over its domain is a strictly monotonic increasing function of the elements of iff contains the origin.
See Appendix A-C ∎
Iv Symbol-level Precoding Design Problem
A symbol-level precoder designs the vector to be transmitted at each symbol time via solving a constrained optimization problem. The solution of the SLP problem, i.e., the transmit vector , is in general a function of instantaneous DI and CSI as well as the set of given system constraints or user-specific requirements. When power is a strict system restriction on the downlink transmission, fairness might be a relevant design criterion . In particular, we are interested in the SLP max-min SINR problem subject to a total power constraint which aims at maximizing the worst SINR among all users. Assuming the CIRs to be distance preserving, the problem is not convex in its original form. In this section, we derive two alternate convex formulations for this problem. This is done by noticing that the noise-free received signal at each user is a increasing function of two parameters.
For any user , the symbol corresponds to one of the points in . In the following, we denote by the index of the constellation point corresponding to , i.e., , where . Furthermore, vectors and are rearranged as and , respectively, such that represents the noise-free received signal at the -th user’s receiver.
The symbol-level SINR for user is proportional to the instantaneous received power by the -th receiver at each symbol time (recall that the same noise variance is assumed for all users). Accordingly, the DPCIR-based SLP max-min SINR problem can be formulated as
where the index set refers to those users with a symbol in the boundary of their corresponding constellation, and denotes an all-zeros vector of appropriate dimension. By introducing a slack variable , one can recast (5) as
which is not convex due to the third set of constraints. As a consequence of Lemma 1 and Lemma 2, and with respect to (4), any point in can be uniquely specified by for all . It follows from Theorem 1 that is strictly increasing in each element of , i.e., assuming either or to be fixed, is a monotonically increasing function of the other. This suggests that if the optimal value of one of the elements, e.g., , is given for all , then the optimization (6) is equivalent to the convex problem
where the parameter is substituted for in (6). In fact, achieving the optimum of (6) requires an exhaustive search over all possible (non-negative) values of and solving (7) for each choice of . The optimal solution is then obtained by picking for which the objective function is maximum among all other choices. Practically speaking, due to the power limitation induced by , one can bound and discretize the search interval to choose from a finite set, which of course leads to a sub-optimal solution. The gap to the optimal solution depends on whether the search interval includes the optimal value, and also on the step size of discretization. In general, the smaller the step size is, the higher the computational complexity will be.
Another alternate, but not equivalent, convex formulation for problem (6) is to jointly optimize and for all , i.e.,
where is an all-ones vector. The optimal solution of this problem can be regarded as a lower bound on the optimum of SLP max-min SINR. It should be noted that for PSK constellations, problem (8) is equivalent to the alternate convex formulation for the SLP SINR balancing provided in .
V Simulation Results
In this section, we provide the simulation results to evaluate the performance of the two proposed alternate convex formulations for the SLP max-min SINR problem. In the simulations, we have considered a downlink multiuser scenario with and , where the BS employs the AWGN-optimized 8-ary constellation for all users. For any user , the complex channel vector follows an i.i.d. complex Gaussian distribution with zero-mean and unit variance. The results are averaged over symbol slots.
Figure 2 shows the optimized minimum SINR across the users obtained from the joint optimization problem (8) and from an exhaustive search over interval [0,2.5] with step size 0.5 for all possible combinations of . For the exhaustive search, the number of convex problems to be solved in every symbol time is of order . As it can be observed, the loss due to the joint, but convex, optimization is not significant (around 1-1.5 dBW). This loss is, however, a consequence of highly reducing the computational complexity to solving only one convex problem in each symbol time.
In this paper, we addressed the problem of SLP SINR balancing with max-min fairness criterion in a downlink multiuser MISO channel. The original formulation of this problem is known to be non-convex. For the so-called DPCIRs, we proposed two alternate convex formulations. Both formulations are based on the observation that the noise-free received signal power is an strictly increasing function of two parameters for any given unbounded DPCIR, under the necessary and sufficient condition that the convex hull of the constellation contains the origin. The first formulation is solvable via an exhaustive search and even though it provides the optimal solution, it is computationally expensive to be implemented in a realistic scenario. The second formulation, though sub-optimal, reduces the problem to a convex optimization.
The authors are supported by the Luxembourg National Research Fund under CORE Junior project: C16/IS/11332341 Enhanced Signal Space opTImization for satellite comMunication Systems (ESSTIMS).
A-a Proof of Lemma 2
The intersection of finitely many closed halfspaces is an unbounded polyhedron if and only if the outward normals to the associated boundary hyperplanes lie on a single closed halfspace [11, p. 20, Theorem 4]. Accordingly, for any with unbounded , the outward normal vectors lie on a single halfspace. Since has the same set of outward normal vectors , it is also unbounded. An unbounded polyhedron is uniquely determined from its vertices and the directions of its infinite edges [11, p. 31, Theorem 4]. It is straightforward to check that is the unique solution of , i.e., all the hyperplanes have a common intersection point . Therefore, , which is given by the solution set of , has a single vertex at and two infinite edges, i.e., a polyhedral angle. In addition, since any two neighboring points share a common Voronoi edge, the two infinite edges of correspond to the two neighboring points of on (i.e., ) with unbounded Voronoi regions. Each infinite edge of is then parallel to a hyperplane with normal vector , where ; therefore it is perpendicular to . This completes the proof.
A-B Proof of Lemma 3
Sufficiency: Having , let further assume that . This assumption, as mentioned earlier, does not have any impact on for any , regardless of whether or . By substituting in Property 1 (iii), for all we have . This completes the proof of sufficiency.
We use the following well-known property of convex sets to prove the necessity.
is the minimum distance vector from the origin to the convex set iff for any vector we have , with equality for lying on the hyperplane orthogonal to [12, p. 69, Theorem 1].
Necessity: By contradiction, if , let assume a new constellation set having all the points of including the origin, i.e., , hence . Clearly, and according to Lemma 2, there always exist exactly two constellation points on that contributes to their DPCIRs. Suppose be one of these points with and denoting its associated DPCIR relative to and , repectively. We denote by the set of neighboring points of in . Let be the distance preserving halfspace from to . Since , we have , i.e., the halfspace does not contain . Hence, is not a supporting hyperplane for at [9, p. 51]. This implies that there exist some for which . According to Property 2 (which gives a necessary and sufficient condition), is not the minimum distance vector from the origin in . Consequently, does not hold for some which contradicts .
A-C Proof of Theorem 1
Sufficiency: Suppose . Assuming a constellation point and its DPCIR , let and be two points in such that and with and . Let consider a new constellation . It is clear that , and therefore . The DPCIR of can be described as . Let , then , which means that . As a consequence, from Lemma 3, we have and the proof of sufficiency is complete.
Necessity: By contradiction, suppose . Then, based on Lemma 4, there exists a constellation point for which . Let , then with . The DPCIR associated with can be expressed as . Since , it follows from Lemma 3 and Property 2 that there exists such that , for which . But yields which is a contradiction. This completes the proof.
-  E. Björnson, M. Bengtsson, and B. Ottersten, “Optimal multiuser transmit beamforming: A difficult problem with a simple solution structure,” IEEE Signal Process. Mag., vol. 31, no. 4, pp. 142–148, Jul. 2014.
-  Y. F. Liu, Y. H. Dai, and Z. Q. Luo, “Coordinated beamforming for MISO interference channel: Complexity analysis and efficient algorithms,” IEEE Trans. Signal Process., vol. 59, no. 3, pp. 1142–1157, Mar. 2011.
-  N. D. Sidiropoulos, T. N. Davidson, and Z.-Q. Luo, “Transmit beamforming for physical-layer multicasting,” IEEE Trans. Signal Process., vol. 54, no. 6, pp. 2239–2251, Jun. 2006.
-  M. Schubert and H. Boche, “Solution of the multiuser downlink beamforming problem with individual SINR constraints,” IEEE Trans. Veh. Technol., vol. 53, no. 1, pp. 18–28, Jan. 2004.
-  A. Wiesel, Y. C. Eldar, and S. Shamai, “Linear precoding via conic optimization for fixed MIMO receivers,” IEEE Trans. Signal Process., vol. 54, no. 1, pp. 161–176, Jan. 2006.
-  C. Masouros and G. Zheng, “Exploiting known interference as green signal power for downlink beamforming optimization,” IEEE Trans. Signal Process., vol. 63, no. 14, pp. 3628–3640, Jul. 2015.
-  M. Alodeh, S. Chatzinotas, and B. Ottersten, “Constructive multiuser interference in symbol level precoding for the MISO downlink channel,” IEEE Trans. Signal Process., vol. 63, no. 9, pp. 2239–2252, May 2015.
-  A. Haqiqatnejad, F. Kayhan, and B. Ottersten, “Constructive interference for generic constellations,” IEEE Signal Process. Lett., In Press.
-  S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge Univ. Press, 2004.
-  F. Aurenhammer and R. Klein, Handbook of computational geometry, 2000, ch. Voronoi diagrams, pp. 201–290.
-  A. D. Alexandrov, Convex Polyhedra. Springer Science & Business Media, 2005.
-  D. G. Luenberger, Optimization by Vector Space Methods. New York: Wiley, 1988.