|
Contact:
Marcus Greferath
School of Math. Sciences
University College Dublin
Belfield, Dublin 4, Ireland
Phone:
+353-1-716-2588 (UCD)
+353-85-153-0951 (mobile)
Joachim Rosenthal
Institut of Mathematics
University of Zurich
Winterthurerstrasse 190
8057 Zurich, Switzerland
Phone:
+41-44-63 55884 (office)
|
|
ITW 2010 Dublin
IEEE Information Theory Workshop
Dublin, August 30 - September 3, 2010
Communication theory 2
Tue 31 Aug, 14.40-16.00, Room 2
Contributed sessions
|
|
Sadaf Salehkalaibar and Mohammad Reza Aref
On the Capacity Region of the Degraded Z Channel
|
|
Abstract:
In this paper, we consider the two-user Z Channel (ZC). There are
two senders and two receivers in the model. One of the senders
transmits information to its intended receiver, while the other
sender transmits information to both receivers. We establish a new
achievable rate region for the ZC, using Marton's binning
technique. At the receivers, we use joint decoding strategy. To
illustrate the tightness of the proposed inner bound, we consider
the degraded ZC which was first introduced by Chong et. al. We then
characterize the capacity region of this type of degraded ZC.
Tue 31 Aug, 14.40-15.00, Room 2
|
|
|
Albert Guillén i Fàbregas and Alfonso Martinez
Bit-Interleaved Coded Modulation with Shaping
|
|
Abstract:
The performance of bit-interleaved coded modulation (BICM) with
shaping (i.e., non-equiprobable bit probabilities) is studied. For
the AWGN channel, the rates achievable with BICM and shaping are
practically identical to those of coded modulation or multilevel
coding, virtually closing the gap that made BICM suboptimal in terms
of information rates.
Tue 31 Aug, 15.00-15.20, Room 2
|
|
|
Reza Khosravi-Farsani, Bahareh Akhbari, and Mohammad Reza Aref
Achievable Rate Regions for Dirty Tape Channels and "Joint Writing on Dirty Paper and Dirty Tape"
|
|
Abstract:
We consider the Gaussian Dirty Tape Channel (DTC) Y = X+S+Z, where {S} is
an additive Gaussian interference known
causally to the transmitter. The general expression
maxPU,f(⋅),X=f(U,S) I(U;Y) is proposed for the capacity
of this channel. For linear assignment to f(⋅), i.e.,
X = U-βS, this expression leads to the compensation
strategy proposed previously by Willems to obtain an
achievable rate for the DTC. We show that linear assignment to
f(⋅) is optimal under the condition that there exists a real
number β* such that the pair (X+β*S,U) is independent
of the interference S. Furthermore, by applying a time-sharing
technique to the achievable rate derived by linear assignment to
f(⋅), an improved lower bound on the capacity of DTC is
obtained. We also consider the Gaussian multiple access channel with
additive interference, and study two different scenarios for this
system. In the first case, both transmitters know interference
causally while in the second, one transmitter has access to the
interference noncausally and the other causally. Achievable rate
regions for these two scenarios are then established.
Tue 31 Aug, 15.20-15.40, Room 2
|
|
|
Hieu T. Do, Tobias J. Oechtering, and Mikael Skoglund
Coding for the Z Channel With a Digital Relay Link
|
|
Abstract:
This paper considers a discrete memoryless four-node network where
two nodes want to send three independent messages to the other two
nodes. The two receiving nodes are allowed to cooperate by means of
a unidirectional noiseless link with finite capacity. A coding
scheme is proposed which combines rate splitting, block Markov
multi-level superposition coding with binning and joint
decoding. The general achievable rates are then specialized to
degraded channel and Gaussian channel, where it is shown that the
sum capacity for the Gaussian channel is achieved under certain
conditions. Results in this paper recover and unify previously known
results for the discrete memoryless Z channel without cooperation,
and results for the Gaussian Z-interference channel with a digital
relay link.
Tue 31 Aug, 15.40-16.00, Room 2
|
Back to previous page
Return to conference mainpage
|
|
