Discrete Sum Rate Maximization for MISO Interference Broadcast Channels: Convex Approximations and Efficient Algorithms
From MaRDI portal
Publication:4620882
DOI10.1109/TSP.2016.2563400zbMATH Open1414.90274OpenAlexW2345892722MaRDI QIDQ4620882
Author name not available (Why is that?)
Publication date: 8 February 2019
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tsp.2016.2563400
Related Items (3)
Distributed Asynchronous Optimization Framework for the MISO Interference Channel โฎ Decentralized Sum Rate Maximization With QoS Constraints for Interfering Broadcast Channel Via Successive Convex Approximation โฎ On the Achievable Sum Rate for MIMO Interference Channels
Recommendations
- Capacity Bounds and Sum Rate Capacities of a Class of Discrete Memoryless Interference Channels ๐ ๐
- On the Achievable Sum Rate for MIMO Interference Channels ๐ ๐
- On the Sum-Rate Capacity of Poisson MISO Multiple Access Channels ๐ ๐
- An Iteratively Weighted MMSE Approach to Distributed Sum-Utility Maximization for a MIMO Interfering Broadcast Channel ๐ ๐
- Maximizing Sum Rate and Minimizing MSE on Multiuser Downlink: Optimality, Fast Algorithms and Equivalence via Max-min SINR ๐ ๐
- Sum-Rate Maximization in the Multicell MIMO Broadcast Channel With Interference Coordination ๐ ๐
- Decentralized Sum Rate Maximization With QoS Constraints for Interfering Broadcast Channel Via Successive Convex Approximation ๐ ๐
- Optimal Transmit Strategy for MISO Channels With Joint Sum and Per-Antenna Power Constraints ๐ ๐
- On the Maximum Achievable Sum-Rate With Successive Decoding in Interference Channels ๐ ๐
This page was built for publication: Discrete Sum Rate Maximization for MISO Interference Broadcast Channels: Convex Approximations and Efficient Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4620882)