The paper presents an iterative scheme for joint timing acquisition, multi-channel parameter estimation, and multiuser soft-data decoding. As an example we consider an asynchronous convolutionally coded direct-sequence code-division multiple-access system. The proposed receiver is derived within the space-alternating generalized expectation-maximization framework, implying the convergence in likelihood is guaranteed under appropriate conditions in contrast to many other iterative receiver architectures. The proposed receiver iterates between joint posterior data estimation, interference cancellation, and single-user channel estimation and timing acquisition. A Markov Chain Monte Carlo technique, namely Gibbs sampling, is employed to compute the a posteriori probabilities of data symbols in a computationally efficient way. Computer simulations in flat Rayleigh fading show that the proposed algorithm is able to handle high system loads unlike many other iterative receivers.
Kocian, A., Panayirci, E., Poor, H., Ruggieri, M. (2010). A Monte Carlo implementation of the SAGE algorithm for joint soft-multiuser decoding, channel parameter estimation, and code acquisition. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 58(11), 5756-5766 [10.1109/TSP.2010.2062181].
A Monte Carlo implementation of the SAGE algorithm for joint soft-multiuser decoding, channel parameter estimation, and code acquisition
RUGGIERI, MARINA
2010-01-01
Abstract
The paper presents an iterative scheme for joint timing acquisition, multi-channel parameter estimation, and multiuser soft-data decoding. As an example we consider an asynchronous convolutionally coded direct-sequence code-division multiple-access system. The proposed receiver is derived within the space-alternating generalized expectation-maximization framework, implying the convergence in likelihood is guaranteed under appropriate conditions in contrast to many other iterative receiver architectures. The proposed receiver iterates between joint posterior data estimation, interference cancellation, and single-user channel estimation and timing acquisition. A Markov Chain Monte Carlo technique, namely Gibbs sampling, is employed to compute the a posteriori probabilities of data symbols in a computationally efficient way. Computer simulations in flat Rayleigh fading show that the proposed algorithm is able to handle high system loads unlike many other iterative receivers.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.