اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدTechnical Report: MIMO B-MAC Interference Network Optimization under Rate Constraints by Polite Water-filling and Duality
125
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 interfering 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.
قيم البحث
اقرأ أيضاً
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.
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.
We investigate a multi-user multiple-input multiple-output interference network in the presence of multiple reconfigurable intelligent surfaces (RISs). The entire system is described by using a circuit-based model for the transmitters, receivers, and
RISs. This is obtained by leveraging the electromagnetic tool of mutual impedances, which accounts for the signal propagation and the mutual coupling among closely-spaced scattering elements. An iterative and provably convergent optimization algorithm that maximizes the sum-rate of RIS-assisted multi-user interference channels is introduced. Numerical results show that the sum-rate is enhanced if the mutual coupling among the elements of the RISs is accounted for at the optimization stage.
In this paper, we deal with the performance analysis of full-duplex relaying in decode-&-forward cooperative networks with multiple-antenna terminals. More specifically, by analyzing the end-to-end statistics, we derive the accurate closed-form expre
ssions of the end-to-end outage probability for both transmit and receive ZFBF scheme over Rayleigh fading environments. Some selected results show some interesting observations useful for system designers. Specifically, we observe that the outage performance can be improved by adopting the joint ZF-based precoding with different antenna configurations.
MIMO interference network optimization is important for increasingly crowded wireless communication networks. We provide a new algorithm, named Dual Link algorithm, for the classic problem of weighted sum-rate maximization for MIMO multiaccess channe
ls (MAC), broadcast channels (BC), and general MIMO interference channels with Gaussian input and a total power constraint. For MIMO MAC/BC, the algorithm finds optimal signals to achieve the capacity region boundary. For interference channels with Gaussian input assumption, two of the previous state-of-the-art algorithms are the WMMSE algorithm and the polite water-filling (PWF) algorithm. The WMMSE algorithm is provably convergent, while the PWF algorithm takes the advantage of the optimal transmit signal structure and converges the fastest in most situations but is not guaranteed to converge in all situations. It is highly desirable to design an algorithm that has the advantages of both algorithms. The dual link algorithm is such an algorithm. Its fast and guaranteed convergence is important to distributed implementation and time varying channels. In addition, the technique and a scaling invariance property used in the convergence proof may find applications in other non-convex problems in communication networks.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
