CAPES / O objetivo desta dissertação é propor uma técnica para a síntese via realimentação de estados para sistemas lineares e invariantes no tempo, considerando que os estados realimentados são previamente quantizados. Para tanto, o erro de quantização é inicialmente modelado como um ruído externo. Assim, o problema de obter os ganhos de realimentação de estados, se torna um problema de projetar os ganhos que minimizem a norma H¥ do sistema controlado. Os ganhos de realimentação são calculados pela solução de um conjunto de condições descritas na forma de desigualdades matriciais lineares. A técnica é ilustrada pela aplicação da realimentação de estados quantizada em um servomecanismo. / The main objective of this dissertation is to propose a technique for synthesis by statefeedback for linear time-invariant systems, considering that the states are quantized before the feedback. To tackle such problem, the quantization error is initially modeled as an external noise. Therefore, the problem of getting the state-feedback gains, becomes a problem of designing the gains that minimize the H¥ norm of the system. The state-feedback gains are calculated by solving a set of conditions described in the form of linear matrix inequalities. The technique is illustrated by applying the of feedback of quantized states to a servo-mechanism.

CAPES / O objetivo desta dissertação é propor uma técnica para a síntese via realimentação de estados para sistemas lineares e invariantes no tempo, considerando que os estados realimentados são previamente quantizados. Para tanto, o erro de quantização é inicialmente modelado como um ruído externo. Assim, o problema de obter os ganhos de realimentação de estados, se torna um problema de projetar os ganhos que minimizem a norma H¥ do sistema controlado. Os ganhos de realimentação são calculados pela solução de um conjunto de condições descritas na forma de desigualdades matriciais lineares. A técnica é ilustrada pela aplicação da realimentação de estados quantizada em um servomecanismo. / The main objective of this dissertation is to propose a technique for synthesis by statefeedback for linear time-invariant systems, considering that the states are quantized before the feedback. To tackle such problem, the quantization error is initially modeled as an external noise. Therefore, the problem of getting the state-feedback gains, becomes a problem of designing the gains that minimize the H¥ norm of the system. The state-feedback gains are calculated by solving a set of conditions described in the form of linear matrix inequalities. The technique is illustrated by applying the of feedback of quantized states to a servo-mechanism.

No description available.

No description available.

The purpose of this thesis is to develop new stability conditions for several linear dynamic systems, including linear parameter-varying (LPV), time-delay systems (LPVTD), slow LPV systems, and parameter-dependent linear time invariant (LTI) systems. These stability conditions are less conservative and/or computationally easier to apply than existing ones. This dissertation is composed of four parts. In the first part of this thesis, the complete stability domain for LTI parameter-dependent (LTIPD) systems is synthesized by extending existing results in the literature. This domain is calculated through a guardian map which involves the determinant of the Kronecker sum of a matrix with itself. The stability domain is synthesized for both single- and multi-parameter dependent LTI systems. The single-parameter case is easily computable, whereas the multi-parameter case is more involved. The determinant of the bialternate sum of a matrix with itself is also exploited to reduce the computational complexity. In the second part of the thesis, a class of parameter-dependent Lyapunov functions is proposed, which can be used to assess the stability properties of single-parameter LTIPD systems in a non-conservative manner. It is shown that stability of LTIPD systems is equivalent to the existence of a Lyapunov function of a polynomial type (in terms of the parameter) of known, bounded degree satisfying two matrix inequalities. The bound of polynomial degree of the Lyapunov functions is then reduced by taking advantage of the fact that the Lyapunov matrices are symmetric. If the matrix multiplying the parameter is not full rank, the polynomial order can be reduced even further. It is also shown that checking the feasibility of these matrix inequalities over a compact set can be cast as a convex optimization problem. Such Lyapunov functions and stability conditions for affine single-parameter LTIPD systems are then generalized to single-parameter polynomially-dependent LTIPD systems and affine multi-parameter LTIPD systems. The third part of the thesis provides one of the first attempts to derive computationally tractable criteria for analyzing the stability of LPV time-delayed systems. It presents both delay-independent and delay-dependent stability conditions, which are derived using appropriately selected Lyapunov-Krasovskii functionals. According to the system parameter dependence, these functionals can be selected to obtain increasingly non-conservative results. Gridding techniques may be used to cast these tests as Linear Matrix Inequalities (LMI's). In cases when the system matrices depend affinely or quadratically on the parameter, gridding may be avoided. These LMI's can be solved efficiently using available software. A numerical example of a time-delayed system motivated by a metal removal process is used to demonstrate the theoretical results. In the last part of the thesis, topics for future investigation are proposed. Among the most interesting avenues for research in this context, it is proposed to extend the existing stability analysis results to controller synthesis, which will be based on the same Lyapunov functions used to derive the nonconservative stability conditions. While designing the dynamic ontroller for linear and parameter-dependent systems, it is desired to take the advantage of the rank deficiency of the system matrix multiplying the parameter such that the controller is of lower dimension, or rank deficient without sacrificing the performance of closed-loop systems.

This dissertation focuses on wideband circuit design and implementation issues up to 10GHz based on the direct conversion architecture in the CMOS and SiGe BiCMOS technologies. The dissertation consists of two parts: One, implementation of a RF front-end receiver for an ultra-wideband system and, two, implementation of a local oscillation (LO) signal for a GSM/WCDMA multiband application. For emerging ultra-wideband (UWB) applications, the key active components in the RF front-end receiver were designed and implemented in 0.18um SiGe BiCMOS process. The design of LNA, which is the critical circuit block for both systems, was analyzed in terms of noise, linearity and group delay variation over an extemely wide bandwidth. Measurements are demonstrated for an energy-thrifty UWB receiver based on an MB-OFDM system covering the full FCC-allowed UWB frequency range. For multiband applications such as a GSM/WCDMA dual-band application, the design of wideband VCO and various frequency generation blocks are investigated as alternatives for implementation of direct conversion architecture. In order to reduce DC-offset and LO pulling phenomena that degrade performance in a typical direct conversion scheme, an innovative fractional LO signal generator was implemented in a standard CMOS process. A simple analysis is provided for the loop dynamics and operating range of the design as well as for the measured results of the factional LO signal generator.

This thesis investigates the frequency weighted balanced model reduction problem for linear time invariant systems. Both continuous and discrete time systems are considered, in one and two-dimensions. First the frequency weighted balanced model reduction problem is formulated, then a novel frequency weighted, balanced, model reduction method for continuous time systems is proposed. This method is based on the retention of frequency weighted Hankel singular values of the original system, and yields stable reduced order models even when two sided weightings are employed. An alternative frequency weighted balanced model reduction technique (applicable for controller reduction applications) is then developed. This is based on a parametrized combination of the frequency weighted partial fraction expansion technique with balanced truncation and the singular perturbation approximation techniques. This method yields stable models even when two sided weightings are employed. An a priori error bound for the model reduction method is derived. Lower frequency response errors and error bounds are obtained using free parameters and equivalent anti-stable weightings. Based on the same idea, a novel parameterized frequency weighted optimal Hankel norm model reduction method with a tighter a priori error bound is proposed. The proposed methods are extended to include discrete time systems. A frequency interval Gramians based stability preserving model reduction scheme with error bounds is also presented. In this case, frequency weights are not explicitly predefined. Discrete time system related results are also included. Several frequency weighted model reduction results for two-dimensional (2-D) systems are also proposed. The advantages of these schemes include error bounds, guaranteed stability and applicability to general stable (non-separable denominator) weighting functions. Finally, a novel 2-D identification based frequency weighted model reduction scheme is outlined. Numerically robust algorithms based on square root and balancing free techniques are proposed for frequency weighted balanced truncation techniques. Several practical examples are included to illustrate the effectiveness of the algorithms.

Passive network reconstruction is the process of learning a structured (networked) representation of a dynamic system through the use of known information about the structure of the system as well as data collected by observing the inputs into a system along with the resultant outputs. This work demonstrates an improvement on an existing network reconstruction algorithm so that the algorithm is capable of consistently and perfectly reconstructing a network when system inputs and outputs are measured without error. This work then extends the improved network reconstruction algorithm so that it functions even in the presence of noise as well as the situation where inputs into the system are unknown. Furthermore, this work demonstrates the capability of the new extended algorithms by reconstructing financial networks from stock market data, and then performing an analysis to understand the vulnerabilities of the reconstructed network to destabilization through localized attacks. The creation of these improved and extended algorithms has opened many theoretical questions, paving the way for future research into network reconstruction.

No description available.

This study introduces new families of wavelets. The first is directly derived from the response of Second Order Underdamped Linear-Time-Invariant (SOULTI) systems, while the second is a generalization of the first to the complex domain and is similar to the Laplace transform kernel function. The first takes the acronym of SOULTI wavelet, while the second is named the Laplace wavelet. The most important criteria for a function or signal to be a wavelet is the ability to recover the original signal back from its continuous wavelet transform. It is shown that it is possible to recover back the original signal once the SOULTI or the Laplace wavelet transform is applied to decompose the signal. It is found that both wavelet transforms satisfy linear differential equations called the reconstructing differential equations, which are closely related to the differential equations that produce the wavelets. The new wavelets can have well defined Time-Frequency resolutions, and they have useful properties; a direct relation between the scale and the frequency, unique transform formulas that can be easily obtained for most elementary signals such as unit step, sinusoids, polynomials, and decaying harmonic signals, and linear relations between the wavelet transform of signals and the wavelet transform of their derivatives and integrals. The defined wavelets are applied to system analysis applications. The new wavelets showed accurate instantaneous frequency identification and modal decomposition of LTI Multi-Degree of Freedom (MDOF) systems and it showed better results than the Short-time Fourier Transform (STFT) and the other harmonic wavelets used in time-frequency analysis. The modal decomposition is applied for modal parameters identification, and the properties of the Laplace and the SOULTI wavelet transforms allows analytical and accurate identification methods. / Ph. D.