Return to search

Interference Mitigation for Cellular Networks: Fundamental Limits and Applications

Interference is a key limiting factor in modern communication systems. In a wireless cellular network, the performance of cell-edge users is severely limited by the intercell interference. This thesis studies the use of interference-channel and relay-channel techniques to mitigate intercell interference and to improve the throughput and coverage of cellular networks. The aim of this thesis is to demonstrate the benefit of the proposed interference mitigation schemes through both information theoretical studies and applications in the cellular network.

There are three mains results in this thesis: First, it is shown that for the $K$-user cyclic Gaussian interference channel, where the $k$th user interferes with only the ($k -1$)th user (mod $K$) in the network, the Etkin-Tse Wang power splitting strategy achieves the capacity region to within 2 bits in the weak interference regime. For the special 3-user case, this gap can be sharpened to $1\frac{1}{2}$ bits by the time-sharing technique. Second, it is shown that for a two-user Gaussian interference channel with an in-band-reception and out-of-band transmission relay, generalized hash-and-forward together with Han-Kobayashi information splitting can achieve the capacity region of this channel to within a constant number of bits in a certain weak-relay regime. A generalized-degrees-of-freedom analysis in the high signal-to-noise ratio regime reveals that in the symmetric channel setting, each common relay bit improves the sum rate up to two bits. The third part of this thesis studies an uplink multicell joint processing model in which the base stations are connected to a centralized processing server via rate-limited digital backhaul links. This thesis proposes a suboptimal achievability scheme employing the Wyner-Ziv compress-and-forward relaying technique and successive-interference-cancellation decoding. The main advantage of the proposed approach is that it results in achievable rate regions that are easily computable, in contrast to previous schemes in which the rate regions can only be characterized by exponential number of rate constraints.

Identiferoai:union.ndltd.org:TORONTO/oai:tspace.library.utoronto.ca:1807/35195
Date20 March 2013
CreatorsZhou, Lei
ContributorsYu, Wei
Source SetsUniversity of Toronto
Languageen_ca
Detected LanguageEnglish
TypeThesis

Page generated in 0.0021 seconds