Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userRobust Transceiver Design for MISO Interference Channel with Energy Harvesting
366
0
0.0
(
0
)
Added by
Ming-Min Zhao
Publication date
2015
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this paper, we consider multiuser multiple-input single-output (MISO) interference channel where the received signal is divided into two parts for information decoding and energy harvesting (EH), respectively. The transmit beamforming vectors and receive power splitting (PS) ratios are jointly designed in order to minimize the total transmission power subject to both signal-to-interference-plus-noise ratio (SINR) and EH constraints. Most joint beamforming and power splitting (JBPS) designs assume that perfect channel state information (CSI) is available; however CSI errors are inevitable in practice. To overcome this limitation, we study the robust JBPS design problem assuming a norm-bounded error (NBE) model for the CSI. Three different solution approaches are proposed for the robust JBPS problem, each one leading to a different computational algorithm. Firstly, an efficient semidefinite relaxation (SDR)-based approach is presented to solve the highly non-convex JBPS problem, where the latter can be formulated as a semidefinite programming (SDP) problem. A rank-one recovery method is provided to recover a robust feasible solution to the original problem. Secondly, based on second order cone programming (SOCP) relaxation, we propose a low complexity approach with the aid of a closed-form robust solution recovery method. Thirdly, a new iterative method is also provided which can achieve near-optimal performance when the SDR-based algorithm results in a higher-rank solution. We prove that this iterative algorithm monotonically converges to a Karush-Kuhn-Tucker (KKT) solution of the robust JBPS problem. Finally, simulation results are presented to validate the robustness and efficiency of the proposed algorithms.
rate research
Read More
In this paper, we investigate a multiuser relay system with simultaneous wireless information and power transfer. Assuming that both base station (BS) and relay station (RS) are equipped with multiple antennas, this work studies the joint transceiver design problem for the BS beamforming vectors, the RS amplify-and-forward transformation matrix and the power splitting (PS) ratios at the single-antenna receivers. Firstly, an iterative algorithm based on alternating optimization (AO) and with guaranteed convergence is proposed to successively optimize the transceiver coefficients. Secondly, a novel design scheme based on switched relaying (SR) is proposed that can significantly reduce the computational complexity and overhead of the AO based designs while maintaining a similar performance. In the proposed SR scheme, the RS is equipped with a codebook of permutation matrices. For each permutation matrix, a latent transceiver is designed which consists of BS beamforming vectors, optimally scaled RS permutation matrix and receiver PS ratios. For the given CSI, the optimal transceiver with the lowest total power consumption is selected for transmission. We propose a concave-convex procedure based and subgradient-type iterative algorithms for the non-robust and robust latent transceiver designs. Simulation results are presented to validate the effectiveness of all the proposed algorithms.
In this paper, we investigate different secrecy energy efficiency (SEE) optimization problems in a multiple-input single-output underlay cognitive radio (CR) network in the presence of an energy harvesting receiver. In particular, these energy efficient designs are developed with different assumptions of channels state information (CSI) at the transmitter, namely perfect CSI, statistical CSI and imperfect CSI with bounded channel uncertainties. In particular, the overarching objective here is to design a beamforming technique maximizing the SEE while satisfying all relevant constraints linked to interference and harvested energy between transmitters and receivers. We show that the original problems are non-convex and their solutions are intractable. By using a number of techniques, such as non-linear fractional programming and difference of concave (DC) functions, we reformulate the original problems so as to render them tractable. We then combine these techniques with the Dinkelbachs algorithm to derive iterative algorithms to determine relevant beamforming vectors which lead to the SEE maximization. In doing this, we investigate the robust design with ellipsoidal bounded channel uncertainties, by mapping the original problem into a sequence of semidefinite programs by employing the semidefinite relaxation, non-linear fractional programming and S-procedure. Furthermore, we show that the maximum SEE can be achieved through a search algorithm in the single dimensional space. Numerical results, when compared with those obtained with existing techniques in the literature, show the effectiveness of the proposed designs for SEE maximization.
The Maddah-Ali and Tse (MAT) scheme is a linear precoding strategy that exploits Interference Alignment and perfect, but delayed, channel state information at the transmitters (delayed CSIT), improving the degrees of freedom (DoF) that can be achieved for the broadcast channel (BC). Since its appearance, many works have extended the concept of Retrospective Interference Alignment (RIA) to other multi-user channel configurations. However, little is known about the broadcast channel with multiple cells, i.e. the interference broadcast channel (IBC). In this work, the DoF are studied for the $K$-user $C$-cell multiple-input single-output (MISO) IBC with delayed CSIT (with $K/C$ users per cell). We show that the straightforward application of the MAT scheme over the IBC fails because it requires all interference to be received from the same source. Hence, in this case not all the interference can be cancelled, thus blocking the decoding of the received messages. We call this phenomenon as textit{interference coupling}, forcing to use the MAT scheme by serving just one cell at a time. In this work, we propose an extension, namely the uncoupled MAT scheme (uMAT), exploiting multiple cells, uncoupling the interference, and achieving the best known DoF inner bound for almost all settings.
We consider the problem of quantifying the Pareto optimal boundary in the achievable rate region over multiple-input single-output (MISO) interference channels, where the problem boils down to solving a sequence of convex feasibility problems after certain transformations. The feasibility problem is solved by two new distributed optimal beamforming algorithms, where the first one is to parallelize the computation based on the method of alternating projections, and the second one is to localize the computation based on the method of cyclic projections. Convergence proofs are established for both algorithms.
We consider a multiple-input multiple-output (MIMO) interference channel (IC), where a single data stream per user is transmitted and each receiver treats interference as noise. The paper focuses on the open problem of computing the outermost boundary (so-called Pareto boundary-PB) of the achievable rate region under linear transceiver design. The Pareto boundary consists of the strict PB and non-strict PB. For the two user case, we compute the non-strict PB and the two ending points of the strict PB exactly. For the strict PB, we formulate the problem to maximize one rate while the other rate is fixed such that a strict PB point is reached. To solve this non-convex optimization problem which results from the hard-coupled two transmit beamformers, we propose an alternating optimization algorithm. Furthermore, we extend the algorithm to the multi-user scenario and show convergence. Numerical simulations illustrate that the proposed algorithm computes a sequence of well-distributed operating points that serve as a reasonable and complete inner bound of the strict PB compared with existing methods.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
