In this paper, we propose a minimum-meansquared-error (MMSE)-based lattice-reduction (LR)-Aided fixedcomplexity sphere decoder (FSD) for low-complexity nearmaximum-likelihood (near-ML) multiple-input multiple-output (MIMO) detection. In order for the FSD to achieve optimal performance, the number of full expansion (FE) stages should be sufficient, which is the major cause of the increase in the computational complexity when either a large signal constellation or a large number of antennas are adopted. However, the proposed algorithm maintains the near-ML performance with the aid of the MMSE-based LR algorithm while reducing the number of FE stages. Although there exists the increase in the computational complexity for the application of the additional processing elements, the decrease in the number of FE stages results in the lower computational complexity of the overall algorithm. The numerical analysis demonstrates that there is a considerable decrease in the computational complexity while the performance degradation is negligible, compared to the optimal FSD.
|Title of host publication||2015 IEEE 21st International Workshop on Local and Metropolitan Area Networks, LANMAN 2015|
|Publisher||IEEE Computer Society|
|Publication status||Published - 2015 May 28|
|Event||21st IEEE International Workshop on Local and Metropolitan Area Networks, LANMAN 2015 - Tsinghua, Beijing, China|
Duration: 2015 Apr 22 → 2015 Apr 24
|Name||IEEE Workshop on Local and Metropolitan Area Networks|
|Other||21st IEEE International Workshop on Local and Metropolitan Area Networks, LANMAN 2015|
|Period||15/4/22 → 15/4/24|
Bibliographical notePublisher Copyright:
© 2015 IEEE.
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Electrical and Electronic Engineering