Frequency domain GSC with low computational complexity

Sung Hoon Moon, Dong Seog Han, Myeong Je Cho, Kil Houm Park

Research output: Contribution to conferencePaperpeer-review

Abstract

The frequency domain generalized sidelobe canceller (FLMS-GSC) removes the 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 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.

Original languageEnglish
Pages656-660
Number of pages5
StatePublished - 1999
EventIEEE Military Communications Conference (MILCOM 1999) - Atlantic City, NJ, USA
Duration: 31 Oct 19993 Nov 1999

Conference

ConferenceIEEE Military Communications Conference (MILCOM 1999)
CityAtlantic City, NJ, USA
Period31/10/993/11/99

Fingerprint

Dive into the research topics of 'Frequency domain GSC with low computational complexity'. Together they form a unique fingerprint.

Cite this