2 research outputs found
Achievable Rate Regions for the Dirty Multiple Access Channel with Partial Side Information at the Transmitters
In this paper, we establish achievable rate regions for the multiple access
channel (MAC) with side information partially known (estimated or sensed
version) at the transmitters. Actually, we extend the lattice strategies used
by Philosof-Zamir for the MAC with full side information at the transmitters to
the partially known case. We show that the sensed or estimated side information
reduces the rate regions, the same as that occurs for Costa Gaussian channel.Comment: 5 pages, 3 figures, This paper was accepted at IEEE-ISIT201
Capacity Bounds and a Certain Capacity Region for Special Three-Receiver Broadcast Channels with Side Information
The fact that the results for 2-receiver broadcast channels (BCs) are not
generalized to the 3-receiver ones is of information theoretical importance. In
this paper we study two classes of discrete memoryless BCs with non-causal side
information (SI), i.e. multilevel BC (MBC) and 3-receiver less noisy BC. First,
we obtain an achievable rate region and a capacity outer bound for the MBC.
Second, we prove a special capacity region for the 3-receiver less noisy BC.
Third, the obtained special capacity region for the 3-receiver less noisy BC is
extended to continuous alphabet fading Gaussian version. It is worth mentioning
that the previous works are special cases of our works.Comment: 24 pages, 2 figures, Submitted to IET Communications Journal for
possible publicatio