Ionuț-Dorinel Fîciu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ionuț-Dorinel Fîciu has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Cristian-Lucian Stanciu
Department of Telecommunications, National University of Science and Technology Politehnica Bucharest, 060042 Bucharest, Romania
4 shared publications - Camelia Elisei-Iliescu
Department of Telecommunications, University Politehnica of Bucharest, 1–3, Iuliu Maniu Blvd., 061071 Bucharest, Romania
3 shared publications - Cristian Anghel
Department of Telecommunications, National University of Science and Technology Politehnica Bucharest, 1–3, Iuliu Maniu Blvd., 061071 Bucharest, Romania
3 shared publications - Constantin Paleologu
Faculty of Electronics, Telecommunications and Information Technology, National University of Science and Technology Politehnica Bucharest, 060042 Bucharest, Romania
2 shared publications - Jacob Benesty
INRS-EMT, University of Quebec, Montreal, QC H5A 1K6, Canada
2 shared publications - Laura-Maria Dogariu
Department of Telecommunications, National University of Science and Technology Politehnica Bucharest, 060042 Bucharest, Romania
1 shared publication
Latest Publications
- Open Access
- 13 April 2024
- Published by MDPI AG in Electronics
- Vol. 13 (8) , 1479
On the Regularization of Recursive Least-Squares Adaptive Algorithms Using Line Search Methods
Stereophonic acoustic echo cancellation (SAEC) requires the identification of four unknown impulse responses corresponding to four loudspeaker-to-microphone pairs. Recent developments in the field of adaptive filters for SAEC setups have allowed for the handling of a single complex-valued adaptive impulse response, instead of the four classical real-valued adaptive filters. With the simplified framework provided by the widely linear (WL) model, more advanced versions of recursive least-squares (RLS) were employed in order to take advantage of their superior tracking speeds when working with highly correlated input signals (such as speech). Despite the performances and numerical stability provided by using exponentially weighted versions of the RLS family in combination with line search methods (LSMs), the SAEC configurations have limited capabilities in mitigating the negative effects caused by high-level disturbances affecting the two microphone signals. Such is the case of double-talk scenarios, which considerably reduce the update accuracy of the adaptive system. This paper analyzes a regularization technique for the named WL-RLS-LSM adaptive filters by adjusting the correlation matrix associated with the input signals and creating a reaction in the update process. The proposed method is designed to considerably slow (or even freeze) the adaptation process while the disturbance is manifested. Simulation results are discussed in order to validate the theoretical content.
- 13 April 2024
- Published by MDPI AG in Electronics
- Vol. 13 (8) , 1479
Open AccessOn the Regularization of Recursive Least-Squares Adaptive Algorithms Using Line Search Methods
Stereophonic acoustic echo cancellation (SAEC) requires the identification of four unknown impulse responses corresponding to four loudspeaker-to-microphone pairs. Recent developments in the field of adaptive filters for SAEC setups have allowed for the handling of a single complex-valued adaptive impulse response, instead of the four classical real-valued adaptive filters. With the simplified framework provided by the widely linear (WL) model, more advanced versions of recursive least-squares (RLS) were employed in order to take advantage of their superior tracking speeds when working with highly correlated input signals (such as speech). Despite the performances and numerical stability provided by using exponentially weighted versions of the RLS family in combination with line search methods (LSMs), the SAEC configurations have limited capabilities in mitigating the negative effects caused by high-level disturbances affecting the two microphone signals. Such is the case of double-talk scenarios, which considerably reduce the update accuracy of the adaptive system. This paper analyzes a regularization technique for the named WL-RLS-LSM adaptive filters by adjusting the correlation matrix associated with the input signals and creating a reaction in the update process. The proposed method is designed to considerably slow (or even freeze) the adaptation process while the disturbance is manifested. Simulation results are discussed in order to validate the theoretical content.
- Open Access
- 9 February 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (4) , 2227
Low-Complexity Data-Reuse RLS Algorithm for Stereophonic Acoustic Echo Cancellation
Stereophonic audio devices employ two loudspeakers and two microphones in order to create a bidirectional sound effect. In this context, the stereophonic acoustic echo cancellation (SAEC) setup requires the estimation of four echo paths, each one corresponding to a loudspeaker-to-microphone pair. The widely linear (WL) model was proposed in recent literature in order to simplify the handling of the SAEC mathematical model. Moreover, low complexity recursive least- squares (RLS) adaptive algorithms were developed within the WL framework and successfully tested for SAEC scenarios. This paper proposes to apply a data-reuse (DR) approach for the combination between the RLS algorithm and the dichotomous coordinate descent (DCD) iterative method. The resulting WL-DR-RLS-DCD algorithm inherits the convergence properties of the RLS family and requires an amount of mathematical operations attractive for practical implementations. Simulation results show that the DR approach improves the tracking capabilities of the RLS-DCD algorithm, with an acceptable surplus in terms of computational workload.
- 9 February 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (4) , 2227
Open AccessLow-Complexity Data-Reuse RLS Algorithm for Stereophonic Acoustic Echo Cancellation
Stereophonic audio devices employ two loudspeakers and two microphones in order to create a bidirectional sound effect. In this context, the stereophonic acoustic echo cancellation (SAEC) setup requires the estimation of four echo paths, each one corresponding to a loudspeaker-to-microphone pair. The widely linear (WL) model was proposed in recent literature in order to simplify the handling of the SAEC mathematical model. Moreover, low complexity recursive least- squares (RLS) adaptive algorithms were developed within the WL framework and successfully tested for SAEC scenarios. This paper proposes to apply a data-reuse (DR) approach for the combination between the RLS algorithm and the dichotomous coordinate descent (DCD) iterative method. The resulting WL-DR-RLS-DCD algorithm inherits the convergence properties of the RLS family and requires an amount of mathematical operations attractive for practical implementations. Simulation results show that the DR approach improves the tracking capabilities of the RLS-DCD algorithm, with an acceptable surplus in terms of computational workload.
- Open Access
- 23 April 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (9) , 4263
Efficient Algorithms for Linear System Identification with Particular Symmetric Filters
In linear system identification problems, it is important to reveal and exploit any specific intrinsic characteristic of the impulse responses, in order to improve the overall performance, especially in terms of the accuracy and complexity of the solution. In this paper, we focus on the nearest Kronecker product decomposition of the impulse responses, together with low-rank approximations. Such an approach is suitable for the identification of a wide range of real-world systems. Most importantly, we reformulate the system identification problem by using a particular symmetric filter within the development, which allows us to efficiently design two (iterative/recursive) algorithms. First, an iterative Wiener filter is proposed, with improved performance as compared to the conventional Wiener filter, especially in challenging conditions (e.g., small amount of available data and/or noisy environments). Second, an even more practical solution is developed, in the form of a recursive least-squares adaptive algorithm, which could represent an appealing choice in real-time applications. Overall, based on the proposed approach, a system identification problem that can be conventionally solved by using a system of equations (with L unknown parameters) is reformulated as a combination of two systems of and equations, respectively, where usually (i.e., a total of parameters). This could lead to important advantages, in terms of both performance and complexity. Simulation results are provided in the framework of network and acoustic echo cancellation, supporting the performance gain and the practical features of the proposed algorithms.- 23 April 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (9) , 4263
Open AccessEfficient Algorithms for Linear System Identification with Particular Symmetric Filters
In linear system identification problems, it is important to reveal and exploit any specific intrinsic characteristic of the impulse responses, in order to improve the overall performance, especially in terms of the accuracy and complexity of the solution. In this paper, we focus on the nearest Kronecker product decomposition of the impulse responses, together with low-rank approximations. Such an approach is suitable for the identification of a wide range of real-world systems. Most importantly, we reformulate the system identification problem by using a particular symmetric filter within the development, which allows us to efficiently design two (iterative/recursive) algorithms. First, an iterative Wiener filter is proposed, with improved performance as compared to the conventional Wiener filter, especially in challenging conditions (e.g., small amount of available data and/or noisy environments). Second, an even more practical solution is developed, in the form of a recursive least-squares adaptive algorithm, which could represent an appealing choice in real-time applications. Overall, based on the proposed approach, a system identification problem that can be conventionally solved by using a system of equations (with L unknown parameters) is reformulated as a combination of two systems of and equations, respectively, where usually (i.e., a total of parameters). This could lead to important advantages, in terms of both performance and complexity. Simulation results are provided in the framework of network and acoustic echo cancellation, supporting the performance gain and the practical features of the proposed algorithms. - Open Access
- 12 January 2022
- Published by MDPI AG in Electronics
- Vol. 11 (2) , 237
Tensor-Based Recursive Least-Squares Adaptive Algorithms with Low-Complexity and High Robustness Features
The recently proposed tensor-based recursive least-squares dichotomous coordinate descent algorithm, namely RLS-DCD-T, was designed for the identification of multilinear forms. In this context, a high-dimensional system identification problem can be efficiently addressed (gaining in terms of both performance and complexity), based on tensor decomposition and modeling. In this paper, following the framework of the RLS-DCD-T, we propose a regularized version of this algorithm, where the regularization terms are incorporated within the cost functions. Furthermore, the optimal regularization parameters are derived, aiming to attenuate the effects of the system noise. Simulation results support the performance features of the proposed algorithm, especially in terms of its robustness in noisy environments.
- 12 January 2022
- Published by MDPI AG in Electronics
- Vol. 11 (2) , 237
Open AccessTensor-Based Recursive Least-Squares Adaptive Algorithms with Low-Complexity and High Robustness Features
The recently proposed tensor-based recursive least-squares dichotomous coordinate descent algorithm, namely RLS-DCD-T, was designed for the identification of multilinear forms. In this context, a high-dimensional system identification problem can be efficiently addressed (gaining in terms of both performance and complexity), based on tensor decomposition and modeling. In this paper, following the framework of the RLS-DCD-T, we propose a regularized version of this algorithm, where the regularization terms are incorporated within the cost functions. Furthermore, the optimal regularization parameters are derived, aiming to attenuate the effects of the system noise. Simulation results support the performance features of the proposed algorithm, especially in terms of its robustness in noisy environments.
- Open Access
- 17 September 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (18) , 8656
Low-Complexity Recursive Least-Squares Adaptive Algorithm Based on Tensorial Forms
Modern solutions for system identification problems employ multilinear forms, which are based on multiple-order tensor decomposition (of rank one). Recently, such a solution was introduced based on the recursive least-squares (RLS) algorithm. Despite their potential for adaptive systems, the classical RLS methods require a prohibitive amount of arithmetic resources and are sometimes prone to numerical stability issues. This paper proposes a new algorithm for multiple-input/single-output (MISO) system identification based on the combination between the exponentially weighted RLS algorithm and the dichotomous descent iterations in order to implement a low-complexity stable solution with performance similar to the classical RLS methods.
- 17 September 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (18) , 8656
Open AccessLow-Complexity Recursive Least-Squares Adaptive Algorithm Based on Tensorial Forms
Modern solutions for system identification problems employ multilinear forms, which are based on multiple-order tensor decomposition (of rank one). Recently, such a solution was introduced based on the recursive least-squares (RLS) algorithm. Despite their potential for adaptive systems, the classical RLS methods require a prohibitive amount of arithmetic resources and are sometimes prone to numerical stability issues. This paper proposes a new algorithm for multiple-input/single-output (MISO) system identification based on the combination between the exponentially weighted RLS algorithm and the dichotomous descent iterations in order to implement a low-complexity stable solution with performance similar to the classical RLS methods.