Utilização de filtro de transformada de fourier para a minimização de ruídos em sinais analíticos

Instrumental data always present some noise. The analytical data information and instrumental noise generally has different frequencies. Thus is possible to remove the noise using a digital filter based on Fourier transform and inverse Fourier transform. This procedure enhance the signal/noise ratio and consecutively increase the detection limits on instrumental analysis. The basic principle of Fourier transform filter with modifications implemented to improve its performance is presented. A numerical example, as well as a real voltammetric example are showed to demonstrate the Fourier transform filter implementation. The programs to perform the Fourier transform filter, in Matlab and Visual Basic languages, are included as appendices

The point source method for inverse scattering in the time domain

Many recent inverse scattering techniques have been designed for single frequency scattered fields in the frequency domain. In practice, however, the data is collected in the time domain. Frequency domain inverse scattering algorithms obviously apply to time-harmonic scattering, or nearly time-harmonic scattering, through application of the Fourier transform. Fourier transform techniques can also be applied to non-time-harmonic scattering from pulses. Our goal here is twofold: first, to establish conditions on the time-dependent waves that provide a correspondence between time domain and frequency domain inverse scattering via Fourier transforms without recourse to the conventional limiting amplitude principle; secondly, we apply the analysis in the first part of this work toward the extension of a particular scattering technique, namely the point source method, to scattering from the requisite pulses. Numerical examples illustrate the method and suggest that reconstructions from admissible pulses deliver superior reconstructions compared to straight averaging of multi-frequency data. Copyright (C) 2006 John Wiley & Sons, Ltd.

Efeitos do strike das estruturas geológicas de duas dimensões nas pseudos-seções de IP resistividade

Os levantamentos de IP-resistividade efetuados na Serra dos Carajás não foram executados ortogonalmente às estruturas geológicas, pois utilizaram linhas anteriormente abertas pelas equipes de geoquímica. Este fato motivou este estudo teórico da influência da direção das linhas de medidas de IP-resistividade em relação ao "strike" da estrutura. Foi usado o programa de elementos finitos de Rijo (1977), desenvolvido para levantamentos perpendiculares às estruturas com as adaptações necessárias. A modificação principal foi na rotina de transformação inversa de Fourier. Para o caso simples dos levantamentos perpendiculares, a transformada inversa é uma integral discreta com apenas sete pontos. No entanto, para as medidas obliquas, o integrando é oscilatório, e portanto, a integral a ser calculada é mais complexa. Foi adaptado um método apresentado por Ting e Luke (1981), usando dezoito pontos em cada integração. Foi constatado que o efeito da direção da linha em relação ao "strike" é desprezível para ângulos maiores que 60 graus. Para ângulos menores, o efeito consiste no alongamento da anomalia, com pequenas alterações em seu centro. Não há uma maneira simples de compensar este efeito com mudanças nos parâmetros do modelo.

Oscilador harmônico unidimensional via transformada unilateral de Fourier e mapeamento do potencial de morse unidimensional nos potenciais pseudo-harmônico e de kratzer tridimensionais

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Oscilador harmônico unidimensional via transformada unilateral de Fourier e mapeamento do potencial de morse unidimensional nos potenciais pseudo-harmônico e de kratzer tridimensionais

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Parallel-recusive filter structures for the computation of discrete transforms

A general approach is presented for implementing discrete transforms as a set of first-order or second-order recursive digital filters. Clenshaw's recurrence formulae are used to formulate the second-order filters. The resulting structure is suitable for efficient implementation of discrete transforms in VLSI or FPGA circuits. The general approach is applied to the discrete Legendre transform as an illustration.

Efficient computation of discrete polynomial transforms

This letter presents a new recursive method for computing discrete polynomial transforms. The method is shown for forward and inverse transforms of the Hermite, binomial, and Laguerre transforms. The recursive flow diagrams require only 2 additions, 2( +1) memory units, and +1multipliers for the +1-point Hermite and binomial transforms. The recursive flow diagram for the +1-point Laguerre transform requires 2 additions, 2( +1) memory units, and 2( +1) multipliers. The transform computation time for all of these transforms is ( )

Nonlinear inverse synthesis for high spectral efficiency transmission in optical fibers

