No description available.

One of the two project reports: The other part is designated PART A: MCMASTER (Off-Campus) PROJECT / <P> A simple and inexpensive pseudo-random number generator has been designed and built using linear feedback shift registers to generate rectangular and gaussian distributed numbers. The device has been interfaced to a Nova computer to provide a high speed source of random numbers. The two distributions have been checked with the following tests: (i) Frequency test (ii) Autocorrelation test and (iii) d 2-test. Results of each test have been compared with the expected theoretical values. Finally, a comparison of the generating speed has been made between this new generator and the existing old software generators. This 28-bit generator is especially desirable in random simulation and Monte Carlo application if randomness, speed and cost are the main consideration in the design. </P> / Thesis / Master of Engineering (MEngr)

No description available.

No description available.

Orientador: José Manoel Balthazar / Banca: Bento Rodrigues de Pontes Junior / Banca: Vicente Lopes Júnior / Resumo: Este trabalho consiste de três partes, na primeira fez - se o estudo da dinâmica de um oscilador com um grau de liberdade, em que uma massa é conectada a um elemento com memória de forma e um amortecedor, onde o sistema é excitado harmonicamente (sistema ideal). Uma solução analítica para o movimento estacionário do sistema é obtida através da análise de técnicas de perturbações, onde foi utilizado o método das múltiplas escalas. Por intermédio desta solução observa - se fenômenos não lineares através das curvas de resposta em freqüência. Além disso, obtém - se condições de estabilidade para o sistema e condições para a existência de bifurcação do tipo sela - nó. Na segunda parte apresenta - se o estudo do comportamento dinâmico não linear de um oscilador com memória de forma, excitado por uma fonte não ideal - um motor elétrico de corrente contínua, desbalanceado e com potência limitada. Toma - se, um problema cujo modelo matemático representa um sistema simplificado (com característica do motor no regime estacionário). Adota - se a formulação Lagrangeana para gerar as equações de movimento. Os resultados são obtidos através de integrações numéricas das equações de movimento sendo possíveis obter oscilações regulares e irregulares (caóticos), os quais dependem da escolha dos parâmetros do sistema. A solução analítica é obtida utilizando - se o método da média, onde é possível observar fenômenos intrínsecos a sistemas não ideais tais como dependência da freqüência de excitação com relação à amplitude de oscilação da coordenada de movimento do sistema (Efeito Sommerfeld). A terceira parte é dedicada à aplicação de uma técnica de controle linear ótimo para a supressão do movimento caótico tanto do sistema ideal quanto do sistema não ideal, via simulações numéricas. / Abstract: This work concerns of three parts, in the first we will make the study of the dynamical of a single - degree of freedom oscillator, which consist of a mass connected to a shape memory element and a dashpot, where the system harmonically excited (ideal source). An analytical solution for the system stationary oscillations is obtained by perturbations method, where was used the method of multiple scales. Due to this solution one can observe nonlinear phenomena trough of frequency - response curves. Besides, conditions for the system stability and the existence of saddle - node bifurcations are also obtained. In the second part show the computational and analytical study of the nonlinear dynamic behavior of the SMA oscillator, excited by a non ideal source - an unbalanced direct current electric motor of limited power. A problem whose mathematical model represents a simplified system (the characteristic of the motor in stationary state). It adopts the Lagrange formularization to deducing the equations of motion. Regular and irregular (chaotic) behaviors depend of the physical parameters and can be observed when a numerical integration is performed. The analytical solution is obtained using the averaging method, where due to this solution on can observe typical non-ideal phenomena like the amplitude motion dependency to the frequency of the excitation (Sommerfeld effect). The third part is dedicated to the application and performance of the linear feedback control for the suppressing of the chaotic motion of an ideal and non ideal system, theses systems are numerical studied. / Mestre

Recently, covering arrays have been the subject of considerable research attention as they hold both theoretical interest and practical importance due to their applications to testing. In this thesis, we perform the first comprehensive study of a generalization of covering arrays called variable strength covering arrays, where we dictate the interactions to be covered in the array by modeling them as facets of an abstract simplicial complex. We outline the necessary background in the theory of hypergraphs, combinatorial testing, and design theory that is relevant to the study of variable strength covering arrays. We then approach questions that arise in variable strength covering arrays in a number of ways. We demonstrate their connections to hypergraph homomorphisms, and explore the properties of a particular family of abstract simplicial complexes, the qualitative independence hypergraphs. These hypergraphs are tightly linked to variable strength covering arrays, and we determine and identify several of their important properties and subhypergraphs. We give a detailed study of constructions for variable strength covering arrays, and provide several operations and divide-and-conquer techniques that can be used in building them. In addition, we give a construction using linear feedback shift registers from primitive polynomials of degree 3 over arbitrary finite fields to find variable strength covering arrays, which we extend to strength-3 covering arrays whose sizes are smaller than many of the best known sizes of covering arrays. We then give an algorithm for creating variable strength covering arrays over arbitrary abstract simplicial complexes, which builds the arrays one row at a time, using a density concept to guarantee that the size of the resultant array is asymptotic in the logarithm of the number of facets in the abstact simplicial complex. This algorithm is of immediate practical importance, as it can be used to create test suites for combinatorial testing. Finally, we use the Lovasz Local Lemma to nonconstructively determine upper bounds on the sizes of arrays for a number of different families of hypergraphs. We lay out a framework that can be used for many hypergraphs, and then discuss possible strategies that can be taken in asymmetric problems.

