29 research outputs found

    Robust Lattice Alignment for K-user MIMO Interference Channels with Imperfect Channel Knowledge

    Full text link
    In this paper, we consider a robust lattice alignment design for K-user quasi-static MIMO interference channels with imperfect channel knowledge. With random Gaussian inputs, the conventional interference alignment (IA) method has the feasibility problem when the channel is quasi-static. On the other hand, structured lattices can create structured interference as opposed to the random interference caused by random Gaussian symbols. The structured interference space can be exploited to transmit the desired signals over the gaps. However, the existing alignment methods on the lattice codes for quasi-static channels either require infinite SNR or symmetric interference channel coefficients. Furthermore, perfect channel state information (CSI) is required for these alignment methods, which is difficult to achieve in practice. In this paper, we propose a robust lattice alignment method for quasi-static MIMO interference channels with imperfect CSI at all SNR regimes, and a two-stage decoding algorithm to decode the desired signal from the structured interference space. We derive the achievable data rate based on the proposed robust lattice alignment method, where the design of the precoders, decorrelators, scaling coefficients and interference quantization coefficients is jointly formulated as a mixed integer and continuous optimization problem. The effect of imperfect CSI is also accommodated in the optimization formulation, and hence the derived solution is robust to imperfect CSI. We also design a low complex iterative optimization algorithm for our robust lattice alignment method by using the existing iterative IA algorithm that was designed for the conventional IA method. Numerical results verify the advantages of the proposed robust lattice alignment method

    Degrees of Freedom for the MIMO Multi-way Relay Channel

    Full text link
    This paper investigates the degrees of freedom (DoF) of the L-cluster, K-user MIMO multi-way relay channel, where users in each cluster wish to exchange messages within the cluster, and they can only communicate through the relay. A novel DoF upper bound is derived by providing users with carefully designed genie information. Achievable DoF is identified using signal space alignment and multiple-access transmission. For the two-cluster MIMO multi-way relay channel with two users in each cluster, DoF is established for the general case when users and the relay have arbitrary number of antennas, and it is shown that the DoF upper bound can be achieved using signal space alignment or multiple-access transmission, or a combination of both. The result is then generalized to the three user case. For the L-cluster K-user MIMO multi-way relay channel in the symmetric setting, conditions under which the DoF upper bound can be achieved are established. In addition to being shown to be tight in a variety of scenarios of interests of the multi-way relay channel, the newly derived upperbound also establishes the optimality of several previously established achievable DoF results for multiuser relay channels that are special cases of the multi-way relay channel.Comment: submitted to IEEE Transactions on Information Theor

    Decentralized Delay Optimal Control for Interference Networks with Limited Renewable Energy Storage

    Full text link
    In this paper, we consider delay minimization for interference networks with renewable energy source, where the transmission power of a node comes from both the conventional utility power (AC power) and the renewable energy source. We assume the transmission power of each node is a function of the local channel state, local data queue state and local energy queue state only. In turn, we consider two delay optimization formulations, namely the decentralized partially observable Markov decision process (DEC-POMDP) and Non-cooperative partially observable stochastic game (POSG). In DEC-POMDP formulation, we derive a decentralized online learning algorithm to determine the control actions and Lagrangian multipliers (LMs) simultaneously, based on the policy gradient approach. Under some mild technical conditions, the proposed decentralized policy gradient algorithm converges almost surely to a local optimal solution. On the other hand, in the non-cooperative POSG formulation, the transmitter nodes are non-cooperative. We extend the decentralized policy gradient solution and establish the technical proof for almost-sure convergence of the learning algorithms. In both cases, the solutions are very robust to model variations. Finally, the delay performance of the proposed solutions are compared with conventional baseline schemes for interference networks and it is illustrated that substantial delay performance gain and energy savings can be achieved

    Beamforming Coordination Techniques in OFDM Multi-hop Cellular Networks

    Get PDF
    English: Design and evaluate multi-hop cellular networks assuming coordination among multiantenna base stations and relay stations using linear precoders .Castellano: Diseñar y evaluar redes celulares multisalto asumiendo coordinación entre estaciones base y repetidores multiantena usando precodificadores lineales .Català: Dissenyar i avaluar xarxes cel·lulars multisalt assumint coordinació entre estacions base i repetidors multiantena fent servir precodificadors lineals

    Interference Management in MIMO Wireless Networks

    Get PDF
    The scarce and overpopulated radio spectrum is going to present a major barrier to the growth and development of future wireless networks. As such, spectrum sharing seems to be inevitable to accommodate the exploding demand for high data rate applications. A major challenge to realizing the potential advantages of spectrum sharing is interference management. This thesis deals with interference management techniques in noncooperative networks. In specific, interference alignment is used as a powerful technique for interference management. We use the degrees of freedom (DoF) as the figure of merit to evaluate the performance improvement due to the interference management schemes. This dissertation is organized in two parts. In the first part, we consider the K-user multiple input multiple output (MIMO) Gaussian interference channel (IC) with M antennas at each transmitter and N antennas at each receiver. This channel models the interaction between K transmitter-receiver pairs sharing the same spectrum for data communication. It is assumed that the channel coefficients are constant and are available at all nodes prior to data transmission. A new cooperative upper-bound on the DoF of this channel is developed which outperforms the known bounds. Also, a new achievable transmission scheme is provided based on the idea of interference alignment. It is shown that the achievable DoF meets the upper-bound when the number of users is greater than a certain threshold, and thus it reveals the channel DoF. In the second part, we consider communication over MIMO interference and X channels in a fast fading environment. It is assumed that the transmitters obtain the channel state information (CSI) after a finite delay which is greater than the coherence time of the channel. In other words, the CSI at the transmitters becomes outdated prior to being exploited for the current transmission. New transmission schemes are proposed which exploit the knowledge of the past CSI at the transmitters to retrospectively align interference in the subsequent channel uses. The proposed transmission schemes offer DoF gain compared to having no CSI at transmitters. The achievable DoF results are the best known results for these channels. Simple cooperative upper-bounds are developed to prove the tightness of our achievable results for some network configurations

    Quelques Aspects des RĂ©seaux Multi-Cellules Multi-Utilisateurs MIMO : DĂ©lai, Conception d'Emetteur-RĂ©cepteur, SĂ©lection d'Utilisateurs et Topologie

    Get PDF
    In order to meet ever-growing needs for capacity in wireless networks, transmission techniques and the system models used to study their performances have rapidly evolved. From single-user single-antenna point-to-point communications to modern multi-cell multi-antenna cellular networks there have been large advances in technology. Along the way, several assumptions are made in order to have either more realistic models, but also to allow simpler analysis. We analyze three aspects of actual networks and try to benefit from them when possible or conversely, to mitigate their negative impact. This sometimes corrects overly optimistic results, for instance when delay in the channel state information (CSI) acquisition is no longer neglected. However, this sometimes also corrects overly pessimistic results, for instance when in a broadcast channel (BC) the number of users is no longer limited to be equal to the number of transmit antennas or when partial connectivity is taken into account in cellular networks.We first focus on the delay in the CSI acquisition because it greatly impairs the channel multiplexing gain if nothing is done to use the dead time during which the transmitters are not transmitting and do not yet have the CSI. We review and propose different schemes to use this dead time to improve the multiplexing gain in both the BC and the interference channel (IC). We evaluate the more relevant net multiplexing gain, taking into account the training and feedback overheads. Results are surprising because potential schemes to fight delay reveal to be burdened by impractical overheads in the BC. In the IC, an optimal scheme is proposed. It allows avoiding any loss of multiplexing gain even for significant feedback delay. Concerning the number of users, we propose a new criterion for the greedy user selection in a BC to benefit of the multi-user diversity, and two interference alignment schemes for the IC to benefit of having multiple users in each cell. Finally, partially connected cellular networks are considered and schemes to benefit from said partial connectivity to increase the multiplexing gain are proposed.Afin de répondre au besoin sans cesse croissant de capacité dans les réseaux sans fil, les techniques de transmission, et les modèles utilisés pour les étudier, ont évolués rapidement. De simples communications point à point avec une seuleantenne nous sommes passé aux réseaux cellulaires de nos jours: de multiples cellules et de multiples antennes à l’émission et à la réception. Progressivement, plusieurs hypothèses ont été faites, soit afin d’avoir des modèles réalistes, mais aussi parfois pour permettre une analyse plus simple. Nous examinons et analysons l’impact de trois aspects des réseaux réels. Cela revient parfois à corriger des résultats trop optimistes, par exemple lorsque le délai dans l’acquisition des coefficients des canaux n’est plus négligé. Cela revient parfois à corriger des résultats trop pessimistes, par exemple, lorsque dans un canal de diffusion (BC) le nombre d’utilisateurs n’est plus limité au nombre d’antennes d’émission ou lorsque la connectivité partielle est prise en compte dans les réseaux cellulaires. Plus précisément, dans cette thèse, nous nous concentrons sur le délai dans l’acquisition des coefficients des canaux par l’émetteur puisque sa prise en comptedétériore grandement le gain de multiplexage du canal si rien n’est fait pour utiliser efficacement le temps mort au cours duquel les émetteurs ne transmettent pas et n’ont pas encore la connaissance du canal. Nous examinons et proposons des schémas de transmission pour utiliser efficacement ce temps mort afin d’améliorer le gain de multiplexage. Nous évaluons le gain de multiplexage net, plus pertinent, en tenant compte le temps passé à envoyer symboles d’apprentissage et à les renvoyer aux transmetteurs. Les résultats sont surprenant puisque les schémas contre le retard de connaissance de canal se révèle être impraticables à cause du cout du partage de la connaissance des canaux. Dans les réseaux multi-cellulaires, un schéma de transmission optimal est proposé et permet de n’avoir aucune perte de gain de multiplexage même en cas de retard important dans la connaissance de canal. En ce qui concerne le nombre d’utilisateurs, nous proposons un nouveau critère pour la sélection des utilisateurs de les configurations à une seule cellule afin de bénéficier de la diversité multi-utilisateurs, et nous proposons deux schémas d’alignement d’interférence pour systèmes multi-cellulaires afin de bénéficier du fait qu’il y a généralement plusieurs utilisateurs dans chaque cellule. Enfin, les réseaux cellulaires partiellement connectés sont étudiés et des schémas bénéficiant de la connectivité partielle pour augmenter le gain de multiplexage sont proposés

    Integer-forcing architectures: cloud-radio access networks, time-variation and interference alignment

    Full text link
    Next-generation wireless communication systems will need to contend with many active mobile devices, each of which will require a very high data rate. To cope with this growing demand, network deployments are becoming denser, leading to higher interference between active users. Conventional architectures aim to mitigate this interference through careful design of signaling and scheduling protocols. Unfortunately, these methods become less effective as the device density increases. One promising option is to enable cellular basestations (i.e., cell towers) to jointly process their received signals for decoding users’ data packets as well as to jointly encode their data packets to the users. This joint processing architecture is often enabled by a cloud radio access network that links the basestations to a central processing unit via dedicated connections. One of the main contributions of this thesis is a novel end-to-end communications architecture for cloud radio access networks as well as a detailed comparison to prior approaches, both via theoretical bounds and numerical simulations. Recent work has that the following high-level approach has numerous advantages: each basestation quantizes its observed signal and sends it to the central processing unit for decoding, which in turn generates signals for the basestations to transmit, and sends them quantized versions. This thesis follows an integer-forcing approach that uses the fact that, if codewords are drawn from a linear codebook, then their integer-linear combinations are themselves codewords. Overall, this architecture requires integer-forcing channel coding from the users to the central processing unit and back, which handles interference between the users’ codewords, as well as integer-forcing source coding from the basestations to the central processing unit and back, which handles correlations between the basestations’ analog signals. Prior work on integer-forcing has proposed and analyzed channel coding strategies as well as a source coding strategy for the basestations to the central processing unit, and this thesis proposes a source coding strategy for the other direction. Iterative algorithms are developed to optimize the parameters of the proposed architecture, which involve real-valued beamforming and equalization matrices and integer-valued coefficient matrices in a quadratic objective. Beyond the cloud radio setting, it is argued that the integer-forcing approach is a promising framework for interference alignment between multiple transmitter-receiver pairs. In this scenario, the goal is to align the interfering data streams so that, from the perspective of each receiver, there seems to be only a signal receiver. Integer-forcing interference alignment accomplishes this objective by having each receiver recover two linear combinations that can then be solved for the desired signal and the sum of the interference. Finally, this thesis investigates the impact of channel coherence on the integer-forcing strategy via numerical simulations

    Design of large polyphase filters in the Quadratic Residue Number System

    Full text link
    corecore