Proceedings Article10.1109/ALLERTON.2008.4797673
Interference Alignment for Cellular Networks
Changho Suh,David Tse +1 more
- 01 Sep 2008
- pp 1037-1044
466
TL;DR: The scheme that approaches to interference-free degree-of-freedom (dof) as the number K of users in each cell increases is developed, which requires finite dimensions growing linearly with K, i.e., ~O(K).
read more
Abstract: In this paper, we propose a new way of interference management for cellular networks. We develop the scheme that approaches to interference-free degree-of-freedom (dof) as the number K of users in each cell increases. Also we find the corresponding bandwidth scaling conditions for typical wireless channels: multi-path channels and single-path channels with propagation delay. The scheme is based on interference alignment. Especially for more-than-two-cell cases where there are multiple non-intended BSs, we propose a new version of interference alignment, namely subspace interference alignment. The idea is to align interferences into multi-dimensional subspace (instead of one dimension) for simultaneous alignments at multiple non-intended BSs. The proposed scheme requires finite dimensions growing linearly with K, i.e., ~O(K).
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
On Feasibility of Interference Alignment in MIMO Interference Networks
TL;DR: This work explores the feasibility of interference alignment in signal vector space-based only on beamforming-for K-user MIMO interference channels and shows that the connection between feasible and proper systems can be further strengthened by including standard information theoretic outer bounds in the feasibility analysis.
849
A Survey on Network Codes for Distributed Storage
Alexandros G. Dimakis,Kannan Ramchandran,Yunnan Wu,Changho Suh +3 more
- 04 Feb 2011
TL;DR: In this paper, the authors provide an overview of the research results on network coding for distributed storage systems and provide a comparison between erasure codes and network coding techniques, showing that maintenance bandwidth can be reduced by orders of magnitude compared to standard erasure code.
816
Deep-Reinforcement-Learning-Based Optimization for Cache-Enabled Opportunistic Interference Alignment Wireless Networks
TL;DR: Simulation results are presented to show that the performance of cache-enabled opportunistic IA networks in terms of the network's sum rate and energy efficiency can be significantly improved by using the proposed approach.
362
Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed Storage
TL;DR: This paper addresses exact repair MDS codes, which allow for any single failed node to be repaired exactly with access to any arbitrary set of d survivor nodes, and characterize the capacity of a class of multisource nonmulticast networks.
289
•Posted Content
Downlink Interference Alignment
Changho Suh,Minnie Ho,David Tse +2 more
TL;DR: This work develops an interference alignment (IA) technique for a downlink cellular system that can be implemented with minimal changes to an existing cellular system where the feedback mechanism (within a cell) is already being considered for supporting multi-user MIMO.
239
References
Interference Alignment and Degrees of Freedom of the $K$ -User Interference Channel
Viveck R. Cadambe,Syed A. Jafar +1 more
TL;DR: For the fully connected K user wireless interference channel where the channel coefficients are time-varying and are drawn from a continuous distribution, the sum capacity is characterized as C(SNR)=K/2log (SNR)+o(log( SNR), which almost surely has K/2 degrees of freedom.
Gaussian Interference Channel Capacity to Within One Bit
TL;DR: The capacity of the two-user Gaussian interference channel has been open for 30 years and the best known achievable region is due to Han and Kobayashi as mentioned in this paper, but its characterization is very complicated.
1.6K
Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality
Pramod Viswanath,David Tse +1 more
TL;DR: The sum capacity of the vector Gaussian broadcast channel is characterized by showing that the existing inner bound of Marton and the existing upper bound of Sato are tight for this channel.
•Posted Content
Gaussian Interference Channel Capacity to Within One Bit
TL;DR: This work shows that the existing outer bounds can in fact be arbitrarily loose in some parameter ranges, and by deriving new outer bounds, it is shown that a very simple and explicit Han-Kobayashi type scheme can achieve to within a single bit per second per hertz of the capacity for all values of the channel parameters.
1.2K
Degrees of Freedom Region of the MIMO $X$ Channel
Syed A. Jafar,Shlomo Shamai +1 more
TL;DR: In this paper, the degrees of freedom region of a MIMO X channel with two transmitters, two receivers, each equipped with multiple antennas, where independent messages need to be conveyed over fixed channels from each transmitter to each receiver is analyzed.
828