اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدGrouping-based Interference Alignment with IA-Cell Assignment in Multi-Cell MIMO MAC under Limited Feedback
153
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 assignment 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.
قيم البحث
اقرأ أيضاً
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.
We take two new approaches to design efficient algorithms for transmitter optimization under rate constraints, to guarantee the Quality of Service in general MIMO interference networks, which is a combination of multiple interfering broadcast channel
s (BC) and multiaccess channels (MAC) and is named B-MAC Networks. Two related optimization problems, maximizing the minimum of weighted rates under a sum-power constraint and minimizing the sum-power under rate constraints, are considered. The first approach takes advantage of existing efficient algorithms for SINR problems by building a bridge between rate and SINR through the design of optimal mappings between them. The approach can be applied to other optimization problems as well. The second approach employs polite water-filling, which is the optimal network version of water-filling that we recently found. It replaces most generic optimization algorithms currently used for networks and reduces the complexity while demonstrating superior performance even in non-convex cases. Both centralized and distributed algorithms are designed and the performance is analyzed in addition to numeric examples.
We consider a downlink cellular network where multi-antenna base stations (BSs) transmit data to single-antenna users by using one of two linear precoding methods with limited feedback: (i) maximum ratio transmission (MRT) for serving a single user o
r (ii) zero forcing (ZF) for serving multiple users. The BS and user locations are drawn from a Poisson point process, allowing expressions for the signal- to-interference coverage probability and the ergodic spectral efficiency to be derived as a function of system parameters such as the number of BS antennas and feedback bits, and the pathloss exponent. We find a tight lower bound on the optimum number of feedback bits to maximize the net spectral efficiency, which captures the overall system gain by considering both of downlink and uplink spectral efficiency using limited feedback. Our main finding is that, when using MRT, the optimum number of feedback bits scales linearly with the number of antennas, and logarithmically with the channel coherence time. When using ZF, the feedback scales in the same ways as MRT, but also linearly with the pathloss exponent. The derived results provide system-level insights into the preferred channel codebook size by averaging the effects of short-term fading and long-term pathloss.
We take two new approaches to design efficient algorithms for transmitter optimization under rate constraints to guarantee the Quality of Service in general MIMO interference networks, named B-MAC Networks, which is a combination of multiple interfer
ing broadcast channels (BC) and multiaccess channels (MAC). Two related optimization problems, maximizing the minimum of weighted rates under a sum-power constraint and minimizing the sum-power under rate constraints, are considered. The first approach takes advantage of existing efficient algorithms for SINR problems by building a bridge between rate and SINR through the design of optimal mappings between them so that the problems can be converted to SINR constraint problems. The approach can be applied to other optimization problems as well. The second approach employs polite water-filling, which is the optimal network version of water-filling that we recently found. It replaces almost all generic optimization algorithms currently used for networks and reduces the complexity while demonstrating superior performance even in non-convex cases. Both centralized and distributed algorithms are designed and the performance is analyzed in addition to numeric examples.
In this paper, we investigate the impact of channel aging on the performance of cell-free (CF) massive multiple-input multiple-output (MIMO) systems with pilot contamination. To take into account the channel aging effect due to user mobility, we firs
t compute a channel estimate. We use it to derive novel closed-form expressions for the uplink spectral efficiency (SE) of CF massive MIMO systems with large-scale fading decoding and matched-filter receiver cooperation. The performance of a small-cell system is derived for comparison. It is found that CF massive MIMO systems achieve higher 95%-likely uplink SE in both low- and high-mobility conditions, and CF massive MIMO is more robust to channel aging. Fractional power control (FPC) is considered to compensate to limit the inter-user interference. The results show that, compared with full power transmission, the benefits of FPC are gradually weakened as the channel aging grows stronger.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
