the approximate sum capacity of the symmetric gaussian k
play

The Approximate Sum Capacity of the Symmetric Gaussian K -User - PowerPoint PPT Presentation

Nov 26, 2023 •142 likes •746 views

The Approximate Sum Capacity of the Symmetric Gaussian K -User Interference Channel Or Ordentlich Joint work with Uri Erez and Bobak Nazer July 5th, ISIT 2012 MIT, Cambridge, Massachusetts Ordentlich, Erez, Nazer Approx. Sum Capacity of the

  1. The Approximate Sum Capacity of the Symmetric Gaussian K -User Interference Channel Or Ordentlich Joint work with Uri Erez and Bobak Nazer July 5th, ISIT 2012 MIT, Cambridge, Massachusetts Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  2. The symmetric Gaussian 2-user IC : channel model z 1 y 1 x 1 1 ˆ w 1 E 1 D 1 w 1 g z 2 g x 2 1 y 2 ˆ w 2 w 2 E 2 D 2 y k = x k + g x ¯ k + z k Channel is static and real valued. Gaussian noises z k are of zero mean and variance 1. All users are subject to the power constraint � x k � 2 ≤ n SNR. Define INR � g 2 SNR and α � log(INR) log(SNR) . Channel is symmetric: sum capacity = 2 × symmetric capacity Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  3. GDoF of symmetric Gaussian 2-user IC Symmetric capacity is known to within 1 / 2 bit (Etkin et al. 08). DoF for each user is 1 / 2. GDoF gives more refined view d ( α ) 1 2 3 1 2 α 1 2 1 2 2 3 Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  4. Symmetric Gaussian 2-user IC Noisy interference regime Treat interference as noise d ( α ) 1 2 3 1 2 α 1 2 1 2 2 3 Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  5. Symmetric Gaussian 2-user IC Weak interference regime Jointly decode intended message and part of interference (Han-Kobayashi). d ( α ) 1 2 3 1 2 α 1 2 1 2 2 3 Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  6. Symmetric Gaussian 2-user IC Strong interference regime Jointly decode intended message and interference d ( α ) 1 2 3 1 2 α 1 2 1 2 2 3 Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  7. Symmetric Gaussian 2-user IC Very strong interference regime Decode interference and then successively decode intended message d ( α ) 1 2 3 1 2 α 1 2 1 2 2 3 Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  8. The symmetric Gaussian K -user IC : channel model z 1 y 1 x 1 1 w 1 ˆ E 1 D 1 w 1 g g z 2 g x 2 1 y 2 ˆ w 2 E 2 D 2 w 2 g . . . . . . g z K g x K 1 y K ˆ w K w K E K D K � y k = x k + g x m + z k m � = k INR � g 2 SNR and α � log(INR) log(SNR) . Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  9. The symmetric Gaussian K -user IC: what do we know? DoF is discontinuous at the rationals (Etkin and E. Ordentlich 09, Wu et al. 11). GDoF of the symmetric K -user IC is independent of K , except for discontinuity at α = 1 (Jafar and Vishwanath 10). d ( α ) 1 2 3 1 2 1 K 1 2 α 1 2 2 3 Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  10. The symmetric Gaussian K -user IC: what do we know? What about finite SNR? Adding interference cannot increase capacity → Outer bounds for K = 2 remain valid for K > 2. 3−user IC @ SNR=35dB 6 symmetric rate[bits/channel use] 5 4 3 2 1 0 −2 0 2 10 10 10 g Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  11. The symmetric Gaussian K -user IC: what do we know? What about finite SNR? Can always use time-sharing 1 → C SYM > 2 K log(1 + K SNR). 3−user IC @ SNR=35dB 6 symmetric rate[bits/channel use] 5 4 3 2 1 0 −2 0 2 10 10 10 g Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  12. The symmetric Gaussian K -user IC: what do we know? What about finite SNR? Can treat interference as noise → achieves the approximate capacity for noisy interference regime 3−user IC @ SNR=35dB 6 symmetric rate[bits/channel use] 5 4 3 2 1 0 −2 0 2 10 10 10 g Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  13. The symmetric Gaussian K -user IC: what do we know? For the other regimes lattice codes are useful. Closed under addition = ⇒ K − 1 interferers folded to one effective interferer. Each receiver sees a K -user MAC � y k = x k + g x m + z k , m � = k Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  14. The symmetric Gaussian K -user IC: what do we know? For the other regimes lattice codes are useful. Closed under addition = ⇒ K − 1 interferers folded to one effective interferer. Assume x 1 , . . . , x K ∈ Λ. = ⇒ Effective 2-user MAC at each receiver y k = x k + g x int , k + z k , � where x int , k = x m ∈ Λ. m � = k Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  15. The symmetric Gaussian K -user IC: what do we know? For the other regimes lattice codes are useful. Closed under addition = ⇒ K − 1 interferers folded to one effective interferer. Assume x 1 , . . . , x K ∈ Λ. = ⇒ Effective 2-user MAC at each receiver y k = x k + g x int , k + z k , � where x int , k = x m ∈ Λ. m � = k How to decode x k ? Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  16. The symmetric Gaussian K -user IC: what do we know? For large g , can decode sum of interferences, subtract and decode desired codeword (Sridharan et al. 08) x k x int , k Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  17. The symmetric Gaussian K -user IC: what do we know? For large g , can decode sum of interferences, subtract and decode desired codeword (Sridharan et al. 08) x k x int , k Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  18. The symmetric Gaussian K -user IC: what do we know? For large g , can decode sum of interferences, subtract and decode desired codeword (Sridharan et al. 08) x k x k z 1 y g x int , k x int , k Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  19. The symmetric Gaussian K -user IC: what do we know? For large g , can decode sum of interferences, subtract and decode desired codeword (Sridharan et al. 08) x k x k z 1 y g x int , k x int , k Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  20. The symmetric Gaussian K -user IC: what do we know? For large g , can decode sum of interferences, subtract and decode desired codeword (Sridharan et al. 08) x k x k z 1 y g x int , k x int , k Decode x int , k Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  21. The symmetric Gaussian K -user IC: what do we know? For large g , can decode sum of interferences, subtract and decode desired codeword (Sridharan et al. 08) x k x k z 1 y g x int , k x int , k Decode x int , k Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  22. The symmetric Gaussian K -user IC: what do we know? For large g , can decode sum of interferences, subtract and decode desired codeword (Sridharan et al. 08) x k x k z 1 y 0 x int , k x int , k Cancel x int , k Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  23. The symmetric Gaussian K -user IC: what do we know? For large g , can decode sum of interferences, subtract and decode desired codeword (Sridharan et al. 08) x k x k z 1 y 0 x int , k x int , k Decode x k Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  24. The symmetric Gaussian K -user IC: what do we know? For large g , can decode sum of interferences, subtract and decode desired codeword (Sridharan et al. 08) x k x k z 1 y 0 x int , k x int , k Decode x k Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  25. The symmetric Gaussian K -user IC: what do we know? For large g , can decode sum of interferences, subtract and decode desired codeword (Sridharan et al. 08) x k x k z 1 y 0 x int , k x int , k Decode x k Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  26. The symmetric Gaussian K -user IC: what do we know? For large g , can decode sum of interferences, subtract and decode desired codeword (Sridharan et al. 08) x k x k z 1 y 0 x int , k x int , k Decode x k Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  27. The symmetric Gaussian K -user IC: what do we know? For large g , can decode sum of interferences, subtract and decode desired codeword (Sridharan et al. 08) x k x k z 1 y 0 x int , k x int , k Decode x k Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  28. The symmetric Gaussian K -user IC: what do we know? What about finite SNR? Successive decoding is optimal in the very strong interference regime. 3−user IC @ SNR=35dB 6 symmetric rate[bits/channel use] 5 4 3 2 1 0 −2 0 2 10 10 10 g Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

  29. The symmetric Gaussian K -user IC: strong interference y k = x k + g x int , k + z k , x k , x int , k ∈ Λ Assume strong interference: g > 1 but not ≫ 1. For 2-user IC jointly decoding intended message and interference is optimal. For K -user IC jointly decoding x k , x int , k seems like a good idea. Question What rates are achievable? Ordentlich, Erez, Nazer Approx. Sum Capacity of the Symmetric Gaussian K -User IC

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Non-Gaussian likelihoods for Gaussian Processes Alan Saul Outline Motivation Non-Gaussian

