The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper considers a two-hop interference network, where two users transmit independent messages to their respective receivers with the help of two relay nodes. The transmitters do not have direct links to the receivers; instead, two relay nodes serve as intermediaries between the transmitters and receivers. Each hop, one from the transmitters to the relays and the other from the relays to the receivers,...
This paper considers the so-called cognitive Z channel, where two users transmit two independent messages to their respective receivers through a Z interference channel. User 1 (primary user) interferes with receiver 2 while user 2 (secondary user) does not interfere with receiver 1. In addition, user 2 overhears the transmission of user 1 through a noisy channel, hence the term dasiacognitivepsila...
This paper investigated the problem of interference channel with one cognitive transmitter (ICOCT) from both the noncausal and causal perspectives. For the noncausal ICOCT, which is also referred to as interference channel with degraded message sets (ICDMS), we proposed a new achievable rate region, which generalizes existing achievable rate regions for IC-DMS and coincides with Marton's broadcast...
In this paper, we propose an achievable rate region for discrete memoryless interference channels with conferencing at the transmitter side. We employ superposition block Markov encoding, combined with simultaneous superposition coding, dirty paper coding, and random binning to obtain the achievable rate region. We show that, under respective conditions, the proposed achievable region reduces to Han...
In this paper, a new achievable rate region for general interference channels with common information is presented. Our result improves upon by applying simultaneous superposition coding over sequential superposition coding. A detailed computation and comparison of the achievable rate region for the Gaussian case is conducted. The proposed achievable rate region is shown to coincide with the capacity...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.