Ragnar Thobaben

Prof. Dr. Ragnar Thobaben

orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 February 2019 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
HFHenrik Forssell
Henrik Forssell
RTRagnar Thobaben
Ragnar Thobaben
HAHussein Al-Zubaidy
Hussein Al-Zubaidy
JGJames Gross
James Gross

14 January 2020 in Entropy
Verified
Journal Article
Open access
PDF file
BGBorja Rodríguez Gálvez
Borja Rodríguez Gálvez
RTRagnar Thobaben
Ragnar Thobaben
MSMikael Skoglund
Mikael Skoglund
The information bottleneck (IB) problem tackles the issue of obtaining relevant compressed representations T of some random variable X for the task of predicting Y. It is defined as a constrained optimization problem that maximizes the information the representation has about the task, I ( T ; Y ) , while ensuring that a certain level of compression r is achieved (i.e., I ( X ; T ) ≤ r ). For practical reasons, the problem is usually solved by maximizing the IB Lagrangian (i.e., L IB ( T ; β ) = I ( T ; Y ) − β I ( X ; T ) ) for many values of β ∈ [ 0 , 1 ] . Then, the curve of maximal I ( T ; Y ) for a given I ( X ; T ) is drawn and a representation with the desired predictability and compression is selected. It is known when Y is a deterministic function of X, the IB curve cannot be explored and another Lagrangian has been proposed to tackle this problem: the squared IB Lagrangian: L sq − IB ( T ; β sq ) = I ( T ; Y ) − β sq I ( X ; T ) 2 . In this paper, we (i) present a general family of Lagrangians which allow for the exploration of the IB curve in all scenarios; (ii) provide the exact one-to-one mapping between the Lagrange multiplier and the desired compression rate r for known IB curve shapes; and (iii) show we can approximately obtain a specific compression level with the convex IB Lagrangian for both known and unknown IB curve shapes. This eliminates the burden of solving the optimization problem for many values of the Lagrange multiplier. That is, we prove that we can solve the original constrained problem with a single optimization.

13 April 2021 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
HFHenrik Forssell
Henrik Forssell
RTRagnar Thobaben
Ragnar Thobaben
Feature-based physical layer authentication (PLA) schemes, using position-specific channel characteristics as identifying features, can provide lightweight protection against impersonation attacks in overhead-limited applications like e.g., mission-critical and low-latency scenarios. However, with PLA-aware attack strategies, an attacker can maximize the probability of successfully impersonating the legitimate devices. In this paper, we provide worst-case detection performance bounds under such strategies for a distributed PLA scheme that is based on the channel-state information (CSI) observed at multiple distributed remote radio-heads. This distributed setup exploits the multiple-channel diversity for enhanced detection performance and mimics distributed antenna architectures considered for 4G and 5G radio access networks. We consider (i) a power manipulation attack, in which a single-antenna attacker adopts optimal transmit power and phase; and (ii) an optimal spatial position attack. Interestingly, our results show that the attacker can achieve close-to-optimal success probability with only statistical CSI, which significantly strengthens the relevance of our results for practical scenarios. Furthermore, our results show that, by distributing antennas to multiple radio-heads, the worst-case missed detection probability can be reduced by 4 orders of magnitude without increasing the total number of antennas, illustrating the superiority of distributed PLA over a co-located antenna setup.

1 December 2021 in IEEE Transactions on Microwave Theory and Techniques
Verified
Journal Article
Open access
BMBoules A. Mouris
Boules A. Mouris
Armando Fernandez PrietoArmando Fernandez Prieto
Armando Fernandez Prieto
JRJose Luis Medran del Rio
Jose Luis Medran del Rio
RTRagnar Thobaben
Ragnar Thobaben
Jesús MartelJesús Martel
Jesús Martel
Oscar Quevedo-TeruelOscar Quevedo-Teruel
Oscar Quevedo-Teruel
In this article, we present a novel application of glide symmetry to differential lines with common-mode (CM) rejection filter properties. Two different topologies are investigated. First, glide symmetry is applied to a pair of differential lines where ground-connected mushrooms are employed as a CM rejection structure. The same idea is also used in a pair of differential lines where defective ground structures are introduced to stop the CM propagation. It is demonstrated that the CM rejection bandwidth is drastically increased when glide symmetry is exploited in both topologies when compared with their corresponding structures without glide symmetry. Furthermore, we show that the differential-mode propagation is hardly affected by the use of glide symmetry, ensuring the good integrity of the transmitted information. Experimental demonstration for both mushroom and defected ground structure is provided. Good agreement between simulations and measurements results is observed.

4 March 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
BMBoules A. Mouris
Boules A. Mouris
PSPhotios Stavrou
Photios Stavrou
RTRagnar Thobaben
Ragnar Thobaben
Power consumption is a major challenge for massive deployment of wireless sensors in internet of things (IoT) networks. This paper studies the use of analog joint source-channel (AJSCC) mappings in low-power sensing schemes. In particular, we propose a novel triangular mapping geometry as a low-complexity dimension reduction mapping. The proposed triangular mapping is employed for analog compression of multiple sensor readings into one signal, and thus, limits the need for power-hungry analog-to-digital conversion and processing at the sensing nodes. A comprehensive performance analysis of the proposed triangular mapping in terms of the mean squared error (MSE) performance is provided analytically and verified numerically. The problem of mapping adaptation to different source distributions is also studied. Moreover, the proposed triangular mapping is adopted in an energy scheduling problem in which the sensing nodes schedule their use of the received powers at different time instants and adjust the mapping parameters accordingly with the goal of minimizing the sum distortion at the receiver. We present a fast low-complexity algorithm for optimal energy scheduling and verify its performance in comparison with commercial convex optimization solvers. It is shown that the proposed mapping provides a very good MSE performance compared to the AJSCC benchmarks despite having a much lower complexity circuit implementation.

5 May 2014 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
RBRicardo Blasco-Serrano
Ricardo Blasco-Serrano
DZDave Zachariah
Dave Zachariah
DSDennis Sundman
Dennis Sundman
RTRagnar Thobaben
Ragnar Thobaben
MSMikael Skoglund
Mikael Skoglund
We consider the problem of estimating sparse vectors from noisy linear measurements in the high dimensionality regime. For a fixed number k of nonzero entries, we study the fundamental relationship between two relevant quantities: the measurement rate, which characterizes the asymptotic behavior of the dimensions of the measurement matrix in terms of the ratio m/log n (with m being the number of measurements and n the dimension of the sparse vector), and the estimation mean square error. First, we use an information-theoretic approach to derive sufficient conditions on the measurement rate to reliably recover a part of the support set that represents a certain fraction of the total vector power. Second, we characterize the mean square error of an estimator that uses partial support set information. Using these two parts, we derive a tradeoff between the measurement rate and the mean-square error. This tradeoff is achievable using a two-step approach: first support set recovery, and then estimation of the active components. Finally, for both deterministic and random vectors, we perform a numerical evaluation to verify the advantages of the methods based on partial support set recovery.