Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Andrei-Alexandru Enescu"'
Autor:
Camelia Elisei-Iliescu, Laura-Maria Dogariu, Constantin Paleologu, Jacob Benesty, Andrei-Alexandru Enescu, Silviu Ciochină
Publikováno v:
Algorithms, Vol 13, Iss 6, p 135 (2020)
High-dimensional system identification problems can be efficiently addressed based on tensor decompositions and modelling. In this paper, we design a recursive least-squares (RLS) algorithm tailored for the identification of trilinear forms, namely R
Externí odkaz:
https://doaj.org/article/cd52dd4e61344ea9af2807e74ce7037a
Publikováno v:
Algorithms, Vol 12, Iss 7, p 146 (2019)
Multi-User (MU) Multiple-Input-Multiple-Output (MIMO) systems have been extensively investigated over the last few years from both theoretical and practical perspectives. The low complexity Linear Precoding (LP) schemes for MU-MIMO are already deploy
Externí odkaz:
https://doaj.org/article/b041861b0cee426f8355319ab3796421
Autor:
Andrei Alexandru Enescu, Silviu Ciochina, Constantin Paleologu, Laura-Maria Dogariu, Jacob Benesty, Camelia Elisei-Iliescu
Publikováno v:
Algorithms, Vol 13, Iss 135, p 135 (2020)
Algorithms
Volume 13
Issue 6
Algorithms
Volume 13
Issue 6
High-dimensional system identification problems can be efficiently addressed based on tensor decompositions and modelling. In this paper, we design a recursive least-squares (RLS) algorithm tailored for the identification of trilinear forms, namely R
Publikováno v:
2018 International Symposium on Electronics and Telecommunications (ISETC).
Linear Precoding (LP) schemes are already used in Long Term Evolution (LTE) Multi-User Multiple-Input-Multiple-Output (MU-MIMO) systems. They have low complexity but do not work well in strongly correlated channels, i.e., for closely separated users.
Publikováno v:
EUSIPCO
The emerging 5G mobile communication standard aims to increase the throughput and, in the same time, to considerably increase the number of users serviced concurrently (Internet of Things). The key direction for achieving these requirements is to hea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b1c2c2125e8a1149a7eb3aacb54f610f
Publikováno v:
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering ISBN: 9783319922126
FABULOUS
FABULOUS
With 3GPP 5G new radio (NR), proposals are already being discussed. Although participants offer various suggestions for the first 5G standardization, common ideas can already be identified. The purpose of the paper is to anticipate, in the context of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::22942e0f19ca8bf79c4ee52f8848cfe0
https://doi.org/10.1007/978-3-319-92213-3_5
https://doi.org/10.1007/978-3-319-92213-3_5
Publikováno v:
TSP
Considering the upcoming future generation of mobile communication standards, Multi-User Massive MIMO (MU-MMIMO) is a well-known method of increasing the overall cell throughput. Such a scenario suffers from a high computational complexity because of
Publikováno v:
2016 12th IEEE International Symposium on Electronics and Telecommunications (ISETC).
Next generation of 5G mobile communications heavily relies on exploiting the spatial degrees of freedom of the radio channels. For this reason, the idea of having base stations (BSs) with a large number of antennas is currently one of the main resear
Publikováno v:
2016 12th IEEE International Symposium on Electronics and Telecommunications (ISETC).
Next generation of mobile communications (5G) comes with high throughput demands (up to more than 10 Gbps). From a radio access point of view, this requires using spatial multiplexing techniques that allow reaching these rates and are suitable for ca
Publikováno v:
2016 International Conference on Communications (COMM).
One of the main areas of research for the next generation of mobile communications (5G) is the concept of Massive MIMO, which implies using base stations that employ a considerably larger number of antennas than the classic MIMO systems (tens or even