Abstract
Recently, a multiple symbol differential sphere decoding (MSDSD) algorithm for unitary space-time modulation over quasi-static channel has been proved to achieve the performance of maximum-likelihood (ML) detection with relatively low complexity. However, an error floor occurs if the algorithm is applied to rapid-fading channels. Based on the assumption of continuous fading, a multiple symbol differential approximate automatic sphere decoding (MSDAASD) algorithm is developed by incorporating a recursive form of an approximate ML metric into automatic sphere decoding. The proposed algorithm is suitable for arbitrary unitary constellations and eliminates the error floor in MSDSD. Compared with decision-feedback detection under the same assumption, MSDAASD achieves similar performance to ML detection with much lower complexity at moderate to high signal-to-noise ratios
Sign-in/Register to access full text options 
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.
