Asymptotic properties of sign algorithms for adaptive filtering
From MaRDI portal
Publication:5266737
DOI10.1109/TAC.2003.816967zbMATH Open1364.93794MaRDI QIDQ5266737FDOQ5266737
Publication date: 20 June 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Cited In (14)
- Sign-error adaptive filtering algorithms involving Markovian parameters
- A unified identification algorithm of FIR systems based on binary observations with time-varying thresholds
- Joint identification of plant rational models and noise distribution functions using binary-valued observations
- Performance analysis of sign-sign algorithm for transversal adaptive filters
- Stochastic Analysis of the Signed LMS Algorithms for Cyclostationary White Gaussian Inputs
- Tracking performance of a quantized adaptive filter equipped with the sign algorithm
- Distributed system identification for linear stochastic systems with binary sensors
- A SPT Treatment to the Realization of the Sign-LMS Based Adaptive Filters
- Recursive identification for multivariate errors-in-variables systems
- Asymptotically efficient parameter estimation using quantized output observations
- Convergence analysis of an adaptive filter equipped with the sign-sign algorithm
- Space and time complexities and sensor threshold selection in quantized identification
- Q-learning algorithms with random truncation bounds and applications to effective parallel computing
- Early developments of control theory in China
This page was built for publication: Asymptotic properties of sign algorithms for adaptive filtering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5266737)