Cristian Anghel
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Cristian Anghel has a total of 18 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
5 shared publications - Camelia Elisei-Iliescu
Department of Telecommunications, University Politehnica of Bucharest, 1–3, Iuliu Maniu Blvd., 061071 Bucharest, Romania
4 shared publications Cristian Stanciu
4 shared publicationsConstantin Paleologu
3 shared publications- Constantin Paleologu
Faculty of Electronics, Telecommunications and Information Technology, National University of Science and Technology Politehnica Bucharest, 060042 Bucharest, Romania
3 shared publications - Ionuț-Dorinel Fîciu
Department of Telecommunications, University Politehnica of Bucharest, 1-3, Iuliu Maniu Blvd., 061071 Bucharest, Romania
3 shared publications
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
- 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.
- 6 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Audio, Speech, and Language Processing
- Vol. 27 (5) , 903-918
Recursive Least-Squares Algorithms for the Identification of Low-Rank Systems
The recursive least-squares (RLS) adaptive filter is an appealing choice in many system identification problems. The main reason behind its popularity is its fast convergence rate. However, this algorithm is computationally very complex, which may make it useless for the identification of long length impulse responses, like in echo cancellation. Computationally efficient versions of the RLS algorithm, like those based on the dichotomous coordinate descent (DCD) iterations or QR decomposition techniques, reduce the complexity, but still have to face the challenges related to long length adaptive filters (e.g., convergence/tracking capabilities). In this paper, we focus on a different approach to improve the efficiency of the RLS algorithm. The basic idea is to exploit the impulse response decomposition based on the nearest Kronecker product and low-rank approximation. In other words, a high-dimension system identification problem is reformulated in terms of low-dimension problems, which are combined together. This approach was recently addressed in terms of the Wiener filter, showing appealing features for the identification of low-rank systems, like real-world echo paths. In this paper, besides the development of the RLS algorithm based on this approach, we also propose a variable regularized version of this algorithm (using the DCD method to reduce the complexity), with improved robustness to double-talk. Simulations are performed in the context of echo cancellation and the results indicate the good performance of these algorithms.
- 6 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Audio, Speech, and Language Processing
- Vol. 27 (5) , 903-918
Recursive Least-Squares Algorithms for the Identification of Low-Rank Systems
The recursive least-squares (RLS) adaptive filter is an appealing choice in many system identification problems. The main reason behind its popularity is its fast convergence rate. However, this algorithm is computationally very complex, which may make it useless for the identification of long length impulse responses, like in echo cancellation. Computationally efficient versions of the RLS algorithm, like those based on the dichotomous coordinate descent (DCD) iterations or QR decomposition techniques, reduce the complexity, but still have to face the challenges related to long length adaptive filters (e.g., convergence/tracking capabilities). In this paper, we focus on a different approach to improve the efficiency of the RLS algorithm. The basic idea is to exploit the impulse response decomposition based on the nearest Kronecker product and low-rank approximation. In other words, a high-dimension system identification problem is reformulated in terms of low-dimension problems, which are combined together. This approach was recently addressed in terms of the Wiener filter, showing appealing features for the identification of low-rank systems, like real-world echo paths. In this paper, besides the development of the RLS algorithm based on this approach, we also propose a variable regularized version of this algorithm (using the DCD method to reduce the complexity), with improved robustness to double-talk. Simulations are performed in the context of echo cancellation and the results indicate the good performance of these algorithms.
- 1 December 2018
- Published by Elsevier in Digital Signal Processing
- Vol. 83, 280-296
Efficient recursive least-squares algorithms for the identification of bilinear forms
- 1 December 2018
- Published by Elsevier in Digital Signal Processing
- Vol. 83, 280-296
Efficient recursive least-squares algorithms for the identification of bilinear forms
- 1 September 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 455-459
Low-Complexity RLS Algorithms for the Identification of Bilinear Forms
- 1 September 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 455-459
Low-Complexity RLS Algorithms for the Identification of Bilinear Forms
- Open Access
- 31 May 2017
- Published by IntechOpen
Efficient FPGA Implementation of a CTC Turbo Decoder for WiMAX/LTE Mobile Systems
Efficient FPGA Implementation of a CTC Turbo Decoder for WiMAX/LTE Mobile Systems | InTechOpen, Published on: 2017-05-31. Authors: Cristian Anghel, Cristian Stanciu and Constantin Paleologu
- 31 May 2017
- Published by IntechOpen
Open AccessEfficient FPGA Implementation of a CTC Turbo Decoder for WiMAX/LTE Mobile Systems
Efficient FPGA Implementation of a CTC Turbo Decoder for WiMAX/LTE Mobile Systems | InTechOpen, Published on: 2017-05-31. Authors: Cristian Anghel, Cristian Stanciu and Constantin Paleologu
- 18 July 2016
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 36 (4) , 1455-1475
LTE Turbo Decoding Parallel Architecture with Single Interleaver Implemented on FPGA
- 18 July 2016
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 36 (4) , 1455-1475
LTE Turbo Decoding Parallel Architecture with Single Interleaver Implemented on FPGA
- Open Access
- 29 August 2011
Fpga Implementation Of An Efficient Proportionate Affine Projection Algorithm For Echo Cancellation
- 29 August 2011
Open AccessFpga Implementation Of An Efficient Proportionate Affine Projection Algorithm For Echo Cancellation
- 1 November 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 125-128
Long Term Evolution primary synchronization algorithms
In this paper we will describe the procedure for primary synchronization in the Long Term Evolution (LTE) systems downlink and we will propose two enhanced algorithms that rely on the traditional methods described in other papers (based on cross-correlation properties of Zadoff-Chu sequences), but provide extra robustness through a validation process that can be made either “hard” or “soft”. The result contains the value for the sector identifier and location of the primary sequence, necessary for further synchronization and confirmation through the cell-specific reference signal (RS).
- 1 November 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 125-128
Long Term Evolution primary synchronization algorithms
In this paper we will describe the procedure for primary synchronization in the Long Term Evolution (LTE) systems downlink and we will propose two enhanced algorithms that rely on the traditional methods described in other papers (based on cross-correlation properties of Zadoff-Chu sequences), but provide extra robustness through a validation process that can be made either “hard” or “soft”. The result contains the value for the sector identifier and location of the primary sequence, necessary for further synchronization and confirmation through the cell-specific reference signal (RS).