Joint Multicast Beamforming and Antenna Selection
The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Abstract
Multicast beamforming exploits subscriber channel state information at the base station to steer the transmission power towards the subscribers, while minimizing interference to other users and systems. Such functionality has been provisioned in the long-term evolution (LTE) enhanced multimedia broadcast multicast service (EMBMS). As antennas become smaller and cheaper relative to up-conversion chains, transmit antenna selection at the base station becomes increasingly appealing in this context. This paper addresses the problem of joint multicast beamforming and antenna selection for multiple co-channel multicast groups. Whereas this problem (and even plain multicast beamforming) is NP-hard, it is shown that the mixedl1,∞-norm squared is a prudent group-sparsity inducing convex regularization, in that it naturally yields a suitable semidefinite relaxation, which is further shown to be the Lagrange bi-dual of the original NP-hard problem. Careful simulations indicate that the proposed algorithm significantly reduces the number of antennas required to meet prescribed service levels, at relatively small excess transmission power. Furthermore, its performance is close to that attained by exhaustive search, at far lower complexity. Extensions to max-min-fair, robust, and capacity-achieving designs are also considered.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482 · cited 1×
“, the Lasso1 [20], suggesting that can be used as a sparsity-inducing regularization.”
BackgroundYALMIP : a toolbox for modeling and optimization in MATLAB
Lofberg, J. (2005) · 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508) · doi:10.1109/cacsd.2004.1393890 · Cited by 9,149 · cited 2×
“YALMIP is a modeling language for optimization problems that is implemented as a free toolbox for MATLAB [10], and uses SeDuMi, a MATLAB implementation of second-order interior-point methods, for the actual computations [19].”
MethodUsing SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
Model Selection and Estimation in Regression with Grouped Variables
Yuan, M., & Lin, Y. (2006) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00532.x · Cited by 7,261 · cited 1×
“The weight matrix updates force small entries of (and thus the corresponding entries of ) to zero, and avoid unduly restraining large entries.”
BackgroundEnhancing Sparsity by Reweighted ℓ 1 Minimization
Candès, E. J., Wakin, M. B., & Boyd, S. P. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9045-x · Cited by 4,863 · cited 4×
“To further increase the group-sparsity of {wk}k=1, the iteratively re-weighted l1-norm penalty in [4] is adapted to suit our problem.”
BackgroundMethodInfluentialScaling Up MIMO: Opportunities and Challenges with Very Large Arrays
Rusek, F., Persson, D., Lau, B. K., Larsson, E. G., Marzetta, T. L., & Tufvesson, F. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2011.2178495 · Cited by 4,654
Vandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
Scaling up MIMO: Opportunities and challenges with very large arrays
Rusek, F., Persson, D., Lau, B. K., Larsson, E. G., Marzetta, T. L., Edfors, O., Tufvesson, F., Print, P., Rusek, F., Persson, D., et al. (2013) · Cited by 4,089
Semidefinite Relaxation of Quadratic Optimization Problems
Luo, Z.-Q., Ma, W.-K., So, A., Ye, Y., & Zhang, S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936019 · Cited by 3,715 · cited 1×
“More generally, the proposed novel algorithm can easily be extended and applied to obtain sparse solutions for a wide class of non-convex quadratically constrained quadratic programming (QCQP) problems for which SDP relaxation is relevant (cf. [11] and references therein).”
Method
Cited by
Group Sparse Beamforming for Green Cloud-RAN
(2014) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2014.040214.131770 · Cited by 468
“, in [19], the tra nsmit antennas corresponding to the smaller coefficients in the gr oup (measured by thel∞-norm) will have a higher priority to be switched off.”
BackgroundMethodInfluentialCodebook-Based Hybrid Precoding for Millimeter Wave Multiuser Systems
He, S., Wang, J., Huang, Y., Ottersten, B., & Hong, W. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2723353 · Cited by 178
“However, unlike to the SRmax problem (20) or the total power minimization problem with RF chain constraints [35], the system EE is not monotonic with respect to the number of RF chains or the sparse parameter λ.”
BackgroundInfluentialOptimal Energy-Efficient Transmit Beamforming for Multi-User MISO Downlink
Tervo, O., Tran, L.-N., & Juntti, M. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2453134 · Cited by 158
“We numerically observe in Section VI that for the considered JBAS-EEmax problem, a mixed -norm is more appropriate than a mixed which was used in [29] in combination with semidefinite programming for power minimization in multigroup multicasting.”
MethodSmoothed -Minimization for Green Cloud-RAN With User Admission Control
Shi, Y., Cheng, J., Zhang, J., Bai, B., Chen, W., & Letaief, K. B. (2016) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2016.2544578 · Cited by 70
“It yields lower network power consumption compared with the existingl1/l∞-norm based algorithm [25], while the coordinated multicast beamforming algorithm [13 ], [21] with all the RRHs active has the highest network power consumption.”
BackgroundMethodInfluentialRobust Group Sparse Beamforming for Multicast Green Cloud-RAN With Imperfect CSI
Shi, Y., Zhang, J., & Letaief, K. B. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2442957 · Cited by 63
Metadata
- Authors
- Mehanna, O., Sidiropoulos, N. D., & Giannakis, G. B.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2013-05
- Volume
- 61
- Issue
- 10
- Pages
- 2660-2674
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2094558966
- Cited by
- 185
- References
- 21
- FWCI
- 9.19
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.