The problem of jointly estimating the number, the identities, and the data of active users in a time-varying multiuser environment was examined in a companion paper (IEEE Trans. Information Theory, vol. 53, no. 9, September 2007), at whose core was the use of the theory of finite random sets on countable spaces. Here we extend that theory to encompass the more general problem of estimating unknown continuous parameters of the active-user signals. This problem is solved here by applying the theory of random finite sets constructed on hybrid spaces. We do so deriving Bayesian recursions that describe the evolution with time of a posteriori densities of the unknown parameters and data. Unlike in the above cited paper, wherein one could evaluat...
Gibbs sampler, a typical Markov chain Monte Carlo (MCMC) method that approximately solves the Bayesi...
Comunicació presentada en la 16th European Signal Processing Conference (EUSIPCO 2008), celebrada el...
New communication standards need to deal with machine-to-machine communications, in which users may ...
The problem of jointly estimating the number, the identities, and the data of active users in a time...
The problem of jointly estimating the number, the identities, and the data of active users in a time...
Abstract—In random-access communication systems, the number of active users varies with time, and ha...
In multiuser detection, the set of users active at any time may be unknown to the receiver. In these...
Markov chain Monte Carlo (MCMC) methods are considered as the powerful techniques for Bayesian compu...
We present an adaptive algorithm based on the theory of hidden Markov models (HMM) which is capable ...
In this paper, two probabilistic adaptive algorithms for jointly detecting active users in a DS-CDMA...
This paper investigates the use of computational Bayesian methods for multiuser detection (MUD) of s...
In this paper, we develop novel Bayesian detection methods that are applicable to both synchronous c...
Abstract—In this paper, two probabilistic adaptive algorithms for jointly detecting active users in ...
Optimum multiuser detection (MUD) with an unknown number of active users requires simultaneous estim...
In this paper, two probabilistic adaptive algorithms for jointly detecting active users in a DS-CDMA...
Gibbs sampler, a typical Markov chain Monte Carlo (MCMC) method that approximately solves the Bayesi...
Comunicació presentada en la 16th European Signal Processing Conference (EUSIPCO 2008), celebrada el...
New communication standards need to deal with machine-to-machine communications, in which users may ...
The problem of jointly estimating the number, the identities, and the data of active users in a time...
The problem of jointly estimating the number, the identities, and the data of active users in a time...
Abstract—In random-access communication systems, the number of active users varies with time, and ha...
In multiuser detection, the set of users active at any time may be unknown to the receiver. In these...
Markov chain Monte Carlo (MCMC) methods are considered as the powerful techniques for Bayesian compu...
We present an adaptive algorithm based on the theory of hidden Markov models (HMM) which is capable ...
In this paper, two probabilistic adaptive algorithms for jointly detecting active users in a DS-CDMA...
This paper investigates the use of computational Bayesian methods for multiuser detection (MUD) of s...
In this paper, we develop novel Bayesian detection methods that are applicable to both synchronous c...
Abstract—In this paper, two probabilistic adaptive algorithms for jointly detecting active users in ...
Optimum multiuser detection (MUD) with an unknown number of active users requires simultaneous estim...
In this paper, two probabilistic adaptive algorithms for jointly detecting active users in a DS-CDMA...
Gibbs sampler, a typical Markov chain Monte Carlo (MCMC) method that approximately solves the Bayesi...
Comunicació presentada en la 16th European Signal Processing Conference (EUSIPCO 2008), celebrada el...
New communication standards need to deal with machine-to-machine communications, in which users may ...