Abstract
The multiple symbol differential detection (MSDD) can narrow the 3 dB gap between differential detection and coherent detection, but its complexity grows exponentially with the blocksize and also with the number of transmit antennas and the data rate. Since the current low-complexity MSDD detection still have the problems such as high complexity, difficult to parallel processing and random latency etc, this study proposes a new algorithm called M-bound intersection detector (M-BID) which derived from the BID incorporated with the M algorithm. A new bounding approach and a simplified BID combining with the M algorithm are presented in M-BID to reduce the computational complexity and obtain a relative stable latency. The numerical and simulation results show that the proposed M-BID algorithm achieves an overall better performance-complexity trade-off over the M algorithm and the BID. Moreover, it possesses the advantages of parallel processing and stable latency which are facilitated for hardware implementation.
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.
