Orientador: Robson Pederiva / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Mecanica / Made available in DSpace on 2018-08-04T03:26:01Z (GMT). No. of bitstreams: 1 Bezerra_RobertodeAraujo_D.pdf: 3842898 bytes, checksum: 23a6bdd65c87be47fe4cfa856795bab0 (MD5) Previous issue date: 2004 / Resumo: Neste trabalho, é feito um estudo comparativo entre diversas técnicas de detecção de falhas em rolamentos por análise de vibração. Inicialmente, as técnicas foram aplicadas a modelos matemáticos de falhas nas pistas interna, externa e nas esferas dos rolamentos; sendo, em seguida, feito um estudo comparativo entre as técnicas. As técnicas foram aplicadas também a rolamentos com falhas induzidas nas pistas e esfera com diferentes tamanhos de falhas e submetidos a diferentes velocidades, para uma melhor compreensão das técnicas. Finalmente, as técnicas foram usadas para o monitoramento da evolução das falhas em um conjunto de doze rolamentos que foram submetidos a condições próximas as de trabalho, o que possibilitou um estudo mais detalhado do processo de evolução dessas falhas. Os resultados obtidos mostraram que, de todas as técnicas utilizadas, o envelope com filtro adaptativo foi a mais eficiente, sendo capaz de detectar pequenos amassamentos e o surgimento de falhas na gaiola. O estudo em condições próximas a realidade possibilitou uma melhor compreensão do processo de evolução das falhas em rolamentos / Abstract: In this thesis, it is made a comparative study among several vibration analysis techniques of fault detection. Initially, the techniques were applied to inner and outer race and rolling element mathematical models of faults, and so, it was possible to compare the techniques. It was used the same techniques on the races and rolling elements with different size of induced faults, submitting to different speeds. With those studies it was possible to understand how to use the technique in a better way. Finally, we monitored a group of twelve bearings to analyse the evolution of faults, close to real conditions. The results showed that the most efficient techniques is the envelope with adaptive filter, it detects small dentings and the begging of cage failure. It was possible to get a better understanding of the failure evolution process in bearings, studying it in close conditions to the reality / Doutorado / Mecanica dos Sólidos e Projeto Mecanico / Doutor em Engenharia Mecânica

Fotografování sluneční koróny patří mezi nejobtížnější úlohy astrofotografie a zároveň je jednou z klíčových metod pro studium koróny. Tato práce přináší ucelený souhrn metod pro pozorování sluneční koróny pomocí snímků. Práce obsahuje nutnou matematickou teorii, postup pro zpracování snímků a souhrn adaptivních filtrů pro vizualizaci koronálních struktur v digitálních obrazech. Dále přináší návrh nových metod určených především pro obrazy s vyšším obsahem šumu, než je běžné u obrazů bílé koróny pořízených během úplných zatmění Slunce, např. pro obrazy pořízené pomocí úzkopásmových filtrů. Fourier normalizing-radial-graded filter, který byl navržen v rámci této práce, je založen na aproximaci hodnot pixelů a jejich variability pomocí trigonometrických polynomů s využitím dalších vlastností obrazu.

Adaptive filtering has grown to become a fundamental topic in signal processing, increasingly attracting attention from the community. Important factors in this popularization were their low computational complexity and model-free nature, adapting even to nonstationary characteristics of the systems and/or signals under study. Nevertheless, many adaptive algorithms introduce trade-offs, for instance, between convergence rate, nonstationary signals tracking, and steady-state error, which can hinder their use in practical applications. Furthermore, some adaptive filters can become unstable when word length is reduced and/or the input data are highly correlated. Recently, combination of adaptive filters was put forward as a solution for such issues. This approach consists in combining a pool of filters by means of a supervisor that attempts to make the overall system at least as good (usually in the mean-square sense) as the best filter in the set. Examples of these structures have been shown to successfully solve this problem, although well-known limitations remain to be addressed. Moreover, due to the relative novelty of this topic, developments in combination of adaptive filters are difficult to accommodate into a common theoretical framework. This work studies combination of adaptive filters and addresses the aforementioned issue by (i) classifying the existing combinations and proposing a taxonomy that exposes the similarities and differences in their forms; (ii) proposing new combinations; (iii) devising a general framework for studying combinations of adaptive filters and using such framework in performance analyses. / Filtragem adaptativa vem ganhando destaque desde seu surgimento tornando-se um tópico de estudo fundamental em processamento de sinais. A versatilidade de dispensarem total conhecimento das propriedades estatísticas dos sinais, aliada à simplicidade computacional de seus métodos, foram importantes fatores em sua consagração. Apesar disto, muitos filtros adaptativos apresentam compromissos envolvendo, por exemplo, velocidade de convergência, rastreamento de sinais não-estacionários e erro em regime, que podem dificultar sua aplicação na prática. Ademais, alguns algoritmos adaptativos são instáveis quando suas entradas são altamente correlacionados e/ou a precisão dos cálculos é reduzida. Uma solução recente para estes problemas é o uso de combinações de filtros adaptativos. Esta abordagem baseia-se em combinar um conjunto de filtros por meio de um supervisor que procura fazer com que o sistema global seja pelo menos tão bom (em geral no sentido quadrático médio) quanto o melhor filtro do conjunto. Exemplos destas estruturas já mostraram a eficácia deste método, apesar de ainda existirem reconhecida limitações. Além disso, em se tratando de um tópico relativamente recente, os desenvolvimentos na área de combinação de filtros adaptativos não possuem uma estrutura teórica unificada. Este trabalho propõe abordar estas questões (i) classificando as combinações existentes e criando uma taxonomia que explicite semelhanças e diferenças entre elas; (ii) introduzindo novas combinações; e (iii) desenvolvendo uma forma unificada de descrever combinações de filtros adaptativos e usando-a em análises de desempenho.

[pt] crescimento dos sistemas de comunicações móveis celulares e dos sistemas de rádio difusão de sinais de áudio e vídeo tem despertado grande interesse na pesquisa de novos métodos para a transmissão de sinais nestas redes. A necessidade de se transmitir dados em altas taxas, com significante eficiência no uso da largura de faixa de freqüências disponível, e por meio de um canal de propagação ruidoso e variante no tempo, constitui o principal problema para o desenvolvimento de novas técnicas de trasmissão de sinais. Dentro deste contexto, esta dissertação trata do uso dos conceitos de transmissão digital e filtragem adaptativa para a demodulação de sinais OFDM (Orthogonal Frequency Division Multiplexing). A equalização de sinais antes e após o estágio de DFT (Discrete Fourier Transform) no receptor e as técnicas de estimação de canal são o objeto principal de estudo deste trabalho. Os resultados dos experimentos são analisados em termos da taxa de erro de bit média obtida e da convergência dos algoritmos empregados nas etapas de equalização e estimação de canal no receptor. / [en] The growth of cellular mobile communication systems and audio and video broadcasting systems has stimulated great interest in the research of new methods for the signal transmission in these networks. The high rate data transmission, with significant efficiency in the use of the available bandwidth, in a noisy and time variant channel, constitutes the main problem for the development of new techniques for signal transmission. In this context, this dissertation deals with the use of the concepts of digital transmission and adaptive filtering for the demodulation of OFDM (Orthogonal Frequency Division Multiplexing) signals. The equalization pre and post DFT (Discrete Fourier Transform) in the receiver and the channel estimation techniques are the main object of study in this work. The results of the experiments are analyzed in terms of the mean bit error rate achieved and the convergence for the algorithms used in the stages of equalization and channel estimation in the receiver.

The low complexity of IIR adaptive filters (AFs) is specially appealing to realtime applications but some drawbacks have been preventing their widespread use so far. For gradient based IIR AFs, adverse operational conditions cause convergence problems in system identification scenarios: underdamped and clustered poles, undermodelling or non-white input signals lead to error surfaces where the adaptation nearly stops on large plateaus or get stuck at sub-optimal local minima that can not be identified as such a priori. Furthermore, the non-stationarity in the input regressor brought by the filter recursivity and the approximations made by the update rules of the stochastic gradient algorithms constrain the learning step size to small values, causing slow convergence. In this work, we propose IIR performance enhancement strategies based on hybrid combinations of AFs that achieve higher convergence rates than ordinary IIR AFs while keeping the stability. / A baixa complexidade dos filtros adaptativos (FAs) IIR é atrativa para aplicações em tempo real, mas certos inconvenientes têm impedido sua ampla utilização até agora. Para os FAs baseados no gradiente descendente, condições operacionais adversas suscitam problemas de convergência em cenários de identificação de sistemas: pólos subamortecidos ou agrupados, submodelagem ou sinais correlacionados originam superfícies de erro onde a adaptação desacelera em grandes planícies ou para em mínimos locais sub-ótimos que não podem ser identificados como tais a priori. Além disso, a não-estacionaridade do regressor de entrada causada pela recursividade do filtro e as aproximações feitas pelas regras de atualização dos algoritmos de gradiente estocástico restringem o passo de aprendizado a valores pequenos, retardando a convergência. Neste trabalho, propomos estratégias de aprimoramento de desempenho baseadas em combinações híbridas e estáveis de FAs que alcançam taxas de convergências mais altas do que FAs IIR comuns.

The low complexity of IIR adaptive filters (AFs) is specially appealing to realtime applications but some drawbacks have been preventing their widespread use so far. For gradient based IIR AFs, adverse operational conditions cause convergence problems in system identification scenarios: underdamped and clustered poles, undermodelling or non-white input signals lead to error surfaces where the adaptation nearly stops on large plateaus or get stuck at sub-optimal local minima that can not be identified as such a priori. Furthermore, the non-stationarity in the input regressor brought by the filter recursivity and the approximations made by the update rules of the stochastic gradient algorithms constrain the learning step size to small values, causing slow convergence. In this work, we propose IIR performance enhancement strategies based on hybrid combinations of AFs that achieve higher convergence rates than ordinary IIR AFs while keeping the stability. / A baixa complexidade dos filtros adaptativos (FAs) IIR é atrativa para aplicações em tempo real, mas certos inconvenientes têm impedido sua ampla utilização até agora. Para os FAs baseados no gradiente descendente, condições operacionais adversas suscitam problemas de convergência em cenários de identificação de sistemas: pólos subamortecidos ou agrupados, submodelagem ou sinais correlacionados originam superfícies de erro onde a adaptação desacelera em grandes planícies ou para em mínimos locais sub-ótimos que não podem ser identificados como tais a priori. Além disso, a não-estacionaridade do regressor de entrada causada pela recursividade do filtro e as aproximações feitas pelas regras de atualização dos algoritmos de gradiente estocástico restringem o passo de aprendizado a valores pequenos, retardando a convergência. Neste trabalho, propomos estratégias de aprimoramento de desempenho baseadas em combinações híbridas e estáveis de FAs que alcançam taxas de convergências mais altas do que FAs IIR comuns.

Adaptive filtering has grown to become a fundamental topic in signal processing, increasingly attracting attention from the community. Important factors in this popularization were their low computational complexity and model-free nature, adapting even to nonstationary characteristics of the systems and/or signals under study. Nevertheless, many adaptive algorithms introduce trade-offs, for instance, between convergence rate, nonstationary signals tracking, and steady-state error, which can hinder their use in practical applications. Furthermore, some adaptive filters can become unstable when word length is reduced and/or the input data are highly correlated. Recently, combination of adaptive filters was put forward as a solution for such issues. This approach consists in combining a pool of filters by means of a supervisor that attempts to make the overall system at least as good (usually in the mean-square sense) as the best filter in the set. Examples of these structures have been shown to successfully solve this problem, although well-known limitations remain to be addressed. Moreover, due to the relative novelty of this topic, developments in combination of adaptive filters are difficult to accommodate into a common theoretical framework. This work studies combination of adaptive filters and addresses the aforementioned issue by (i) classifying the existing combinations and proposing a taxonomy that exposes the similarities and differences in their forms; (ii) proposing new combinations; (iii) devising a general framework for studying combinations of adaptive filters and using such framework in performance analyses. / Filtragem adaptativa vem ganhando destaque desde seu surgimento tornando-se um tópico de estudo fundamental em processamento de sinais. A versatilidade de dispensarem total conhecimento das propriedades estatísticas dos sinais, aliada à simplicidade computacional de seus métodos, foram importantes fatores em sua consagração. Apesar disto, muitos filtros adaptativos apresentam compromissos envolvendo, por exemplo, velocidade de convergência, rastreamento de sinais não-estacionários e erro em regime, que podem dificultar sua aplicação na prática. Ademais, alguns algoritmos adaptativos são instáveis quando suas entradas são altamente correlacionados e/ou a precisão dos cálculos é reduzida. Uma solução recente para estes problemas é o uso de combinações de filtros adaptativos. Esta abordagem baseia-se em combinar um conjunto de filtros por meio de um supervisor que procura fazer com que o sistema global seja pelo menos tão bom (em geral no sentido quadrático médio) quanto o melhor filtro do conjunto. Exemplos destas estruturas já mostraram a eficácia deste método, apesar de ainda existirem reconhecida limitações. Além disso, em se tratando de um tópico relativamente recente, os desenvolvimentos na área de combinação de filtros adaptativos não possuem uma estrutura teórica unificada. Este trabalho propõe abordar estas questões (i) classificando as combinações existentes e criando uma taxonomia que explicite semelhanças e diferenças entre elas; (ii) introduzindo novas combinações; e (iii) desenvolvendo uma forma unificada de descrever combinações de filtros adaptativos e usando-a em análises de desempenho.

