Filetype
With the rapid growth of mobile communication systems, massive multiple-input multiple-output (MIMO) technology plays a key role in enhancing communication systems to meet growing data traffic demands. However, scaling the technology further challenges the system designers to balance design tradeoffs in order to provide efficient and low-cost communication systems. This requires efficient hardware
The first WARA Robotics Mobile Manipulation Challenge, held in December 2024 at ABB Corporate Research in Vasteras, Sweden, addressed the automation of task-intensive and repetitive manual labor in laboratory environments - specifically the transport and cleaning of glassware. Designed in collaboration with AstraZeneca, the challenge invited academic teams to develop autonomous robotic systems cap
During the last two decades, an active line of research in proof complexity has been into the space complexity of proofs and how space is related to other measures. By now these aspects of the resolution proof system are fairly well understood, but many open problems remain for the related but stronger proof system polynomial calculus (PC/PCR). For instance, the space complexity of many standard “
We prove the first hardness results against efficient proof search by quantum algorithms. We show that underLearning with Errors (LWE), the standard lattice-based cryptographic assumption, no quantum algorithm can weaklyautomate TC0-Frege. This extends the line of results of Krajííček and Pudlík(Information and Computation, 1998), Bonet, Pitassi, and Raz (SIAM Journal on Computing, 2000),and Bonet
We study the problem of estimating the semi-generalized pose of a partially calibrated camera, i.e., the pose of a perspective camera with unknown focal length w.r.t. a generalized camera, from a hybrid set of 2D-2D and 2D-3D point correspondences. We study all possible camera configurations within the generalized camera system. To derive practical solvers to previously unsolved challenging config
Consider discrete-time linear distributed averaging dynamics, whereby a finite number of agents in a network start with uncorrelated and unbiased noisy measurements of a common state of the world modeled as a scalar parameter, and iteratively update their estimates following a non-Bayesian learning rule. Specifically, let every agent update her estimate to a convex combination of her own current e
We train and compare the performance of two different machine learning algorithms to learn changes in winter wheat production for fields from the southwest of Sweden. As input to these algorithms, we use cloud-penetrating Sentinel-1 polarimetry radar data together with respective field topography and local weather over four different years. We note that all of the input data were freely available.
Systems that interact with the environment around them generally run some periodic tasks. This class of systems include, among others, embedded control systems. Embedded controllers have been proven vulnerable to various security attacks, including attacks that alter sensor and actuator data and attacks that disrupt the calculation of the control signals. In this paper, we propose, and implement,
In this paper, we present a heuristic method for adapting a networked linear feedback controller to improve its robustness to timing complications, such as long delays, aborted computations, and dropped packets. The core concept of the approach is to log successful sampling and actuation events and then, at discrete time-points, use non-convex parametric optimization to improve the expected perfor
Aquatic and terrestrial habitats are interdependent components of the boreal forest landscape involving multiple dynamic interactions; these are manifested particularly in riparian areas, which are key components in the forest landscape. However, this interdependence between aquatic and terrestrial habitats is not adequately accounted for in the current management of forest ecosystems. Here we rev
We consider a version of the Erdős–Rothschild problem for families of graph patterns. For any fixed k≥3, let r0(k) be the largest integer such that the following holds for all 2≤r≤r0(k) and all sufficiently large n: The Turán graph Tk−1(n) is the unique n-vertex graph G with the maximum number of r-edge-colorings such that the edge set of any copy of Kk in G is rainbow. We use the regularity lemma
The rapidly evolving domain of network systems poses complex challenges, especially when considering scalability and transient behaviors. This thesis aims to address these challenges by offering insights into the transient analysis and control design tailored for large-scale network systems. The thesis consists of three papers, each of which contributes to the overarching goal of this work.The fir
Phase-noise (PN) estimation and compensation are crucial in millimeter-wave (mmWave) communication systems to achieve high reliability. The PN estimation, however, suffers from high computational complexity due to its fundamental characteristics, such as spectral spreading and fast-varying fluctuations. In this paper, we propose a new framework for low-complexity PN compensation in orthogonal freq
Massive multiple-input multiple-out (MIMO) technology is vital in millimeter-wave (mmWave) bands to obtain large array gains. However, there are practical challenges, such as high hardware cost and power consumption in such systems. A promising solution to these problems is to adopt a hybrid beamforming architecture. This architecture has a much lower number of transceiver (TRx) chains than the to
A 2.2 mm2 full digital baseband SoC with four heterogeneous cores for 128-node 8-users distributed massive MIMO is presented. Two specialized DSPs perform rapid over-the-air synchronization within 0.1ms. A highly optimized 8-complex lane MIMO vector processor provides 4x hardware efficiency improvement over general-purpose processors. Circuit optimizations and the use of body-bias result in 1070 p
We investigate frugal splitting operators for finite sum monotone inclusion problems. These operators utilize exactly one direct or resolvent evaluation of each operator of the sum, and the splitting operator's output is dictated by linear combinations of these evaluations' inputs and outputs. To facilitate analysis, we introduce a novel representation of frugal splitting operators via a generaliz
This thesis presents five papers on minimax adaptive control and estimation. Minimax adaptive estimation is a framework for output prediction and state estimation that provides a priori computable performance bounds for esti- mators. Minimax adaptive controllers ensure that the closed loop has finite gain, maintaining stability and performance under model class uncertainty. The contributions of t
The problem of decoding random codes is a fundamental problem for code-based cryptography, including recent code-based candidates in the NIST post-quantum standardization process. In this paper, we present a novel Sieving-style Information-set Decoding algorithm, addressing the task of solving the syndrome decoding problem. Our approach involves maintaining a list of weight-2p solution vectors to
This is an undeniable fact now that wireless systems pervade all aspects of our lives. These systems are evolving at a rapid clip, connecting more people and devices every single day that goes by. This growth is further fueled by the users’ insatiable appetite for more traffic, be it for online gaming, watching high-fidelity video, downloading huge files, live- streaming and many more uses. With t
The Module Learning With Errors (MLWE)-based Key Encapsulation Mechanism (KEM) Kyber is NIST's new standard scheme for post-quantum encryption. As a building block, Kyber uses a Chosen Plaintext Attack (CPA)-secure Public Key Encryption (PKE) scheme, referred to as Kyber.CPAPKE. In this paper we study the robustness of Kyber.CPAPKE against key mismatch attacks.We demonstrate that Kyber's security