Non-Gaussian likelihoods for Gaussian Processes Alan Saul Outline Motivation Non-Gaussian

Non-Gaussian likelihoods for Gaussian Processes Alan Saul Outline Motivation Non-Gaussian posteriors Approximate methods Laplace approximation Variational bayes Expectation propagation Comparisons GP regression - recap so far Model the

1.4k views • 113 slides
Circularly Symmetric Gaussian Random Vectors Saravanan Vijayakumaran sarva@ee.iitb.ac.in

Circularly Symmetric Gaussian Random Vectors Saravanan Vijayakumaran sarva@ee.iitb.ac.in

Circularly Symmetric Gaussian Random Vectors Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay October 1, 2013 1 / 11 Circularly Symmetric Gaussian Random Vectors

373 views • 11 slides
Lecture 3 Capacity of Multiuser Gaussian Channels The Gaussian uplink: 6.1 The fading

Lecture 3 Capacity of Multiuser Gaussian Channels The Gaussian uplink: 6.1 The fading

Lecture 3 Capacity of Multiuser Gaussian Channels The Gaussian uplink: 6.1 The fading Gaussian uplink: 6.3 (parts) The Gaussian downlink: 6.2 The fading Gaussian downlink: 6.4 (parts) Mikael Skoglund, Theoretical Foundations of

