Details
- Project's acronym:
- LBF
- Financial Program Name:
- OPUS
- Organization:
- Narodowe Centrum Nauki (NCN) (National Science Centre)
- Agreement:
- UMO-2018/29/B/ST7/00325 z dnia 2019-01-24
- Realisation period:
- 2019-01-24 - 2022-01-23
- Project manager:
- prof. dr hab. inż. Maciej Niedźwiecki
- Team members:
-
- investigator dr inż. Marcin Ciołek
- investigator dr inż. Piotr Andrzej Kaczmarek
- investigator dr inż. Artur Gańcza
- Realised in:
- Faculty of Electronics, Telecommunications and Informatics
- Project's value:
- 500 000.00 PLN
- Request type:
- National Research Programmes
- Domestic:
- Domestic project
- Verified by:
- Gdańsk University of Technology
Papers associated with that project
Filters
total: 14
Catalog Projects
Year 2022
-
Adaptive identification of sparse underwater acoustic channels with a mix of static and time-varying parameters
PublicationWe consider identification of sparse linear systems with a mix of static and time-varying parameters. Such systems are typical in underwater acoustics (UWA), for instance, in applications requiring identi- fication of the acoustic channel, such as UWA communications, navigation and continuous-wave sonar. The recently proposed fast local basis function (fLBF) algorithm provides high performance when identi- fying time-varying systems....
-
Adaptive Identification of Underwater Acoustic Channel with a Mix of Static and Time-Varying Parameters
PublicationWe consider the problem of identification of communication channels with a mix of static and time-varying parameters. Such scenarios are typical, among others, in underwater acoustics. In this paper, we further develop adaptive algorithms built on the local basis function (LBF) principle resulting in excellent performance when identifying time-varying systems. The main drawback of an LBF algorithm is its high complexity. The subsequently...
-
Finite-window RLS algorithms
PublicationTwo recursive least-squares (RLS) adaptive filtering algorithms are most often used in practice, the exponential and sliding (rectangular) window RLS algorithms. This popularity is mainly due to existence of low-complexity versions of these algorithms. However, these two windows are not always the best choice for identification of fast time-varying systems, when the identification performance is most important. In this paper, we...
-
Optimally regularized local basis function approach to identification of time-varying systems
PublicationAccurate identification of stochastic systems with fast-varying parameters is a challenging task which cannot be accomplished using model-free estimation methods, such as weighted least squares, which assume only that system coefficients can be regarded as locally constant. The current state of the art solutions are based on the assumption that system parameters can be locally approximated by a linear combination of appropriately...
Year 2021
-
Application of regularized Savitzky–Golay filters to identification of time-varying systems
PublicationSavitzky–Golay (SG) filtering is a classical signal smoothing technique based on the local least squares approximation of the analyzed signal by a linear combination of known functions of time (originally — powers of time, which corresponds to polynomial approximation). It is shown that the regularized version of the SG algorithm can be successfully applied to identification of time-varying finite impulse response (FIR) systems....
-
Decoupled Kalman filter based identification of time-varying FIR systems
PublicationWhen system parameters vary at a fast rate, identification schemes based on model-free local estimation approaches do not yield satisfactory results. In cases like this, more sophisticated parameter tracking procedures must be used, based on explicit models of parameter variation (often referred to as hypermodels), either deterministic or stochastic. Kalman filter trackers, which belong to the second category, are seldom used in...
-
Identification of Fast Time-varying Communication Channels Using the Preestimation Technique
PublicationAccurate identification of stochastic systems with fast-varying parameters is a challenging task which cannot be accomplished using model-free estimation methods, such as weighted least squares, which assume only that system coefficients can be regarded as locally constant. The current state-of-the-art solutions are based on the assumption that system parameters can be locally approximated by a linear combination of appropriately...
-
Regularized identification of fast time-varying systems - comparison of two regularization strategies
PublicationThe problem of identification of a time-varying FIR system is considered and solved using the local basis function approach. It is shown that the estimation (tracking) results can be improved by means of regularization. Two variants of regularization are proposed and compared: the classical L2 (ridge) regularization and a new, reweighted L2 one. It is shown that the new approach can outperform the classical one and is computationally...
-
Regularized Identification of Time-Varying FIR Systems Based on Generalized Cross-Validation
PublicationA new regularization method is proposed and applied to identification of time-varying finite impulse response systems. We show, that by a careful design of the regularization constraint, one can improve estimation results, especially in the presence of strong measurement noise. We also show that the the most appropriate regularization gain can be found by direct optimization of the generalized cross-validation criterion.
Year 2020
-
A new look at the statistical identification of nonstationary systems
PublicationThe paper presents a new, two-stage approach to identification of linear time-varying stochastic systems, based on the concepts of preestimation and postfiltering. The proposed preestimated parameter trajectories are unbiased but have large variability. Hence, to obtain reliable estimates of system parameters, the preestimated trajectories must be further filtered (postfiltered). It is shown how one can design and optimize such...
-
A New Method of Noncausal Identification of Time-varying Systems
PublicationThe paper shows that the problem of noncausal identification of a time-varying FIR (finite impulse response) sys- tem can be reformulated, and solved, as a problem of smoothing of the preestimated parameter trajectories. Characteristics of the smoothing filter should be chosen so as to provide the best trade- off between the bias and variance of the resulting estimates. It is shown that optimization of the smoothing operation can...
-
On the preestimation technique and its application to identification of nonstationary systems
PublicationThe problem of noncausal identification of a nonstationary stochastic FIR (finite impulse response) sys- tem is reformulated, and solved, as a problem of smoothing of preestimated parameter trajectories. Three approaches to preestimation are critically analyzed and compared. It is shown that optimization of the smoothing operation can be performed adaptively using the parallel estimation technique. The new approach is computationally...
Year 2019
-
Fast Basis Function Estimators for Identification of Nonstationary Stochastic Processes
PublicationThe problem of identification of a linear nonsta-tionary stochastic process is considered and solved using theapproach based on functional series approximation of time-varying parameter trajectories. The proposed fast basis func-tion estimators are computationally attractive and yield resultsthat are better than those provided by the local least squaresalgorithms. It is shown that two...
-
Fully Adaptive Savitzky-Golay Type Smoothers
PublicationThe problem of adaptive signal smoothing is consid-ered and solved using the weighted basis function approach. Inthe special case of polynomial basis and uniform weighting theproposed method reduces down to the celebrated Savitzky-Golaysmoother. Data adaptiveness is achieved via parallel estimation.It is shown that for the polynomial and harmonic bases andcosinusoidal weighting sequences, the competing signal estimatescan be computed...
seen 1484 times