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

DOI10.1016/j.sigpro.2009.10.019zbMath1194.94052arXiv0704.3241OpenAlexW2110079143WikidataQ63961416 ScholiaQ63961416MaRDI QIDQ985473

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On maximum-likelihood detection and the search for the closest lattice point
• Multiuser Detection in a Dynamic Environment– Part I: User Identification and Data Detection
• Curse-of-dimensionality revisited: Collapse of the particle filter in very large scale systems
• Online activity detection in a multiuser environment using the matrix CUSUM algorithm
• Sequential Estimation of Multipath MIMO-OFDM Channels
• Tracking an unknown time-varying number of speakers using TDOA measurements: a random finite set approach
• Closest point search in lattices
• On the sphere-decoding algorithm I. Expected complexity

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