Abstract
AbstractMultiple-Input Multiple-Output Orthogonal Frequency Division Multiplexing (MIMO-OFDM) system is a promising solution to fulfill the demand of high-speed transmission rate and high quality of service for future Underwater Acoustic (UWA) communication. However, Multi-Access Interference (MAI) due to the interference from co-channel users at the receiver of MIMO-OFDM is considered as main source limiting the system capacity. Therefore, Multiuser Detection (MUD) technique is needed to suppress the effect of MAI at the receiver of the MIMO-OFDM system. In this research, MUD is achieved using the global and local optimal solution of binary spotted hyena optimizer (BSHO) multiuser detector algorithm in an underwater environment. The transceiver model of the MIMO-OFDM system in underwater is implemented using World Ocean Simulation System (WOSS). The bit error rate (BER) performance of the proposed BSHO multiuser detector algorithm is analyzed using MATLAB simulation and also compared with conventional detectors and with metaheuristic approach such as binary particle swarm optimization (BPSO) in the UWA network. The proposed BSHO metaheuristic algorithm outperforms in BER analysis, which results in the best optimal solution toward MUD over existing detectors and the existing metaheuristic approach in the UWA network.KeywordsUnderwater acoustic (UWA)Multiple-Input Multiple-Output (MIMO)Orthogonal frequency division multiplexing (OFDM)Binary spotted hyena optimizer (BSHO)Multiuser detection (MUD)Multi-Access interference (MAI)
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.