Reduced-Dimension Multiuser Detection
From MaRDI portal
Publication:2989211
DOI10.1109/TIT.2013.2248873zbMATH Open1364.94192arXiv1109.6303OpenAlexW2568274150MaRDI QIDQ2989211FDOQ2989211
Authors: Yao Xie, Y. C. Eldar, Andrea J. Goldsmith 
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: We present a reduced-dimension multiuser detector (RD-MUD) structure for synchronous systems that significantly decreases the number of required correlation branches at the receiver front-end, while still achieving performance similar to that of the conventional matched-filter (MF) bank. RD-MUD exploits the fact that, in some wireless systems, the number of active users may be small relative to the total number of users in the system. Hence, the ideas of analog compressed sensing may be used to reduce the number of correlators. The correlating signals used by each correlator are chosen as an appropriate linear combination of the users' spreading waveforms. We derive the probability-of-symbol-error when using two methods for recovery of active users and their transmitted symbols: the reduced-dimension decorrelating (RDD) detector, which combines subspace projection and thresholding to determine active users and sign detection for data recovery, and the reduced-dimension decision-feedback (RDDF) detector, which combines decision-feedback matching pursuit for active user detection and sign detection for data recovery. We derive probability of error bounds for both detectors, and show that the number of correlators needed to achieve a small probability-of-symbol-error is on the order of the logarithm of the number of users in the system. The theoretical performance results are validated via numerical simulations.
Full work available at URL: https://arxiv.org/abs/1109.6303
Cited In (1)
This page was built for publication: Reduced-Dimension Multiuser Detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989211)
