Interference Alignment as a Rank Constrained Rank Minimization Dimitris S. Papailiopoulos and Alexandros G. Dimakis USC Globecom 2010.

Slides:



Advertisements
Similar presentations
Underwater Acoustic MIMO Channel Capacity
Advertisements

Introduction to Algorithms
1 Modeling and Optimization of VLSI Interconnect Lecture 9: Multi-net optimization Avinoam Kolodny Konstantin Moiseev.
Lecture 8 – Nonlinear Programming Models Topics General formulations Local vs. global solutions Solution characteristics Convexity and convex programming.
EE359 – Lecture 16 Outline MIMO Beamforming MIMO Diversity/Multiplexing Tradeoffs MIMO Receiver Design Maximum-Likelihood, Decision Feedback, Sphere Decoder.
Noise Cancelation for MIMO System Prepared by: Heba Hamad Rawia Zaid Rua Zaid Supervisor: Dr.Yousef Dama.
June 4, 2015 On the Capacity of a Class of Cognitive Radios Sriram Sridharan in collaboration with Dr. Sriram Vishwanath Wireless Networking and Communications.
Meeting Report Gill Aug. 24, Letter -- simulation Sum rate DIA-MMSE 2 DIA-MMSE: Since DIA is suboptimal, it should be operated for Tx first, then.
1 CODING FOR MULTIPLE ANTENNAS WITH LINEAR AND NONLINEAR (BLAST) INTERFACES DIMACS WORKSHOP, OCTOBER 2002 EZIO BIGLIERI (work done with A. Nordio, G. Taricco,
Ergodic Capacity of MIMO Relay Channel Bo Wang and Junshan Zhang Dept. of Electrical Engineering Arizona State University Anders Host-Madsen Dept. of Electrical.
An Iterative Optimization Strategy in Multiple Points to Multiple Points MIMO (M4) Mobile Communication Systems MCL Yun-Shen Chang
Support Vector Machines Formulation  Solve the quadratic program for some : min s. t.,, denotes where or membership.  Different error functions and measures.
COST 289 Etienne Auger, Carlo Mutti, Marc Kuhn and Armin Wittneben
1 Power Control, Interference Suppression and Interference Avoidance in Wireless Systems Roy Yates (with S. Ulukus and C. Rose) WINLAB, Rutgers University.
Multiple-input multiple-output (MIMO) communication systems
Reformulated - SVR as a Constrained Minimization Problem subject to n+1+2m variables and 2m constrains minimization problem Enlarge the problem size and.
Subspaces, Basis, Dimension, Rank
Network Alignment: Treating Networks as Wireless Interference Channel Chun Meng Univ. of California, Irvine.
MIMO Multiple Input Multiple Output Communications © Omar Ahmad
Lecture II Introduction to Digital Communications Following Lecture III next week: 4. … Matched Filtering ( … continued from L2) (ch. 2 – part 0 “ Notes.
Matrix Completion IT530 Lecture Notes.
Massive MIMO Systems Massive MIMO is an emerging technology,
Zukang Shen, Jeffrey Andrews, and Brian Evans
Doc.: IEEE /0493r1 Submission May 2010 Changsoon Choi, IHP microelectronicsSlide 1 Beamforming training for IEEE ad Date: Authors:
Design of a New Multiuser Line Code A. Al-Sammak* * EEE Department, U. of Bahrain, Isa Town, Bahrain R. L. Kirlin** # and P.F. Driessen** ** ECE Department,
*P. C. Weeraddana **M. Codreanu, **M. Latva-Aho, ***A. Ephremides * KTH, Royal institute of Technology, Stockholm, Sweden ** CWC, University of Oulu, Finland.
May 7, 2014, Florence, Italy Retrospective Interference Alignment for the 3-user MIMO Interference Channel with.
Transmit Diversity with Channel Feedback Krishna K. Mukkavilli, Ashutosh Sabharwal, Michael Orchard and Behnaam Aazhang Department of Electrical and Computer.
FIM Regularity for Gaussian Semi-Blind(SB) MIMO FIR Channel Estimation
Semi-Blind (SB) Multiple-Input Multiple-Output (MIMO) Channel Estimation Aditya K. Jagannatham DSP MIMO Group, UCSD ArrayComm Presentation.
JWITC 2013Jan. 19, On the Capacity of Distributed Antenna Systems Lin Dai City University of Hong Kong.
تهیه کننده : نرگس مرعشی استاد راهنما : جناب آقای دکتر جمشید شنبه زاده.
MIMO Communications and Algorithmic Number Theory G. Matz joint work with D. Seethaler Institute of Communications and Radio-Frequency Engineering Vienna.
A Semi-Blind Technique for MIMO Channel Matrix Estimation Aditya Jagannatham and Bhaskar D. Rao The proposed algorithm performs well compared to its training.
Media-based Modulation
7: MIMO I: Spatial Multiplexing and Channel Modeling Fundamentals of Wireless Communication, Tse&Viswanath 1 7. MIMO I: Spatial Multiplexing and Channel.
EE359 – Lecture 15 Outline Announcements: HW posted, due Friday MT exam grading done; l Can pick up from Julia or during TA discussion section tomorrow.
Resource Allocation in Hospital Networks Based on Green Cognitive Radios 王冉茵
1 WELCOME Chen. 2 Simulation of MIMO Capacity Limits Professor: Patric Ö sterg å rd Supervisor: Kalle Ruttik Communications Labortory.
Scheduling Considerations for Multi-User MIMO
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
Comparison Value vs Policy iteration
Doc.: IEEE /0584r0 Submission May 2010 Slide 1 Grouping Process for MU-MIMO Date: Authors:
Secure M-PSK Communication Via Directional Modulation University of Luxembourg, University of Illinois in Chicago ICASSP, Shanghai, 2016 Ashkan Kalantari,
Bridging the Gap: A Deterministic Model for Wireless Links David Tse Wireless Foundations U.C. Berkeley NSF Wireless Networks Workshop Aug 27, 2007 TexPoint.
Wireless Communication
EE359 – Lecture 15 Outline Announcements: MIMO Channel Capacity
EE359 – Lecture 14 Outline Practical Issues in Adaptive Modulation
Wireless Communication
A Physical Interpretation of Beamforming, BLAST and SVD Algorithms
Design of Multiple Antenna Coding Schemes with Channel Feedback
EE359 – Lecture 15 Outline Announcements: MIMO Channel Capacity
Nonnegative polynomials and applications to learning
Howard Huang, Sivarama Venkatesan, and Harish Viswanathan
Near-Optimal Hybrid Analog and Digital Precoding for Downlink mmWave Massive MIMO Systems Linglong Dai1, Xinyu Gao1, Jinguo Quan2, and Shuangfeng Han3,
Nuclear Norm Heuristic for Rank Minimization
MIMO-OFDM with antenna selection
Chapter 6. Large Scale Optimization
Null Space Learning in MIMO Systems
SVD: Physical Interpretation and Applications
SPACE-MAC: Enable spatial-reuse using MIMO channel aware MAC
Slides prepared on 09 September, 2018
Mainak Chowdhury, Andrea Goldsmith, Tsachy Weissman
Mainak Chowdhury, Andrea Goldsmith, Tsachy Weissman
Ian C. Wong and Brian L. Evans ICASSP 2007 Honolulu, Hawaii
MIMO (Multiple Input Multiple Output)
Ian C. Wong and Brian L. Evans ICASSP 2007 Honolulu, Hawaii
BASIC FEASIBLE SOLUTIONS
Outline Sparse Reconstruction RIP Condition
Sebastian Semper1 and Florian Roemer1,2
Presentation transcript:

Interference Alignment as a Rank Constrained Rank Minimization Dimitris S. Papailiopoulos and Alexandros G. Dimakis USC Globecom 2010

Overview K user MIMO Interference Channel Rewrite IA using Ranks Relax: Nuclear Norm Heuristic Compare with leakage minimization 2

System Model Interference Alignment IA as a RCRM Nuclear Norm Relaxation Simulations 3

K-user MIMO interference Channel K users, MIMO, Gaussian noise Users beamform and transmit symbols Rx s zeroforce received superpositions 4 Rx1 Rx2 Rx3 Q: what rates can we achieve?

Signal Spaces 5 Rx1 Rx “observes” a vector in a given space. Observed space = useful space + interference All useful information is in All useless information is in Q: So, what rates can we achieve? All useful information is in All useless information is in Q: So, what rates can we achieve?

System Model Interference Alignment IA as a RCRM Nuclear Norm Relaxation Simulations 6

DoF Objective: Max. Rate (high-SNR) rate = DoF*log(SNR) Max. DoF: use IA (Select beamformers and ZF) 7 Rx1 Rx2 Rx3 Theorem: Sum DoF=

Feasibility of IA (DoF Achievability) Theorem [Yetis,Gou,Jafar,Kayran]: (w.h.p.) i.e. We can find s and s such that NP-hard  [Razaviyayn,Sanjabi,Luo] 8

System Model Interference Alignment IA as a RCRM Nuclear Norm Relaxation Simulations 9

Rank Constrained Rank Minimization OK. Let’s reformulate our objective. We want find s and s s.t.: 1) maximize useful dimensions 2) minimize interference Max sum DoF: 10

