Loading [MathJax]/extensions/MathZoom.js
A Conic Quadratic Programming Approach to Physical Layer Multicasting for Large-Scale Antenna Arrays | IEEE Journals & Magazine | IEEE Xplore

A Conic Quadratic Programming Approach to Physical Layer Multicasting for Large-Scale Antenna Arrays

CodeAvailable

Abstract:

We investigate the problem of downlink physical layer multicasting that aims at minimizing the transmit power with a massive antenna array installed at the transmitter si...Show More

Abstract:

We investigate the problem of downlink physical layer multicasting that aims at minimizing the transmit power with a massive antenna array installed at the transmitter site. We take a solution based on semidefinite relaxation (SDR) as our benchmark. It is shown that instead of working on the semidefinite program (SDP) naturally produced by the SDR, the dual counterpart of the same problem may provide a more efficient numerical implementation. Later, by using a successive convex approximation strategy, we arrive at a provably convergent iterative second-order cone programming (SOCP) solution. Our thorough numerical investigations report that the newly proposed SOCP solution offers improved power efficiency and a massively reduced computational complexity. Therefore, the SOCP solution is seen as a suitable candidate for obtaining beamformers that minimize transmit power, especially, when a very large number of antennas is used at the transmitter.
Published in: IEEE Signal Processing Letters ( Volume: 21, Issue: 1, January 2014)
Page(s): 114 - 117
Date of Publication: 11 December 2013

ISSN Information:

References is not available for this document.

I. Introduction

The main benefits offered by the so called large-scale antenna systems include, but are not limited to, better spectral efficiency, enhanced link reliability and improved energy efficiency. For an overview of this topic, the interested reader is referred to [1]. The joint problem of multicasting the same message to a group of active users while also consuming minimum power with the aid of a massive array of antenna elements is intriguing at least from a couple of perspectives. Firstly, from the point of view of studying approximation techniques for this NP-hard problem. Secondly, due to the need of devising computationally efficient procedures to overcome the peculiar challenges that arise due to a very large number of transmit antenna elements. In their pioneering work, Sidiropoulos et al. [2], have studied the problem of the physical layer multicasting with a transmitter using a linear precoder. In addition to proving the NP-hardness of this problem, they have also devised an approximating scheme that relies on the semidefinite relaxation (SDR) and uses randomization techniques to recover the beamforming vector. The SDR approach has been extensively used in numerous problems under varying settings. The survey paper [3] provides a more complete overview of the relaxation technique and its signal processing applications.

Select All
1.
F. Rusek, D. Persson, B. K. Lau, E. G. Larsson, T. L. Marzetta, O. Edfors, et al., "Scaling up MIMO: Opportunitiesand challenges with very large arrays", IEEE Signal Process. Mag., vol. 30, no. 1, pp. 40-60, Jan. 2013.
2.
N. D. Sidiropoulos, T. N. Davidson and Z.-Q. Luo, "Transmit beamforming for physical-layermulticasting", IEEE Trans. Signal Process., vol. 54, no. 6, pp. 2239-2250, Jun. 2006.
3.
Z.-Q. Luo, W.-K. Ma, A.-C. So, Y. Ye and S. Zhang, "Semidefiniterelaxation of quadratic optimization problems", IEEE Signal Process. Mag., vol. 27, no. 3, pp. 20-34, May 2010.
4.
J. Löfberg, "Dualize it: Software for automaticprimal and dual conversions of conic programs", Optim. Meth. Softw., vol. 24, no. 3, pp. 313-325, Jun. 2009.
5.
A. Beck, A. B. Tal and L. Tetruashvili, "A sequential parametric convexapproximation method with applications to nonconvex truss topology designproblems", J. Global Optim., vol. 47, no. 1, pp. 29-51, 2010.
6.
B. R. Marks and G. P. Wright, "A general inner approximationalgorithm for nonconvex mathematical programs", Oper. Res., vol. 26, no. 4, pp. 681-683, 1978.
7.
L.-N. Tran, M. F. Hanif, A. Tolli and M. Juntti, "Fast converging algorithm for weighted sumrate maximization in multicell MISO downlink", IEEE Signal Process. Lett., vol. 19, no. 12, pp. 872-875, Dec. 2012.
8.
M. S. Lobo, L. Vandenberghe, S. Boyd and H. Lebret, "Applications of second-order cone programming", Lin. Alg. Applicat. Special on Linear Algebra in Control Signals and Image Processing, pp. 193-228, 1998-Nov.
9.
M. Grant and S. Boyd, CVX: Matlab software for disciplined convex programming version 1.21, Apr. 2011.
10.
J. Löfberg, "YALMIP: A toolbox for modelingand optimization in MATLAB", Proc. CACSD Conf., 2004.
11.
J. F. Sturm, "Using SeDuMi 1.02 a MATLABtoolbox for optimization over symmetric cones", Optim. Meth. Softw., vol. 11–12, pp. 625-653, 1999.
12.

Contact IEEE to Subscribe

References

References is not available for this document.