activity
20182021
most citedIntelligent Reflecting Surface Operation under Predictable Receiver Mobility: A Continuous Time Propagation Model

87 citations · 87 across the 3 of their papers we have counts for

collaborators

10 papers

cs.NI2021

Inter-Plane Inter-Satellite Connectivity in LEO Constellations: Beam Switching vs. Beam Steering

Israel Leyva-Mayorga, Maik Röper, Bho Matthiesen +3

Low Earth orbit (LEO) satellite constellations rely on inter-satellite links (ISLs) to provide global connectivity. However, one significant challenge is to establish and maintain…

cs.IT2021

Hierarchical Resource Allocation: Balancing Throughput and Energy Efficiency in Wireless Systems

Bho Matthiesen, Eduard A. Jorswieck, Petar Popovski

A main challenge of 5G and beyond wireless systems is to efficiently utilize the available spectrum and simultaneously reduce the energy consumption. From the radio resource alloca…

cs.IT2021

Globally Optimal Beamforming for Rate Splitting Multiple Access

Bho Matthiesen, Yijie Mao, Petar Popovski +1

We consider globally optimal precoder design for rate splitting multiple access in Gaussian multiple-input single-output downlink channels with respect to weighted sum rate and ene…

cs.IT202087 cited

Intelligent Reflecting Surface Operation under Predictable Receiver Mobility: A Continuous Time Propagation Model

Bho Matthiesen, Emil Björnson, Elisabeth De Carvalho +1

The operation of an intelligent reflecting surface (IRS) under predictable receiver mobility is investigated. We develop a continuous time system model for multipath channels and d…

cs.NI2019

LEO Small-Satellite Constellations for 5G and Beyond-5G Communications

Israel Leyva-Mayorga, Beatriz Soret, Maik Röper +4

The next frontier towards truly ubiquitous connectivity is the use of Low Earth Orbit (LEO) small-satellite constellations to support 5G and Beyond-5G (B5G) networks. Besides enhan…

cs.IT2019

Mixed Monotonic Programming for Fast Global Optimization

Bho Matthiesen, Christoph Hellings, Eduard A. Jorswieck +1

While globally optimal solutions to many convex programs can be computed efficiently in polynomial time, this is, in general, not possible for nonconvex optimization problems. Ther…