Blind source separation of instantaneous MIMO systems based on the least-squares Constant Modulus Algorithm

2005 ◽  
Vol 152 (5) ◽  
pp. 616 ◽  
Author(s):  
P. Sansrimahachai ◽  
D.B. Ward ◽  
A.G. Constantinides
Keyword(s):  
Least Squares ◽  
Blind Source Separation ◽  
Mimo Systems ◽  
Source Separation ◽  
Constant Modulus ◽  
Constant Modulus Algorithm

scholarly journals Antisparsity as a Prior in Blind Separation of Correlated Sources

2021 ◽  
Author(s):  
Renan Brotto ◽  
Kenji Nose-Filho ◽  
João M. T. Romano
Keyword(s):  
Wireless Communication ◽  
Blind Source Separation ◽  
Source Separation ◽  
Constant Modulus ◽  
Blind Separation ◽  
Constant Modulus Algorithm ◽  
Computational Simulations ◽  
Correlated Sources ◽  
Simulation Results ◽  
Binary Sources

<div>This letter introduces the concept of antisparse Blind Source Separation (BSS), proposing a suitable criterion based on the $\ell_\infty$ norm to explore the antisparsity feature. </div><div>The effectiveness of the criterion is theoretically demonstrated and it is also evaluated by computational simulations, which consider up to ten distinct sources with different correlation levels. Moreover, we simulated a scenario in wireless communication with binary sources, comparing our approach to the Constant Modulus algorithm. Both the theoretical and the simulation results highlight the potentiality of using antisparsity as a prior in BSS.</div>

scholarly journals Antisparsity as a Prior in Blind Separation of Correlated Sources

2021 ◽  
Author(s):  
Renan Brotto ◽  
Kenji Nose-Filho ◽  
João M. T. Romano
Keyword(s):  
Wireless Communication ◽  
Blind Source Separation ◽  
Source Separation ◽  
Constant Modulus ◽  
Blind Separation ◽  
Constant Modulus Algorithm ◽  
Computational Simulations ◽  
Correlated Sources ◽  
Simulation Results ◽  
Binary Sources

<div>This letter introduces the concept of antisparse Blind Source Separation (BSS), proposing a suitable criterion based on the $\ell_\infty$ norm to explore the antisparsity feature. </div><div>The effectiveness of the criterion is theoretically demonstrated and it is also evaluated by computational simulations, which consider up to ten distinct sources with different correlation levels. Moreover, we simulated a scenario in wireless communication with binary sources, comparing our approach to the Constant Modulus algorithm. Both the theoretical and the simulation results highlight the potentiality of using antisparsity as a prior in BSS.</div>

Sign in / Sign up

Export Citation Format

Share Document