Abstract
Blind source separation (BSS) is the process of separating the original signals from their mixtures without the knowledge of neither the signals nor the mixing process. In this paper, a Bayesian modeling approach for the separation of instantaneous mixture of linear modulation signals with memory in communication systems is developed, in which the finite alphabet (FA) property of the source signals, together with the correlation contained in the source signals are used for the purpose of accurate signal separation. And the Gibbs sampling algorithm is employed to estimate discrete source signals and mixing coefficients. Moreover, the approach takes into account noise levels in the model in order to provide precise estimations of the signals. The simulation results under determined mixture condition show that this new algorithm gives precise estimation of sources and coefficients of mixture. Furthermore, the efficiency of this proposed approach under underdetermined mixture condition is attested by a numerical simulation experiment.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cavalcante, C.C., Romano, J.M.T.: Multi-user pdf estimation based criteria for adaptive blind separation of discrete sources. Signal Processing 85, 1059–1072 (2005)
Cardoso, J.F., Laheld, B.H.: Equivariant adaptive source separation. IEEE Trans. Signal Process. 40(12), 3017–3030 (1996)
Belouchrani, A., Cardoso, J.F.: Maximum likelihood source separation for discrete sources. In: EUSIPCO 1994, Edinburgh, Scotland, pp. 768–771. Elsevier, Amsterdam (1994)
Routtenberg, T., Tabrikian, J.: Blind MIMO-AR System Identification and Source Separation with Finite-Alphabet. IEEE Trans. Signal Process. 58(3) (2010)
Bilmes, J.A.: A Gentle Tutorial of the EM Algorithm and its Application to Parameter Estimation for Gaussian Mixture and Hidden Markov Models. International Computer Science Institute, Berkeley, CA, Tech. Rep. TR-97-021 (1998)
Rowe, D.B.: A Bayesian Approach to Blind Source Separation. J. Interdis. Math. 5(1), 49–76 (2002)
Casella, G., George, E.I.: Explaining the Gibbs Sampler. The American Statistician 46(3), 167–174 (2003)
Grellier, O., Comon, P.: Blind separation of discrete sources. IEEE Signal Process. Lett. 5(8), 212–214 (1998)
Sénécal, S., Amblard, P.-O.: Bayesian separation of discrete sources via Gibbs sampling. In: International Workshop on Independent Component Analysis and Blind Source Separation, Helsinki, Finland, pp. 566–572 (2000)
Chen, R., Li, T.-H.: Blind Restoration of Linearly Degraded Discrete Signals by Gibbs Sampling. IEEE Trans. on Signal Process. 43(10), 2410–2413 (1995)
Proakis, J.G.: Digital Communications, 4th edn. House of Electronics Industry, Beijing (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, H., Gu, F., Xiao, Y. (2011). A Bayesian Approach to Blind Separation of Mixed Discrete Sources by Gibbs Sampling. In: Hsu, CH., Yang, L.T., Ma, J., Zhu, C. (eds) Ubiquitous Intelligence and Computing. UIC 2011. Lecture Notes in Computer Science, vol 6905. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23641-9_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-23641-9_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23640-2
Online ISBN: 978-3-642-23641-9
eBook Packages: Computer ScienceComputer Science (R0)