6,247 research outputs found
On the Symmetric Feedback Capacity of the K-user Cyclic Z-Interference Channel
The K-user cyclic Z-interference channel models a situation in which the kth
transmitter causes interference only to the (k-1)th receiver in a cyclic
manner, e.g., the first transmitter causes interference only to the Kth
receiver. The impact of noiseless feedback on the capacity of this channel is
studied by focusing on the Gaussian cyclic Z-interference channel. To this end,
the symmetric feedback capacity of the linear shift deterministic cyclic
Z-interference channel (LD-CZIC) is completely characterized for all
interference regimes. Using insights from the linear deterministic channel
model, the symmetric feedback capacity of the Gaussian cyclic Z-interference
channel is characterized up to within a constant number of bits. As a byproduct
of the constant gap result, the symmetric generalized degrees of freedom with
feedback for the Gaussian cyclic Z-interference channel are also characterized.
These results highlight that the symmetric feedback capacities for both linear
and Gaussian channel models are in general functions of K, the number of users.
Furthermore, the capacity gain obtained due to feedback decreases as K
increases.Comment: Accepted for publication in IEEE Transactions on Information Theor
Feedback and Cooperation in Wireless Networks
The demand for wireless data services has been dramatically growing over the last decade. This growth has been accompanied by a significant increase in the number of users sharing the same wireless medium, and as a result, interference management has become a hot topic of research in recent years. In this dissertation, we investigate feedback and transmitter cooperation as two closely related tools to manage the interference and achieve high data rates in several wireless networks, focusing on additive white Gaussian noise (AWGN) interference, X, and broadcast channels.
We start by a one-to-many network, namely, the three-user multiple-input multiple-output (MIMO) Gaussian broadcast channel, where we assume that the transmitter obtains the channel state information (CSI) through feedback links after a finite delay. We also assume that the feedback delay is greater than the channel coherence time, and thus, the CSI expires prior to being exploited by the transmitter for its current transmission. Nevertheless, we show that this delayed CSI at the transmitter (delayed CSIT) can help the transmitter to achieve significantly higher data rates compared to having no CSI. We indeed show that delayed CSIT increases the channel degrees of freedom (DoF), which is translated to an unbounded increase in capacity with increasing signal-to-noise-ratio (SNR). For the symmetric case, i.e. with the same number of antennas at each receiver, we propose different transmission schemes whose achievable DoFs meet the upper bound for a wide range of transmit-receive antenna ratios. Also, for the general non-symmetric case, we propose transmission schemes that characterize the DoF region for certain classes of antenna configurations.
Subsequently, we investigate channels with distributed transmitters, namely, Gaussian single-input single-output (SISO) K-user interference channel and 2×K X channel under the delayed CSIT assumption. In these channels, in major contrast to the broadcast channel, each transmitter has access only to its own messages. We propose novel multiphase transmission schemes wherein the transmitters collaboratively align the past interference at appropriate receivers using the knowledge of past CSI. Our achievable DoFs are greater than one (which is the channel DoF without CSIT), and strictly increasing in K. Our results are yet the best available reported DoFs for these channels with delayed CSIT. Furthermore, we consider the K-user r-cyclic interference channel, where each transmitter causes interference on only r receivers in a cyclic manner. By developing a new upper bound, we show that this channel has K/r DoF with no CSIT. Moreover, by generalizing our multiphase transmission ideas, we show that, for r=3, this channel can achieve strictly greater than K/3 DoF with delayed CSIT.
Next, we add the capability of simultaneous transmission and reception, i.e. full-duplex operation, to the transmitters, and investigate its impact on the DoF of the SISO Gaussian K-user interference and M×K X channel under the delayed CSIT assumption. By proposing new cooperation/alignment techniques, we show that the full-duplex transmitter cooperation can potentially yield DoF gains in both channels with delayed CSIT. This is in sharp contrast to the previous results on these channels indicating the inability of full-duplex transmitter cooperation to increase the channel DoF with either perfect instantaneous CSIT or no CSIT. With the recent technological advances in implementation of full-duplex communication, it is expected to play a crucial role in the future wireless systems.
Finally, we consider the Gaussian K-user interference and K×K X channel with output feedback, wherein each transmitter causally accesses the output of its paired receiver. First, using the output feedback and under no CSIT assumption, we show that both channels can achieve DoF values greater than one, strictly increasing in K, and approaching the limiting value of 2 as K→∞. Then, we develop transmission schemes for the same channels with both output feedback and delayed CSIT, known as Shannon feedback. Our achievable DoFs with Shannon feedback are greater than those with the output feedback for almost all values of K
On the Capacity of Symmetric Gaussian Interference Channels with Feedback
In this paper, we propose a new coding scheme for symmetric Gaussian
interference channels with feedback based on the ideas of time-varying coding
schemes. The proposed scheme improves the Suh-Tse and Kramer inner bounds of
the channel capacity for the cases of weak and not very strong interference.
This improvement is more significant when the signal-to-noise ratio (SNR) is
not very high. It is shown theoretically and numerically that our coding scheme
can outperform the Kramer code. In addition, the generalized degrees-of-freedom
of our proposed coding scheme is equal to the Suh-Tse scheme in the strong
interference case. The numerical results show that our coding scheme can attain
better performance than the Suh-Tse coding scheme for all channel parameters.
Furthermore, the simplicity of the encoding/decoding algorithms is another
strong point of our proposed coding scheme compared with the Suh-Tse coding
scheme. More importantly, our results show that an optimal coding scheme for
the symmetric Gaussian interference channels with feedback can be achieved by
using only marginal posterior distributions under a better cooperation strategy
between transmitters.Comment: To appear in Proc. of IEEE International Symposium on Information
Theory (ISIT), Hong Kong, June 14-19, 201
Degrees of Freedom and Achievable Rate of Wide-Band Multi-cell Multiple Access Channels With No CSIT
This paper considers a -cell multiple access channel with inter-symbol
interference. The primary finding of this paper is that, without instantaneous
channel state information at the transmitters (CSIT), the sum
degrees-of-freedom (DoF) of the considered channel is
with when the number of users per cell is sufficiently large,
where is the ratio of the maximum channel-impulse-response (CIR) length
of desired links to that of interfering links in each cell. Our finding implies
that even without instantaneous CSIT, \textit{interference-free DoF per cell}
is achievable as approaches infinity with a sufficiently large number
of users per cell. This achievability is shown by a blind interference
management method that exploits the relativity in delay spreads between desired
and interfering links. In this method, all inter-cell-interference signals are
aligned to the same direction by using a discrete-Fourier-transform-based
precoding with cyclic prefix that only depends on the number of CIR taps. Using
this method, we also characterize the achievable sum rate of the considered
channel, in a closed-form expression.Comment: Submitted to IEEE Transactions on Communication
Perfect Output Feedback in the Two-User Decentralized Interference Channel
In this paper, the -Nash equilibrium (-NE) region of the two-user
Gaussian interference channel (IC) with perfect output feedback is approximated
to within bit/s/Hz and arbitrarily close to bit/s/Hz. The
relevance of the -NE region is that it provides the set of rate-pairs
that are achievable and stable in the IC when both transmitter-receiver pairs
autonomously tune their own transmit-receive configurations seeking an
-optimal individual transmission rate. Therefore, any rate tuple outside
the -NE region is not stable as there always exists one link able to
increase by at least bits/s/Hz its own transmission rate by updating its
own transmit-receive configuration. The main insights that arise from this work
are: The -NE region achieved with feedback is larger than or equal
to the -NE region without feedback. More importantly, for each rate pair
achievable at an -NE without feedback, there exists at least one rate
pair achievable at an -NE with feedback that is weakly Pareto superior.
There always exists an -NE transmit-receive configuration that
achieves a rate pair that is at most bit/s/Hz per user away from the outer
bound of the capacity region.Comment: Revised version (Aug. 2015
On Approximating the Sum-Rate for Multiple-Unicasts
We study upper bounds on the sum-rate of multiple-unicasts. We approximate
the Generalized Network Sharing Bound (GNS cut) of the multiple-unicasts
network coding problem with independent sources. Our approximation
algorithm runs in polynomial time and yields an upper bound on the joint source
entropy rate, which is within an factor from the GNS cut. It
further yields a vector-linear network code that achieves joint source entropy
rate within an factor from the GNS cut, but \emph{not} with
independent sources: the code induces a correlation pattern among the sources.
Our second contribution is establishing a separation result for vector-linear
network codes: for any given field there exist networks for which
the optimum sum-rate supported by vector-linear codes over for
independent sources can be multiplicatively separated by a factor of
, for any constant , from the optimum joint entropy
rate supported by a code that allows correlation between sources. Finally, we
establish a similar separation result for the asymmetric optimum vector-linear
sum-rates achieved over two distinct fields and
for independent sources, revealing that the choice of field
can heavily impact the performance of a linear network code.Comment: 10 pages; Shorter version appeared at ISIT (International Symposium
on Information Theory) 2015; some typos correcte
- …