347 views • 10 slides
Case Study: Approximate Bayesian Inference for Latent Gaussian Models by Using Integrated Nested

Case Study: Approximate Bayesian Inference for Latent Gaussian Models by Using Integrated Nested

Case Study: Approximate Bayesian Inference for Latent Gaussian Models by Using Integrated Nested Laplace Approximations BIOSTAT830: Graphical Models December 08, 2016 Introduction - INLA Inference for latent Gaussian Markov random field

605 views • 35 slides
Modern Gaussian Processes: Scalable Inference and Novel Applications (Part II-b) Approximate

Modern Gaussian Processes: Scalable Inference and Novel Applications (Part II-b) Approximate

Modern Gaussian Processes: Scalable Inference and Novel Applications (Part II-b) Approximate Inference Edwin V. Bonilla and Maurizio Filippone CSIROs Data61, Sydney, Australia and EURECOM, Sophia Antipolis, France July 14 th , 2019 1

1.14k views • 44 slides
Lecture 1 Capacity of the Gaussian Channel Basic concepts in information theory: Appendix B

Lecture 1 Capacity of the Gaussian Channel Basic concepts in information theory: Appendix B

Lecture 1 Capacity of the Gaussian Channel Basic concepts in information theory: Appendix B Capacity of the Gaussian channel: Appendix B, Ch. 5.13 Mikael Skoglund, Theoretical Foundations of Wireless 1/23 Entropy and Mutual

307 views • 12 slides
On Achievable Rates of the Two-user Symmetric Gaussian Interference Channel Omar Mehanna, John

On Achievable Rates of the Two-user Symmetric Gaussian Interference Channel Omar Mehanna, John

Introduction Optimized HK Sum-Rate Numerical Results High SNR Time Sharing Conclusions On Achievable Rates of the Two-user Symmetric Gaussian Interference Channel Omar Mehanna, John Marcos and Nihar Jindal University of Minnesota Allerton

563 views • 38 slides
8 Approximate inference in switching linear dynamical systems using Gaussian mixtures David

8 Approximate inference in switching linear dynamical systems using Gaussian mixtures David

8 Approximate inference in switching linear dynamical systems using Gaussian mixtures David Barber 8.1 Introduction The linear dynamical system (LDS) (see Section 1.3.2) is a standard time series model in which a latent linear process

