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

Authors:
Yongquan Fan;Jiashu Zhang
Affiliations:
Key Lab of Signal and Information Processing, Southwest Jiaotong University, Chengdu 610031, China and School of Mathematics and Computer Engineering, Xihua University, Chengdu 610039, China;Key Lab of Signal and Information Processing, Southwest Jiaotong University, Chengdu 610031, China
Venue:
Signal Processing
Year:
2009

Citing 3
Cited 2

BEACON: an adaptive set-membership filtering technique with sparseupdates

IEEE Transactions on Signal Processing
On the value of information in system identification-Bounded noise case

Automatica (Journal of IFAC)
Brief paper: Recursive state bounding by parallelotopes

Automatica (Journal of IFAC)

Chaotic secure communication based on a gravitational search algorithm filter

Engineering Applications of Artificial Intelligence
A chaotic digital secure communication based on a modified gravitational search algorithm filter

Information Sciences: an International Journal

Quantified Score

Hi-index	0.08

Visualization

Abstract

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.