Abstract
SDMA (Space-Division Multiple Access) is a MIMO (Multiple-Input and Multiple-Output) based wireless communication network architecture which has the potential to significantly increase the spectral efficiency and system performance. So far several multiuser detection (MUD) schemes like Zero Forcing (ZF), Minimum Mean Square Error estimation (MMSE), ordered successive interference cancellation (OSIC) and maximum likelihood (ML) detection have been proposed by various researchers. Among them, maximum likelihood (ML) detection scheme provides the minimum bit error rate (BER). However, the complexity of ML detection increases exponentially with the constellation size of modulation and number of users. The M-algorithm combined with QR decomposition (QRD-M) can be substitute to ML detection due its low complexity and it's near optimal performance. In this paper the complexity of QRD-M scheme is compared with ML by means of number of foundational operations and the elapsed time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
