A new sum-rate outer bound for Gaussian Interference Channels with Generalized Feedback (GIFC-GF)

1. A new sum-rate outer bound for Gaussian Interference Channels with Generalized Feedback (GIFC-GF) Shuang (Echo) Yang, UIC (Daniela Tuninetti) - University of Illinois at Chicago Problem Statement and Motivation • In wireless channels, every node overhears the transmission of other nodes and can use it for cooperative communication. • Cooperation is a virtual MIMO that benefits the rate performance of all source-destination pairs without increasing transmit powers nor channel bandwidth (just the enc/decoding complexity.) A standard model for GIFC-GF is: Main Result Conclusions and Future Work • We compare our new outer bound with available bounds and show that under certain network parameters our bound is the tightest. • We are studying extensions of our bounding techniques to weak interference channels, and to channels with more than two users. • For strong interference we derive the new sum-rate upper bound • We argue that the capacity region can not depend on h11. We give a side information to the receiver that depends on h11. We chose the h11 that is the least informative for the receiver. 2nd Annual North American School of Information Theory, Evanston, IL, August 10-13, 2009