Low dimensional multiuser detection exploiting low user activity

In this paper, we propose new multiuser detectors (MUDs) based on compressed sensing approaches for the large-scale multiple antenna systems equipped with dozens of low-power antennas. We consider the scenarios where the number of receiver antennas is smaller than the total number of users, but the number of active users is relatively small. This prior information motivates sparsity-embracing MUDs such as sparsity-embracing linear/nonlinear MUDs where the detection of active users and their symbol detection are employed. In addition, sparsity-embracing MUDs with maximum a posteriori probability criterion (MAP-MUDs) are presented. They jointly detect active users and their symbols by exploiting the probability of user activity, and it can be solved efficiently by introducing convex relaxing senses. Furthermore, it is shown that sparsity-embracing MUDs exploiting common users' activity across multiple symbols, i.e., frame-by-frame, can be considered to improve performance. Also, in multiple multiple-input and multiple-output networks with aggressive frequency reuse, we propose the interference cancellation strategy for the proposed sparsity-embracing MUDs. That first cancels out the interference induced by adjacent networks and then recovers the desired users' information by exploiting the low user activity. In simulation studies for binary phase shift keying modulation, numerical evidences establish the effectiveness of our proposed MUDs exploiting low user activity, as compared with the conventional MUD.