Inscriere cercetatori

Premii Ad Astra

premii Ad Astra

Asociația Ad Astra a anunțat câștigătorii Premiilor Ad Astra 2022: http://premii.ad-astra.ro/. Proiectul și-a propus identificarea și popularizarea modelelor de succes, a rezultatelor excepționale ale cercetătorilor români din țară și din afara ei.

Asociatia Ad Astra a cercetatorilor romani lanseaza BAZA DE DATE A CERCETATORILOR ROMANI DIN DIASPORA. Scopul acestei baze de date este aceea de a stimula colaborarea dintre cercetatorii romani de peste hotare dar si cu cercetatorii din Romania. Cercetatorii care doresc sa fie nominalizati in aceasta baza de date sunt rugati sa trimita un email la cristian.presura@gmail.com

Traian Abrudan

Avatar

Department of Comupter Science, University of Oxford, Oxford, .

E-mail: trimite un mesaj.

Pagina web a instituţiei: http://www.cs.ox.ac.uk/people/traian.abrudan/
Pagina web personala: http://signal.hut.fi/~tabrudan/

Nascut(a) in: 1976

Interese: comunicatii radio, procesare statistica de semnale (de la seznori multipli), estimare de parametri, metosde de optimizare numerica, pozitionare bazata pe unde radio

flag Detalii:
Traian E. Abrudan a obtinut titlul de Doctor (cu distinctie) de la Universitea Aalto, Finlanda (cunoscuta anterior ca Universitatea de Tehnologie din Helsinki) in anul 2008, si titlul de Master de la Universtitatea Tehnica din Cluj-Napoca, Romania in anul 2000. Intre anii 2001-2010, a fost membru SMARAD (SMArt and Novel RADios Research Unit) care a fost nominalizata ca Centru de Excelenta de catre Academia Finlandei. In 2004. si 2006 respectiv, a obtinut grantul Nokia. In perioada 2010-2013 a fost cercetator post-doctoral la Institutul de Telecomunicatii (IT), Facultatea de Inginerie, Universitatea din Porto (FEUP), Portugalia. Din Octombrie 2013, lucreaza la Departamentul de Informatica, Universitatea din Oxford. Ariile sale de cercetare includ: estimarea parametrilor, optimizarea numerica, procesarea statistica de semnale aplicata la retelele radio, precum si sustemele de navigare.

flag Details:
Traian E. Abrudan received the D.Sc. degree (with honors) from Aalto University, Finland (formerly known as Helsinki University of Technology) in 2008, and the M.Sc. degree from the Technical University of Cluj-Napoca, Romania in 2000, respectively. During 2001-2010, he was a member of SMARAD (SMArt and Novel RADios Research Unit) which has been selected as Center of Excellence in research by The Academy of Finland. He was awarded with Nokia Scholarship in 2004 and 2006, respectively. During 2010-2013, he was a postdoctoral researcher at Instituto de Telecomunicacões (IT) Porto, Faculty of Engineering, University of Porto (FEUP), Portugal. Since October 2013, he is with the Department of Computer Science, University of Oxford. His current research interests include parameter estimation, numerical optimization and statistical signal processing applied to wireless communication networks, as well as localization and navigation systems.

Publicații selectate:

* D. Kapetanovic, F. Rusek, T. E. Abrudan, V. Koivunen, Construction of Minimum Euclidean Distance MIMO Precoders and Their Lattice Classifications, IEEE, IEEE Transactions on Signal Processing, 60 (8), 2012.

* L. Oliveira, Hongbin Li, L. Almeida, T. E. Abrudan, RSSI-based Relative Localisation for Mobile Robots, Elsevier, Ad Hoc Networks (Elsevier), 2013.

* T. E. Abrudan, A. Haghparast, V. Koivunen, Time synchronization and ranging in OFDM systems using time-reversal, IEEE, IEEE Transactions on Instrumentation and Measurement, PP, 2013.

* T. Abrudan, V. Koivunen, Blind equalization in spatial multiplexing MIMO-OFDM systems based on vector CMA and decorrelation criteria, Springer, Wireless Personal Communications (Springer), 43, 2007.

* T. Abrudan, J. Eriksson, V. Koivunen, Conjugate gradient algorithm for optimization under unitary matrix constraint, Elsevier, Signal Processing (Elsevier), 89, 2009.

* T. Abrudan and J. Eriksson and V. Koivunen, Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint, IEEE, IEEE Transactions on Signal Processing, 56(3), 2008.