Recently, covering arrays have been the subject of considerable research attention as they hold both theoretical interest and practical importance due to their applications to testing. In this thesis, we perform the first comprehensive study of a generalization of covering arrays called variable strength covering arrays, where we dictate the interactions to be covered in the array by modeling them as facets of an abstract simplicial complex. We outline the necessary background in the theory of hypergraphs, combinatorial testing, and design theory that is relevant to the study of variable strength covering arrays. We then approach questions that arise in variable strength covering arrays in a number of ways. We demonstrate their connections to hypergraph homomorphisms, and explore the properties of a particular family of abstract simplicial complexes, the qualitative independence hypergraphs. These hypergraphs are tightly linked to variable strength covering arrays, and we determine and identify several of their important properties and subhypergraphs. We give a detailed study of constructions for variable strength covering arrays, and provide several operations and divide-and-conquer techniques that can be used in building them. In addition, we give a construction using linear feedback shift registers from primitive polynomials of degree 3 over arbitrary finite fields to find variable strength covering arrays, which we extend to strength-3 covering arrays whose sizes are smaller than many of the best known sizes of covering arrays. We then give an algorithm for creating variable strength covering arrays over arbitrary abstract simplicial complexes, which builds the arrays one row at a time, using a density concept to guarantee that the size of the resultant array is asymptotic in the logarithm of the number of facets in the abstact simplicial complex. This algorithm is of immediate practical importance, as it can be used to create test suites for combinatorial testing. Finally, we use the Lovasz Local Lemma to nonconstructively determine upper bounds on the sizes of arrays for a number of different families of hypergraphs. We lay out a framework that can be used for many hypergraphs, and then discuss possible strategies that can be taken in asymmetric problems.

Recently, covering arrays have been the subject of considerable research attention as they hold both theoretical interest and practical importance due to their applications to testing. In this thesis, we perform the first comprehensive study of a generalization of covering arrays called variable strength covering arrays, where we dictate the interactions to be covered in the array by modeling them as facets of an abstract simplicial complex. We outline the necessary background in the theory of hypergraphs, combinatorial testing, and design theory that is relevant to the study of variable strength covering arrays. We then approach questions that arise in variable strength covering arrays in a number of ways. We demonstrate their connections to hypergraph homomorphisms, and explore the properties of a particular family of abstract simplicial complexes, the qualitative independence hypergraphs. These hypergraphs are tightly linked to variable strength covering arrays, and we determine and identify several of their important properties and subhypergraphs. We give a detailed study of constructions for variable strength covering arrays, and provide several operations and divide-and-conquer techniques that can be used in building them. In addition, we give a construction using linear feedback shift registers from primitive polynomials of degree 3 over arbitrary finite fields to find variable strength covering arrays, which we extend to strength-3 covering arrays whose sizes are smaller than many of the best known sizes of covering arrays. We then give an algorithm for creating variable strength covering arrays over arbitrary abstract simplicial complexes, which builds the arrays one row at a time, using a density concept to guarantee that the size of the resultant array is asymptotic in the logarithm of the number of facets in the abstact simplicial complex. This algorithm is of immediate practical importance, as it can be used to create test suites for combinatorial testing. Finally, we use the Lovasz Local Lemma to nonconstructively determine upper bounds on the sizes of arrays for a number of different families of hypergraphs. We lay out a framework that can be used for many hypergraphs, and then discuss possible strategies that can be taken in asymmetric problems.

