SearcharxivSearch

arXiv subjects

Christian Scheunert

Publications and source records attributed to Christian Scheunert.

4 recordsLinked to original sources

Closed-form Solution of Wahba's Problem for Pairwise Similar Quaternions

Wahba's problem is fundamental to spacecraft attitude estimation, seeking the optimal rotation that minimizes the weighted misalignment between sets of vector observations. Traditional solvers, including Davenport's $q$-method, QUEST, and ESOQ, reformulate the problem as an eigenvalue task for a $4 \times 4$ symmetric matrix, a process that obscures the underlying algebraic structure of the solution. This paper presents a novel, entirely quaternion-based closed-form solution for the pairwise similar quaternions. By establishing a direct connection to the homogeneous singular Sylvester equation: (i) we derive the necessary and sufficient condition for the existence of a quaternion that achieves zero Wahba's cost; (ii) we provide a closed-form analytic expression for the corresponding solution set; and (iii) we propose the computationally efficient and numerically stable Minimal Analytic Rotation Algorithm (MARA). Computational complexity analysis demonstrates that MARA achieves a $35.11\%$ reduction in total floating-point operations (FLOPs) compared to the state-of-the-art ESOQ2 algorithm. Numerical validation via $10^6$ Monte Carlo trials confirms that MARA achieves higher accuracy than established optimal solvers under stochastic noise, offering a computationally more efficient and analytically transparent alternative for high-frequency attitude determination systems.

math.RA

On solutions of singular Sylvester equations in quaternions

The quaternionic equations ax-xb=0 and ax-xb=c are investigated, which are called homogeneous and inhomogeneous Sylvester equations, respectively. Conditions for the existence of solutions are provided. In addition, the general and nonzero solutions to these equations are derived applying quaternion square roots.

math.RA

An Overview of the NET Playground -- A Heterogeneous, Multi-Functional Network Test Bed

This paper provides an overview of the hardware and software components used in our test bed project the NET Playground. All source information is stored in the GitLab repository (https://gitlab.com/Paulteck/net-playground). In the Hardware section, we present sketches and 3D views of mechanical parts and technical drawings of printed boards. The Software section discusses relay control using shell scripts and the utilization of Ansible for automation. We also introduce a C++ framework for connecting with the INA231 energy sensor. This paper serves as a reference for understanding and replicating our project's hardware and software components.

eess.SY

Weak Secrecy in the Multi-Way Untrusted Relay Channel with Compute-and-Forward

We investigate the problem of secure communications in a Gaussian multi-way relay channel applying the compute-and-forward scheme using nested lattice codes. All nodes employ half-duplex operation and can exchange confidential messages only via an untrusted relay. The relay is assumed to be honest but curious, i.e., an eavesdropper that conforms to the system rules and applies the intended relaying scheme. We start with the general case of the single-input multiple-output (SIMO) L-user multi-way relay channel and provide an achievable secrecy rate region under a weak secrecy criterion. We show that the securely achievable sum rate is equivalent to the difference between the computation rate and the multiple access channel (MAC) capacity. Particularly, we show that all nodes must encode their messages such that the common computation rate tuple falls outside the MAC capacity region of the relay. We provide results for the single-input single-output (SISO) and the multiple-input single-input (MISO) L-user multi-way relay channel as well as the two-way relay channel. We discuss these results and show the dependency between channel realization and achievable secrecy rate. We further compare our result to available results in the literature for different schemes and show that the proposed scheme operates close to the compute-and-forward rate without secrecy.

cs.IT