72,479 research outputs found
Information Theoretic Limits of State-dependent Networks
We investigate the information theoretic limits of two types of state-dependent models in this dissertation. These models capture a wide range of wireless communication scenarios where there are interference cognition among transmitters. Hence, information theoretic studies of these models provide useful guidelines for designing new interference cancellation schemes in practical wireless networks.
In particular, we first study the two-user state-dependent Gaussian multiple access channel (MAC) with a helper. The channel is corrupted by an additive Gaussian state sequence known to neither the transmitters nor the receiver, but to a helper noncausally, which assists state cancellation at the receiver. Inner and outer bounds on the capacity region are first derived, which improve the state-of-the-art bounds given in the literature. Further comparison of these bounds yields either segments on the capacity region boundary or the full capacity region by considering various regimes of channel parameters.
We then study the two-user Gaussian state-dependent Z-interference channel (Z-IC), in which two receivers are corrupted respectively by two correlated states that are noncausally known to transmitters, but unknown to receivers. Three interference regimes are studied, and the capacity region or the sum capacity boundary is characterized either fully or partially under various channel parameters. The impact of the correlation between the states on the cancellation of state and interference as well as the achievability of the capacity is demonstrated via numerical analysis.
Finally, we extend our results on the state-dependent Z-IC to the state-dependent regular IC. As both receivers in the regular IC are interfered, more sophisticated achievable schemes are designed. For the very strong regime, the capacity region is achieved by a scheme where the two transmitters implement a cooperative dirty paper coding. For the strong but not very strong regime, the sum-rate capacity is characterized by rate splitting, layered dirty paper coding and successive cancellation. For the weak regime, the sum-rate capacity is achieved via dirty paper coding individually at two receivers as well as treating interference as noise. Numerical investigation indicates that for the regular IC, the correlation between states impacts the achievability of the channel capacity in a different way from that of the Z-IC
The Approximate Capacity Region of the Gaussian Z-Interference Channel with Conferencing Encoders
A two-user Gaussian Z-Interference Channel (GZIC) is considered, in which
encoders are connected through noiseless links with finite capacities. In this
setting, prior to each transmission block the encoders communicate with each
other over the cooperative links. The capacity region and the sum-capacity of
the channel are characterized within 1.71 bits per user and 2 bits in total,
respectively. It is also established that properly sharing the total limited
cooperation capacity between the cooperative links may enhance the achievable
region, even when compared to the case of unidirectional transmitter
cooperation with infinite cooperation capacity. To obtain the results,
genie-aided upper bounds on the sum-capacity and cut-set bounds on the
individual rates are compared with the achievable rate region. In the
interference-limited regime, the achievable scheme enjoys a simple type of
Han-Kobayashi signaling, together with the zero-forcing, and basic relaying
techniques. In the noise-limited regime, it is shown that treating interference
as noise achieves the capacity region up to a single bit per user.Comment: 25 pages, 6 figures, submitted to IEEE Transactions on Information
Theor
- …