Search arXivSearch

arXiv · 1601.08117

Measurement-driven Quality Assessment of Nonlinear Systems by Exponential Replacement

Abstract

We discuss the problem how to determine the quality of a nonlinear system with respect to a measurement task. Due to amplification, filtering, quantization and internal noise sources physical measurement equipment in general exhibits a nonlinear and random input-to-output behaviour. This usually makes it impossible to accurately describe the underlying statistical system model. When the individual operations are all known and deterministic, one can resort to approximations of the input-to-output function. The problem becomes challenging when the processing chain is not exactly known or contains nonlinear random effects. Then one has to approximate the output distribution in an empirical way. Here we show that by measuring the first two sample moments of an arbitrary set of output transformations in a calibrated setup, the output distribution of the actual system can be approximated by an equivalent exponential family distribution. This method has the property that the resulting approximation of the statistical system model is guaranteed to be pessimistic in an estimation theoretic sense. We show this by proving that an equivalent exponential family distribution in general exhibits a lower Fisher information measure than the original system model. With various examples and a model matching step we demonstrate how this estimation theoretic aspect can be exploited in practice in order to obtain a conservative measurement-driven quality assessment method for nonlinear measurement systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Manuel Stein, Josef A. Nossek, Kurt Barbé. 2016-01-29. Measurement-driven Quality Assessment of Nonlinear Systems by Exponential Replacement. https://doi.org/10.1109/i2mtc.2016.7520370

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT