Howard Huang, Sivarama Venkatesan, and Harish Viswanathan

Slides:



Advertisements
Similar presentations
GSC: Standardization Advancing Global Communications Evolution of TD-SCDMA China Communications Standards Association (CCSA) Chicago, May 29th to 2nd June,
Advertisements

ECSE 6592 Wireless Ad Hoc and Sensor Networks Spatial Diversity in Wireless Networks Hsin-Yi Shen Nov 3, 2005.
Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.
Opportunistic Scheduling Algorithms for Wireless Networks
Multiuser Detection for CDMA Systems
1 Multi-user diversity in slow fading channels Reference: “Opportunistic Beamforming Using Dumb Antennas” P. Vishwanath, D. Tse, R. Laroia,
VSMC MIMO: A Spectral Efficient Scheme for Cooperative Relay in Cognitive Radio Networks 1.
Capacity of Wireless Channels
2005/12/06OPLAB, Dept. of IM, NTU1 Optimizing the ARQ Performance in Downlink Packet Data Systems With Scheduling Haitao Zheng, Member, IEEE Harish Viswanathan,
Comparison of different MIMO-OFDM signal detectors for LTE
22 nd September 2008 | Tariciso F. Maciel Suboptimal Resource Allocation for Multi-User MIMO-OFDMA Systems Tarcisio F. Maciel Darmstadt, 22 nd September.
Kuang-Hao Liu et al Presented by Xin Che 11/18/09.
1 Cross-Layer Design for Wireless Communication Networks Ness B. Shroff Center for Wireless Systems and Applications (CWSA) School of Electrical and Computer.
An Iterative Optimization Strategy in Multiple Points to Multiple Points MIMO (M4) Mobile Communication Systems MCL Yun-Shen Chang
7C Cimini-9/97 RANDOM ACCESS TECHNIQUES ALOHA Efficiency Reservation Protocols Voice and Data Techniques - PRMA - Variable rate CDMA.
EE360: Lecture 7 Outline Adaptive CDMA Techniques Introduction CDMA with power control Adaptive techniques for interference reduction Rate and power adaptation.
EE360: Lecture 6 Outline MAC Channel Capacity in AWGN
TD-SCDMA.
ECE 776 Information Theory Capacity of Fading Channels with Channel Side Information Andrea J. Goldsmith and Pravin P. Varaiya, Professor Name: Dr. Osvaldo.
EE360: Lecture 15 Outline Cellular System Capacity
50 users per cell (N U =600) N T =6  System uses frequency reuse factor 1. This is not a frequency reuse pattern.  Mitigating inter-cell interference.
How to Turn on The Coding in MANETs Chris Ng, Minkyu Kim, Muriel Medard, Wonsik Kim, Una-May O’Reilly, Varun Aggarwal, Chang Wook Ahn, Michelle Effros.
Wireless Communication Elec 534 Set IV October 23, 2007
1 Secure Cooperative MIMO Communications Under Active Compromised Nodes Liang Hong, McKenzie McNeal III, Wei Chen College of Engineering, Technology, and.
12. Feb.2010 | Christian Müller Distributed Resource Allocation in OFDMA-Based Relay Networks Christian Müller.
Multicast Scheduling in Cellular Data Networks Katherine Guo, Arun Netravali, Krishan Sabnani Bell-Labs Research Hyungsuk Won, Han Cai, Do Young Eun, Injong.
ECE559VV – Fall07 Course Project Presented by Guanfeng Liang Distributed Power Control and Spectrum Sharing in Wireless Networks.
*P. C. Weeraddana **M. Codreanu, **M. Latva-Aho, ***A. Ephremides * KTH, Royal institute of Technology, Stockholm, Sweden ** CWC, University of Oulu, Finland.
8: MIMO II: Capacity and Multiplexing Architectures Fundamentals of Wireless Communication, Tse&Viswanath 1 8. MIMO II: Capacity and Multiplexing Architectures.
Philipp Hasselbach Capacity Optimization for Self- organizing Networks: Analysis and Algorithms Philipp Hasselbach.
Fen Hou and Pin-Han Ho Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario Wireless Communications and Mobile.
User Cooperation via Rateless Coding Mahyar Shirvanimoghaddam, Yonghui Li, and Branka Vucetic The University of Sydney, Australia IEEE GLOBECOM 2012 &
Ali Al-Saihati ID# Ghassan Linjawi
JWITC 2013Jan. 19, On the Capacity of Distributed Antenna Systems Lin Dai City University of Hong Kong.
EE 6332, Spring, 2014 Wireless Communication Zhu Han Department of Electrical and Computer Engineering Class 11 Feb. 19 th, 2014.
Cross-Layer Optimization in Wireless Networks under Different Packet Delay Metrics Chris T. K. Ng, Muriel Medard, Asuman Ozdaglar Massachusetts Institute.
University of Houston Cullen College of Engineering Electrical & Computer Engineering Capacity Scaling in MIMO Wireless System Under Correlated Fading.
Wireless Multiple Access Schemes in a Class of Frequency Selective Channels with Uncertain Channel State Information Christopher Steger February 2, 2004.
Space Time Codes. 2 Attenuation in Wireless Channels Path loss: Signals attenuate due to distance Shadowing loss : absorption of radio waves by scattering.
EE359 – Lecture 12 Outline Combining Techniques
5: Capacity of Wireless Channels Fundamentals of Wireless Communication, Tse&Viswanath 1 5. Capacity of Wireless Channels.
Content caching and scheduling in wireless networks with elastic and inelastic traffic Group-VI 09CS CS CS30020 Performance Modelling in Computer.
QoS Routing and Scheduling in TDMA based Wireless Mesh Backhaul Networks Chi-Yao Hong, Ai-Chun Pang,and Jean-Lien C. Wu IEEE Wireless Communications and.
A Simple Transmit Diversity Technique for Wireless Communications -M
October 28, 2005 Single User Wireless Scheduling Policies: Opportunism and Optimality Brian Smith and Sriram Vishwanath University of Texas at Austin October.
Scheduling Considerations for Multi-User MIMO
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
Self-Organized Resource Allocation in LTE Systems with Weighted Proportional Fairness I-Hong Hou and Chung Shue Chen.
Technology training (Session 6)
EE359 – Lecture 15 Outline Announcements: MIMO Channel Capacity
Presented by Tae-Seok Kim
Wireless Communication
Space Time Codes.
EE359 – Lecture 15 Outline Announcements: MIMO Channel Capacity
Channel Allocation (MAC)
Resource Allocation in Non-fading and Fading Multiple Access Channel
Distributed MIMO Patrick Maechler April 2, 2008.
Space Time Coding and Channel Estimation
Optimal Sequence Allocation and Multi-rate CDMA Systems
Scheduling in Wireless Communication Systems
Wireless Communication Channel Capacity
Wireless Communication Channel Capacity
Ian C. Wong, Zukang Shen, Jeffrey G. Andrews, and Brian L. Evans
QoS Aware Adaptive Subcarrier Allocation in OFDMA Systems
Opportunistic Beam-forming with Limited Feedback
Channel Dimension Reduction in MU Operation
Presented By Riaz (STD ID: )
Ian C. Wong and Brian L. Evans ICASSP 2007 Honolulu, Hawaii
Chrysostomos Koutsimanis and G´abor Fodor
Presentation transcript:

