Camelia Elisei-Iliescu was
born in Romania in 1991. In 2013, she started
working under the guidance of Prof. Constantin PALEOLOGU in the domain of
adaptive filtering and system identification. In 2014, she
received the B.Sc. in telecommunications systems from Faculty of Electronics,
Telecommunications, and Information Technology, University Politehnica of
Bucharest (UPB), Romania. She also received the Master degree in integrated
circuits and systems for communications in 2016, and a Ph.D. degree (SUMMA CUM
LAUDE) in adaptive signal processing in 2019 coordinated by prof. Constantin
PALEOLOGU, both from the same institution. Her research
interests also include acoustic signal processing and DSP/FPGA implementation.
Google
scholar citations
https://scholar.google.com/citations?user=snQjyWMAAAAJ
Contact:
Email: camelliailiescu27@gmail.com
Tel./fax: +40214034687
Room B03
Telecommunications Department
Faculty of Electronics,
Telecommunications, and Information Technology
University Politehnica of Bucharest
1-3, Iuliu Maniu Blvd., 061071, Bucharest,
ROMANIA
JOURNAL PAPERS
- C. Elisei-Iliescu, C. Paleologu, J.
Benesty, C. Stanciu, C. Anghel, and S. Ciochina, “Recursive least-squares
algorithms for the identification of low-rank systems,” IEEE/ACM Trans.
Audio, Speech, Language Processing, vol. 27, pp. 903-918, May 2019.
- C. Elisei-Iliescu, C. Stanciu, C.
Paleologu, J. Benesty, C. Anghel, and S. Ciochina, “Efficient recursive
least-squares algorithms for the identification of bilinear forms,” Digital
Signal Processing, vol. 83, pp. 280-296, Dec. 2018.
- C. Elisei-Iliescu, C. Stanciu, C.
Paleologu, J. Benesty, C. Anghel, and S. Ciochina, A practical overview of
recursive least-squares algorithms for echo cancellation,” International
Journal on Advances in Telecommunications, vol. 10, pp. 96-104, Dec.
2017.
CONFERENCE PAPERS
- L. M. Dogariu, C. Elisei-Iliescu, C.
Paleologu, J. Benesty, and S. Ciochina, “A
proportionate affine projection algorithm for the identification of sparse
bilinear forms,” in Proc. IEEE International
Symposium on Signals, Circuits and Systems (ISSCS), 2019 (4 pages),
Iasi, Romania.
- C. Elisei-Iliescu, C. Paleologu, J.
Benesty, and S. Ciochina, “A recursive
least-squares algorithm based on the nearest Kronecker product
decomposition,” in
Proc. IEEE International
Conference on Acoustics, Speech, and
Signal Processing (ICASSP),
2019, pp. 4843-4847, Brighton, UK.
- C. Elisei-Iliescu, C. Paleologu, J.
Benesty, C. Stanciu, C. Anghel, and S. Ciochina, “Regularized
recursive least-squares algorithms
for the identification of bilinear forms,”
in Proc. IEEE ,
2018 (4 pages), Timisoara, Romania.
- C. Elisei-Iliescu, C. Stanciu, C.
Paleologu, J. Benesty, C. Anghel, and S. Ciochina, “Low-complexity RLS algorithms
for the identification of bilinear forms,” in Proc.
EUSIPCO, 2018, pp. 455-459,
Rome, Italy.
- C. Elisei-Iliescu, C. Paleologu, and
R. Tamas, “On the performance of the
variable-regularized recursive least-squares algorithms,”
in Proc. SPIE ATOM-N, 2018 (6 pages), Constanta, Romania. *Paper Award*
- C. Paleologu, J. Benesty, C.
Elisei-Iliescu, C. Stanciu, C. Anghel, and S. Ciochina, “A
proportionate NLMS algorithm for the identification of sparse bilinear
forms,” in Proc. IEEE TSP, 2018, pp. 698-701,
Athens, Greece.
- C. Elisei-Iliescu, C. Paleologu, J.
Benesty, R. A. Dobre, and S. Ciochina, “An RLS algorithm for the
identification of bilinear forms,” in Proc. IEEE SIITME, 2017, pp.
292-295, Constanta, Romania.
- C. Elisei-Iliescu and C. Paleologu, “Recursive least-squares algorithms
for echo cancellation - An overview and open issues,” in Proc. International Conference on Networks (ICN),
2017, pp. 87-91, Venice, Italy. *Paper Award*
- C. Elisei-Iliescu, C. Stanciu, C.
Paleologu, J. Benesty, C. Anghel, and S. Ciochina, “Robust variable-regularized RLS
algorithms,” in Proc. IEEE HSCMA,
2017, pp. 171-175, San Franciso, USA.
- R. A. Dobre, C. Elisei-Iliescu, C.
Paleologu, C. Negrescu, and D. Stanomir, “Robust audio
forensic software for recovering speech signals drowned in loud music,”
in Proc. IEEE SIITME, 2016 (4 pages), Oradea, Romania.
- C. Elisei-Iliescu, C. Paleologu, and
R. Tamas, “On the performance of variable forgetting factor recursive
least-squares algorithms,” in Proc. SPIE ATOM-N, 2016 (6 pages),
Constanta, Romania.