Klaus Witrisal

Prof. Klaus Witrisal

orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
4 September 2019 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
ELErik Leitinger
Erik Leitinger
FMFlorian Meyer
Florian Meyer
FHFranz Hlawatsch
Franz Hlawatsch
KWKlaus Witrisal
Klaus Witrisal
FTFredrik Tufvesson
Fredrik Tufvesson
MWMoe Z. Win
Moe Z. Win
We present a simultaneous localization and mapping (SLAM) algorithm that is based on radio signals and the association of specular multipath components (MPCs) with geometric features. Especially in indoor scenarios, robust localization from radio signals is challenging due to diffuse multipath propagation, unknown MPC-feature association, and limited visibility of features. In our approach, specular reflections at flat surfaces are described in terms of virtual anchors (VAs) that are mirror images of the physical anchors (PAs). The positions of these VAs and possibly also of the PAs are unknown. We develop a Bayesian model of the SLAM problem and represent it by a factor graph, which enables the use of belief propagation (BP) for efficient marginalization of the joint posterior distribution. The resulting BP-based SLAM algorithm detects the VAs associated with the PAs and estimates jointly the time-varying position of the mobile agent and the positions of the VAs and possibly also of the PAs, thereby leveraging the MPCs in the radio signal for improved accuracy and robustness of agent localization. The algorithm has a low computational complexity and scales well in all relevant system parameters. Experimental results using both synthetic measurements and real ultra-wideband radio signals demonstrate the excellent performance of the algorithm in challenging indoor environments.

21 October 2020 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
FWFuxi Wen
Fuxi Wen
JKJosef Kulmer
Josef Kulmer
KWKlaus Witrisal
Klaus Witrisal
HWHenk Wymeersch
Henk Wymeersch
5G mmWave communication is useful for positioning due to the geometric connection between the propagation channel and the propagation environment. Channel estimation methods can exploit the resulting sparsity to estimate parameters (delay and angles) of each propagation path, which in turn can be exploited for positioning and mapping. When paths exhibit significant spread in either angle or delay, these methods break down or lead to significant biases. We present a novel tensor-based method for channel estimation that allows estimation of mmWave channel parameters in a non-parametric form. The method is able to accurately estimate the channel, even in the absence of a specular component. This in turn enables positioning and mapping using only diffuse multipath. Simulation results are provided to demonstrate the efficacy of the proposed approach.

29 February 2024 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Open access
SGStefan Grebien
Stefan Grebien
ELErik Leitinger
Erik Leitinger
KWKlaus Witrisal
Klaus Witrisal
BFBernard H. Fleury
Bernard H. Fleury
In this paper, we present an iterative algorithm that detects and estimates the specular components (SCs) and estimates the dense component (DC) of single-input—multiple-output (SIMO) ultra-wide-band (UWB) multipath channels. Specifically, the algorithm super-resolves the SCs in the delay–angle-of-arrival domain and estimates the parameters of a parametric model of the delay-angle power spectrum characterizing the DC. Channel noise is also estimated. In essence, the algorithm solves the problem of estimating spectral lines (the SCs) in colored noise (generated by the DC and channel noise). Its design is inspired by the sparse Bayesian learning (SBL) framework. As a result the iteration process contains a threshold condition that determines whether a candidate SC shall be retained or pruned. By relying to results from extreme-value analysis the threshold of this condition is suitably adapted to ensure a prescribed probability of detecting spurious SCs. Studies using synthetic and real channel measurement data demonstrate the virtues of the algorithm: it is able to still detect and accurately estimate SCs, even when their separation in delay and angle is down to half the Rayleigh resolution limit (RRL) of the equipment; it is robust in the sense that it tends to return no more SCs than the actual ones. Finally, the algorithm is demonstrated to outperform a state-of-the-art super-resolution channel estimator in terms of robustness in the estimation of the amplitudes of specular components closely spaced in the dispersion domain.

