ترغب بنشر مسار تعليمي؟ اضغط هنا

Feedback-Topology Designs for Interference Alignment in MIMO Interference Channels

124   0   0.0 ( 0 )
 نشر من قبل Sungyoon Cho
 تاريخ النشر 2011
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

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.



قيم البحث

اقرأ أيضاً

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 merel y 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.
119 - Chiao-En Chen 2015
Interference alignment (IA) has recently emerged as a promising interference mitigation technique for interference networks. In this letter, we focus on the IA non-iterative transceiver design problem in a multiple-input-multiple-output interfering b roadcast channel (MIMO-IBC), and observed that there is previously unexploited flexibility in different permutations of user ordering. By choosing a good user ordering for a pre-determined IA inter-channel-interference allocation, an improved transceiver design can be accomplished. In order to achieve a more practical performance-complexity tradeoff, a suboptimal user ordering algorithm is proposed. Simulation shows the proposed suboptimal user ordering algorithm can achieve near-optimal performance compared to the optimal ordering while exhibiting only moderate computational complexity.
Interference alignment (IA) is a promising technique to efficiently mitigate interference and to enhance the capacity of a wireless communication network. This paper proposes a grouping-based interference alignment (GIA) with optimized IA-Cell assign ment for the multiple cells interfering multiple-input and multiple-output (MIMO) multiple access channel (MAC) network under limited feedback. This work consists of three main parts: 1) a complete study (including some new improvements) of the GIA with respect to the degrees of freedom (DoF) and optimal linear transceiver design is performed, which allows for low-complexity and distributed implementation; 2) based on the GIA, the concept of IA-Cell assignment is introduced. Three IA-Cell assignment algorithms are proposed for the setup with different backhaul overhead and their DoF and rate performance is investigated; 3) the performance of the proposed GIA algorithms is studied under limited feedback of IA precoders. To enable efficient feedback, a dynamic feedback bit allocation (DBA) problem is formulated and solved in closed-form. The practical implementation, the required backhaul overhead, and the complexity of the proposed algorithms are analyzed. Numerical results show that our proposed algorithms greatly outperform the traditional GIA under both unlimited and limited feedback.
This paper investigates the linear precoder design for $K$-user interference channels of multiple-input multiple-output (MIMO) transceivers under finite alphabet inputs. We first obtain general explicit expressions of the achievable rate for users in the MIMO interference channel systems. We study optimal transmission strategies in both low and high signal-to-noise ratio (SNR) regions. Given finite alphabet inputs, we show that a simple power allocation design achieves optimal performance at high SNR whereas the well-known interference alignment technique for Gaussian inputs only utilizes a partial interference-free signal space for transmission and leads to a constant rate loss when applied naively to finite-alphabet inputs. Moreover, we establish necessary conditions for the linear precoder design to achieve weighted sum-rate maximization. We also present an efficient iterative algorithm for determining precoding matrices of all the users. Our numerical results demonstrate that the proposed iterative algorithm achieves considerably higher sum-rate under practical QAM inputs than other known methods.
The feasibility conditions of interference alignment (IA) are analyzed for reverse TDD systems, i.e., one cell operates as downlink (DL) but the other cell operates as uplink (UL). Under general multiple-input and multiple-output (MIMO) antenna confi gurations, a necessary condition and a sufficient condition for one-shot linear IA are established, i.e., linear IA without symbol or time extension. In several example networks, optimal sum degrees of freedom (DoF) is characterized by the derived necessary condition and sufficient condition. For symmetric DoF within each cell, a sufficient condition is established in a more compact expression, which yields the necessary and sufficient condition for a class of symmetric DoF. An iterative construction of transmit and received beamforming vectors is further proposed, which provides a specific beamforming design satisfying one-shot IA. Simulation results demonstrate that the proposed IA not only achieve lager DoF but also significantly improve the sum rate in the practical signal-to-noise ratio (SNR) regime.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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