A Class of Adaptive Cyclostationary Beamforming Algorithms

Abstract

One of the main benefits of the cyclostationary beamforming algorithms is their ability to extract signals from co-channel interference with only a knowledge of the cycle frequency. In this paper, we study the popular cyclostationary beamformers, and propose five new algorithms, namely, the adaptive cyclic adaptive beamforming (ACAB), adaptive cross-SCORE (ACS), constrained least-squares (CLS), adaptive phase-SCORE (APS), and maximal constrained autocorrelation (MCA) algorithms. All these algorithms are adaptive and have a computational complexity of O(n 2 ) complex multiplications, where n is the number of array elements. A comparative study of these algorithms is made based on numerical simulations. Each of these algorithms has specific application scenarios. The ACS and the APS algorithms are particularly suited for very adverse signal environments. The ACAB, MCA and cyclic adaptive beamforming (CAB, from the work of Wu and Wong) algorithms can pro- vide good performance in the case of medium or weak interference, while the CLS algorithm is especially suitable for weak interference. The CAB algorithm is shown to be a special case of the least-square self-coherent restoral (LS-SCORE) algorithm. Some insights as to how one can assign carrier frequency and symbol rate during digital modulation are also suggested. The proposed adaptive algorithms are easy to implement, and thus are very promising for applications in wireless and mobile communications.