Abstract
SummaryMulti‐user multiple‐input multiple‐output (MU‐MIMO) system has the capability of delivering optimal system capacity that provides the simultaneous service to a large number of users using dirty paper coding (DPC) scheme. However, the DPC scheme is quite difficult to be implemented in the real‐time scenario as the computational complexity is very high and the process cannot be accomplished within the duration of few coherence periods. In this paper, we have adopted a newly developed binary spider monkey optimization (binary SMO) algorithm for the joint user and antenna scheduling (JUAS) problem to maximize the achievable system sum‐rate performance. It has been shown that JUAS with binary SMO achieves nearly 99% of system throughput achieved by the extensive search algorithm (ESA) using DPC. Also it is compared with binary flower pollination algorithm (binary FPA) to check which of the two gives better result. It is observed that the binary SMO in JUAS achieves a globally optimal solution quite rapidly, to remain well within the modern‐day packet data communication interval. The proposed binary SMO shows low computational complexity and computation time as compared to ESA (i.e., DPC). Also when it is compared with binary FPA, it shows quite a significant improvement in system throughput. Moreover, the effectiveness of binary SMO in the MU‐MIMO broadcasting scenario is verified through extensive simulation results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.