A new tuning scheme for linearly tunable high-Q filters is proposed. The tuning method is based on using the phase information for both frequency and Q factor tuning. There is no need to find out the relationship between a filter's passband magnitude and Q. A gm-C biquadratic filter is designed to demonstrate the proposed tuning circuitry. The project includes a phase locked loop (PLL) based frequency tuning loop, reference clock generator, and differential difference amplifier (DDA) for dealing with frequency and Q factor tuning loop and linearly tunable second order gm-C bandpass filter. Simulation results for a 10 MHz prototype filter using AMI 0.5μm process is presented. The chip testing results show that the automatic frequency tuning error is 2.5% for the 10 MHz case.

A new tuning scheme for linearly tunable high-Q filters is proposed. The tuning method is based on using the phase information for both frequency and Q factor tuning. There is no need to find out the relationship between a filter's passband magnitude and Q. A gm-C biquadratic filter is designed to demonstrate the proposed tuning circuitry. The project includes a phase locked loop (PLL) based frequency tuning loop, reference clock generator, and differential difference amplifier (DDA) for dealing with frequency and Q factor tuning loop and linearly tunable second order gm-C bandpass filter. Simulation results for a 10 MHz prototype filter using AMI 0.5μm process is presented. The chip testing results show that the automatic frequency tuning error is 2.5% for the 10 MHz case.

<p>This thesis is about complex convexity. We compare it with other notions of convexity such as ordinary convexity, linear convexity, hyperconvexity and pseudoconvexity. We also do detailed study about ℂ-convex Hartogs domains, which leads to a definition of ℂ-convex functions of class <i>C</i>¹. The study of Hartogs domains also leads to characterization theorem of bounded ℂ-convex domains with <i>C</i>¹ boundary that satisfies the interior ball condition. Both the method and the theorem is quite analogous with the known characterization of bounded ℂ-convex domains with <i>C</i>² boundary. We also show an exhaustion theorem for bounded ℂ-convex domains with <i>C</i>² boundary. This theorem is later applied, giving a generalization of a theorem of L. Lempert concerning the relation between the Carathéodory and Kobayashi metrics.</p>

This thesis is about complex convexity. We compare it with other notions of convexity such as ordinary convexity, linear convexity, hyperconvexity and pseudoconvexity. We also do detailed study about ℂ-convex Hartogs domains, which leads to a definition of ℂ-convex functions of class C1. The study of Hartogs domains also leads to characterization theorem of bounded ℂ-convex domains with C1 boundary that satisfies the interior ball condition. Both the method and the theorem is quite analogous with the known characterization of bounded ℂ-convex domains with C2 boundary. We also show an exhaustion theorem for bounded ℂ-convex domains with C2 boundary. This theorem is later applied, giving a generalization of a theorem of L. Lempert concerning the relation between the Carathéodory and Kobayashi metrics.

<p> The problem of a thin, orthotropic skew plate of linearly varying thickness for vibration and buckling analyses is formulated under the assumptions of small-deflection theory of plates. Using the dimensionless oblique coordinates, the deflection surface of the plate is expressed as a polynomial series, each term of which satisfying the required polar symmetry conditions, and the natural frequencies are computed using Galerkin method. As is required in Galerkin method, the assumed deflection function satisfies all the boundary conditions on all the edges of the plate. For the skew plate, clamped on all the four edges, numerical results for the first few natural frequencies are presented for various combinations of aspect ratio, skew angle and taper parameter. Convergence study has been made for typical configuration of the plate and the limited available data is inserted therein along with the computed results, for comparison.</p> / Thesis / Master of Engineering (MEngr)

An iterative solution to the problem of blind image deconvolution is presented whereby a previous image estimate is explicitly used in the new image estimation process. The previous image is pre-filtered using an adaptive, non-parametric stabilizing function that is updated based on a current error estimate. This function is experimentally shown to dramatically benefit the convergence rate for the a priori restoration case. Noise propagation from one iteration to the next is reduced by the use of a second, regularizing operator, resulting in a hybrid iteration technique. Further, error terms are developed that shed new light on the error propagation properties of this method and others by quantifying the extent of noise and regularization error propagation. Optimal non-parametric, frequency adaptive stabilizing and regularization functions are then derived based on this error analysis. / Thesis / Master of Engineering (ME)

Approved for public release; distribution is unlimited / The Linearly Tapered Slot Antenna (LTSA) had been investigated and developed experimentally; its applications have primarily been based on empirical designs. An accurate theoretical model based on Moment Methods (MM) is developed here to study the radiation characteristics of the LTSA. Using the MM solutions to the reaction integral equation, this thesis presents an analysis to model and explain the LTSA behavior. The effects of variable design parameters on radiation patterns are studied. Discussion is augmented by relating predicted radiation patterns to calculated current distributions on the antenna surface. Conclusions are made regarding optimum designs for the LTSA. Relevant observations are made concerning the extensive computational tasks and the computer resources required for the MM model. / http://archive.org/details/modelingbehavior00kell / Major, United States Army

Seja (X; t) um espaço topológico e seja F a família de todos os subconjuntos de X que satisfazem uma propriedade topológica dada P (invariante por homeomorfismos). Se acrescentarmos abertos novos à topologia e se F\' é a família de todos os subconjuntos do novo espaço que satisfazem a propriedade P, podemos ter que F &ne; F\'. Se isto sempre acontece, dizemos que o espaço (X; t) é maximal com respeito à família F. Neste trabalho estudaremos os espaços topológicos maximais com respeito a algumas famílias de subconjuntos: discretos, compactos, densos, conexos e das sequências convergentes. / Let (X; t) be a topological space and let F be the family of all subsets of X that satisfy a given topological property P (invariant under homeomorphisms). If we add new open sets to the topology and if F\' is the family of all subsets of the new space which satisfy the property P, we can have F &ne; F\'. If this is always the case, we say that (X; t) is maximal with respect to the family F. We show here some characterizations of maximal spaces with respect to the family of some of its subsets: compacts, dense, discrete and convergent sequences.

There are many novel techniques have been invented to provide high-data rate with high quality communication services for future wireless communications systems. Recently, a novel digital modulation technology for multiple accesses, referred to as the Multi-Carrier Code Division Multiple Access (MC-CDMA), has been proposed to support high data rate transmission; it is based on the combination of CDMA and orthogonal frequency division multiplexing (OFDM). The MC-CDMA has been shown to be an effective technique for combating multipath fading. With MC-CDMA system, a user¡¦s spreading code can be modulated on separate subcarriers, undergo frequency-flat fading channel and offers frequency diversity advantage. But in a multi-user environment, othogonality among spreading codes is severely distorted due to multipath delay spread, such that the system capacity will be limited by the multiple access interferences (MAI). Similar situations exist due to possible narrowband interference (NBI) from other systems. Effective interference reduction will render system capacity to increase, which means interference suppression techniques are vital in improving overall system performance. In this thesis, we propose a new linearly constrained recursive least square algorithm, with diagonal loading approach, referred to as the DL-LC RLS algorithms, to further improve the system performance. The proposed diagonal loading RLS algorithm is different from conventional diagonal loading RLS algorithm, in which the diagonal loading was used to improve the robustness to pointing errors in beamforming problem. However, in this thesis, the diagonal loading approach could be used to alleviate the effect due to multiple access interference (MAI), such that under certain circumstances, better performance could be achieved. Basically, in the proposed algorithm, the power of interference plus noise of received signal will be estimated and subtracted from the diagonal terms of the autocorrelation matrix of received signal. After that instead of using the original autocorrelation matrix, the new correlation matrix, with subtracting power related to the interference plus noise, will be involved during the adaptation processes for updating the weights of the multi-user detector. Finally, computer simulation results, in terms of bit error rate, are used to demonstrate the merits of the proposed scheme compared with the conventional RLS algorithm approach without using the diagonal approaches.

Šiame darbe atliekami stochastinių minimumų asimptotiniai tyrimai. Įrodomos minimumų ribinės teoremos tuo atveju, kai tiesinis normalizavimas neduoda neišsigimusių ribinių skirstinių, tokiu atveju taikau netiesinį minimumų normalizavimą. Konkretaus skirstinio atveju randamos netiesinės normalizavimo funkcijos, kurių pagalba yra gaunami minimumų klasikiniai ribiniai skirstiniai. Įrodoma Perkėlimo teorema netiesiniam normalizavimui. Darbo tikslai: • ištirti netiesinio normalizavimo reikalingumą; • išanalizuoti netiesinio normalizavimo galimybes minimumų schemoje. Darbo uždaviniai: • parinkti netiesinio normalizavimo funkciją konkretaus skirstinio atveju; • gauti ribinius klasikinius skirstinius, kai minimumai normalizuojami netiesiškai; • įvertinti konvergavimo greitį ribinėse teoremose; • atlikti aproksimavimo paklaidų kompiuterinę analizę. / This paper is the asymptotic analysis of stochastic minima. Proofs of minima limit theorems are provided for cases, when linear normalization does not give non-degenerate limit distributions. In this cases, non-linear minima normalization is used. For a specific distribution, non-linear normalization functions are calculated, which are then used to get classic limit distributions for minima. Objectives: • Examine the necessity of non-linear normalization; • Analyze the possibilities for non-linear normalization in minimum pattern. Tasks: • Choose non-linear normalization function for a specific distribution; • Get classic limit distributions, where minima are normalized non-linearly; • Investigate the rate of convergence within the limit theorems; • Perform computer-based analysis of approximation errors.