scispace - formally typeset
Open AccessJournal ArticleDOI

On the Achievable Rate Regions for Interference Channels With Degraded Message Sets

Jinhua Jiang, +1 more
- 01 Oct 2008 - 
- Vol. 54, Iss: 10, pp 4707-4712
TLDR
A coding scheme that collectively has advantages of cooperative coding, collaborative coding, and dirty paper coding, is developed for the interference channel with degraded message sets, and achievable rate regions of the IC-DMS in both discrete memoryless and Gaussian cases are derived.
Abstract
The interference channel with degraded message sets (IC-DMS) refers to a communication model, in which two senders attempt to communicate with their respective receivers simultaneously through a common medium, and one sender has complete and a priori (noncausal) knowledge about the message being transmitted by the other. A coding scheme that collectively has advantages of cooperative coding, collaborative coding, and dirty paper coding, is developed for such a channel. With resorting to this coding scheme, achievable rate regions of the IC-DMS in both discrete memoryless and Gaussian cases are derived. The derived achievable rate regions generally include several previously known rate regions as special cases. A numerical example for the Gaussian case further demonstrates that the derived achievable rate region offers considerable improvements over these existing results in the high-interference-gain regime.

read more

Citations
More filters
Journal ArticleDOI

Breaking Spectrum Gridlock With Cognitive Radios: An Information Theoretic Perspective

TL;DR: This information-theoretic survey provides guidelines for the spectral efficiency gains possible through cognitive radios, as well as practical design ideas to mitigate the coexistence challenges in today's crowded spectrum.
Journal ArticleDOI

Cognitive radio networks

TL;DR: This article highlights some of the recent information theoretic limits, models, and design of these promising networks of intelligent, adaptive wireless devices called cognitive radios.
Proceedings ArticleDOI

Stackelberg game for utility-based cooperative cognitiveradio networks

TL;DR: This paper proposes a cooperative cognitive radio framework, where primary users, aware of the existence of secondary users, may select some of them to be the cooperative relay, and in return lease portion of the channel access time to them for their own data transmission.
Journal ArticleDOI

On the capacity of interference channels with one cooperating transmitter

TL;DR: Inner and outer bounds are established on the capacity region of two-sender, two-receiver interference channels where one transmitter knows both messages and the transmitter with this extra message knowledge is referred to as being cognitive.
Journal ArticleDOI

New Inner and Outer Bounds for the Memoryless Cognitive Interference Channel and Some New Capacity Results

TL;DR: The inner bound presented in this work-which includes rate splitting, superposition coding, a broadcast channel-like binning scheme and Gel'fand Pinsker coding-is the largest known to date and is explicitly shown to include all previously proposed achievable rate regions.
References
More filters
Book

Information Theory and Reliable Communication

TL;DR: This chapter discusses Coding for Discrete Sources, Techniques for Coding and Decoding, and Source Coding with a Fidelity Criterion.
Journal ArticleDOI

Writing on dirty paper (Corresp.)

TL;DR: It is shown that the optimal transmitter adapts its signal to the state S rather than attempting to cancel it, which is also the capacity of a standard Gaussian channel with signal-to-noise power ratio P/N.
Journal ArticleDOI

A new achievable rate region for the interference channel

TL;DR: A new achievable rate region for the general interference channel which extends previous results is presented and evaluated and the capacity of a class of Gaussian interference channels is established.
Journal ArticleDOI

Achievable rates in cognitive radio channels

TL;DR: An achievable region which combines Gel'fand-Pinkser coding with an achievable region construction for the interference channel is developed, which resembles dirty-paper coding, a technique used in the computation of the capacity of the Gaussian multiple-input multiple-output (MIMO) broadcast channel.
Related Papers (5)