Downlink Capacity Evaluation of Cellular Networks with Known Interference Cancellation Howard Huang, Sivarama Venkatesan, and Harish Viswanathan Lucent Technologies Bell Labs

Motivation Significant advance on known interference cancellation for MIMO broadcast channels Natural fit with downlink of a cellular system Most base stations already equipped with 2~4 antennas Additional processing at the base station is economically reasonable Asymmetric bandwidth requirement for data traffic can justify channel feedback required for known interference cancellation Goal: How much do we really gain? Best effort packet data Delay sensitive streaming applications Characterization of rate region using duality used for computations 11/7/2018

Model Mobile receives signal from a single cell and interference from surrounding cells Phase coordination across multiple cells in outdoor wide area wireless networks appears impractical Complexity of computing the gains grows with the number of cells Block fading channel model Mobile feeds back channel conditions from the desired base station in each frame Ideal noiseless feedback Performance Metrics Throughput distribution for packet data Number of users at fixed rate transmission 11/7/2018

System Model Block Fading Wire-Line Network h Each interval has sufficient number of symbols to achieve capacity 1 h 2 h 3 Other-cell interference + AWGN 11/7/2018

Packet Data Throughput In a cellular system different users are at different distances from the base station Sum rate is a poor metric for comparing gains A scheduler is used to arbitrate the resources and guarantees some notion of fairness We will use the proportional fair scheduler where is the long term average throughput achieved We will assume the backlogged scenario where each user has infinite amount of data to send Simplifying assumption Can still obtain reasonable estimate of the gain 11/7/2018

