427 research outputs found
Flexible Backhaul Design and Degrees of Freedom for Linear Interference Networks
The considered problem is that of maximizing the degrees of freedom (DoF) in
cellular downlink, under a backhaul load constraint that limits the number of
messages that can be delivered from a centralized controller to the base
station transmitters. A linear interference channel model is considered, where
each transmitter is connected to the receiver having the same index as well as
one succeeding receiver. The backhaul load is defined as the sum of all the
messages available at all the transmitters normalized by the number of users.
When the backhaul load is constrained to an integer level B, the asymptotic per
user DoF is shown to equal (4B-1)/(4B), and it is shown that the optimal
assignment of messages to transmitters is asymmetric and satisfies a local
cooperation constraint and that the optimal coding scheme relies only on
zero-forcing transmit beamforming. Finally, an extension of the presented
coding scheme is shown to apply for more general locally connected and
two-dimensional networks.Comment: Submitted to IEEE International Symposium on Information Theory (ISIT
2014
Degrees of Freedom of Interference Channels with CoMP Transmission and Reception
We study the Degrees of Freedom (DoF) of the K-user interference channel with
coordinated multi-point (CoMP) transmission and reception. Each message is
jointly transmitted by M_t successive transmitters, and is jointly received by
M_r successive receivers. We refer to this channel as the CoMP channel with a
transmit cooperation order of M_t and receive cooperation order of M_r. Since
the channel has a total of K transmit antennas and K receive antennas, the
maximum possible DoF is equal to K. We show that the CoMP channel has K DoF if
and only if M_t + M_r is greater than or equal to K+1. For the general case, we
derive an outer bound that states that the DoF is bounded above by the ceiling
of (K+M_t+M_r-2)/2. For the special case with only CoMP transmission, i.e, M_r
= 1, we propose a scheme that can achieve (K+M_t-1)/2 DoF for all K < 10, and
conjecture that the result holds true for all K . The achievability proofs are
based on the notion of algebraic independence from algebraic geometry.Comment: Submitted to IEEE Transactions on Information Theor
Transceiver design and interference alignment in wireless networks: complexity and solvability
University of Minnesota M.S. thesis. November 2013. Major: Mathematics. Advisor: Gennady Lyubeznik. 1 computer file (PDF); vi, 58 pages.This thesis aims to theoretically study a modern linear transceiver design strategy, namely interference alignment, in wireless networks. We consider an interference channel whereby each transmitter and receiver are equipped with multiple antennas. The basic problem is to design optimal linear transceivers (or beamformers) that can maximize the system throughput. The recent work [1] suggests that optimal beamformers should maximize the total degrees of freedom through the interference alignment equations. In this thesis, we first state the interference alignment equations and study the computational complexity of solving these equations. In particular, we prove that the problem of maximizing the total degrees of freedom for a given interference channel is NP-hard. Moreover, it is shown that even checking the achievability of a given tuple of degrees of freedom is NP-hard when each receiver is equipped with at least three antennas. Interestingly, the same problem becomes polynomial time solvable when each transmit/receive node is equipped with no more than two antennas.The second part of this thesis answers an open theoretical question about interference alignment on generic channels: What degrees of freedom tuples (d1, d2, ..., dK) are achievable through linear interference alignment for generic channels? We partially answer this question by establishing a general condition that must be satisfied by any degrees of freedom tuple (d1, d2, ..., dK) achievable through linear interference alignment. For a symmetric system with dk = d for all k, this condition implies that the total achievable DoF cannot grow linearly with K, and is in fact no more than K(M + N)/(K + 1), where M and N are the number of transmit and receive antennas, respectively. We also show that this bound is tight when the number of antennas at each transceiver is divisible by the number of data streams
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
Cellular Interference Alignment
Interference alignment promises that, in Gaussian interference channels, each
link can support half of a degree of freedom (DoF) per pair of transmit-receive
antennas. However, in general, this result requires to precode the data bearing
signals over a signal space of asymptotically large diversity, e.g., over an
infinite number of dimensions for time-frequency varying fading channels, or
over an infinite number of rationally independent signal levels, in the case of
time-frequency invariant channels. In this work we consider a wireless cellular
system scenario where the promised optimal DoFs are achieved with linear
precoding in one-shot (i.e., over a single time-frequency slot). We focus on
the uplink of a symmetric cellular system, where each cell is split into three
sectors with orthogonal intra-sector multiple access. In our model,
interference is "local", i.e., it is due to transmitters in neighboring cells
only. We consider a message-passing backhaul network architecture, in which
nearby sectors can exchange already decoded messages and propose an alignment
solution that can achieve the optimal DoFs. To avoid signaling schemes relying
on the strength of interference, we further introduce the notion of
\emph{topologically robust} schemes, which are able to guarantee a minimum rate
(or DoFs) irrespectively of the strength of the interfering links. Towards this
end, we design an alignment scheme which is topologically robust and still
achieves the same optimum DoFs
- …