Results 151 to 160 of about 342,890 (187)

An achievable rate region for the broadcast channel

IEEE Transactions on Information Theory, 1975
Summary: Let \(p(y_1, y_2 \mid x)\) denote a discrete memoryless channel with a single source \(X\) and two independent receivers \(Y_1\) and \(Y_2\). We exhibit an achievable region of rates \((R_{11},R_{12},R_{22})\) at which independent information can be sent, respectively, to receiver 1, to both receivers 1 and 2, and to receiver 2.
openaire   +2 more sources

Achievable Rate Regions for OFDMA with Link Adaptation

2007 IEEE 18th International Symposium on Personal, Indoor and Mobile Radio Communications, 2007
In this paper, we discuss the achievable rate regions for the uplink of an OFDMA system. The capacity region is computed for realistic channel models, exploiting a recent generalization of the well-known iterative water-filling algorithm. We then invoke the important constraint of exclusive user allocation per subchannel and approximate the ...
openaire   +1 more source

An improved achievable rate region for causal cognitive radio

2009 IEEE International Symposium on Information Theory, 2009
This paper studies two-user causal cognitive radio channels, in which the secondary user has causal knowledge about the message being sent by the primary user. An inner bound on the capacity region of such channels is established by employing a coding strategy consisting of block Markov superposition and dirty paper encoding, and backward decoding.
Seyed Hossein Seyedmehdi, Jinhua Jiang, Yan Xin, Xiaodong Wang   +3 more
openaire   +1 more source

Achievable Rate Regions for the Two-way Relay Channel

2006 IEEE International Symposium on Information Theory, 2006
We study the two-way communication problem for the relay channel. Hereby, two terminals communicate simultaneously in both directions with the help of one relay. We consider the restricted two-way problem, i.e., the encoders at both terminals do not cooperate.
Boris Rankov, Armin Wittneben
openaire   +1 more source

The Achievable Rate Region of 802.11-Scheduled Multihop Networks

IEEE/ACM Transactions on Networking, 2009
In this paper, we characterize the achievable rate region for any IEEE 802.11-scheduled static multihop network. To do so, we first characterize the achievable edge-rate region, that is, the set of edge rates that are achievable on the given topology.
A. Jindal, K. Psounis
openaire   +1 more source

Achievable rate regions for asynchronous Slepian-Wolf coding systems

2015 IEEE Information Theory Workshop - Fall (ITW), 2015
The Slepian-Wolf (SW) coding system is a source coding system with two encoders and a decoder, where these encoders independently encode input sequences emitted from two correlated sources into fixed-length codewords, and the decoder reconstructs all input sequences from the codewords.
Tetsunao Matsuta, Tomohiko Uyematsu
openaire   +1 more source

Achievable Rate-Distortion Region for Robust Distributed Source Coding

2019 IEEE Information Theory Workshop (ITW), 2019
We derive a new inner bound to the rate-distortion (RD) region of the robust distributed source coding (RDSC) problem. The derived bound is proven to strictly enlarge the previous known largest for identified examples. This builds on the fixed block-length coding scheme that has been proposed in a series of recent works.
openaire   +1 more source

Maximum sum rates via analysis of 2-user interference channel achievable rates region

2009 43rd Annual Conference on Information Sciences and Systems, 2009
Treating the interference as noise, the paper studies the first derivative of the frontiers which trace the achievable rates region of the 2-user interference channel. The achievable rates region in this case was found to be the convex hull of the union of two regions, each is bounded by a log-defined line.
Mohamad Charafeddine, Arogyaswami Paulraj   +1 more
openaire   +1 more source

A New Achievable Rate Region for the Cognitive Radio Channel

2008 IEEE International Conference on Communications, 2008
The cognitive radio channel (CRC) refers to a communication model in which two senders attempt to communicate with their respective receivers simultaneously through a common medium, and one of the senders has complete and a priori (non-causal) knowledge about the message being transmitted by the other.
J. Jiang, Y. Xin
openaire   +1 more source

On Achievable Rate Regions for Source Coding Over Networks

2009
In the field of source coding over networks, a central goal is to understand the best possible performance for compressing and transmitting dependent data distributed over a network. The achievable rate region for such a network describes all link capacities that suffice to satisfy the reproduction demands.
openaire   +1 more source