Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers (1994)
Pacific Grove, CA, USA
Oct. 31, 1994 to Nov. 2, 1994
A.-J. Van der Veen , Dept. of Electr. Eng., Stanford Univ., Palo Alto, CA, USA
A. Paulraj , Dept. of Electr. Eng., Stanford Univ., Palo Alto, CA, USA
Iterative constant modulus algorithms have been used to blindly separate and retrieve interfering constant modulus signals impinging on an antenna array. These algorithms have several well-known but basically unsolved deficiencies. In this paper, we present an algorithm to analytically compute the solution to the underlying constant modulus (CRI) factorization problem. With this new approach, if is possible to detect the number of CM signals present in the channel, and to retrieve all of them exactly, rejecting other, non-CM signals. Only a modest amount of samples are required. The algorithm is robust in the presence of noise, and is tested on real data, collected from an experimental set-up.<
iterative methods, antenna arrays, receiving antennas, signal detection, array signal processing, equalisers, interference (signal)
A. Van der Veen and A. Paulraj, "Analytical solution to the constant modulus factorization problem," Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers(ACSSC), Pacific Grove, CA, USA, 1995, pp. 1433-1437.