Low-complexity receivers for multiuser detection with an unknown number of active users

DOI10.1016/J.SIGPRO.2009.10.019zbMATH Open1194.94052OpenAlexW2110079143WikidataQ63961416 ScholiaQ63961416MaRDI QIDQ985473FDOQ985473

Authors Daniele Angelosante, Ezio Biglieri, Marco Lops

Publication date 6 August 2010

Published in Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0704.3241

zbMATH Keywords

multiuser detectionBayesian recursionsrandom-set theorysphere detection

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: We examine the problem of determining which nodes are neighbors of a given one in a wireless network. We consider an unsupervised network operating on a frequency-flat Gaussian channel, where $K+1$ nodes associate their identities to nonorthogonal signatures, transmitted at random times, synchronously, and independently. A number of neighbor-discovery algorithms, based on different optimization criteria, are introduced and analyzed. Numerical results show how reduced-complexity algorithms can achieve a satisfactory performance.

Recommendations

• A Bayesian framework for the development of suboptimal blind multiuser detectors for DS/CDMA signals in synchronous channels
• Random-set theory and wireless communications
• Adaptive blind multiuser detection over flat fast fading channels using particle filtering
• Linear Multiuser Detectors for Incompletely Known Symmetric Signals in CDMA Systems
• Blind adaptive multiuser detection

Cites work

• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 1232106 (Why is no real title available?)
• Closest point search in lattices
• Curse-of-dimensionality revisited: Collapse of the particle filter in very large scale systems
• Multiuser Detection in a Dynamic Environment– Part I: User Identification and Data Detection
• On maximum-likelihood detection and the search for the closest lattice point
• On the sphere-decoding algorithm I. Expected complexity
• Online activity detection in a multiuser environment using the matrix CUSUM algorithm
• Sequential Estimation of Multipath MIMO-OFDM Channels
• Statistical multisource-multitarget information fusion.
• Tracking an unknown time-varying number of speakers using TDOA measurements: a random finite set approach

Cited in

(1)

• Random-set theory and wireless communications

This page was built for publication: Low-complexity receivers for multiuser detection with an unknown number of active users

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985473)