In this work, programmable analog techniques using floating-gate transistors have been developed to design precision analog circuits, low-power signal processing primitives and adaptive systems that learn on-chip. Traditional analog implementations lack programmability with the result that issues such as mismatch are corrected at the expense of area. Techniques have been proposed that use floating-gate transistors as an integral part of the circuit of interest to provide both programmability and the ability to correct for mismatch. Traditionally, signal processing has been performed in the digital domain with analog circuits handling the interface with the outside world. Such a partitioning of responsibilities is inefficient as signal processing involves repeated multiplication and addition operations that are both very power efficient in the analog domain. Using programmable analog techniques, fundamental signal processing primitives such as multipliers have been developed in a low-power fashion while preserving accuracy. This results in a paradigm shift in signal processing. A co-operative analog/digital signal processing framework is now possible such that the partitioning of tasks between the analog and digital domains is performed in a power efficient manner. Complex signal processing tasks such as adaptive filtering that learn the weight coefficients are implemented by exploiting the non-linearities inherent with floating-gate programming. The resulting floating-gate synapses are compact, low-power and offer the benefits of non-volatile weight storage. In summary, this research involves developing techniques for improving analog circuit performance and in developing power-efficient techniques for signal processing and on-chip learning.

When computational resources are limited, especially multipliers, distributed arithmetic (DA) is used in lieu of the typical multiplier-based filtering structures. However, DA is not well suited for adaptive applications. The bottleneck is updating the memory table. Several attempts have been done to accelerate updating the memory, but at the expense of additional memory usage and of convergence speed. To develop an adaptive DA filter with an uncompromised convergence rate, the memory table must be fully updated. In this research, an efficient method for fully updating a DA memory table is proposed. The proposed update method is based on exploiting the temporal locality of the stored data and subexpression sharing. The proposed update method reduces the computational workload and requires no additional memory resources. DA using the proposed update method is called conjugate distributed arithmetic. Filters can also be constructed from analog components. Often, for lower precision computations, analog circuits use less power and less chip area than their digital counterparts. However, digital components are often used because of their ease of reprogrammability. Achieving such reprogrammability in analog is possible, but at the expense of additional chip area. A reprogrammable mixed-signal DA finite impulse response (FIR) filter is proposed to address the issues with reprogrammable analog FIR filters that are constructing compact reprogrammable filtering structures, non-symmetric and imprecise filter coefficients, inconsistent sampling of the input data, and input sample data corruption. These issues are successfully addressed using distributed arithmetic, digital registers, and epots. Also, a mixed-signal DA second-order section (SOS), which is used as the building block for higher order infinite impulse response filters, was proposed. The type of issues with an analog SOS filter are similar to those of an analog FIR filter, which are the lack of a compact reprogrammable filtering structure, the imprecise filter coefficients, the inconsistent sampling of the data, and the corruption of the data samples. These issues are successfully addressed using distributed arithmetic and digital registers.

The main objective of this research is to design, simulate, and evaluate telescope array-based receiver architectures for the inter-planetary optical communication links, which is able to provide broadband data support for future deep-space and universe exploration missions. The major aspects of this research are as follows: (1) evaluation and performance comparison of telescope arrays-based receiver with a large, monolithic telescope-based receiver, (2) mathematical modeling and analysis of the impact of various limiting factors (i.e., background noise, atmospheric turbulence, synchronization and tracking errors) on the performance of optical array receiver, (3) design and evaluation of subsystems and adaptive signal processing algorithms for the mitigation of the above-mentioned deleterious effects, and (4) development of an end-to-end simulation and analysis platform for an optical communication link between a transmitter in Mars orbit and an Earth-based array receiver after integration of the proposed sub-systems. In the second part of this research, I aim to extend the analysis to the free-space, short-range, terrestrial optical communication links. In this part, the objective is the development of the efficient simulation tools for the analysis of receiver performance and optical beam propagation through turbulent atmospheric channel. In the experimental part of the research, the investigation of the use of adaptive optics (AO) subsystems for turbulence and background noise compensation in the deep-space optical communication links will be carried out.