Narrowband interference cancellation based on set-membership estimation in DCSK communication system

This paper presents set-membership estimation methods for narrowband interference cancellation (NBIC) in differential chaotic shift keying (DCSK) communication. Based on the boundedness of the chaotic carrier, two optimal bounding ellipsoid (OBE) algorithms are formulated, one with known and one with unknown interference parameters. Compared with the Kalman filter and recursive least-squares (RLS) algorithms, the proposed NBIC methods are computationally efficient due to the discerning update features that can estimate interfering signals with only a fraction of the observations. Simulation results illustrate that the proposed NBIC methods can suppress autoregressive (AR) or sinusoidal interference effectively.