|
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 1
Mon 30 Aug, 14.40-16.00, Room 3
Contributed session
|
|
Jing Huang, Krishnan Padmanabhan, and Oliver M. Collins
Exact PWM Representation of Bandlimited Signals
|
|
Abstract:
This paper proves that any bandlimited signal within ± 0.637 V
can be represented by a PWM waveform with amplitude V. The number
of the pulses in the waveform is equal to the number of the Nyquist
samples. This paper also provides a practical iterative procedure to
generate the PWM waveform for a given bandlimited signal. The error
of this procedure decreases exponentially with the number of
iterations.
Mon 30 Aug, 14.40-15.00, Room 3
|
|
|
Stefan Krone and Gerhard Fettweis
Fading Channels with 1-Bit Output Quantization: Optimal Modulation, Ergodic Capacity and Outage Probability
|
|
Abstract:
The achievable rate of communications systems depends on the
quantization resolution at the receiver. Earlier work has shown that
the capacity of real-valued AWGN channels with 1-bit output
quantization is achieved with BPSK. This paper studies optimal
modulation schemes, the ergodic capacity and the outage probability
for complex-valued fading channels with 1-bit output quantization,
assuming full channel knowledge at the receiver. It is shown that
circular symmetry with at most one amplitude per phase is a
necessary condition for optimal modulation. Circular-symmetric PSK
achieves the ergodic capacity in case of Rayleigh
fading. Considering the outage probability for Rayleigh fading,
L-PSK with large L shows the best performance among conventional
modulation schemes.
Mon 30 Aug, 15.00-15.20, Room 3
|
|
|
Kumar Viswanatha, Emrah Akyol, and Kenneth Rose
On Optimum Communication Cost for Joint Compression and DispersiveInformation Routing
|
|
Abstract:
In this paper, we consider the problem of minimum cost joint
compression and routing for networks with multiple-sinks and
correlated sources. We introduce a routing paradigm, called
dispersive information routing, wherein the intermediate nodes are
allowed to forward a subset of the received bits on subsequent
paths. This paradigm opens up a rich class of research problems
which focus on the interplay between encoding and routing in a
network. What makes it particularly interesting is the challenge in
encoding sources such that, exactly the required information is
routed to each sink, to reconstruct the sources they are interested
in. We demonstrate using simple examples that our approach offers
better asymptotic performance than conventional routing techniques.
We also introduce a variant of the well known random binning
technique, called 'power binning', to encode and decode sources that
are dispersively transmitted, and which asymptotically achieves the
minimum communication cost within this routing paradigm.
Mon 30 Aug, 15.20-15.40, Room 3
|
|
|
Md. Zahurul I. Sarkar and Tharmalingam Ratnarajah
On the Secure Outage Performance for Wireless Multicasting through Slow Fading Channels
|
|
Abstract:
In the group-oriented applications such as military and commercial
wireless cellular networks often require the same data to be
conveyed to multiple users simultaneously. This technique is usually
referred to as physical layer multicasting. In this paper, we are
interested in protecting these data from eavesdropping. Here, we
consider the transmission of confidential data through slow fading
channels in the presence of single as well as multiple
eavesdroppers. We define the perfect secrecy multicast mutual
information in terms of secure outage probability for three
different scenarios of secure wireless multicasting and provide a
complete characterization of the maximum transmission rate at which
the eavesdropper/eavesdroppers is/are unable to decode any
information. We also present the average secrecy mutual information
for multicasting in the presence of multiple eavesdroppers.
Mon 30 Aug, 15.40-16.00, Room 3
|
Back to previous page
Return to conference mainpage
|
|
