Do you want to publish a course? Click here

On Interference Alignment and the Deterministic Capacity for Cellular Channels with Weak Symmetric Cross Links

153   0   0.0 ( 0 )
 Added by J\\\"org B\\\"uhler
 Publication date 2011
and research's language is English




Ask ChatGPT about the research

In this paper, we study the uplink of a cellular system using the linear deterministic approximation model, where there are two users transmitting to a receiver, mutually interfering with a third transmitter communicating with a second receiver. We give an achievable coding scheme and prove its optimality, i.e. characterize the capacity region. This scheme is a form of interference alignment which exploits the channel gain difference of the two-user cell.



rate research

Read More

This paper studies a symmetric K user Gaussian interference channel with K transmitters and K receivers. A very strong interference regime is derived for this channel setup. A very strong interference regime is one where the capacity region of the interference channel is the same as the capacity region of the channel with no interference. In this regime, the interference can be perfectly canceled by all the receivers without incurring any rate penalties. A very strong interference condition for an example symmetric K user deterministic interference channel is also presented.
An interference alignment example is constructed for the deterministic channel model of the $K$ user interference channel. The deterministic channel example is then translated into the Gaussian setting, creating the first known example of a fully connected Gaussian $K$ user interference network with single antenna nodes, real, non-zero and contant channel coefficients, and no propagation delays where the degrees of freedom outerbound is achieved. An analogy is drawn between the propagation delay based interference alignment examples and the deterministic channel model which also allows similar constructions for the 2 user $X$ channel as well.
The fully connected K-user interference channel is studied in a multipath environment with bandwidth W. We show that when each link consists of D physical paths, the total spectral efficiency can grow {it linearly} with K. This result holds not merely in the limit of large transmit power P, but for any fixed P, and is therefore a stronger characterization than degrees of freedom. It is achieved via a form of interference alignment in the time domain. A caveat of this result is that W must grow with K, a phenomenon we refer to as {it bandwidth scaling}. Our insight comes from examining channels with single path links (D=1), which we refer to as line-of-sight (LOS) links. For such channels we build a time-indexed interference graph and associate the communication problem with finding its maximal independent set. This graph has a stationarity property that we exploit to solve the problem efficiently via dynamic programming. Additionally, the interference graph enables us to demonstrate the necessity of bandwidth scaling for any scheme operating over LOS interference channels. Bandwidth scaling is then shown to also be a necessary ingredient for interference alignment in the K-user interference channel.
Interference alignment (IA) is a joint-transmission technique that achieves the capacity of the interference channel for high signal-to-noise ratios (SNRs). Most prior work on IA is based on the impractical assumption that perfect and global channel-state information(CSI) is available at all transmitters. To implement IA, each receiver has to feed back CSI to all interferers, resulting in overwhelming feedback overhead. In particular, the sum feedback rate of each receiver scales quadratically with the number of users even if the quantized CSI is fed back. To substantially suppress feedback overhead, this paper focuses on designing efficient arrangements of feedback links, called feedback topologies, under the IA constraint. For the multiple-input-multiple-output (MIMO) K-user interference channel, we propose the feedback topology that supports sequential CSI exchange (feedback and feedforward) between transmitters and receivers so as to achieve IA progressively. This feedback topology is shown to reduce the network feedback overhead from a cubic function of K to a linear one. To reduce the delay in the sequential CSI exchange, an alternative feedback topology is designed for supporting two-hop feedback via a control station, which also achieves the linear feedback scaling with K. Next, given the proposed feedback topologies, the feedback-bit allocation algorithm is designed for allocating feedback bits by each receiver to different feedback links so as to regulate the residual interference caused by the finite-rate feedback. Simulation results demonstrate that the proposed bit allocation leads to significant throughput gains especially in strong interference environments.
comments
Fetching comments Fetching comments
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا