Shack-Hartmann wavefront sensing with elongated sodium laser beacons: centroiding versus matched filtering

We describe modeling and simulation results for the Thirty Meter Telescope on the degradation of sodium laser guide star Shack-Hartmann wavefront sensor measurement accuracy that will occur due to the spatial structure and temporal variations of the mesospheric sodium layer. By using a contiguous set of lidar measurements of the sodium profile, the performance of a standard centroid and of a more refined noise-optimal matched filter spot position estimation algorithm is analyzed and compared for a nominal mean signal level equal to 1000 photodetected electrons per subaperture per integration time, as a function of subaperture to laser launch telescope distance and CCD pixel readout noise. Both algorithms are compared in terms of their rms spot position estimation error due to noise, their associated wavefront error when implemented on the Thirty Meter Telescope facility adaptive optics system, their linear dynamic range, and their bias when detuned from the current sodium profile

Optimal input design and parameter estimation for continuous-time dynamical systems

Diese Arbeit behandelt die Themengebiete Design of Experiments (DoE) und Parameterschätzung für zeitkontinuierliche Systeme, welche in der modernen Regelungstheorie eine wichtige Rolle spielen. Im gewählten Kontext untersucht DoE die Auswirkungen von verschiedenen Rahmenbedingungen von Simulations- bzw. Messexperimenten auf die Qualität der Parameterschätzung, wobei der Fokus auf der Anwendung der Theorie auf praxisrelevante Problemstellungen liegt. Dafür wird die weithin bekannte Fisher-Matrix eingeführt und die resultierende nicht lineare Optimierungsaufgabe angeschrieben. An einem PT1-System wird der Informationsgehalt von Signalen und dessen Auswirkungen auf die Parameterschätzung gezeigt. Danach konzentriert sich die Arbeit auf ein Teilgebiet von DoE, nämlich Optimal Input Design (OID), und wird am Beispiel eines 1D-Positioniersystems im Detail untersucht. Ein Vergleich mit häufig verwendeten Anregungssignalen zeigt, dass generierte Anregungssignale (OID) oft einen höheren Informationsgehalt aufweisen und mit genaueren Schätzwerten einhergeht. Zusätzlicher Benefit ist, dass Beschränkungen an Eingangs-, Ausgangs- und Zustandsgrößen einfach in die Optimierungsaufgabe integriert werden können. Der zweite Teil der Arbeit behandelt Methoden zur Parameterschätzung von zeitkontinuierlichen Modellen mit dem Fokus auf der Verwendung von Modulationsfunktionen (MF) bzw. Poisson-Moment Functionals (PMF) zur Vermeidung der zeitlichen Ableitungen und Least-Squares zur Lösung des resultierenden überbestimmten Gleichungssystems. Bei verrauschten Messsignalen ergibt sich daraus sofort die Problematik von nicht erwartungstreuen Schätzergebnissen (Bias). Aus diesem Grund werden Methoden zur Schätzung und Kompensation von Bias Termen diskutiert. Beitrag dieser Arbeit ist vor allem die detaillierte Aufarbeitung eines Ansatzes zur Biaskompensation bei Verwendung von PMF und Least-Squares für lineare Systeme und dessen Erweiterung auf (leicht) nicht lineare Systeme. Der vorgestellte Ansatz zur Biaskompensation (BC-OLS) wird am nicht linearen 1D-Servo in der Simulation und mit Messdaten validiert und in der Simulation mit anderen Methoden, z.B., Total-Least-Squares verglichen. Zusätzlich wird der Ansatz von PMF auf die weiter gefasste Systemklasse der Modulationsfunktionen (MF) erweitert. Des Weiteren wird ein praxisrelevantes Problem der Parameteridentifikation diskutiert, welches auftritt, wenn das Systemverhalten nicht gänzlich von der Identifikationsgleichung beschrieben wird. Am 1D-Servo wird gezeigt, dass ein Deaktivieren und Reaktivieren der PMF Filter mit geeigneter Initialisierung diese Problematik einfach löst.This thesis addresses two topics that play a significant role in modern control theory: design of experiments (DoE) and parameter estimation methods for continuous-time (CT) models. In this context, DoE focuses on the impact of experimental design regarding the accuracy of a subsequent estimation of unknown model parameters and applying the theory to real-world applications and its detailed analysis. We introduce the Fisher-information matrix (FIM), consisting of the parameter sensitivities and the resulting highly nonlinear optimization task. By a first-order system, we demonstrate the computation of the information content, its visualization, and an illustration of the effects of higher Fisher information on parameter estimation quality. After that, the topic optimal input design (OID), a subarea of DoE, will be thoroughly explored on the practice-relevant linear and nonlinear model of a 1D-position servo system. Comparison with standard excitation signals shows that the OID signals generally provide higher information content and lead to more accurate parameter estimates using least-squares methods. Besides, this approach allows taking into account constraints on input, output, and state variables. In the second major topic of this thesis, we treat parameter estimation methods for CT systems, which provide several advantages to identify discrete-time (DT) systems, e.g., allows physical insight into model parameters. We focus on modulating function method (MFM) or Poisson moment functionals (PMF) and least-squares to estimate unknown model parameters. In the case of noisy measurement data, the problem of biased parameter estimation arises immediately. That is why we discuss the computation and compensation of the so-called estimation bias in detail. Besides the detailed elaboration of a bias compensating estimation method, this work’s main contribution is, based on PMF and least squares for linear systems, the extension to at least slightly nonlinear systems. The derived bias-compensated ordinary least-squares (BCOLS) approach for obtaining asymptotically unbiased parameter estimates is tested on a nonlinear 1D-servo model in the simulation and measurement. A comparison with other methods for bias compensation or avoidance, e.g., total least-squares (TLS), is performed. Additionally, the BC-OLS method is applied to the more general MFM. Furthermore, a practical issue of parameter estimation is discussed, which occurs when the system behavior leaves and re-enters the space covered by the identification equation. Using the 1D-servo system, one can show that disabling and re-enabling the PMF filters with appropriate initialization can solve this problem

A digital tuning scheme for digitally programmable integrated continuous-time filters and techniques for high-precision monolithic linear circuit design and implementation

Multiple topics which all focus on precision monolithic circuit design but beyond this are not directly related to each other are presented. The first topic is a digital tuning scheme for digitally programmable integrated continuous-time filters (4), (8) - (10). Emphasis of this research is on development of a more general tuning scheme which can be applicable to various filter functions as well as high-frequency applications. The tuning scheme consists of two phases: system identification and adjustment. Various continuous-time filter identification methods including time-domain and frequency-domain approaches are investigated, and a filter adjustment algorithm is presented. Potential of high accuracy of the proposed tuning scheme and successful applicability to high-frequency filters with versatile functions have been demonstrated through simulations and experiments;Four other topics are separately presented. First, nonidealities associated with high-precision amplifiers (5), (7) are discussed. Special emphasis is given on analysis of statistical characteristics of random CMRR and offset of CMOS op-amps which can help estimating yield of high-volume production and help engineers design for a given yield. Next, an automatic offset compensation scheme for CMOS op-amps with ping-pong control (2), (6) is presented. A very low-voltage circuit design technique using floating gate MOSFETs (3) is introduced. Finally, an accurate and matching-free threshold voltage extraction scheme using a ratio-independent SC amplifier and a dynamic current mirror (1) is discussed

Robust Total Least Mean M-Estimate normalized subband filter Adaptive Algorithm for impulse noises and noisy inputs

When the input signal is correlated input signals, and the input and output signal is contaminated by Gaussian noise, the total least squares normalized subband adaptive filter (TLS-NSAF) algorithm shows good performance. However, when it is disturbed by impulse noise, the TLS-NSAF algorithm shows the rapidly deteriorating convergence performance. To solve this problem, this paper proposed the robust total minimum mean M-estimator normalized subband filter (TLMM-NSAF) algorithm. In addition, this paper also conducts a detailed theoretical performance analysis of the TLMM-NSAF algorithm and obtains the stable step size range and theoretical steady-state mean squared deviation (MSD) of the algorithm. To further improve the performance of the algorithm, we also propose a new variable step size (VSS) method of the algorithm. Finally, the robustness of our proposed algorithm and the consistency of theoretical and simulated values are verified by computer simulations of system identification and echo cancellation under different noise models

Multitask Diffusion Adaptation over Networks

Adaptive networks are suitable for decentralized inference tasks, e.g., to monitor complex natural phenomena. Recent research works have intensively studied distributed optimization problems in the case where the nodes have to estimate a single optimum parameter vector collaboratively. However, there are many important applications that are multitask-oriented in the sense that there are multiple optimum parameter vectors to be inferred simultaneously, in a collaborative manner, over the area covered by the network. In this paper, we employ diffusion strategies to develop distributed algorithms that address multitask problems by minimizing an appropriate mean-square error criterion with $\ell_2$-regularization. The stability and convergence of the algorithm in the mean and in the mean-square sense is analyzed. Simulations are conducted to verify the theoretical findings, and to illustrate how the distributed strategy can be used in several useful applications related to spectral sensing, target localization, and hyperspectral data unmixing.Comment: 29 pages, 11 figures, submitted for publicatio

Bayesian uncertainty quantification in linear models for diffusion MRI

Diffusion MRI (dMRI) is a valuable tool in the assessment of tissue microstructure. By fitting a model to the dMRI signal it is possible to derive various quantitative features. Several of the most popular dMRI signal models are expansions in an appropriately chosen basis, where the coefficients are determined using some variation of least-squares. However, such approaches lack any notion of uncertainty, which could be valuable in e.g. group analyses. In this work, we use a probabilistic interpretation of linear least-squares methods to recast popular dMRI models as Bayesian ones. This makes it possible to quantify the uncertainty of any derived quantity. In particular, for quantities that are affine functions of the coefficients, the posterior distribution can be expressed in closed-form. We simulated measurements from single- and double-tensor models where the correct values of several quantities are known, to validate that the theoretically derived quantiles agree with those observed empirically. We included results from residual bootstrap for comparison and found good agreement. The validation employed several different models: Diffusion Tensor Imaging (DTI), Mean Apparent Propagator MRI (MAP-MRI) and Constrained Spherical Deconvolution (CSD). We also used in vivo data to visualize maps of quantitative features and corresponding uncertainties, and to show how our approach can be used in a group analysis to downweight subjects with high uncertainty. In summary, we convert successful linear models for dMRI signal estimation to probabilistic models, capable of accurate uncertainty quantification.Comment: Added results from a group analysis and a comparison with residual bootstra

Study of L0-norm constraint normalized subband adaptive filtering algorithm

Limited by fixed step-size and sparsity penalty factor, the conventional sparsity-aware normalized subband adaptive filtering (NSAF) type algorithms suffer from trade-off requirements of high filtering accurateness and quicker convergence behavior. To deal with this problem, this paper proposes variable step-size L0-norm constraint NSAF algorithms (VSS-L0-NSAFs) for sparse system identification. We first analyze mean-square-deviation (MSD) statistics behavior of the L0-NSAF algorithm innovatively in according to a novel recursion form and arrive at corresponding expressions for the cases that background noise variance is available and unavailable, where correlation degree of system input is indicated by scaling parameter r. Based on derivations, we develop an effective variable step-size scheme through minimizing the upper bounds of the MSD under some reasonable assumptions and lemma. To realize performance improvement, an effective reset strategy is incorporated into presented algorithms to tackle with non-stationary situations. Finally, numerical simulations corroborate that the proposed algorithms achieve better performance in terms of estimation accurateness and tracking capability in comparison with existing related algorithms in sparse system identification and adaptive echo cancellation circumstances.Comment: 15 pages,15 figure