activity
20132021
most citedMassive MIMO Adaptive Modulation and Coding Using Online Deep Learning Algorithm

42 citations · 63 across the 9 of their papers we have counts for

collaborators

9 papers

cs.IT2021★ 3 cited

Study on Precoding Optimization Algorithms in Massive MIMO System with Multi-Antenna Users

Evgeny Bobrov, Dmitry Kropotov, Sergey Troshin +1

The paper studies the multi-user precoding problem as a non-convex optimization problem for wireless multiple input and multiple output (MIMO) systems. In our work, we approximate…

cs.IT2021

Adaptive Regularized Zero-Forcing Beamforming in Massive MIMO with Multi-Antenna Users

Evgeny Bobrov, Boris Chinyaev, Viktor Kuznetsov +5

Modern wireless cellular networks use massive multiple-input multiple-output (MIMO) technology. This technology involves operations with an antenna array at a base station that sim…

cs.NI2021★ 42 cited

Massive MIMO Adaptive Modulation and Coding Using Online Deep Learning Algorithm

Evgeny Bobrov, Dmitry Kropotov, Hao Lu +1

The paper describes an online deep learning algorithm (ODL) for adaptive modulation and coding in massive MIMO. The algorithm is based on a fully connected neural network, which is…

math.OA2016★ 1 cited

On some topics of analysis on noncommutative spaces

Danila Zaev

We consider a conservative Markov semigroup on a semi-finite -algebra. It is known that under some reasonable assumptions it is enough to determine a kind of differential stru…

math.PR2015★ 1 cited

Exchangeable optimal transportation and log-concavity

Alexander V. Kolesnikov, Danila A. Zaev

We study the Monge and Kantorovich transportation problems on within the class of exchangeable measures. With the help of the de Finetti decomposition theorem…

math.OA2015★ 1 cited

-Wasserstein distances on state and quasi-state spaces of -algebras

Danila Zaev

We construct an analogue of the classical -Wasserstein distance for the state space of a -algebra. Given an abstract Lipschitz gauge on a -algebra in t…

math.PR2015

Decomposition of the Kantorovich problem and Wasserstein distances on simplexes

Danila Zaev

Let be a Polish space, be the set of Borel probability measures on , and be a homeomorphism. We prove that for the simplex $\mathrm{Dom} \s…

math.FA2014★ 4 cited

On the Monge-Kantorovich problem with additional linear constraints

Danila Zaev

We consider the modified Monge-Kantorovich problem with additional restriction: admissible transport plans must vanish on some fixed functional subspace. Different choice of the su…

math.FA2013★ 11 cited

Optimal transportation of processes with infinite Kantorovich distance. Independence and symmetry

Alexander V. Kolesnikov, Danila A. Zaev

We consider probability measures on and study optimal transportation mappings for the case of infinite Kantorovich distance. Our examples include 1) quasi-pro…