In linear communication channels, spectral components (modes) defined by the Fourier transform of the signal propagate without interactions with each other. In certain nonlinear channels, such as the one modelled by the classical nonlinear Schrödinger equation, there are nonlinear modes (nonlinear signal spectrum) that also propagate without interacting with each other and without corresponding nonlinear cross talk, effectively, in a linear manner. Here, we describe in a constructive way how to introduce such nonlinear modes for a given input signal. We investigate the performance of the nonlinear inverse synthesis (NIS) method, in which the information is encoded directly onto the continuous part of the nonlinear signal spectrum. This transmission technique, combined with the appropriate distributed Raman amplification, can provide an effective eigenvalue division multiplexing with high spectral efficiency, thanks to highly suppressed channel cross talk. The proposed NIS approach can be integrated with any modulation formats. Here, we demonstrate numerically the feasibility of merging the NIS technique in a burst mode with high spectral efficiency methods, such as orthogonal frequency division multiplexing and Nyquist pulse shaping with advanced modulation formats (e.g., QPSK, 16QAM, and 64QAM), showing a performance improvement up to 4.5 dB, which is comparable to results achievable with multi-step per span digital back propagation.

On the Error-Free Computation of Fast Cosine Transform

We extend our previous work into error-free representations of transform basis functions by presenting a novel error-free encoding scheme for the fast implementation of a Linzer-Feig Fast Cosine Transform (FCT) and its inverse. We discuss an 8x8 L-F scaled Discrete Cosine Transform where the architecture uses a new algebraic integer quantization of the 1-D radix-8 DCT that allows the separable computation of a 2-D DCT without any intermediate number representation conversions. The resulting architecture is very regular and reduces latency by 50% compared to a previous error-free design, with virtually the same hardware cost.

Some Inverse Problems in Analysis and Geometry

Thesis (Ph.D.)--University of Washington, 2016-08

Análise quantitativa da distribuição de jogadores de futebol em campo durante jogos oficiais

Universidade Estadual de Campinas. Faculdade de Educação Física

Methods of Fourier optics in digital holographic microscopy

In this paper, processing methods of Fourier optics implemented in a digital holographic microscopy system are presented. The proposed methodology is based on the possibility of the digital holography in carrying out the whole reconstruction of the recorded wave front and consequently, the determination of the phase and intensity distribution in any arbitrary plane located between the object and the recording plane. In this way, in digital holographic microscopy the field produced by the objective lens can be reconstructed along its propagation, allowing the reconstruction of the back focal plane of the lens, so that the complex amplitudes of the Fraunhofer diffraction, or equivalently the Fourier transform, of the light distribution across the object can be known. The manipulation of Fourier transform plane makes possible the design of digital methods of optical processing and image analysis. The proposed method has a great practical utility and represents a powerful tool in image analysis and data processing. The theoretical aspects of the method are presented, and its validity has been demonstrated using computer generated holograms and images simulations of microscopic objects. (c) 2007 Elsevier B.V. All rights reserved.

Complex dynamics in the trajectory control of redundant manipulators

Redundant manipulators allow the trajectory optimization, the obstacle avoidance, and the resolution of singularities. For this type of manipulators, the kinematic control algorithms adopt generalized inverse matrices that may lead to unpredictable responses. Motivated by these problems this paper studies the complexity revealed by the trajectory planning scheme when controlling redundant manipulators. The results reveal fundamental properties of the chaotic phenomena and give a deeper insight towards the development of superior trajectory control algorithms.

Rhapsody in fractional

This paper studies several topics related with the concept of “fractional” that are not directly related with Fractional Calculus, but can help the reader in pursuit new research directions. We introduce the concept of non-integer positional number systems, fractional sums, fractional powers of a square matrix, tolerant computing and FracSets, negative probabilities, fractional delay discrete-time linear systems, and fractional Fourier transform.

Rhapsody in Fractional

This paper studies several topics related with the concept of “fractional” that are not directly related with Fractional Calculus, but can help the reader in pursuit new research directions. We introduce the concept of non-integer positional number systems, fractional sums, fractional powers of a square matrix, tolerant computing and FracSets, negative probabilities, fractional delay discrete-time linear systems, and fractional Fourier transform.