RFRobert F. H. Fischer

Robert F. H. Fischer

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Robert F. H. Fischer has a total of 69 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Helper Data Schemes for Coded Modulation and Shaping in Physical Unclonable Functions

    by Robert F.H. Fischer

    We consider the generation and utilization of helper data for physical unclonable functions (PUFs) that provide real-valued, Gaussian distributed readout symbols. A coded modulation and signal shaping scheme that matches this distribution is employed, extracting more than one bit of entropy from each basic building block (PUF node). Compared to classical binary PUFs, longer keys/fingerprints are obtained and/or higher reliabilities (lower error ratios) are possible. A new helper data scheme is proposed that works with any type of coded modulation/shaping scheme. Compared to the permutation scheme known from the literature, in the conversion scheme, a smaller amount of helper data needs to be generated, yet a higher reliability is achieved. Additionally, the recently proposed idea of a two-metric helper data scheme is generalized to coded modulation and a general S-metric scheme. We demonstrate how to generate additional helper data to enhance decodability resulting in the desired lower word error ratios. The proposed schemes are assessed through numerical simulations and evaluation of measurement data. We compare multi-level codes employing a newly proposed rate design strategy with bit-interleaved coded modulation and trellis shaping with a distribution matcher. It is demonstrated that when selecting a suitable design, the rate per PUF node that can be reliably extracted can be as high as 2 bit/node.

  • Open Access

    Towards Detecting Climate Change Effects With UAV-Borne Imaging Radars

    by Ingrid Ullmann, Christina Bonfert, Alexander Grathwohl, Mohamed Amine Lahmeri, Victor Mustieles-Pérez, Julian Kanz, Elena Sterk, Frederik Bormuth, Roghayeh Ghasemi, Patrick Fenske, et al.

    Climate change is associated with a variety of environmental phenomena, such as the melting of glaciers, the drying out of crops and soils, and an increase in the risk of avalanches. To detect and monitor these changes, satellite-based radar imaging is widely used, as it enables the large-scale mapping of the Earth's surface independent of weather and sunlight. An emerging field of research is to use radar systems mounted on unmanned aerial vehicles (UAVs) for this purpose. UAV-borne radar systems image smaller areas, but can capture them in greater detail, more flexibly in terms of flight trajectory, and at shorter repetition intervals. This article presents the capabilities of UAV-based radar systems and the associated challenges in terms of system design and imaging techniques for detecting and monitoring the effects of climate change. Current research results are shown. In addition, we give an outlook on using a swarm of cooperative UAVs, each carrying a radar. UAV swarms will enable a higher imaging quality with respect to resolution and detectability, but at the same time come with a number of additional challenges, which will be discussed in the paper as well.


  • Open Access

    Helper Data Schemes for Coded Modulation and Shaping in Physical Unclonable Functions

    by Robert F. H. Fischer

    In this paper, we consider the generation and utilization of helper data for physical unclonable functions (PUFs) that provide real-valued readout symbols. Compared to classical binary PUFs, more entropy can be extracted from each basic building block (PUF node), resulting in longer keys/fingerprints and/or a higher reliability. To this end, a coded modulation and signal shaping scheme that matches the (approximately) Gaussian distribution of the readout has to be employed. A new helper data scheme is proposed that works with any type of coded modulation/shaping scheme. Compared to the permutation scheme from the literature, less amount of helper data has to be generated and a higher reliability is achieved. Moreover, the recently proposed idea of a two-metric helper data scheme is generalized to coded modulation and a general S-metric scheme. It is shown how extra helper data can be generated to improve decodability. The proposed schemes are assessed by numerical simulations and by evaluation of measurement data. We compare multi-level codes using a new rate design strategy with bit-interleaved coded modulation and trellis shaping with a distribution matcher. By selecting a suitable design, the rate per PUF node that can be reliably extracted can be as high as 2~bit/node.

  • Open Access

    Frequency-Domain Analysis of Reconfigured Incremental ΔΣ ADCs on the Example of the Exponential Phase

    by Paul Kaesser, Omar Ismail, Johannes Wagner, Robert F. H. Fischer, Maurits Ortmanns

    In this paper, analysis of linear time-variant systems is applied to incremental Delta-Sigma (I-DS) ADCs with periodic architectural reconfiguration in the frequency domain. The analysis will then be applied to the example of linear-exponential I-DS ADCs as a state-of-the-art dynamic reconfiguration technique. It is shown how a matched reconstruction filter of the reconfigured linear-exponential incremental Delta-Sigma modulator (I-DSM) can be mathematically derived. Using the calculated overall transfer functions of the linear-exponential I-DS ADC, accurate performance predictions can be given. The proposed method allows the accurate prediction of performances and gives insight and understanding of the performance improvements and trade-offs achieved by reconfiguration techniques in I-DS ADCs in general and the exponential phase in particular.


  • Open Access

    Coded Modulation and Shaping for Multivalued Physical Unclonable Functions

    by Robert F. H. Fischer, Sven Muelich

    In this paper, a coded modulation scheme employing signal shaping is proposed and designed for use in multi-valued physical unclonable functions (PUFs). In the literature, usually binary PUFs are considered, where less than one bit of entropy is extracted from each fundamental building block (PUF node). This randomness in the hardware may then be used for the derivation of cryptographic keys. Meanwhile, PUFs over higher-order alphabets, so-called multi-valued PUFs (MVPUFs) have been presented. Typically, symbols from a higher-order alphabet are extracted by suited quantization. In contrast, in this paper we propose a coded modulation scheme which directly works on the analog values provided by the PUF nodes. We establish an interpretation as digital transmission with randomness at the transmitter, and thereon calculate the respective capacities of bit levels for the Gaussian distributed reference PUF readout in additive Gaussian noise. In addition, the metric for optimum soft-decision decoding is derived. Thereby, the coded modulation scheme can be designed for the present situation. A helper data scheme adapted to the given situation is proposed and analyzed. Moreover, on top of the multilevel coding scheme, we employ signal shaping for the first time in the context of PUFs. In particular, trellis shaping is applied. By this, the coded modulation scheme can be perfectly matched to the PUF statistics. This is reflected by the results of conducted numerical simulations. High coding rates can be used, i.e., a large entropy per PUF node can be extracted, with very high reliabilities.


  • Design of Practical Scrambling Schemes for Physical-Layer Security

    by Johannes Pfeiffer, Robert F. H. Fischer

    In physical-layer security, coding and modulation are employed to prevent successful eavesdropping without the need for secret keys. Most promising coding approaches apply channel coding in combination with information-bit scrambling, which leads to error multiplication at the descrambling process. In this letter, the strategies of shift-register based scrambling and block-wise scrambling (using matrix multiplications) are assessed for a Gaussian wiretap channel scenario w.r.t. the security gap metric. We show that the former leads to an unequal protection of communicated message bits. This becomes apparent only upon the evaluation of individual bit positions’ error rates and security gaps. In contrast, the more general block scrambling enables schemes that provide equal protection. An optimized scrambling matrix design is presented, which yields the best error-rate performance. In addition to the theoretical examination of error propagation in the descrambling process, numerical results that combine low-density parity-check codes and scrambling support those findings.


  • Open Access

    Algorithms and Bounds for Complex and Quaternionic Lattices With Application to MIMO Transmission

    by Sebastian Stern, Cong Ling, Robert F. H. Fischer

    Lattices are a popular field of study in mathematical research, but also in more practical areas like cryptology or multiple-input/multiple-output (MIMO) transmission. In mathematical theory, most often lattices over real numbers are considered. However, in communications, complex-valued processing is usually of interest. Besides, by the use of dual-polarized transmission as well as by the combination of two time slots or frequencies, four-dimensional (quaternion-valued) approaches become more and more important. Hence, to account for this fact, well-known lattice algorithms and related concepts are generalized in this work. To this end, a brief review of complex arithmetic, including the sets of Gaussian and Eisenstein integers, and an introduction to quaternion-valued numbers, including the sets of Lipschitz and Hurwitz integers, are given. On that basis, generalized variants of two important algorithms are derived: first, of the polynomial-time LLL algorithm, resulting in a reduced basis of a lattice by performing a special variant of the Euclidean algorithm defined for matrices, and second, of an algorithm to calculate the successive minima—the norms of the shortest independent vectors of a lattice—and its related lattice points. Generalized bounds for the quality of the particular results are established and the asymptotic complexities of the algorithms are assessed. These findings are extensively compared to conventional real-valued processing. It is shown that the generalized approaches outperform their real-valued counterparts in complexity and/or quality aspects. Moreover, the application of the generalized algorithms to MIMO communications is studied, particularly in the field of lattice-reduction-aided and integer-forcing equalization.


  • Open Access

    A New Helper Data Scheme for Soft-Decision Decoding of Binary Physical Unclonable Functions

    by Robert F. H. Fischer, Sven Muelich

    Physical unclonable functions (PUFs) exploit randomness in the hardware for the derivation of cryptographic keys. In the literature, usually the readout is two-level quantized and hard-decision channel decoding is used to stabilize the extracted key. In this paper, we assess soft-decision decoding of binary PUFs. It is well known in the literature on channel coding that soft-decision decoding provides significant gains over hard-decision decoding since reliability information about the symbols is utilized. The PUF readout process is interpreted as digital transmission over a noisy channel, the respective capacity is calculated, and the optimum decoding metric is derived. In addition, we propose an augmented helper data scheme which is suited for soft-decision decoding. This scheme utilizes the fact that operations on the analog readout values are possible, opposed to operations on hard-decided binary symbols in classical PUFs. The security of the new scheme is proven and a possible realization is discussed. The performance is covered by numerical simulations and by applying the scheme to measurement data from FPGA implementations of ring oscillator PUFs.


  • Multilevel Coding for Physical-Layer Security

    by Johannes Pfeiffer, Robert F.H. Fischer

    In any transmission scheme, security against eavesdroppers is of importance. Contrary to classical encryption, security directly at the physical layer can be achieved by applying suited coding and modulation schemes. In this paper, coded modulation schemes, i.e., the use of higher-order constellations, is studied for generating both security against a wiretapper and reliability for the legitimate user. Specifically, a multilevel coding (MLC) scheme is considered. The influence of the constellation, in particular its cardinality and its dimensionality, on the gained security is assessed. As LSB component code, a practical secure coding scheme based on punctured LDPC codes is used. The security level for the employed LDPC code ensembles within MLC constructions is examined with an adapted density evolution technique. Results from numerical simulations cover the theoretical considerations and match with the derived asymptotic behavior. The results are compared to the situation when straightforwardly applying a binary code according to the BICM approach.