“…Centralized and distributed algorithms for sum-power minimization under minimum SINR constrains were also proposed in [19] and [18]. Other works, such as [20], [21], have focused on the sum-energy efficiency maximization problem, that consists in minimizing the energy consumption per transmitted bit. The weighted sum-rate maximization problem with QoS guarantees was considered in [22]- [24].…”
Section: Trafficmentioning
confidence: 99%
“…Thus, only local CSI is required to be available at the BSs and users. The proposed precoded pilot scheme is required for the update of the receive beamforming matrices from (10) at the user side and transmit beamforming matrices from (20) at the BSs, where both (10) and (20) require some knowledge about interfering CSI.…”
Section: B Signaling Aspectsmentioning
confidence: 99%
“…where Q π π’ = π π=1 H H π π’ ,π,π W π,π π½ π,π W H π,π H π π’ ,π,π and π π π’ is the dual variable associated to the power budget constraints of (17). From (20) we can observe that {π½ π’,π } β(π’,π) act as weights of user π’ on sub-channel π. The value of π π π’ β₯ 0 should be chosen to meet the complementary slackness condition of the power budget constraints.…”
mentioning
confidence: 99%
“…The value of π π π’ β₯ 0 should be chosen to meet the complementary slackness condition of the power budget constraints. Note that if the power constraint is not active when solving (20) for π π π’ = 0, then the beamformers are optimal. Otherwise, the optimal value of π π π’ can be obtained using one dimensional search techniques (e.g., bisection method) with respect to the power budget constraints [13].…”
mentioning
confidence: 99%
“…Otherwise, the optimal value of π π π’ can be obtained using one dimensional search techniques (e.g., bisection method) with respect to the power budget constraints [13]. The high complexity due to the matrix inversion in (20) can be reduced by using an eigenvalue decomposition of Q π π’ + π π π’ I, as shown in [13], or by solving the linear system (Q π π’ + π π π’ I)M π’,π = H H π π’ ,π’,π W π’,π π½ π’,π , β(π’ β U π‘ , π). Once the current MSE values, {E π’,π } β(π’βU π‘ ,π) are computed, we update the variable r (π+1) π’,π ,π as:…”
Due to the continuous advancements of orthogonal frequency division multiplexing (OFDM) and multiple antenna techniques, multiuser multiple input multiple output (MU-MIMO) OFDM is a key enabler of both fourth and fifth generation networks. In this paper, we consider the problem of weighted sum-rate maximization under latency constraints in finite buffer multicell MU-MIMO OFDM systems.Unlike previous works, the optimization variables include the transceiver beamforming vectors, the scheduled packet size and the resources in the frequency and power domains. This problem is motivated by the observation that multicell MU-MIMO OFDM systems serve multiple quality of service classes and the system performance depends critically on both the transceiver design and the scheduling algorithm.Since this problem is non-convex, we resort to the max-plus queuing method and successive convex approximation. We propose both centralized and decentralized solutions, in which practical design aspects, such as signaling overhead, are considered. Finally, we compare the proposed framework with state-of-the-art algorithms in relevant scenarios, assuming a realistic channel model with space, frequency and time correlations. Numerical results indicate that our design provides significant gains over designs based on the wide-spread saturated buffers assumption, while also outperforming algorithms that consider a finite-buffer model.
“…Centralized and distributed algorithms for sum-power minimization under minimum SINR constrains were also proposed in [19] and [18]. Other works, such as [20], [21], have focused on the sum-energy efficiency maximization problem, that consists in minimizing the energy consumption per transmitted bit. The weighted sum-rate maximization problem with QoS guarantees was considered in [22]- [24].…”
Section: Trafficmentioning
confidence: 99%
“…Thus, only local CSI is required to be available at the BSs and users. The proposed precoded pilot scheme is required for the update of the receive beamforming matrices from (10) at the user side and transmit beamforming matrices from (20) at the BSs, where both (10) and (20) require some knowledge about interfering CSI.…”
Section: B Signaling Aspectsmentioning
confidence: 99%
“…where Q π π’ = π π=1 H H π π’ ,π,π W π,π π½ π,π W H π,π H π π’ ,π,π and π π π’ is the dual variable associated to the power budget constraints of (17). From (20) we can observe that {π½ π’,π } β(π’,π) act as weights of user π’ on sub-channel π. The value of π π π’ β₯ 0 should be chosen to meet the complementary slackness condition of the power budget constraints.…”
mentioning
confidence: 99%
“…The value of π π π’ β₯ 0 should be chosen to meet the complementary slackness condition of the power budget constraints. Note that if the power constraint is not active when solving (20) for π π π’ = 0, then the beamformers are optimal. Otherwise, the optimal value of π π π’ can be obtained using one dimensional search techniques (e.g., bisection method) with respect to the power budget constraints [13].…”
mentioning
confidence: 99%
“…Otherwise, the optimal value of π π π’ can be obtained using one dimensional search techniques (e.g., bisection method) with respect to the power budget constraints [13]. The high complexity due to the matrix inversion in (20) can be reduced by using an eigenvalue decomposition of Q π π’ + π π π’ I, as shown in [13], or by solving the linear system (Q π π’ + π π π’ I)M π’,π = H H π π’ ,π’,π W π’,π π½ π’,π , β(π’ β U π‘ , π). Once the current MSE values, {E π’,π } β(π’βU π‘ ,π) are computed, we update the variable r (π+1) π’,π ,π as:…”
Due to the continuous advancements of orthogonal frequency division multiplexing (OFDM) and multiple antenna techniques, multiuser multiple input multiple output (MU-MIMO) OFDM is a key enabler of both fourth and fifth generation networks. In this paper, we consider the problem of weighted sum-rate maximization under latency constraints in finite buffer multicell MU-MIMO OFDM systems.Unlike previous works, the optimization variables include the transceiver beamforming vectors, the scheduled packet size and the resources in the frequency and power domains. This problem is motivated by the observation that multicell MU-MIMO OFDM systems serve multiple quality of service classes and the system performance depends critically on both the transceiver design and the scheduling algorithm.Since this problem is non-convex, we resort to the max-plus queuing method and successive convex approximation. We propose both centralized and decentralized solutions, in which practical design aspects, such as signaling overhead, are considered. Finally, we compare the proposed framework with state-of-the-art algorithms in relevant scenarios, assuming a realistic channel model with space, frequency and time correlations. Numerical results indicate that our design provides significant gains over designs based on the wide-spread saturated buffers assumption, while also outperforming algorithms that consider a finite-buffer model.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citationsβcitations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.