Transmit Beamforming to Multiple Co-Channel Multicast Groups

Karipidis, Eleftherios; Sidiropoulos, Nicholas D.; Luo, Zhi-Quan

doi:10.1109/camap.2005.1574196

Cited by 49 publications

(61 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Extending the multicast concept, a unified framework for physical layer multicasting to multiple co-channel groups, where independent sets of common data are transmitted to groups of users by the multiple antennas, was given in [3], [4]. In parallel to [3], the work of [5] involved dirty paper coding methods that are bound to increase the complexity of the system.…”

Section: A Phy Multicastingmentioning

confidence: 99%

Multicast multigroup beamforming for per-antenna power constrained large-scale arrays

Christopoulos

Chatzinotas

Ottersten

2015

2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

View full text Add to dashboard Cite

Abstract-Large in the number of transmit elements, multiantenna arrays with per-element limitations are in the focus of the present work. In this context, physical layer multigroup multicasting under per-antenna power constrains, is investigated herein. To address this complex optimization problem lowcomplexity alternatives to semi-definite relaxation are proposed. The goal is to optimize the per-antenna power constrained transmitter in a maximum fairness sense, which is formulated as a non-convex quadratically constrained quadratic problem. Therefore, the recently developed tool of feasible point pursuit and successive convex approximation is extended to account for practical per-antenna power constraints. Interestingly, the novel iterative method exhibits not only superior performance in terms of approaching the relaxed upper bound but also a significant complexity reduction, as the dimensions of the optimization variables increase. Consequently, multicast multigroup beamforming for large-scale array transmitters with per-antenna dedicated amplifiers is rendered computationally efficient and accurate. A preliminary performance evaluation in large-scale systems for which the semi-definite relaxation constantly yields non rank-1 solutions is presented.

show abstract

Section: A Phy Multicastingmentioning

confidence: 99%

Multicast multigroup beamforming for per-antenna power constrained large-scale arrays

Christopoulos

Chatzinotas

Ottersten

2015

2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

View full text Add to dashboard Cite

show abstract

“…Whereas multi-group multicast transmit beamforming under SINR constraints is NP-hard in general [5,6], we have shown that, in the special case of Vandermonde steering vectors it is in fact a semidefinite problem, which can be efficiently solved. We have also considered robust beamforming solutions under channel uncertainty for the case of a single multicast group.…”

Section: Discussionmentioning

confidence: 99%

“…In this scenario, we observed that when the relaxed SDP problem R in [5] is feasible, its optimal solution, i.e., the blocks {X…”

Section: Exact Globally Optimal Solution In the Vandermonde Casementioning

confidence: 99%

“…A simple simulation experiment illustrates the equivalence of the aforementioned algorithm to the one proposed in [5]. Figures 1 and 2 show the optimized transmit beam patterns generated by algorithm 1 (SDP relaxation problem R and randomization -multicast power control problem MGPC) and algorithm 2 (SDP problem V and spectral factorization), respectively.…”

Section: Exact Globally Optimal Solution In the Vandermonde Casementioning

confidence: 99%

“…Problem P was considered in [5] and it was found to be NP-hard, in the case of general steering vectors, based on arguments proved in earlier work [6]. Therefore, a two step approach was proposed and shown to yield high-quality approximate solutions at manageable complexity cost.…”

Section: Pmentioning

confidence: 99%

See 2 more Smart Citations

Convex Transmit Beamforming for Downlink Multicasting to Multiple Co-Channel Groups

Karipidis

Sidiropoulos

Luo

2006 IEEE International Conference on Acoustics Speed and Signal Processing Proceedings

Self Cite

View full text Add to dashboard Cite

We consider the problem of transmit beamforming to multiple cochannel multicast groups. Since the direct minimization of transmit power while guaranteeing a prescribed minimum signal to interference plus noise ratio (SINR) at each receiver is nonconvex and NPhard, we present convex SDP relaxations of this problem and study when such relaxations are tight. Our results show that when the steering vectors for all receivers are of Vandermonde type (such as in the case of a uniform linear array and line-of-sight propagation), a globally optimum solution to the corresponding transmit beamforming problem can be obtained via an equivalent SDP reformulation. We also present various robust formulations for the problem of single-group multicasting, when the steering vectors are only approximately known. Simulation results are presented to illustrate the effectiveness of our SDP relaxations and reformulations.

show abstract

Multicast beamforming with LOS self‐interference cancellation in full‐duplex wireless communications

Liu

2018

Int J Communication

View full text Add to dashboard Cite

In this paper, we consider a full-duplex system where the access point installed with multiple transmitting antennas and a single receiving antenna serves several single-antenna remote users. In this case, there are 2 kinds of interferences. One is the near-field self-interference (SI) induced by the simultaneous transmitting and receiving over the same band, and the other is the cochannel interference caused by the multicast broadcasting in the same band. A problem of near-field SI cancellation and the cochannel interference suppression using transmit beamforming is formulated at the access point. This problem of ensuring the near-field line-of-sight SI suppression benchmark and maximizing the minimum received signal-to-interference-plus-noise ratio of remote receivers leads to a nonconvex NP-hard optimization. Furthermore, we introduce a semidefinite relaxation technique coupled with linear program power adjustment and an outer bisection search loop to transform the problem into a convex optimization. This can be solved by the modern interior point methods. Simulations show that the proposed method is feasible even when the local receive antenna in near-field and the remote receivers in far field are in the same direction. KEYWORDSbeamforming, cochannel interference, full-duplex, self-interference cancellation, semidefinite relaxation Int J Commun Syst. 2018;31:e3544.wileyonlinelibrary.com/journal/dac

show abstract

Transmit Beamforming to Multiple Co-Channel Multicast Groups

Cited by 49 publications

References 38 publications

Multicast multigroup beamforming for per-antenna power constrained large-scale arrays

Multicast multigroup beamforming for per-antenna power constrained large-scale arrays

Convex Transmit Beamforming for Downlink Multicasting to Multiple Co-Channel Groups

Multicast beamforming with LOS self‐interference cancellation in full‐duplex wireless communications

Contact Info

Product

Resources

About