31,319 research outputs found
Dependence Balance Based Outer Bounds for Gaussian Networks with Cooperation and Feedback
We obtain new outer bounds on the capacity regions of the two-user multiple
access channel with generalized feedback (MAC-GF) and the two-user interference
channel with generalized feedback (IC-GF). These outer bounds are based on the
idea of dependence balance which was proposed by Hekstra and Willems [1]. To
illustrate the usefulness of our outer bounds, we investigate three different
channel models. We first consider a Gaussian MAC with noisy feedback (MAC-NF),
where transmitter , , receives a feedback , which is the
channel output corrupted with additive white Gaussian noise . As the
feedback noise variances become large, one would expect the feedback to become
useless, which is not reflected by the cut-set bound. We demonstrate that our
outer bound improves upon the cut-set bound for all non-zero values of the
feedback noise variances. Moreover, in the limit as , , our outer bound collapses to the capacity region of the
Gaussian MAC without feedback. Secondly, we investigate a Gaussian MAC with
user-cooperation (MAC-UC), where each transmitter receives an additive white
Gaussian noise corrupted version of the channel input of the other transmitter
[2]. For this channel model, the cut-set bound is sensitive to the cooperation
noises, but not sensitive enough. For all non-zero values of cooperation noise
variances, our outer bound strictly improves upon the cut-set outer bound.
Thirdly, we investigate a Gaussian IC with user-cooperation (IC-UC). For this
channel model, the cut-set bound is again sensitive to cooperation noise
variances but not sensitive enough. We demonstrate that our outer bound
strictly improves upon the cut-set bound for all non-zero values of cooperation
noise variances.Comment: Submitted to IEEE Transactions on Information Theor
Can Negligible Cooperation Increase Network Capacity? The Average-Error Case
In communication networks, cooperative strategies are coding schemes where
network nodes work together to improve network performance metrics such as
sum-rate. This work studies encoder cooperation in the setting of a discrete
multiple access channel with two encoders and a single decoder. A node in the
network that is connected to both encoders via rate-limited links, referred to
as the cooperation facilitator (CF), enables the cooperation strategy.
Previously, the authors presented a class of multiple access channels where the
average-error sum-capacity has an infinite derivative in the limit where CF
output link capacities approach zero. The authors also demonstrated that for
some channels, the maximal-error sum-capacity is not continuous at the point
where the output link capacities of the CF equal zero. This work shows that the
the average-error sum-capacity is continuous when CF output link capacities
converge to zero; that is, the infinite derivative of the average-error
sum-capacity is not a result of its discontinuity as in the maximal-error case.Comment: 20 pages, 1 figure. To be submitted to ISIT '1
Two-way quantum communication channels
We consider communication between two parties using a bipartite quantum
operation, which constitutes the most general quantum mechanical model of
two-party communication. We primarily focus on the simultaneous forward and
backward communication of classical messages. For the case in which the two
parties share unlimited prior entanglement, we give inner and outer bounds on
the achievable rate region that generalize classical results due to Shannon. In
particular, using a protocol of Bennett, Harrow, Leung, and Smolin, we give a
one-shot expression in terms of the Holevo information for the
entanglement-assisted one-way capacity of a two-way quantum channel. As
applications, we rederive two known additivity results for one-way channel
capacities: the entanglement-assisted capacity of a general one-way channel,
and the unassisted capacity of an entanglement-breaking one-way channel.Comment: 21 pages, 3 figure
Negligible Cooperation: Contrasting the Maximal- and Average-Error Cases
In communication networks, cooperative strategies are coding schemes where network nodes work together to improve network performance metrics such as the total rate delivered across the network. This work studies encoder cooperation in the setting of a discrete multiple access channel (MAC) with two encoders and a single decoder. A network node, here called the cooperation facilitator (CF), that is connected to both encoders via rate-limited links, enables the cooperation strategy. Previous work by the authors presents two classes of MACs: (i) one class where the average-error sum-capacity has an infinite derivative in the limit where CF output link capacities approach zero, and (ii) a second class of MACs where the maximal-error sum-capacity is not continuous at the point where the output link capacities of the CF equal zero. This work contrasts the power of the CF in the maximal- and average-error cases, showing that a constant number of bits communicated over the CF output link can yield a positive gain in the maximal-error sum-capacity, while a far greater number of bits, even numbers that grow sublinearly in the blocklength, can never yield a non-negligible gain in the average-error sum-capacity
Hash-and-Forward Relaying for Two-Way Relay Channel
This paper considers a communication network comprised of two nodes, which
have no mutual direct communication links, communicating two-way with the aid
of a common relay node (RN), also known as separated two-way relay (TWR)
channel.
We first recall a cut-set outer bound for the set of rates in the context of
this network topology assuming full-duplex transmission capabilities. Then, we
derive a new achievable rate region based on hash-and-forward (HF) relaying
where the RN does not attempt to decode but instead hashes its received signal,
and show that under certain channel conditions it coincides with Shannon's
inner-bound for the two-way channel [1]. Moreover, for binary adder TWR channel
with additive noise at the nodes and the RN we provide a detailed capacity
achieving coding scheme based on structure codes.Comment: 5 pages, 2 figures, submitted to the IEEE ISIT'11 conferenc
Channel Uncertainty in Ultra Wideband Communication Systems
Wide band systems operating over multipath channels may spread their power
over bandwidth if they use duty cycle. Channel uncertainty limits the
achievable data rates of power constrained wide band systems; Duty cycle
transmission reduces the channel uncertainty because the receiver has to
estimate the channel only when transmission takes place. The optimal choice of
the fraction of time used for transmission depends on the spectral efficiency
of the signal modulation. The general principle is demonstrated by comparing
the channel conditions that allow different modulations to achieve the capacity
in the limit. Direct sequence spread spectrum and pulse position modulation
systems with duty cycle achieve the channel capacity, if the increase of the
number of channel paths with the bandwidth is not too rapid. The higher
spectral efficiency of the spread spectrum modulation lets it achieve the
channel capacity in the limit, in environments where pulse position modulation
with non-vanishing symbol time cannot be used because of the large number of
channel paths
- …