System Model Interference Alignment IA as a RCRM Nuclear Norm Relaxation Simulations 11

Relax the ranks Find good relaxation for cost function Cues: [Recht,Fazel,Parrilo], [Candes,Tao]… sum of singular values ( -norm) a.k.a. the nuclear norm 12 Replace: with: Replace: with:

Relax the ranks Find good relaxation for the rank constraints For any BF and ZF matrices new BF & ZF with same “rank properties” s.t. 13 Close and “bound” Convex sets

Nuclear Norm Heuristic Now we have a convex relaxation. Fix and solve 14

What is leakage minimization When perfect IA is possible the “interference leakage” will be zero. Alternating minimization of = -norm of singular values. [Gomadam,Cadambe,Jafar] [Peters,Heath] 15 VS Low rank (high DoF) Low energy VS Low rank (high DoF) Low energy

System Model Interference Alignment IA as a RCRM Nuclear Norm Relaxation Simulations 16

Simulations 17 3 users 5 transmit, 3 receive antennas d = 1,2 Leakage minimization and max-SINR run for 50 iterations ε = 0.01

Simulations 18 3 users 8 transmit, 4 receive antennas d = 2,3 Leakage minimization and max-SINR run for 50 iterations ε = 0.01

Conclusions 19 3 users 11 transmit, 5 receive antennas d = 3,4 Leakage minimization and max-SINR run for 50 iterations ε = 0.01

Conclusions 20 3 users 21 transmit, 15 receive antennas d = 9 Leakage minimization and max-SINR run for 50 iterations ε = 0.01

FIN