Numerical optimization has played a central role in addressing key signal processing (SP) problems Highly effective methods have been developed for a large variety of SP applications such as communications, radar, filter design, and speech and image analytics, just to name a few However, optimization algorithms often entail considerable complexity, which creates a serious gap between theoretical design/analysis and real-time processing In this paper, we aim at providing a new learning-based perspective to address this challenging issue The key idea is to treat the input and output of an SP algorithm as an unknown nonlinear mapping and use a deep neural network (DNN) to approximate it If the nonlinear mapping can be learned accurately by a DNN of moderate size, then SP tasks can be performed effectively—since passing the input through a DNN only requires a small number of simple operations In our paper, we first identify a class of optimization algorithms that can be accurately approximated by a fully connected DNN Second, to demonstrate the effectiveness of the proposed approach, we apply it to approximate a popular interference management algorithm, namely, the WMMSE algorithm Extensive experiments using both synthetically generated wireless channel data and real DSL channel data have been conducted It is shown that, in practice, only a small network is sufficient to obtain high approximation accuracy, and DNNs can achieve orders of magnitude speedup in computational time compared to the state-of-the-art interference management algorithm

Learning to Optimize: Training Deep Neural Networks for Interference Management

The use of multiple antennas at base stations is a key component in the design of cellular communication systems that can meet high-capacity demands in the downlink. Under ideal conditions, the gai ...

/pdf/optimal-resource-allocation-in-coordinated-multi-cell-24v9usph8q.pdf

Optimal Resource Allocation in Coordinated Multi-Cell Systems

We propose a novel decomposition framework for the distributed optimization of general nonconvex sum-utility functions arising naturally in the system design of wireless multi-user interfering systems. Our main contributions are i) the development of the first class of (inexact) Jacobi best-response algorithms with provable convergence, where all the users simultaneously and iteratively solve a suitably convexified version of the original sum-utility optimization problem; ii) the derivation of a general dynamic pricing mechanism that provides a unified view of existing pricing schemes that are based, instead, on heuristics; and iii) a framework that can be easily particularized to well-known applications, giving rise to very efficient practical (Jacobi or Gauss-Seidel) algorithms that outperform existing ad hoc methods proposed for very specific problems. Interestingly, our framework contains as special cases well-known gradient algorithms for nonconvex sum-utility problems, and many block-coordinate descent schemes for convex functions.

Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems

In this correspondence, we study the downlink transmission in a multi-cell system, where multiple base stations (BSs) each with multiple antennas cooperatively design their respective transmit beamforming vectors to optimize the overall system performance. For simplicity, it is assumed that all mobile stations (MSs) are equipped with a single antenna each, and there is one active MS in each cell at one time. Accordingly, the system of interests can be modeled by a multiple-input single-output (MISO) Gaussian interference channel (IC), termed as MISO-IC, with interference treated as noise. We propose a new method to characterize different rate-tuples for active MSs on the Pareto boundary of the achievable rate region for the MISO-IC, by exploring the relationship between the MISO-IC and the cognitive radio (CR) MISO channel. We show that each Pareto-boundary rate-tuple of the MISO-IC can be achieved in a decentralized manner when each of the BSs attains its own channel capacity subject to a certain set of interference-power constraints (also known as interference-temperature constraints in the CR system) at the other MS receivers. Furthermore, we show that this result leads to a new decentralized algorithm for implementing the multi-cell cooperative downlink beamforming.

Cooperative Interference Management With MISO Beamforming

In a cellular wireless system, users located at cell edges often suffer significant out-of-cell interference. Assuming each base station is equipped with multiple antennas, we can model this scenario as a multiple-input single-output (MISO) interference channel. In this paper we consider a coordinated beamforming approach whereby multiple base stations jointly optimize their downlink beamforming vectors in order to simultaneously improve the data rates of a given group of cell edge users. Assuming perfect channel knowledge, we formulate this problem as the maximization of a system utility (which balances user fairness and average user rates), subject to individual power constraints at each base station. We show that, for the single-carrier case and when the number of antennas at each base station is at least two, the optimal coordinated beamforming problem is NP-hard for both the harmonic mean utility and the proportional fairness utility. For general utilities, we propose a cyclic coordinate descent algorithm, which enables each transmitter to update its beamformer locally with limited information exchange and establish its global convergence to a stationary point. We illustrate its effectiveness in computer simulations by using the space matched beamformer as the benchmark.

Coordinated Beamforming for MISO Interference Channel: Complexity Analysis and Efficient Algorithms

In this article, we discuss distributed resource allocation schemes in which each transmitter determines its allocation autonomously, based on the exchange of interference prices. These schemes have been primarily motivated by the common model for spectrum sharing in which a user or service provider may transmit in a designated band provided that they abide by certain rules (e.g., a standard such as 802.11). An attractive property of these schemes is that they are scalable, i.e., the information exchange and overhead can be adapted according to the size of the network.

/pdf/distributed-resource-allocation-schemes-5b1n9rjboi.pdf

C. Shi

Papers

Distributed resource allocation schemes