110 research outputs found
Cooperative Downlink Multicell Preprocessing Relying on Reduced-Rate Back-Haul Data Exchange
Different-complexity multicell preprocessing (MCP) schemes employing distributed signal-to-interference leakageplus-noise ratio (SILNR) precoding techniques are proposed, which require reduced back-haul data exchange in comparison with the conventional MCP structure. Our results demonstrate that the proposed structures are capable of increasing the throughput achievable in the cell-edge area while offering different geographic rate profile distributions, as well as meeting different delay requirements
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
Distributed downlink multi-cell processing requiring reduced-rate back-haul data exchange
Different-complexity Multi-Cell Processing (MCP) schemes employing Distributed Signal-to-Interference-Leakage-plus-Noise-Ratio (SILNR) precoding techniques are proposed, which require reduced back-haul data exchange in comparison to the conventional MCP structure. Our results demonstrate that the proposed structures are capable of increasing the achievable cell-edge throughput and offering different geographic rate profile distributions as well as meeting different delay requirements
Massive MIMO has Unlimited Capacity
The capacity of cellular networks can be improved by the unprecedented array
gain and spatial multiplexing offered by Massive MIMO. Since its inception, the
coherent interference caused by pilot contamination has been believed to create
a finite capacity limit, as the number of antennas goes to infinity. In this
paper, we prove that this is incorrect and an artifact from using simplistic
channel models and suboptimal precoding/combining schemes. We show that with
multicell MMSE precoding/combining and a tiny amount of spatial channel
correlation or large-scale fading variations over the array, the capacity
increases without bound as the number of antennas increases, even under pilot
contamination. More precisely, the result holds when the channel covariance
matrices of the contaminating users are asymptotically linearly independent,
which is generally the case. If also the diagonals of the covariance matrices
are linearly independent, it is sufficient to know these diagonals (and not the
full covariance matrices) to achieve an unlimited asymptotic capacity.Comment: To appear in IEEE Transactions on Wireless Communications, 17 pages,
7 figure
Game Theory and Microeconomic Theory for Beamforming Design in Multiple-Input Single-Output Interference Channels
In interference-limited wireless networks, interference management techniques are important in order to improve the performance of the systems. Given that spectrum and energy are scarce resources in these networks, techniques that exploit the resources efficiently are desired. We consider a set of base stations operating concurrently in the same spectral band. Each base station is equipped with multiple antennas and transmits data to a single-antenna mobile user. This setting corresponds to the multiple-input single-output (MISO) interference channel (IFC). The receivers are assumed to treat interference signals as noise. Moreover, each transmitter is assumed to know the channels between itself and all receivers perfectly. We study the conflict between the transmitter-receiver pairs (links) using models from game theory and microeconomic theory. These models provide solutions to resource allocation problems which in our case correspond to the joint beamforming design at the transmitters. Our interest lies in solutions that are Pareto optimal. Pareto optimality ensures that it is not further possible to improve the performance of any link without reducing the performance of another link.
Strategic games in game theory determine the noncooperative choice of strategies of the players. The outcome of a strategic game is a Nash equilibrium. While the Nash equilibrium in the MISO IFC is generally not efficient, we characterize the necessary null-shaping constraints on the strategy space of each transmitter such that the Nash equilibrium outcome is Pareto optimal. An arbitrator is involved in this setting which dictates the constraints at each transmitter. In contrast to strategic games, coalitional games provide cooperative solutions between the players. We study cooperation between the links via coalitional games without transferable utility. Cooperative beamforming schemes considered are either zero forcing transmission or Wiener filter precoding. We characterize the necessary and sufficient conditions under which the core of the coalitional game with zero forcing transmission is not empty. The core solution concept specifies the strategies with which all players have the incentive to cooperate jointly in a grand coalition. While the core only considers the formation of the grand coalition, coalition formation games study coalition dynamics. We utilize a coalition formation algorithm, called merge-and-split, to determine stable link grouping. Numerical results show that while in the low signal-to-noise ratio (SNR) regime noncooperation between the links is efficient, at high SNR all links benefit in forming a grand coalition. Coalition formation shows its significance in the mid SNR regime where subset link cooperation provides joint performance gains.
We use the models of exchange and competitive market from microeconomic theory to determine Pareto optimal equilibria in the two-user MISO IFC. In the exchange model, the links are represented as consumers that can trade goods within themselves. The goods in our setting correspond to the parameters of the beamforming vectors necessary to achieve all Pareto optimal points in the utility region. We utilize the conflict representation of the consumers in the Edgeworth box, a graphical tool that depicts the allocation of the goods for the two consumers, to provide closed-form solution to all Pareto optimal outcomes. The exchange equilibria are a subset of the points on the Pareto boundary at which both consumers achieve larger utility then at the Nash equilibrium. We propose a decentralized bargaining process between the consumers which starts at the Nash equilibrium and ends at an outcome arbitrarily close to an exchange equilibrium. The design of the bargaining process relies on a systematic study of the allocations in the Edgeworth box. In comparison to the exchange model, a competitive market additionally defines prices for the goods. The equilibrium in this economy is called Walrasian and corresponds to the prices that equate the demand to the supply of goods. We calculate the unique Walrasian equilibrium and propose a coordination process that is realized by the arbitrator which distributes the Walrasian prices to the consumers. The consumers then calculate in a decentralized manner their optimal demand corresponding to beamforming vectors that achieve the Walrasian equilibrium. This outcome is Pareto optimal and lies in the set of exchange equilibria.
In this thesis, based on the game theoretic and microeconomic models, efficient beamforming strategies are proposed that jointly improve the performance of the systems. The gained results are applicable in interference-limited wireless networks requiring either coordination from the arbitrator or direct cooperation between the transmitters
- …