12 January 2018 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
JKJosef Kulmer
Josef Kulmer
ELErik Leitinger
Erik Leitinger
SGStefan Grebien
Stefan Grebien
KWKlaus Witrisal
Klaus Witrisal
Highly accurate location information is a key facilitator to stimulate future services for the commercial and public sectors. Positioning and tracking of absolute positions of wireless nodes usually requires information provided from technical infrastructure, e.g. satellites or fixed anchor nodes, whose maintenance is costly and whose limited operating coverage narrows the positioning service. In this paper we present an algorithm aiming at tracking of absolute positions without using information from fixed anchors, odometers or inertial measurement units. We perform radio channel measurements in order to exploit position-related information contained in multipath components (MPCs). Tracking of the absolute node positions is enabled by estimation of MPC parameters followed by association of these parameters to a floorplan. To account for uncertainties in the floorplan and for propagation effects like diffraction and penetration, we recursively update the provided floorplan using the measured MPC parameters. We demonstrate the ability to localize two agent nodes without the employment of further infrastructure, using data from ultra-wideband channel measurements. Further, we show the potential performance gain if also one fixed anchor is available and we validate the algorithm for a range of different signal bandwidths and number of nodes.

14 June 2023 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Open access
AVAlexander Venus
Alexander Venus
ELErik Leitinger
Erik Leitinger
STStefan Tertinek
Stefan Tertinek
KWKlaus Witrisal
Klaus Witrisal
This paper presents a factor graph formulation and particle-based sum-product algorithm (SPA) for robust sequential localization in multipath-prone environments. The proposed algorithm jointly performs data association, sequential estimation of a mobile agent position, and adapts all relevant model parameters. We derive a novel non-uniform false alarm (FA) model that captures the delay and amplitude statistics of the multipath radio channel. This model enables the algorithm to indirectly exploit position-related information contained in the multipath components (MPCs) for the estimation of the agent position without using any prior information such as floorplan information or training data. Using simulated and real measurements in different channel conditions, we demonstrate that the algorithm can provide high-accuracy position estimates even in fully obstructed line-of-sight (OLOS) situations and show that the performance of our algorithm constantly attains the posterior Cramér-Rao lower bound (P-CRLB), facilitating the additional information contained in the presented FA model. The algorithm is shown to provide robust estimates in both, dense multipath channels as well as channels showing specular, resolved MPCs, significantly outperforming state-of-the-art radio-based localization methods.

25 January 2023 in IEEE Transactions on Signal and Information Processing over Networks
Verified
Journal Article
Closed access
LWLukas Wielandner
Lukas Wielandner
ELErik Leitinger
Erik Leitinger
FMFlorian Meyer
Florian Meyer
KWKlaus Witrisal
Klaus Witrisal
Cooperative localization (CL) is an important technology for innovative services such as location-aware communication networks, modern convenience, and public safety. We consider wireless networks with mobile agents that aim to localize themselves by performing pairwise measurements amongst agents and exchanging their location information. Belief propagation (BP) is a state-of-the-art Bayesian method for CL. In CL, particle-based implementations of BP often are employed that can cope with non-linear measurement models and state dynamics. However, particle-based BP algorithms are known to suffer from particle degeneracy in large and dense networks of mobile agents with high-dimensional states. This paper derives the messages of BP for CL by means of particle flow, leading to the development of a distributed particle-based message-passing algorithm which avoids particle degeneracy. Our combined particle flow-based BP approach allows the calculation of highly accurate proposal distributions for agent states with a minimal number of particles. It outperforms conventional particle-based BP algorithms in terms of accuracy and runtime. Furthermore, we compare the proposed method to a centralized particle flow-based implementation, known as the exact Daum-Huang filter, and to sigma point BP in terms of position accuracy, runtime, and memory requirement versus the network size. We further contrast all methods to the theoretical performance limit provided by the posterior Cramér-Rao lower bound (PCRLB). Based on three different scenarios, we demonstrate the superiority of the proposed method.