441 research outputs found

    To Harvest and Jam: A Paradigm of Self-Sustaining Friendly Jammers for Secure AF Relaying

    Get PDF
    This paper studies the use of multi-antenna harvest-and-jam (HJ) helpers in a multi-antenna amplify-and-forward (AF) relay wiretap channel assuming that the direct link between the source and destination is broken. Our objective is to maximize the secrecy rate at the destination subject to the transmit power constraints of the AF relay and the HJ helpers. In the case of perfect channel state information (CSI), the joint optimization of the artificial noise (AN) covariance matrix for cooperative jamming and the AF beamforming matrix is studied using semi-definite relaxation (SDR) which is tight, while suboptimal solutions are also devised with lower complexity. For the imperfect CSI case, we provide the equivalent reformulation of the worst-case robust optimization to maximize the minimum achievable secrecy rate. Inspired by the optimal solution to the case of perfect CSI, a suboptimal robust scheme is proposed striking a good tradeoff between complexity and performance. Finally, numerical results for various settings are provided to evaluate the proposed schemes.Comment: 16 pages (double column), 8 figures, submitted for possible journal publicatio

    Sum-Rate Maximization in Two-Way AF MIMO Relaying: Polynomial Time Solutions to a Class of DC Programming Problems

    Full text link
    Sum-rate maximization in two-way amplify-and-forward (AF) multiple-input multiple-output (MIMO) relaying belongs to the class of difference-of-convex functions (DC) programming problems. DC programming problems occur as well in other signal processing applications and are typically solved using different modifications of the branch-and-bound method. This method, however, does not have any polynomial time complexity guarantees. In this paper, we show that a class of DC programming problems, to which the sum-rate maximization in two-way MIMO relaying belongs, can be solved very efficiently in polynomial time, and develop two algorithms. The objective function of the problem is represented as a product of quadratic ratios and parameterized so that its convex part (versus the concave part) contains only one (or two) optimization variables. One of the algorithms is called POlynomial-Time DC (POTDC) and is based on semi-definite programming (SDP) relaxation, linearization, and an iterative search over a single parameter. The other algorithm is called RAte-maximization via Generalized EigenvectorS (RAGES) and is based on the generalized eigenvectors method and an iterative search over two (or one, in its approximate version) optimization variables. We also derive an upper-bound for the optimal values of the corresponding optimization problem and show by simulations that this upper-bound can be achieved by both algorithms. The proposed methods for maximizing the sum-rate in the two-way AF MIMO relaying system are shown to be superior to other state-of-the-art algorithms.Comment: 35 pages, 10 figures, Submitted to the IEEE Trans. Signal Processing in Nov. 201

    How to Understand LMMSE Transceiver Design for MIMO Systems From Quadratic Matrix Programming

    Full text link
    In this paper, a unified linear minimum mean-square-error (LMMSE) transceiver design framework is investigated, which is suitable for a wide range of wireless systems. The unified design is based on an elegant and powerful mathematical programming technology termed as quadratic matrix programming (QMP). Based on QMP it can be observed that for different wireless systems, there are certain common characteristics which can be exploited to design LMMSE transceivers e.g., the quadratic forms. It is also discovered that evolving from a point-to-point MIMO system to various advanced wireless systems such as multi-cell coordinated systems, multi-user MIMO systems, MIMO cognitive radio systems, amplify-and-forward MIMO relaying systems and so on, the quadratic nature is always kept and the LMMSE transceiver designs can always be carried out via iteratively solving a number of QMP problems. A comprehensive framework on how to solve QMP problems is also given. The work presented in this paper is likely to be the first shoot for the transceiver design for the future ever-changing wireless systems.Comment: 31 pages, 4 figures, Accepted by IET Communication

    Hybrid Transceiver Optimization for Multi-Hop Communications

    Full text link
    Multi-hop communication with the aid of large-scale antenna arrays will play a vital role in future emergence communication systems. In this paper, we investigate amplify-and-forward based and multiple-input multiple-output assisted multi-hop communication, in which all nodes employ hybrid transceivers. Moreover, channel errors are taken into account in our hybrid transceiver design. Based on the matrix-monotonic optimization framework, the optimal structures of the robust hybrid transceivers are derived. By utilizing these optimal structures, the optimizations of analog transceivers and digital transceivers can be separated without loss of optimality. This fact greatly simplifies the joint optimization of analog and digital transceivers. Since the optimization of analog transceivers under unit-modulus constraints is non-convex, a projection type algorithm is proposed for analog transceiver optimization to overcome this difficulty. Based on the derived analog transceivers, the optimal digital transceivers can then be derived using matrix-monotonic optimization. Numeral results obtained demonstrate the performance advantages of the proposed hybrid transceiver designs over other existing solutions.Comment: 32 pages, 6 figures. This manuscript has been submitted to IEEE Journal on Selected Areas in Communications (special issue on Multiple Antenna Technologies for Beyond 5G

    Joint Transceiver Design Algorithms for Multiuser MISO Relay Systems with Energy Harvesting

    Full text link
    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
    • …
    corecore