350 views • 16 slides
Approximate Bayesian inference for latent Gaussian models avard Rue 1 H Department of

Approximate Bayesian inference for latent Gaussian models avard Rue 1 H Department of

Approximative Bayesian inference Approximate Bayesian inference for latent Gaussian models avard Rue 1 H Department of Mathematical Sciences NTNU, Norway December 4, 2009 1 With S.Martino/N.Chopin Approximative Bayesian inference Overview

1.61k views • 159 slides
Lecture 2 Capacity of Fading Gaussian Channels Slow fading channels: Ch. 5.4.14 Fast

Lecture 2 Capacity of Fading Gaussian Channels Slow fading channels: Ch. 5.4.14 Fast

Lecture 2 Capacity of Fading Gaussian Channels Slow fading channels: Ch. 5.4.14 Fast fading channels: Ch. 5.4.56 Mikael Skoglund, Theoretical Foundations of Wireless 1/16 The Flat Fading Gaussian Channel CSIT CSIR h m w m

406 views • 8 slides
Capacity Region of the Gaussian Arbitrarily-Varying Broadcast Channel Fatemeh Hosseinigoki and

Capacity Region of the Gaussian Arbitrarily-Varying Broadcast Channel Fatemeh Hosseinigoki and

Capacity Region of the Gaussian Arbitrarily-Varying Broadcast Channel Fatemeh Hosseinigoki and Oliver Kosut A RIZONA S TATE U NIVERSITY ISIT 2020 1 / 12 Gaussian Arbitrarily-Varying Broadcast Channel Transmitter power constraint X 2

557 views • 44 slides
Capacity of a Broadcast Channel with Luo, Gohary, Yanikomeroglu Gaussian Jamming and a Friendly

Capacity of a Broadcast Channel with Luo, Gohary, Yanikomeroglu Gaussian Jamming and a Friendly

Capacity of a Broadcast Channel with Gaussian Jamming and a Friendly Eavesdropper 1 Capacity of a Broadcast Channel with Luo, Gohary, Yanikomeroglu Gaussian Jamming and a Friendly Channel Eavesdropper Model Relaying Schemes Kevin

507 views • 18 slides
On the Fraction of Capacity One Relay can Achieve in Gaussian Half-Duplex Diamond Networks

On the Fraction of Capacity One Relay can Achieve in Gaussian Half-Duplex Diamond Networks

2020 IEEE International Symposium on Information Theory On the Fraction of Capacity One Relay can Achieve in Gaussian Half-Duplex Diamond Networks Authors: Sarthak Jain (Presenter) Soheil Mohajer Martina Cardone University of Minnesota, T

931 views • 51 slides
Gaussian Filter The Gaussian filter 1 2 1 A Gaussian kernel gives less 1 2 4 2 weight to

Gaussian Filter The Gaussian filter 1 2 1 A Gaussian kernel gives less 1 2 4 2 weight to

Gaussian Filter The Gaussian filter 1 2 1 A Gaussian kernel gives less 1 2 4 2 weight to pixels further from 16 the center of the window 1 2 1 This kernel is an approximation of a Gaussian function Gaussian filtering versus mean

405 views • 11 slides
Unsourced Multiuser Sparse Regression Codes achieve the Symmetric MAC Capacity Alexander Fengler

Unsourced Multiuser Sparse Regression Codes achieve the Symmetric MAC Capacity Alexander Fengler

Unsourced Multiuser Sparse Regression Codes achieve the Symmetric MAC Capacity Alexander Fengler Joint work with Peter Jung and Giuseppe Caire | Technische Universit at Berlin Communications and Information Theory Chair CommI Multiple Access

1.22k views • 32 slides
Ergodic and Outage Capacity of Narrowband MIMO Gaussian Channels Yang Wen Liang Department of

Ergodic and Outage Capacity of Narrowband MIMO Gaussian Channels Yang Wen Liang Department of

