Learn More
The problem of transmit beamforming to multiple cochannel multicast groups is considered, when the channel state is known at the transmitter and from two viewpoints: minimizing total transmission power while guaranteeing a prescribed minimum signal-to-interference-plus-noise ratio (SINR) at each receiver; and a "fair" approach maximizing the overall minimum(More)
The problem of transmit beamforming to multiple co-channel mul-ticast groups is considered, from the viewpoint of guaranteing a prescribed minimum signal-to-interference-plus-noise-ratio (SINR) at each receiver. The problem is a multicast generalization of the SINR-constrained multiuser downlink beamforming problem: the difference is that each transmitted(More)
The problem of transmit beamforming to multiple cochannel multicast groups is considered for the important special case when the channel vectors are Vandermonde. This arises when a uniform linear antenna antenna (ULA) array is used at the transmitter under far-field line-of-sight propagation conditions, as provisioned in 802.16e and related wireless(More)
—A distributed beamforming algorithm is proposed for the two-user multiple-input single-output (MISO) interference channel (IFC). The algorithm is iterative and uses as bargaining value the interference that each transmitter generates towards the receiver of the other user. It enables cooperation among the transmitters in order to increase both users' rates(More)
In recent years, there is growing interest in hybrid fiber-copper access solutions, as in fiber to the basement (FTTB) and fiber to the curb/cabinet (FTTC). The twisted pair segment in these architectures is in the range of a few hundred meters, thus supporting transmission over tens of MHz. This paper provides crosstalk models derived from measured data(More)
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 (SENR) at each receiver is nonconvex and NP-hard, we present convex SDP relaxations of this problem and study when such relaxations are tight.(More)
A fundamental aspect in performance engineering of wireless networks is optimizing the set of links that can be concurrently activated to meet given signal-to-interference-and-noise ratio (SINR) thresholds. The solution of this combinatorial problem is the key element in scheduling and cross-layer resource management. Previous works on link activation(More)
We consider a wireless network comprising a number of mutually-interfering links. We study the transmit power control problem that determines the egalitarian signal-to-interference-plus-noise ratio under a novel setup. Namely, we assume that the receivers have multiuser detection capability, which enables decoding and cancellation of the interference, when(More)
We consider the problem of finding Pareto-optimal (PO) operating points for the multiple-input single-output (MISO) interference channel when the transmitters have statistical (covariance) channel knowledge. We devise a computationally efficient algorithm, based on semidefinite relaxation, to compute the PO rates and the enabling beamforming vectors. We(More)