On-line scheduling algorithm In each frame we assign rate vector that maximizes where is the moving average of the throughput The rate region depends on the the transmission strategy DPC rate region when known interference cancellation is employed Rate region from beam forming We have to solve the weighted rate sum maximization in each frame to determine the throughput 11/7/2018

Maximum Weighted Rate Sum Using duality Using polymatroid structure of the MAC rate region 11/7/2018

Simple proof of optimal ordering For any set of covariance matrices Since independent of the decoding order, we should pick the user with least weight to see the most interference 11/7/2018

Convex Optimization Algorithm Standard convex optimization techniques can be used to perform the maximization : Covariance matrices Optimization : Linear Constraint : Power Constraint Iterative Algorithm Linear Optimization: Line Search : Update : 11/7/2018

Beam Forming Scheme Separately encode each user’s signal with zero-forcing beam forming Rate Region for a subset of users ( ) Max weighted rate sum within the subset is weighted water- filling Computing max weighted rate sum over all subsets of users is very complex even for 4 antennas Approx: First select a subset of users with the highest individual metrics and implement max weighted rate sum only over this subset of users Complexity depends on the size of the set 11/7/2018

Group ZF Beam Forming for Multiple Receive Antennas Similar to group multi-user detection Covariance matrices are chosen such that multiple streams can be transmitted to each user on separate beams Orthogonality of ZF beam forming preserved only across users The multiple streams for a given user are not orthogonal Similar approximation algorithm as in ZF case for computing maximum weighted rate sum 11/7/2018

Classic Cellular Model MSC BTS Gateway Hexagonal Layout Uniform User distribution 11/7/2018

Simulation Setup 20 users drawn from this CDF 10000 frames with the proportional fair scheduling 11/7/2018

Performance for Single Receive Antenna Factor of 2 improvement w.r.t simple beam forming at 50% point Optimum selection of users with beam forming reduces the gap significantly 11/7/2018

Performance for Multiple Receive Antennas Harder to bridge the gap GZF technique is sub-optimal even among schemes without DPC 11/7/2018

Optimality in a Large Symmetric System Consider a system with large number of users with identical fading statistics With high probability there will be a subset of users that are orthogonal with high SNR in each scheduling interval Symmetry implies sum rate maximization in each scheduling interval should be optimal Sum rate is maximized by transmission to subset that is orthogonal with high SNR Optimal even when joint coding is allowed since sum rate is maximized by transmission to orthogonal subset 11/7/2018

Fixed Rate Evaluation Model For delay sensitive applications we have to guarantee a fixed rate independent of channel conditions Assume the same rate requirement for all users Translates to determining the equal rate point on the rate region Goal: Evaluate the CDF of number users that can be supported at a given fixed rate (user locations and channel instances are random) Optimum known interference cancellation Known interference cancellation with FCFS order TDMA 11/7/2018

Equal Rate Point on the DPC Region Unable to establish that for any rate vector there exists weight vector such that is the solution to the optimization Cannot iterate on the weights to determine the equal rate point is indeed unique whenever is such that All points of the rate region may not be achievable without rate- splitting or time-sharing For capacity evaluation we need only an algorithm to test if a rate vector is achievable 11/7/2018

Convex optimization algorithm for achievability Define Given a rate vector find Then is achievable iff 11/7/2018

Convex Sets and Separating Hyperplanes Can quickly determine points outside the rate region 11/7/2018

FCFS Algorithm Users arrive in some order with the rate requirement Allocate power to the users assuming entire bandwidth is allocated to each user Use known interference cancellation to remove the new user from interfering existing users Existing users are interference to new user The arrival order can be sub-optimal Performance will be better than TDMA because of known interference cancellation 11/7/2018

TDMA Vs FCFS (Single Receive Antenna) 50% gain at the 10% point for 4 transmit antennas Gain is not significant for 1 and 2 transmit antennas 11/7/2018

TDMA Vs FCFS (multiple receive antennas) 11/7/2018

FCFS Vs Optimal Ordering MPF – Minimum Power First 11/7/2018

Summary Duality results were used to determine the maximum gain when using a proportional fair scheduler Factor of 2 gain relative to TDMA strategy with single beam Single receive antenna case the beam forming can come close to Known Interference Cancellation Algorithm to determine the fixed rate capacity was proposed 50% improvement relative to TDMA with single beam TDMA with multiple beams could potentially narrow this gap Optimum order is comparable to FCFS at the 10% outage level Scenarios where inter-cell coordination becomes feasible should be investigated for potentially larger gains 11/7/2018