Ergodic and Outage Capacity of Narrowband MIMO Gaussian Channels Yang Wen Liang Department of Electrical and Computer Engineering The University of British Columbia April 19th, 2005 Outline of Presentation Introduction of MIMO MIMO

584 views • 33 slides
Investor Presentation 26 April 2013 ASEAN Stars Conference 2012 1 March 2012 Asias First

Investor Presentation 26 April 2013 ASEAN Stars Conference 2012 1 March 2012 Asias First

4Q FY2011/12 4Q FY2012/13 Financial Results Presentation Investor Presentation 26 April 2013 ASEAN Stars Conference 2012 1 March 2012 Asias First Listed Indian Property Trust Asias First Listed Indian Property Trust Disclaimer This

788 views • 47 slides
Data Types Gabriele Keller Ron Vanderfeesten Compound types What are types? So far, we

Data Types Gabriele Keller Ron Vanderfeesten Compound types What are types? So far, we

Concepts of Program Design Data Types Gabriele Keller Ron Vanderfeesten Compound types What are types? So far, we only looked at basic types, such as Int, Boolean, as well as function types Int Bool 1 True 2 False 3 4

651 views • 35 slides
Compositional Data Types A Report from the Field Patrick Bahr paba@diku.dk University of

Compositional Data Types A Report from the Field Patrick Bahr paba@diku.dk University of

Compositional Data Types A Report from the Field Patrick Bahr paba@diku.dk University of Copenhagen, Department of Computer Science Fourth DIKU-IST Joint Workshop on Foundations of Software, January 10-14, 2011 joint work with Tom Hvitved

300 views • 26 slides
CS 671 Automated Reasoning Extending Nuprls Type Theory 1. Design Decisions for Nuprls Type

CS 671 Automated Reasoning Extending Nuprls Type Theory 1. Design Decisions for Nuprls Type

CS 671 Automated Reasoning Extending Nuprls Type Theory 1. Design Decisions for Nuprls Type Theory 2. Product, Union, and List Types 3. The Curry-Howard Isomorphism, formally 4. Empty and Unit Types Design Decisions for Nuprls Type Theory

556 views • 8 slides
Positively Dependent Types Dan Licata and Robert Harper Carnegie Mellon University 1 Dans

Positively Dependent Types Dan Licata and Robert Harper Carnegie Mellon University 1 Dans

Positively Dependent Types Dan Licata and Robert Harper Carnegie Mellon University 1 Dans thesis New dependently typed programming language for programming with binding and scope Applications: Domain-specific logics for reasoning about

809 views • 67 slides
Self-Adaptive Quality Requirement Elicitation Process for Legacy Systems: A Case Study in

Self-Adaptive Quality Requirement Elicitation Process for Legacy Systems: A Case Study in

Self-Adaptive Quality Requirement Elicitation Process for Legacy Systems: A Case Study in HealthCare ALFONSO MARTNEZ, LORENA AYUSO & ANGELINA ESPINOZA NOUR ALI UNIVERSITY OF BRIGHTON-UK UNIVERSIDAD AUTONOMA METROPOLITANA-MEXICO RE@SAC

400 views • 18 slides
Monadic reflection in Lax Logic Tristan Crolard LACL University of East Paris TPDC11 Novi

Monadic reflection in Lax Logic Tristan Crolard LACL University of East Paris TPDC11 Novi

Monadic reflection in Lax Logic Tristan Crolard LACL University of East Paris TPDC11 Novi Sad May 29, 2011 Introduction Revisit Representing monads [Filinski, 1994] from a logical standpoint. Goal: understand the

498 views • 33 slides
Constrained Optimization in : Recap October 19, 2018 197 / 424 Global Extrema on Closed

Constrained Optimization in : Recap October 19, 2018 197 / 424 Global Extrema on Closed

Constrained Optimization in : Recap October 19, 2018 197 / 424 Global Extrema on Closed Intervals Recall the extreme value theorem. A consequence is that: if either of c or d lies in( a , b ), then it is a critical number of f ; else each

284 views • 26 slides

More recommend