Følg
Constantin Paleologu
Constantin Paleologu
Professor, POLITEHNICA Bucharest, Romania
Verifisert e-postadresse på comm.pub.ro - Startside
Tittel
Sitert av
Sitert av
År
A robust variable forgetting factor recursive least-squares algorithm for system identification
C Paleologu, J Benesty, S Ciochina
IEEE Signal Processing Letters 15, 597-600, 2008
5042008
A variable step-size affine projection algorithm designed for acoustic echo cancellation
C Paleologu, J Benesty, S Ciochina
IEEE Transactions on Audio, Speech, and Language Processing 16 (8), 1466-1478, 2008
1872008
Sparse adaptive filters for echo cancellation
C Paleologu, J Benesty, S Ciochina
Morgan & Claypool Publishers, 2011
1762011
Variable step-size NLMS algorithm for under-modeling acoustic echo cancellation
C Paleologu, S Ciochina, J Benesty
IEEE signal processing letters 15, 5-8, 2008
1722008
An efficient proportionate affine projection algorithm for echo cancellation
C Paleologu, S Ciochina, J Benesty
IEEE Signal Processing Letters 17 (2), 165-168, 2009
1572009
Speech processing in modern communication: Challenges and perspectives
I Cohen, J Benesty, S Gannot
Springer, 2010
137*2010
On regularization in adaptive filtering
J Benesty, C Paleologu, S Ciochina
IEEE Transactions on audio, speech, and language processing 19 (6), 1734-1742, 2010
1192010
Linear system identification based on a Kronecker product decomposition
C Paleologu, J Benesty, S Ciochină
IEEE/ACM Transactions on Audio, Speech, and Language Processing 26 (10 …, 2018
1172018
Study of the general Kalman filter for echo cancellation
C Paleologu, J Benesty, S Ciochină
IEEE transactions on audio, speech, and language processing 21 (8), 1539-1549, 2013
1132013
An optimized NLMS algorithm for system identification
S Ciochină, C Paleologu, J Benesty
Signal Processing 118, 115-121, 2016
1072016
On the identification of bilinear forms with the Wiener filter
J Benesty, C Paleologu, S Ciochină
IEEE Signal Processing Letters 24 (5), 653-657, 2017
972017
Recursive least-squares algorithms for the identification of low-rank systems
C Elisei-Iliescu, C Paleologu, J Benesty, C Stanciu, C Anghel, S Ciochină
IEEE/ACM Transactions on Audio, Speech, and Language Processing 27 (5), 903-918, 2019
932019
An improved proportionate NLMS algorithm based on the l0norm
C Paleologu, J Benesty, S Ciochină
2010 IEEE International Conference on Acoustics, Speech and Signal …, 2010
832010
A perspective on stereophonic acoustic echo cancellation
J Benesty, C Paleologu, T Gänsler, S Ciochină
Springer Science & Business Media, 2011
742011
An overview on optimized NLMS algorithms for acoustic echo cancellation
C Paleologu, S Ciochină, J Benesty, SL Grant
EURASIP Journal on Advances in Signal Processing 2015, 1-19, 2015
712015
A widely linear model for stereophonic acoustic echo cancellation
C Stanciu, J Benesty, C Paleologu, T Gänsler, S Ciochină
Signal Processing 93 (2), 511-516, 2013
632013
Adaptive filtering for the identification of bilinear forms
C Paleologu, J Benesty, S Ciochină
Digital Signal Processing 75, 153-167, 2018
622018
Proportionate adaptive filters from a basis pursuit perspective
J Benesty, C Paleologu, S Ciochină
IEEE Signal Processing Letters 17 (12), 985-988, 2010
612010
On the influence of the forgetting factor of the RLS adaptive filter in system identification
S Ciochina, C Paleologu, J Benesty, AA Enescu
2009 International Symposium on Signals, Circuits and Systems, 1-4, 2009
602009
Double-talk robust VSS-NLMS algorithm for under-modeling acoustic echo cancellation
C Paleologu, S Ciochina, J Benesty
2008 IEEE International Conference on Acoustics, Speech and Signal …, 2008
512008
Systemet kan ikke utføre handlingen. Prøv på nytt senere.
Artikler 1–20