The demand for low power wireless transceiver implementations has been fueled by multiple applications in the recent decades, including cellular systems, wireless local area networks, personal area networks, biotelemetry and sensor networks. Dynamic range, which is set by linearity and sensitivity performance, is a critical design metric in many of these systems. Both linearity and sensitivity requirements continue to become progressively challenging in many systems due to greater spectrum usage and the need for high data rates respectively. The objective of this research is to investigate power-efficient circuit techniques for reducing the power requirement in receiver front-ends without compromising the dynamic range performance. In the first part of the dissertation, a low power receiver down-converter topology for enhancing dynamic range performance is presented. Current mode down-converters with passive mixer cores have been shown to provide excellent dynamic range performance. However, in contrast to a current commutating Gilbert cell, these down-converters require separate bias current paths for the RF transconductor and the baseband transimpedance amplifier. The proposed topology reduces the power requirement of conventional current mode passive down-converter by sharing the bias current between the transconductance and transimpedance stages. This is achieved without compromising the available voltage headroom for either stage, which is a limitation of bias-sharing based on the use of stacked stages. The dynamic range of the basic bias-current-shared topology is further enhanced through suppression of low frequency noise and IM3 products. Two variants of the down-converter, employing a broadband common-gate and a narrowband common-source input stage, are implemented in a 0.18-μm CMOS technology. The dynamic range performance of the architecture is analyzed. Finally, a prototype of a full direct-conversion receiver implementation with quadrature outputs and integrated LO synthesis is demonstrated. A power-efficient oscillator design for phase noise minimization is presented in the second part of this dissertation. This design is targeted towards multi-radio platforms where several communication links operate simultaneously over multiple frequency bands. Blockers from concurrently operating radios present a major design challenge. The blockers not only make the frontend linearity requirement more stringent but also degrade receiver sensitivity through reciprocal mixing with the phase noise sidebands of LO. Phase noise minimization is thus critical for ensuring high sensitivity in frequency bands where large blockers are present and not sufficiently attenuated by pre-select filters. A capacitive power combining technique in oscillators is introduced to improve phase noise performance. By combining this approach with current reuse, the phase noise is reduced at lower power, compared to conventional LC oscillators. This leads to improved power efficiency. Moreover, the technique mitigates modeling uncertainty arising from phase noise reduction through simultaneous impedance and current scaling. The mode selection in this oscillator, which employs multiple coupled resonators, is analyzed and the impact of coupling on far-out phase noise performance is discussed. Multi-mode oscillation can potentially arise in other oscillator topologies too, e.g., in multiphase oscillators. Mode selection in a widely used transistor-coupled quadrature oscillator is analyzed in detail in the final part of the dissertation. The analysis shows how cross-compression among multiple competing modes can lead to suppression of non-dominant modes in the steady state. / text

Resumo: O sistema de microscopia de força atômica se tornou um instrumento popular e útil para medir as forças intermoleculares com resolução atômica que pode ser aplicado em eletrônica, análises biológicas, engenharia de materiais, semicondutores, etc. Este trabalho estuda o comportamento da dinâmica não-linear da ponta da sonda causada pelo tipo da amostra e os modos de funcionamento de um microscópio de força atômica. Utilizando-se de simulações numéricas, busca-se uma solução aproximada, através do método de perturbação de múltiplas escalas e teoria de controle linear ótimo consegue-se um bom entendimento do trabalho feito e explicado a seguir. Este trabalho está dividido em três partes, na primeira apresentou-se o problema, mostrando a necessidade de se controlar o comportamento caótico no sistema a ser estudado. Mostrou-se o funcionamento do microscópio atômico com todas suas variáveis de funcionamento. Foram geradas as equações de movimento e os resultados são obtidos através de integrações numéricas das equações de movimento, obteve-se oscilações regulares e irregulares (caóticos), os quais dependem da escolha dos parâmetros do sistema. Na segunda parte do trabalho, utilizou-se o método das múltiplas escalas, efetuou-se a busca de uma solução analítica aproximada para o movimento estacionário do sistema, que foi obtida através de técnicas de perturbações. Este método foi desenvolvido foi desenvolvido por [10] para controlar estes sistemas / Abstract: The atomic force microscope system has become a popular and useful instrument to measure the intermolecular forces with atomic-resolution that can be applied in electronics, biological analysis, materials, semiconductors etc. This work studies the complex nonlinear dynamic behavior of the probe tip between the sample and cantilever of an atomic force microscope using numeral simulations, method of multiple scales, and optimal linear control. This work concerns of three parts, in the first we will make the presentation of the AFM, showing various models of AFM. In second part, regular and irregular (chaotic) behaviors depend of the physical parameters and can be observed when a numerical integration is performed. When the dynamic system of the AFM becomes a chaotic oscillator a computational and analytical study of the nonlinear dynamic behavior of the AFM oscillator is proposed and it is obtained by perturbations method. The third part is dedicated to the application and performance of the linear feedback control for the suppressing of the chaotic motion of a non ideal system, theses systems are numerically studied. We use the method developed by [10] to control both the non-ideal system. This method seeks to find an optimal linear feedback control where they find - if conditions for the application of linear control in non-linear, ensuring the stability of the problem / Orientador: José Manoel Balthazar / Coorientador: Bento Rodrigues de Pontes / Banca: Átila Madureira Bueno / Banca: Angelo Marcelo Tusset / Mestre