Modified ordered successive interference cancellation MIMO detection using low complexity constellation search

Abstract

High spectral efficiency, large capacity, and high data rate make large-scale Multiple-Input Multiple-Output (MIMO) systems more prominent in 5G communication. Existing MIMO detection schemes like Maximum Likelihood (ML) achieves optimal performance, but it is significantly affected by exponentially increasing computational complexity. On the other hand, linear MIMO detection techniques have low complexity. However, these cannot be implemented in practical systems due to poor performance. Ordered Successive Interference Cancellation (OSIC) addresses these issues as it possesses intermediate and suboptimal performance but it faces erroneous symbols due to wrong selection of order. At first, OSIC K-correction algorithm is employed to resolve OSIC issues by replacing the user-defined K symbols in the search subspace of OSIC symbol vector and detects the symbol in terms of better likelihood metric. In addition, it proposes Reduced Complexity (RC) OSIC K-correction scheme that further reduces the computational complexity in OSIC K-correction by exploiting the deviation vector which focuses to opt and detect only the most erroneous symbols. The proposed algorithms offer an adequate trade-off between computational complexity and detection performance.