Frequency domain GSC with low computational complexity

The frequency domain generalized sidelobe canceller (FLMS-GSC) removes interference signals rapidly by using the frequency domain least mean square (FLMS) algorithm. However, it, requires a lot of computational complexity. In this paper, a new realization of the frequency domain GSC, called censored-GSC (C-GSC), to reduce the computational complexity of the frequency domain GSC is proposed. During some initial times C-GSC decides weights to be updated by using the cell-averaging constant false alarm rate (CA-CFAR) algorithm. Then, the C-GSC updates only the selected weights. Simulation results show that the C-GSC removes the interference signals more rapidly than the conventional GSC without degradation of mean square error (MSE) performance. Hence, it has much less computational complexity than that of the conventional GSC