Moritz Wiese’s research while affiliated with Technical University of Munich and other places

We experimentally investigate the performance of semantically-secure physical layer security (PLS) in 5G new radio (NR) mmWave communications during the initial cell search procedure in the NR band n257 at 27 GHz. A gNB transmits PLS-encoded messages in the presence of an eavesdropper, who intercepts the communication by non-intrusively collecting channel readings in the form of IQ samples. For the message transmission, we use the physical broadcast channel (PBCH) within the synchronization signal block. We analyze different signal-to-noise ratio (SNR) conditions by progressively reducing the transmit power of the subcarriers carrying the PBCH channel, while ensuring optimal conditions for over-the-air frequency and timing synchronization. We measure the secrecy performance of the communication in terms of upper and lower bounds for the distinguishing error rate (DER) metric for different SNR levels and beam angles when performing beamsteering in indoor scenarios, such as office environments and laboratory settings.

This paper introduces a novel approach to enhance the performance of UAV-enabled integrated sensing and communication (ISAC) systems. By integrating uniform planar arrays (UPAs) and modeling the UAV as a rigid body using SE(3), the study addresses key challenges in existing ISAC frameworks, such as rigid-body dynamics and trajectory design. We propose a target tracking scheme based on extended Kalman filtering (EKF) in SE(3) and trajectory optimization from a control signal design perspective, leveraging the conditional Posterior Cramer-Rao bound (CPCRB) to optimize performance. Numerical results demonstrate the effectiveness of the proposed method in improving target tracking and trajectory optimization for a UAV-enabled MIMO-OFDM ISAC system.

We consider a standard two-source model for uniform common randomness (UCR) generation, in which two terminals (Terminal A and Terminal B) observe independent and identically distributed (i.i.d.) samples of a correlated finite source, and where Terminal A is allowed to send information to Terminal B over an arbitrary single-user channel. We provide a general theoretical framework, from which the proofs of a general formula for the UCR capacity and general bounds on the ϵ-UCR capacity of the specified model follow as special cases. The UCR capacity is defined as the maximum achievable CR rate such that the two terminals can agree on a common uniform or nearly uniform random variable with probability arbitrarily close to one, whereas the ϵ-UCR capacity is defined as the maximum CR rate that can be achieved such that the probability that the two terminals do not agree on a common uniform or nearly uniform random variable does not exceed ϵ, where 0 < ϵ < 1 is fixed. The established general formula for the UCR capacity depends on a formula characterizing the transmission capacity of arbitrary point-to-point channels, as elaborated by Verdú and Han. The derived general lower and upper bounds on the ϵ- UCR capacity depend on corresponding lower and upper bounds on the ϵ-transmission capacity, as proved by Verdú and Han for arbitrary point-to-point channels. Since we are considering general channels, the derived bounds are equal except possibly for at most countably many points, where discontinuity issues might arise. We further provide two examples of channels for which the established bounds are equal and investigate the left-continuity and monotonicity of the derived lower bound.

We introduce, motivate and study $\varepsilon$ ε -almost collision-flat universal (ACFU) hash functions $f:\mathcal X\times \mathcal S\rightarrow \mathcal A$ f : X × S → A . Their main property is that the number of collisions in any given value is bounded. Each $\varepsilon$ ε -ACFU hash function is an $\varepsilon$ ε -almost universal (AU) hash function, and every $\varepsilon$ ε -almost strongly universal (ASU) hash function is an $\varepsilon$ ε -ACFU hash function. We study how the size of the seed set $\mathcal S$ S depends on $\varepsilon ,|\mathcal X |$ ε , | X | and $|\mathcal A |$ | A | . Depending on how these parameters are interrelated, seed-minimizing ACFU hash functions are equivalent to mosaics of balanced incomplete block designs (BIBDs) or to duals of mosaics of quasi-symmetric block designs; in a third case, mosaics of transversal designs and nets yield seed-optimal ACFU hash functions, but a full characterization is missing. By either extending $\mathcal S$ S or $\mathcal X$ X , it is possible to obtain an $\varepsilon$ ε -ACFU hash function from an $\varepsilon$ ε -AU hash function or an $\varepsilon$ ε -ASU hash function, generalizing the construction of mosaics of designs from a given resolvable design (Gnilke et al. in Des. Codes Cryptogr. 86(1):85–95, 2017). The concatenation of an ASU and an ACFU hash function again yields an ACFU hash function. Finally, we motivate ACFU hash functions by their applicability in privacy amplification.

Over the past decades, the problem of communication over finite-state Markov channels (FSMCs) has been investigated in many works and the capacity of FSMCs has been studied in closed form under the assumption of the availability of partial/complete channel state information at the sender and/or the receiver. In our work, we focus on infinite-state Markov channels by investigating the problem of message transmission over time-varying single-user multiple-input multiple-output (MIMO) Gauss-Markov Rayleigh fading channels, as an example of MIMO ergodic Rayleigh fading channels, with average power constraint and with complete channel state information available at the receiver side (CSIR). We prove a single-letter formula for the channel capacity and in particular the formula pointed out by Telatar for the channel capacity of MIMO ergodic Rayleigh fading channels for the case when the Gaussian noise is uncorrelated across antennas.