Compressive sensing based multiuser detector for massive MBM MIMO uplink

Media based modulation(MBM)is expected to be a prominent modulation scheme,which has access to the high data rate by using radio frequency(RF)mirrors and fewer transmit antennas.Associated with multiuser multiple input multiple output(MIMO),the MBM scheme achieves better performance than other conventional multiuser MIMO schemes.In this paper,the massive MIMO uplink is considered and a conjunctive MBM transmission scheme for each user is employed.This conjunctive MBM transmission scheme gathers aggregate MBM signals in multiple continuous time slots,which exploits the structured sparsity of these aggregate MBM signals.Under this kind of scenario,a multiuser detector with low complexity based on the compressive sensing(CS)theory to gain better detection performance is proposed.This detector is developed from the greedy sparse recovery technique compressive sampling matching pursuit(CoSaMP)and exploits not only the inherently distributed sparsity of MBM signals but also the structured sparsity of multiple aggregate MBM signals.By exploiting these sparsity,the proposed CoSaMP based multiuser detector achieves reliable detection with low complexity.Simulation results demonstrate that the proposed CoSaMP based multiuser detector achieves better detection performance compared with the conventional methods.

Multiuser detector based on wavelet networks

Multiple access interference (MAI) and near-far problem are two major obstacles in DS-CDMA systems. Combining wavelet neural networks and two matched filters, the novel multiuser detector, which is based on multiple variable function estimation wavelet networks over single path asynchronous channel and space-time channel respectively is presented. Excellent localization characteristics of wavelet functions in both time and frequency domains allowed hierarchical multiple resolution learning of input-output data mapping. The ma thematic frame of the neural networks and error back ward propagation algorithm are introduced. The complexity of the multiuser detector only depends on that of wavelet networks. With numerical simulations and performance analysis, it indicates that the multiuser detector has excellent performance in eliminating MAI and near-far resistance.

A Novel Stochastic Blind Adaptive Multiuser Detector for CDMA Systems

Blind adaptive multiuser detector has become a research hotspot in recent years due to a number of advantages, but many blind adaptive algorithms involve low convergence rate. This paper presents a novel stochastic blind adaptive multiuser detector without requiring training sequences, which needs only two system parameters: the signature sequence of the desired user i, s i and the variance of the additive white Gaussian noise (AWGN),σ 2. Simulation results show that by reasonably choosing time varying step size, the proposed detector can not only improve the convergence rate, but also reduce the limiting NSE (Normalized Squared Error) values, so it can effectively increase the performance of the system.

JOINT SPACE-FREQUENCY MULTIUSER SYMBOL DETECTOR FOR MC-CDMA SYSTEM WITH UNIFORM LINEAR ARRAY

The MultiCarrier Code Division Multiple Access (MC-CDMA) scheme is promising for relieving capacity limit problems of Direct Sequence (DS-) CDMA systems due to serious InterChip Interference (ICI) and MultiUser Interference (MUI) in high-data-rate wireless communication systems. In this paper, the Uniform Linear Array (ULA) is applied to the base station of macrocellular MC-CDMA systems in a frequency-selective fading channel environment. A joint space-frequency multiuser symbol sequence detector is developed for all active users within one macrocell without space-frequency channel estimation. Simultaneously, Directions-Of-Arrivals (DOAs) of all active users can also be estimated. By dividing the ULA into two identical overlapping subarrays, a specific auxiliary matrix is constructed, which includes both symbol sequence and DOA information of all active users. Then, based on the subspace method, performing the eigen decomposition on such auxiliary matrix, the closed-form solution of symbol sequences and DOAs for all active users can be obtained. In comparison with schemes based on channel estimation, our algorithm need not explicitly estimate the space-frequency channel for each active user,so it has lower computation complexity. Extensive computer simulations demonstrate the overall performance of this novel scheme.

New blind adaptive approach to multiuser detection in CDMA systems

Due to a number of advantages, blind adaptive multiuser detector has become a research hotspot in recent years. But low convergence rate problem occurs to many blind adaptive algorithms. A new blind adaptive approach to multiuser detection is presented. The simulation results show that by reasonably choosing time varying step size, the proposed detector can not only improve the convergence rate, but also reduce the bit error rate (BER) of the system, and so it can effectively improve the system performance with less computational cost.

IDMA based MAI mitigation scheme with low complexity and low latency

High complexity and high latency are key problems for multiuser detection （MUD） to be applied to a mobile station in cellular networks. To tackle these problems, an interleave division multiple access （IDMA） based multiple access scheme, grouped spread IDMA （GSIDMA）, is proposed. In a GSIDMA system, lower complexity and latency for mobile stations can be achieved by appropriately dividing active users into different groups. The system model of GSIDMA is constructed and followed by analysing on its system capacity, complexity and latency, and bit error rate （BER） performance. The extrinsic information transfer （EXIT） chart is used to analyze the convergence behavior of the iteration process. The grouping method and interleavers-reuse issue for GSIDMA are also discussed preliminarily. The analyses and simulation results indicate that the complexity and latency of the proposed scheme are much lower than those of IDMA, whereas its BER performance is close to the latter. The properties of low complexity and low latency make it more feasible for the practical implementation.