Robust Monotonic Optimization Framework for Multicell MISO Systems

The performance of multiuser systems is both difficult to measure fairly and to optimize. Most resource allocation problems are non-convex and NP-hard, even under simplifying assumptions such as perfect channel knowledge, homogeneous channel properties among users, and simple power constraints. We establish a general optimization framework that systematically solves these problems to global optimality. The proposed branch-reduce-and-bound (BRB) algorithm handles general multicell downlink systems with single-antenna users, multiantenna transmitters, arbitrary quadratic power constraints, and robustness to channel uncertainty. A robust fairness-profile optimization (RFO) problem is solved at each iteration, which is a quasi-convex problem and a novel generalization of max-min fairness. The BRB algorithm is computationally costly, but it shows better convergence than the previously proposed outer polyblock approximation algorithm. Our framework is suitable for computing benchmarks in general multicell systems with or without channel uncertainty. We illustrate this by deriving and evaluating a zero-forcing solution to the general problem.Comment: Published in IEEE Transactions on Signal Processing, 16 pages, 9 figures, 2 table

Optimality Properties, Distributed Strategies, and Measurement-Based Evaluation of Coordinated Multicell OFDMA Transmission

The throughput of multicell systems is inherently limited by interference and the available communication resources. Coordinated resource allocation is the key to efficient performance, but the demand on backhaul signaling and computational resources grows rapidly with number of cells, terminals, and subcarriers. To handle this, we propose a novel multicell framework with dynamic cooperation clusters where each terminal is jointly served by a small set of base stations. Each base station coordinates interference to neighboring terminals only, thus limiting backhaul signalling and making the framework scalable. This framework can describe anything from interference channels to ideal joint multicell transmission. The resource allocation (i.e., precoding and scheduling) is formulated as an optimization problem (P1) with performance described by arbitrary monotonic functions of the signal-to-interference-and-noise ratios (SINRs) and arbitrary linear power constraints. Although (P1) is non-convex and difficult to solve optimally, we are able to prove: 1) Optimality of single-stream beamforming; 2) Conditions for full power usage; and 3) A precoding parametrization based on a few parameters between zero and one. These optimality properties are used to propose low-complexity strategies: both a centralized scheme and a distributed version that only requires local channel knowledge and processing. We evaluate the performance on measured multicell channels and observe that the proposed strategies achieve close-to-optimal performance among centralized and distributed solutions, respectively. In addition, we show that multicell interference coordination can give substantial improvements in sum performance, but that joint transmission is very sensitive to synchronization errors and that some terminals can experience performance degradations.Comment: Published in IEEE Transactions on Signal Processing, 15 pages, 7 figures. This version corrects typos related to Eq. (4) and Eq. (28

Adaptive Bit Partitioning for Multicell Intercell Interference Nulling with Delayed Limited Feedback

Base station cooperation can exploit knowledge of the users' channel state information (CSI) at the transmitters to manage co-channel interference. Users have to feedback CSI of the desired and interfering channels using finite-bandwidth backhaul links. Existing codebook designs for single-cell limited feedback can be used for multicell cooperation by partitioning the available feedback resources between the multiple channels. In this paper, a new feedback-bit allocation strategy is proposed, as a function of the delays in the communication links and received signal strengths in the downlink. Channel temporal correlation is modeled as a function of delay using the Gauss-Markov model. Closed-form expressions for bit partitions are derived to allocate more bits to quantize the stronger channels with smaller delays and fewer bits to weaker channels with larger delays, assuming random vector quantization. Cellular network simulations are used to show that the proposed algorithm yields higher sum-rates than an equal-bit allocation technique.Comment: Submitted to IEEE Transactions on Signal Processing, July 201

Distributed Linear Precoding and User Selection in Coordinated Multicell Systems

In this manuscript we tackle the problem of semi-distributed user selection with distributed linear precoding for sum rate maximization in multiuser multicell systems. A set of adjacent base stations (BS) form a cluster in order to perform coordinated transmission to cell-edge users, and coordination is carried out through a central processing unit (CU). However, the message exchange between BSs and the CU is limited to scheduling control signaling and no user data or channel state information (CSI) exchange is allowed. In the considered multicell coordinated approach, each BS has its own set of cell-edge users and transmits only to one intended user while interference to non-intended users at other BSs is suppressed by signal steering (precoding). We use two distributed linear precoding schemes, Distributed Zero Forcing (DZF) and Distributed Virtual Signal-to-Interference-plus-Noise Ratio (DVSINR). Considering multiple users per cell and the backhaul limitations, the BSs rely on local CSI to solve the user selection problem. First we investigate how the signal-to-noise-ratio (SNR) regime and the number of antennas at the BSs affect the effective channel gain (the magnitude of the channels after precoding) and its relationship with multiuser diversity. Considering that user selection must be based on the type of implemented precoding, we develop metrics of compatibility (estimations of the effective channel gains) that can be computed from local CSI at each BS and reported to the CU for scheduling decisions. Based on such metrics, we design user selection algorithms that can find a set of users that potentially maximizes the sum rate. Numerical results show the effectiveness of the proposed metrics and algorithms for different configurations of users and antennas at the base stations.Comment: 12 pages, 6 figure

Adaptive Multicell 3D Beamforming in Multi-Antenna Cellular Networks

We consider a cellular network with multi-antenna base stations (BSs) and single-antenna users, multicell cooperation, imperfect channel state information, and directional antennas each with a vertically adjustable beam. We investigate the impact of the elevation angle of the BS antenna pattern, denoted as tilt, on the performance of the considered network when employing either a conventional single-cell transmission or a fully cooperative multicell transmission. Using the results of this investigation, we propose a novel hybrid multicell cooperation technique in which the intercell interference is controlled via either cooperative beamforming in the horizontal plane or coordinated beamfroming in the vertical plane of the wireless channel, denoted as adaptive multicell 3D beamforming. The main idea is to divide the coverage area into two disjoint vertical regions and adapt the multicell cooperation strategy at the BSs when serving each region. A fair scheduler is used to share the time-slots between the vertical regions. It is shown that the proposed technique can achieve performance comparable to that of a fully cooperative transmission but with a significantly lower complexity and signaling requirements. To make the performance analysis computationally efficient, analytical expressions for the user ergodic rates under different beamforming strategies are also derived.Comment: Accepted for publication in IEEE Transaction on Vehicular Technolog

Large System Analysis of Power Normalization Techniques in Massive MIMO

Linear precoding has been widely studied in the context of Massive multiple-input-multiple-output (MIMO) together with two common power normalization techniques, namely, matrix normalization (MN) and vector normalization (VN). Despite this, their effect on the performance of Massive MIMO systems has not been thoroughly studied yet. The aim of this paper is to fulfill this gap by using large system analysis. Considering a system model that accounts for channel estimation, pilot contamination, arbitrary pathloss, and per-user channel correlation, we compute tight approximations for the signal-to-interference-plus-noise ratio and the rate of each user equipment in the system while employing maximum ratio transmission (MRT), zero forcing (ZF), and regularized ZF precoding under both MN and VN techniques. Such approximations are used to analytically reveal how the choice of power normalization affects the performance of MRT and ZF under uncorrelated fading channels. It turns out that ZF with VN resembles a sum rate maximizer while it provides a notion of fairness under MN. Numerical results are used to validate the accuracy of the asymptotic analysis and to show that in Massive MIMO, non-coherent interference and noise, rather than pilot contamination, are often the major limiting factors of the considered precoding schemes.Comment: 12 pages, 3 figures, Accepted for publication in the IEEE Transactions on Vehicular Technolog

Técnicas de pré-codificação para sistemas multicelulares coordenados

Doutoramento em TelecomunicaçõesCoordenação Multicélula é um tópico de investigação em rápido crescimento e uma solução promissora para controlar a interferência entre células em sistemas celulares, melhorando a equidade do sistema e aumentando a sua capacidade. Esta tecnologia já está em estudo no LTEAdvanced sob o conceito de coordenação multiponto (COMP). Existem várias abordagens sobre coordenação multicélula, dependendo da quantidade e do tipo de informação partilhada pelas estações base, através da rede de suporte (backhaul network), e do local onde essa informação é processada, i.e., numa unidade de processamento central ou de uma forma distribuída em cada estação base. Nesta tese, são propostas técnicas de pré-codificação e alocação de potência considerando várias estratégias: centralizada, todo o processamento é feito na unidade de processamento central; semidistribuída, neste caso apenas parte do processamento é executado na unidade de processamento central, nomeadamente a potência alocada a cada utilizador servido por cada estação base; e distribuída em que o processamento é feito localmente em cada estação base. Os esquemas propostos são projectados em duas fases: primeiro são propostas soluções de pré-codificação para mitigar ou eliminar a interferência entre células, de seguida o sistema é melhorado através do desenvolvimento de vários esquemas de alocação de potência. São propostas três esquemas de alocação de potência centralizada condicionada a cada estação base e com diferentes relações entre desempenho e complexidade. São também derivados esquemas de alocação distribuídos, assumindo que um sistema multicelular pode ser visto como a sobreposição de vários sistemas com uma única célula. Com base neste conceito foi definido uma taxa de erro média virtual para cada um desses sistemas de célula única que compõem o sistema multicelular, permitindo assim projectar esquemas de alocação de potência completamente distribuídos. Todos os esquemas propostos foram avaliados em cenários realistas, bastante próximos dos considerados no LTE. Os resultados mostram que os esquemas propostos são eficientes a remover a interferência entre células e que o desempenho das técnicas de alocação de potência propostas é claramente superior ao caso de não alocação de potência. O desempenho dos sistemas completamente distribuídos é inferior aos baseados num processamento centralizado, mas em contrapartida podem ser usados em sistemas em que a rede de suporte não permita a troca de grandes quantidades de informação.Multicell coordination is a promising solution for cellular wireless systems to mitigate inter-cell interference, improving system fairness and increasing capacity and thus is already under study in LTE-A under the coordinated multipoint (CoMP) concept. There are several coordinated transmission approaches depending on the amount of information shared by the transmitters through the backhaul network and where the processing takes place i.e. in a central processing unit or in a distributed way on each base station. In this thesis, we propose joint precoding and power allocation techniques considering different strategies: Full-centralized, where all the processing takes place at the central unit; Semi-distributed, in this case only some process related with power allocation is done at the central unit; and Fulldistributed, where all the processing is done locally at each base station. The methods are designed in two phases: first the inter-cell interference is removed by applying a set of centralized or distributed precoding vectors; then the system is further optimized by centralized or distributed power allocation schemes. Three centralized power allocation algorithms with per-BS power constraint and different complexity tradeoffs are proposed. Also distributed power allocation schemes are proposed by considering the multicell system as superposition of single cell systems, where we define the average virtual bit error rate (BER) of interference-free single cell system, allowing us to compute the power allocation coefficients in a distributed manner at each BS. All proposed schemes are evaluated in realistic scenarios considering LTE specifications. The numerical evaluations show that the proposed schemes are efficient in removing inter-cell interference and improve system performance comparing to equal power allocation. Furthermore, fulldistributed schemes can be used when the amounts of information to be exchanged over the backhaul is restricted, although system performance is slightly degraded from semi-distributed and full-centralized schemes, but the complexity is considerably lower. Besides that for high degrees of freedom distributed schemes show similar behaviour to centralized ones