On the Capacity of a Class of Cognitive Z-interference Channels

TL;DR

This paper derives simple, computable rate regions for a special class of cognitive Z-interference channels, providing insights into achievable rates and capacity bounds, especially in high-interference scenarios.

Contribution

It introduces explicit achievable regions and improved outer bounds for this channel class, simplifying capacity analysis and extending results to Gaussian channels.

Findings

Derived explicit achievable regions for discrete memoryless channels

Established a new capacity region in high-interference regime

Provided numerical comparisons validating the regions

Abstract

We study a special class of the cognitive radio channel in which the receiver of the cognitive pair does not suffer interference from the primary user. Previously developed general encoding schemes for this channel are complex as they attempt to cope with arbitrary channel conditions, which leads to rate regions that are difficult to evaluate. The focus of our work is to derive simple rate regions that are easily computable, thereby providing more insights into achievable rates and good coding strategies under different channel conditions. We first present several explicit achievable regions for the general discrete memoryless case. We also present an improved outer bound on the capacity region for the case of high interference. We then extend these regions to Gaussian channels. With a simple outer bound we establish a new capacity region in the high-interference regime. Lastly, we provide numerical comparisons between the derived achievable rate regions and the outer bounds.