A Monte-Carlo Implementation of the SAGE Algorithm for Joint Soft Multiuser and Channel Parameter Estimation

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

5 pages, 3 figures, 10th IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) 2009

Scientific paper

An efficient, joint transmission delay and channel parameter estimation algorithm is proposed for uplink asynchronous direct-sequence code-division multiple access (DS-CDMA) systems based on the space-alternating generalized expectation maximization (SAGE) framework. The marginal likelihood of the unknown parameters, averaged over the data sequence, as well as the expectation and maximization steps of the SAGE algorithm are derived analytically. To implement the proposed algorithm, a Markov Chain Monte Carlo (MCMC) technique, called Gibbs sampling, is employed to compute the {\em a posteriori} probabilities of data symbols in a computationally efficient way. Computer simulations show that the proposed algorithm has excellent estimation performance. This so-called MCMC-SAGE receiver is guaranteed to converge in likelihood.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Monte-Carlo Implementation of the SAGE Algorithm for Joint Soft Multiuser and Channel Parameter Estimation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Monte-Carlo Implementation of the SAGE Algorithm for Joint Soft Multiuser and Channel Parameter Estimation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Monte-Carlo Implementation of the SAGE Algorithm for Joint Soft Multiuser and Channel Parameter Estimation will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-13535

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.