Searcharxiv⌕ Search

arXiv subjects

Tobias Weber

Publications and source records attributed to Tobias Weber.

38 records · Page 3Linked to original sources

Degrees of Freedom for Instantaneous-Relay Aided Interference Channel: Bounds and Achievable Schemes

The K-user flat fading MIMO interference channel with J instantaneous relays (KICJR) is considered. In the KICJR, the effective channel between sources and destinations including the relays has certain structure and is non-generic. For non-generic channels, the achievable degrees of freedom (DoF) is still unknown. Lee and Wang showed that by using the aligned interference neutralization scheme 3/2 degrees of freedom is achievable in a 2IC1R system, which is 50% more than the 2-user interference channel. But the DoF performance and achievable schemes for other KICJR networks are not investigated in literature. In this paper we devise an achievable scheme called restricted interference alignment for instantaneous-relay aided interference channels. Also, to find insights to the maximum achievable degrees of freedom we develop linear beamforming based on the mean square error (MSE) minimization as an achievable scheme. Furthermore, we present upper-bounds on the maximum achievable degrees of freedom by investigating the properness of the interference alignment equation system. The numerical results show that the DoF performance of the proposed restricted interference alignment scheme and the MSE-based beamforming match the upper-bounds determined from the properness of the interference alignment equations.

cs.IT↗

Maximizing the Sum Rate in Cellular Networks Using Multi-Convex Optimization

In this paper, we propose a novel algorithm to maximize the sum rate in interference-limited scenarios where each user decodes its own message with the presence of unknown interferences and noise considering the signal-to-interference-plus-noise-ratio. It is known that the problem of adapting the transmit and receive filters of the users to maximize the sum rate with a sum transmit power constraint is non-convex. Our novel approach is to formulate the sum rate maximization problem as an equivalent multi-convex optimization problem by adding two sets of auxiliary variables. An iterative algorithm which alternatingly adjusts the system variables and the auxiliary variables is proposed to solve the multi-convex optimization problem. The proposed algorithm is applied to a downlink cellular scenario consisting of several cells each of which contains a base station serving several mobile stations. We examine the two cases, with or without several half-duplex amplify-and-forward relays assisting the transmission. A sum power constraint at the base stations and a sum power constraint at the relays are assumed. Finally, we show that the proposed multi-convex formulation of the sum rate maximization problem is applicable to many other wireless systems in which the estimated data symbols are multi-affine functions of the system variables.

cs.IT↗