David T.-H. Kao

Learn More
We study the limits of reliable communication in two-user interference channels where each of the two transmitters knows a different subset of the four channel gains characterizing the network state. In order to systematically analyze this problem, we introduce two concepts. First, we define a local view model for network state information at each(More)
Dirty paper codes are a powerful tool for combating known interference. However, there is a significant difference between knowing the transmitted interference sequence and knowing the received interference sequence, especially when the channel modifying the interference is uncertain. We present an upper bound on the capacity of a compound vector dirty(More)
Remark 1: Fixed coding rates have no impact on fairness loss — they are not an unknown and can be accounted for perfectly. Remark 2: Worst-case error places more emphasis on the users with weaker channels, therefore it is more important to have precise measurements for weaker users. Remark 3: If the channel is more asymmetric, the loss in fairness is(More)
  • 1