199 research outputs found
A Novel Transmission Scheme for the -user Broadcast Channel with Delayed CSIT
The state-dependent -user memoryless Broadcast Channel~(BC) with state
feedback is investigated. We propose a novel transmission scheme and derive its
corresponding achievable rate region, which, compared to some general schemes
that deal with feedback, has the advantage of being relatively simple and thus
is easy to evaluate. In particular, it is shown that the capacity region of the
symmetric erasure BC with an arbitrary input alphabet size is achievable with
the proposed scheme. For the fading Gaussian BC, we derive a symmetric
achievable rate as a function of the signal-to-noise ratio~(SNR) and a small
set of parameters. Besides achieving the optimal degrees of freedom at high
SNR, the proposed scheme is shown, through numerical results, to outperform
existing schemes from the literature in the finite SNR regime.Comment: 30 pages, 3 figures, submitted to IEEE Transactions on Wireless
Communications (revised version
Coordinated Multicasting with Opportunistic User Selection in Multicell Wireless Systems
Physical layer multicasting with opportunistic user selection (OUS) is
examined for multicell multi-antenna wireless systems. By adopting a two-layer
encoding scheme, a rate-adaptive channel code is applied in each fading block
to enable successful decoding by a chosen subset of users (which varies over
different blocks) and an application layer erasure code is employed across
multiple blocks to ensure that every user is able to recover the message after
decoding successfully in a sufficient number of blocks. The transmit signal and
code-rate in each block determine opportunistically the subset of users that
are able to successfully decode and can be chosen to maximize the long-term
multicast efficiency. The employment of OUS not only helps avoid
rate-limitations caused by the user with the worst channel, but also helps
coordinate interference among different cells and multicast groups. In this
work, efficient algorithms are proposed for the design of the transmit
covariance matrices, the physical layer code-rates, and the target user subsets
in each block. In the single group scenario, the system parameters are
determined by maximizing the group-rate, defined as the physical layer
code-rate times the fraction of users that can successfully decode in each
block. In the multi-group scenario, the system parameters are determined by
considering a group-rate balancing optimization problem, which is solved by a
successive convex approximation (SCA) approach. To further reduce the feedback
overhead, we also consider the case where only part of the users feed back
their channel vectors in each block and propose a design based on the balancing
of the expected group-rates. In addition to SCA, a sample average approximation
technique is also introduced to handle the probabilistic terms arising in this
problem. The effectiveness of the proposed schemes is demonstrated by computer
simulations.Comment: Accepted by IEEE Transactions on Signal Processin
On Two-Pair Two-Way Relay Channel with an Intermittently Available Relay
When multiple users share the same resource for physical layer cooperation
such as relay terminals in their vicinities, this shared resource may not be
always available for every user, and it is critical for transmitting terminals
to know whether other users have access to that common resource in order to
better utilize it. Failing to learn this critical piece of information may
cause severe issues in the design of such cooperative systems. In this paper,
we address this problem by investigating a two-pair two-way relay channel with
an intermittently available relay. In the model, each pair of users need to
exchange their messages within their own pair via the shared relay. The shared
relay, however, is only intermittently available for the users to access. The
accessing activities of different pairs of users are governed by independent
Bernoulli random processes. Our main contribution is the characterization of
the capacity region to within a bounded gap in a symmetric setting, for both
delayed and instantaneous state information at transmitters. An interesting
observation is that the bottleneck for information flow is the quality of state
information (delayed or instantaneous) available at the relay, not those at the
end users. To the best of our knowledge, our work is the first result regarding
how the shared intermittent relay should cooperate with multiple pairs of users
in such a two-way cooperative network.Comment: extended version of ISIT 2015 pape
Secret Communication over Broadcast Erasure Channels with State-feedback
We consider a 1-to- communication scenario, where a source transmits
private messages to receivers through a broadcast erasure channel, and the
receivers feed back strictly causally and publicly their channel states after
each transmission. We explore the achievable rate region when we require that
the message to each receiver remains secret - in the information theoretical
sense - from all the other receivers. We characterize the capacity of secure
communication in all the cases where the capacity of the 1-to- communication
scenario without the requirement of security is known. As a special case, we
characterize the secret-message capacity of a single receiver point-to-point
erasure channel with public state-feedback in the presence of a passive
eavesdropper.
We find that in all cases where we have an exact characterization, we can
achieve the capacity by using linear complexity two-phase schemes: in the first
phase we create appropriate secret keys, and in the second phase we use them to
encrypt each message. We find that the amount of key we need is smaller than
the size of the message, and equal to the amount of encrypted message the
potential eavesdroppers jointly collect. Moreover, we prove that a dishonest
receiver that provides deceptive feedback cannot diminish the rate experienced
by the honest receivers.
We also develop a converse proof which reflects the two-phase structure of
our achievability scheme. As a side result, our technique leads to a new outer
bound proof for the non-secure communication problem
Achievable Regions for Interference Channels with Generalized and Intermittent Feedback
In this paper, we first study a two-user interference channel with
generalized feedback. We establish an inner bound on its capacity region. The
coding scheme that we employ for the inner bound is based on an appropriate
combination of Han-Kobayash rate splitting and compress-and-forward at the
senders. Each sender compresses the channel output that is observes using a
compression scheme that is \`a-la Lim et al. noisy network coding and
Avestimeher et al. quantize-map-and-forward. Next, we study an injective
deterministic model in which the senders obtain output feedback only
intermittently. Specializing the coding scheme of the model with generalized
feedback to this scenario, we obtain useful insights onto effective ways of
combining noisy network coding with interference alignment techniques. We also
apply our results to linear deterministic interference channels with
intermittent feedback.Comment: To appear in Proc. of the 2014 IEEE International Symposium on
Information Theory, 6 pages, 2 figure
- …