Adaptive filter theory (3rd ed.)
Adaptive filter theory (3rd ed.)
Multiuser Detection
Statistical Digital Signal Processing and Modeling
Statistical Digital Signal Processing and Modeling
Joint estimation and decoding of space-time Trellis codes
EURASIP Journal on Applied Signal Processing - Space-time coding and its applications - part I
A blind particle filtering detector of signals transmitted over flat fading channels
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
Blind multiuser detection: a subspace approach
IEEE Transactions on Information Theory
Adaptive joint detection and decoding in flat-fading channels via mixture Kalman filtering
IEEE Transactions on Information Theory
The Kalman filter as the optimal linear minimum mean-squared error multiuser CDMA detector
IEEE Transactions on Information Theory
Noncoherent multiuser detection for nonlinear modulation over the Rayleigh-fading channel
IEEE Transactions on Information Theory
Blind adaptive multiuser detection
IEEE Transactions on Information Theory
An asynchronous multiuser CDMA detector based on the Kalman filter
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
A particle filter for frequency synchronization in MIMO-OFDM systems
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Iterative decoding in Factor Graph representation using Particle Filtering
Digital Signal Processing
Hi-index | 0.00 |
We propose a method for blind multiuser detection (MUD) in synchronous systems over flat and fast Rayleigh fading channels. We adopt an autoregressive-moving-average (ARMA) process to model the temporal correlation of the channels. Based on the ARMA process, we propose a novel time-observation state-space model (TOSSM) that describes the dynamics of the addressed multiuser system. The TOSSM allows an MUD with natural blending of low-complexity particle filtering (PF) and mixture Kalman filtering (for channel estimation). We further propose to use a more efficient PF algorithm known as the stochastic M -algorithm (SMA), which, although having lower complexity than the generic PF implementation, maintains comparable performance.