Felix Albu

Dr. Felix Albu

Department of Electronics, Valahia University of Targoviste, 130082 Targoviste, Romania
orcid

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 November 2018 in Applied Sciences
Verified
Journal Article
Open access
PDF file
FYFeiran Yang
Feiran Yang
YCYin Cao
Yin Cao
MWMing Wu
Ming Wu
Felix AlbuFelix Albu
Felix Albu
JYJun Yang
Jun Yang
This paper presents a comprehensive overview of the frequency-domain filtered-x least mean-square (FxLMS) algorithms for active noise control (ANC). The direct use of frequency-domain adaptive filters for ANC results in two kinds of delays, i.e., delay in the signal path and delay in the weight adaptation. The effects of the two kinds of delays on the convergence behavior and stability of the adaptive algorithms are analyzed in this paper. The first delay can violate the so-called causality constraint, which is a major concern for broadband ANC, and the second delay can reduce the upper bound of the step size. The modified filter-x scheme has been employed to remove the delay in the weight adaptation, and several delayless filtering approaches have been presented to remove the delay in the signal path. However, state-of-the-art frequency-domain FxLMS algorithms only remove one kind of delay, and some of these algorithms have a very high peak complexity and hence are impractical for real-time systems. This paper thus proposes a new delayless frequency-domain ANC algorithm that completely removes the two kinds of delays and has a low complexity. The performance advantages and limitations of each algorithm are discussed based on an extensive evaluation, and the complexities are evaluated in terms of both the peak and average complexities.

18 April 2005 in IEEE Signal Processing Letters
Verified
Journal Article
Closed access
YZY. Zakharov
Y. Zakharov
Felix AlbuFelix Albu
Felix Albu
We propose a new approach for real-time implementation of the fast affine projection (FAP) algorithm. This is based on exploiting the recently introduced dichotomous coordinate descent (DCD) algorithm, which is especially efficient for solving systems of linear equations on real-time hardware and software platforms since it is free of multiplication and division. The numerical stability of the DCD algorithm allows the new combined DCD-FAP algorithm also to be stable. The convergence and complexity of the DCD-FAP algorithm is compared with that of the FAP, Gauss-Seidel FAP (GS-FAP), and modified GS-FAP algorithms in the application to acoustic echo cancellation. The DCD-FAP algorithm demonstrates a performance close to that of the FAP algorithm with ideal matrix inversion and the complexity smaller than that of the Gauss-Seidel FAP algorithms.

23 January 2017 in Entropy
Verified
Journal Article
Open access
PDF file
YLYingsong Li
Yingsong Li
YWYanyan Wang
Yanyan Wang
RYRui Yang
Rui Yang
Felix AlbuFelix Albu
Felix Albu
A soft parameter function penalized normalized maximum correntropy criterion (SPF-NMCC) algorithm is proposed for sparse system identification. The proposed SPF-NMCC algorithm is derived on the basis of the normalized adaptive filter theory, the maximum correntropy criterion (MCC) algorithm and zero-attracting techniques. A soft parameter function is incorporated into the cost function of the traditional normalized MCC (NMCC) algorithm to exploit the sparsity properties of the sparse signals. The proposed SPF-NMCC algorithm is mathematically derived in detail. As a result, the proposed SPF-NMCC algorithm can provide an efficient zero attractor term to effectively attract the zero taps and near-zero coefficients to zero, and, hence, it can speed up the convergence. Furthermore, the estimation behaviors are obtained by estimating a sparse system and a sparse acoustic echo channel. Computer simulation results indicate that the proposed SPF-NMCC algorithm can achieve a better performance in comparison with the MCC, NMCC, LMS (least mean square) algorithms and their zero attraction forms in terms of both convergence speed and steady-state performance.

20 February 2007 in IEEE Transactions on Audio, Speech, and Language Processing
Verified
Journal Article
Closed access
Felix AlbuFelix Albu
Felix Albu
MBMartin Bouchard
Martin Bouchard
YZYuriy Zakharov
Yuriy Zakharov
For feedforward multichannel active noise control (ANC) systems, the use of adaptive finite-impulse response (FIR) filters is a popular solution, and the multichannel filtered-x least-mean-square (FX-LMS) algorithm is the most commonly used algorithm. The drawback of the FX-LMS is the slow convergence speed, especially for broadband multichannel systems. Recently, some fast affine projection algorithms have been introduced for multichannel ANC, as an interesting alternative to the FX-LMS algorithm. They can provide a significantly improved convergence speed at a reasonable additional computational cost. Yet, the additional computational cost or the potential numerical instability in some of the recently proposed algorithms can prevent the use of those algorithms for some applications. In this paper, we propose two pseudo-affine projection algorithms for multichannel ANC: one based on the Gauss-Seidel method and one based on dichotomous coordinate descent (DCD) iterations. It is shown that the proposed algorithms typically have a lower complexity than the previously published fast affine projection algorithms for ANC, with very similar good convergence properties and good numerical stability. Thus, the proposed algorithms are an interesting alternative to the standard FX-LMS algorithm for ANC, providing an improved performance for a computational load of the same order

27 August 2003
Verified
Conference Paper
Closed access
Felix AlbuFelix Albu
Felix Albu
JKJ. Kadlec
J. Kadlec
NCN. Coleman
N. Coleman
AFA. Fagan
A. Fagan
In this paper we propose a new stable fast affine projection algorithm based on Gauss-Seidel iterations (GSFAP). We investigate its implementation using the logarithmic number system (LNS) and compare it with two other fast affine projection (FAP) algorithms. Simplified and multi-input GSFAP versions are also proposed. We show that the algorithm is only marginally more complex than NLMS and simpler than other FAP algorithms. Its application for acoustic echo cancellation is also investigated.

27 September 2012 in Electronics Letters
Verified
Journal Article
Closed access
Felix AlbuFelix Albu
Felix Albu
HKH.K. Kwan
H.K. Kwan
A new proportionate affine projection sign algorithm is proposed for network echo cancellation. It uses a recursive procedure and takes into account the previously computed proportionate coefficients. It is shown that the proposed algorithm can obtain a lower steady-state misalignment than other affine projection sign algorithms for different echo paths, impulsive interferences and step sizes.