Name
Abstract | ||
|---|---|---|
We consider the problem of blind adaptive signal separation with an antenna array, based on the constant modulus (CM) criterion. An approximation to the CM cost function is proposed, which allows the use of the recursive least squares (RLS) optimization technique. A novel RLS constant modulus algorithm (RLS-CMA) is derived, where the modulus power of the array output can take on arbitrary positive real values (i.e., fractional values allowed). Simulations are performed to compare the performance of the proposed RLS-CMA to other well-known algorithms for blind adaptive beamforming. Results indicate that the RLS-CMA has a significantly faster convergence rate and better tracking ability. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/TSP.2004.826167 | IEEE Transactions on Signal Processing |
Keywords | Field | DocType |
blind adaptive array,blind adaptive beamforming,constant modulus algorithm,cm cost function,blind adaptive signal separation,constant modulus,novel rls,antenna array,array output,proposed rls-cma,squares constant modulus algorithm,modulus power,least squares approximation,blind source separation,cost function,adaptive beamforming,convergence,wireless communication,convergence rate,adaptive signal processing | Least squares,Mathematical optimization,Adaptive beamformer,Antenna array,Algorithm,Adaptive filter,Rate of convergence,Adaptive algorithm,Blind signal separation,Recursive least squares filter,Mathematics | Journal |
Volume | Issue | ISSN |
52 | 5 | 1053-587X |
Citations | PageRank | References |
40 | 2.14 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuxin Chen | 1 | 40 | 2.14 |
| Tho Le-Ngoc | 2 | 2210 | 237.14 |
| B. Champagne | 3 | 52 | 3.43 |
| Changjiang Xu | 4 | 120 | 8.33 |