Abstract

The constant modulus property of communication signals, such as FM and phase-modulated signals, are often used in blind separation of multiple users. Because there is no training sequence needed, the system transmission efficiency is increased. However the CMA suffers from the complex iteration computation and local minimums. The analytical constant modulus algorithm (ACMA) replaces the problem of finding the weight vector blindly with the equivalent problem of blind source separation in signal subspace. Via joint diagonalization of matrices, each user's signal can be obtained analytically. Expanding the ACMA of space domain beamforming to space-time domain can improve the performance of blind signal separation of the system. The computation complexity of ST-ACMA is only related to the amount of constant modulus sources. Its performance is similar to ST-CMA algorithm, but it has less computation than ST-CMA and the faster convergence rate. Finally, numerical simulations can illustrate the effectiveness of this algorithm.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.