On the Transform Method of Solution of an External Crack Problem

The breakdown of the usual method of Fourier transforms in the problem of an external line crack in a thin infinite elastic plate is discovered and the correct solution of this problem is derived using the concept of a generalised Fourier transform of a type discussed first by Golecki [1] in connection with Flamant's problem.

Segal-Bargmann transform and Paley-Wiener theorems on M(2)

We study the Segal-Bargmann transform on M(2). The range of this transform is characterized as a weighted Bergman space. In a similar fashion Poisson integrals are investigated. Using a Gutzmer's type formula we characterize the range as a class of functions extending holomorphically to an appropriate domain in the complexification of M(2). We also prove a Paley-Wiener theorem for the inverse Fourier transform.

Component wave delineation of ECG by filtering in the Fourier domain

A complete solution to the fundamental problem of delineation of an ECG signal into its component waves by filtering the discrete Fourier transform of the signal is presented. The set of samples in a component wave is transformed into a complex sequence with a distinct frequency band. The filter characteristics are determined from the time signal itself. Multiplication of the transformed signal with a complex sinusoidal function allows the use of a bank of low-pass filters for the delineation of all component waves. Data from about 300 beats have been analysed and the results are highly satisfactory both qualitatively and quantitatively.

Wavelet transform analysis of truncated fringe patterns in 3-D surface profilometry

Wavelet transform analysis of projected fringe pattern for phase recovery in 3-D shape measurement of objects is investigated. The present communication specifically outlines and evaluates the errors that creep in to the reconstructed profiles when fringe images do not satisfy periodicity. Three specific cases that give raise to non-periodicity of fringe image are simulated and leakage effects caused by each one of them are analyzed with continuous complex Morlet wavelet transform. Same images are analyzed with FFT method to make a comparison of the reconstructed profiles with both methods. Simulation results revealed a significant advantage of wavelet transform profilometry (WTP), that the distortions that arise due to leakage are confined to the locations of discontinuity and do not spread out over the entire projection as in the case of Fourier transform profilometry (FTP).

A transform approach to linear network coding for acyclic networks with delay

The algebraic formulation for linear network coding in acyclic networks with each link having an integer delay is well known. Based on this formulation, for a given set of connections over an arbitrary acyclic network with integer delay assumed for the links, the output symbols at the sink nodes at any given time instant is a Fq-linear combination of the input symbols across different generations, where Fq denotes the field over which the network operates. We use finite-field discrete Fourier transform (DFT) to convert the output symbols at the sink nodes at any given time instant into a Fq-linear combination of the input symbols generated during the same generation. We call this as transforming the acyclic network with delay into n-instantaneous networks (n is sufficiently large). We show that under certain conditions, there exists a network code satisfying sink demands in the usual (non-transform) approach if and only if there exists a network code satisfying sink demands in the transform approach. Furthermore, assuming time invariant local encoding kernels, we show that the transform method can be employed to achieve half the rate corresponding to the individual source-destination mincut (which are assumed to be equal to 1) for some classes of three-source three-destination multiple unicast network with delays using alignment strategies when the zero-interference condition is not satisfied.

Fractional Hilbert transform extensions and associated analytic signal construction

The analytic signal (AS) was proposed by Gabor as a complex signal corresponding to a given real signal. The AS has a one-sided spectrum and gives rise to meaningful spectral averages. The Hilbert transform (HT) is a key component in Gabor's AS construction. We generalize the construction methodology by employing the fractional Hilbert transform (FrHT), without going through the standard fractional Fourier transform (FrFT) route. We discuss some properties of the fractional Hilbert operator and show how decomposition of the operator in terms of the identity and the standard Hilbert operators enables the construction of a family of analytic signals. We show that these analytic signals also satisfy Bedrosian-type properties and that their time-frequency localization properties are unaltered. We also propose a generalized-phase AS (GPAS) using a generalized-phase Hilbert transform (GPHT). We show that the GPHT shares many properties of the FrHT, in particular, selective highlighting of singularities, and a connection with Lie groups. We also investigate the duality between analyticity and causality concepts to arrive at a representation of causal signals in terms of the FrHT and GPHT. On the application front, we develop a secure multi-key single-sideband (SSB) modulation scheme and analyze its performance in noise and sensitivity to security key perturbations. (C) 2013 Elsevier B.V. All rights reserved.

L-p-Integrability, Dimensions of Supports of Fourier Transforms and Applications

It is proved that there does not exist any non zero function in with if its Fourier transform is supported by a set of finite packing -measure where . It is shown that the assertion fails for . The result is applied to prove L-p Wiener Tauberian theorems for R-n and M(2).

Precoding-Based Network Alignment Using Transform Approach for Acyclic Networks With Delay

The algebraic formulation for linear network coding in acyclic networks with the links having integer delay is well known. Based on this formulation, for a given set of connections over an arbitrary acyclic network with integer delay assumed for the links, the output symbols at the sink nodes, at any given time instant, is a F(p)m-linear combination of the input symbols across different generations, where F(p)m denotes the field over which the network operates (p is prime and m is a positive integer). We use finite-field discrete Fourier transform to convert the output symbols at the sink nodes, at any given time instant, into a F(p)m-linear combination of the input symbols generated during the same generation without making use of memory at the intermediate nodes. We call this as transforming the acyclic network with delay into n-instantaneous networks (n is sufficiently large). We show that under certain conditions, there exists a network code satisfying sink demands in the usual (nontransform) approach if and only if there exists a network code satisfying sink demands in the transform approach. When the zero-interference conditions are not satisfied, we propose three precoding-based network alignment (PBNA) schemes for three-source three-destination multiple unicast network with delays (3-S 3-D MUN-D) termed as PBNA using transform approach and time-invariant local encoding coefficients (LECs), PBNA using time-varying LECs, and PBNA using transform approach and block time-varying LECs. We derive sets of necessary and sufficient conditions under which throughputs close to n' + 1/2n' + 1, n'/2n' + 1, and n'/2n' + 1 are achieved for the three source-destination pairs in a 3-S 3-D MUN-D employing PBNA using transform approach and time-invariant LECs, and PBNA using transform approach and block time-varying LECs, where n' is a positive integer. For PBNA using time-varying LECs, we obtain a sufficient condition under which a throughput demand of n(1)/n, n(2)/n, and n(3)/n can be met for the three source-destination pairs in a 3-S 3-D MUN-D, where n(1), n(2), and n(3) are positive integers less than or equal to the positive integer n. This condition is also necessary when n(1) + n(3) = n(1) + n(2) = n where n(1) >= n(2) >= n(3).

用Fourier变换莫尔法测量流体自由表面微幅波的振幅

采用一种非接触的光学方法——傅立叶变换莫尔法（Fourier transform method），结合数字图像处理技术，对微幅振荡的水表面波的振幅进行测量。它是对全场中每一个像素点进行测量，比接触测量法具有更高的灵敏度。它为微幅水表面波振幅的测量提供了一种手段。通过将计算机生成的周期性光栅图像经投影机直接投影到被测物体的参考平面，经CCD摄像头、图像板捕捉存储形成数字化的光栅图像，利用傅立叶变换莫尔法处理光栅图像，从而获得包含有水表面波的振幅的相位信息，再经适当的几何变换获得振幅信息。我们在生趣振荡装置上进行了不同激励频率和不同振幅的表面波的振幅测量。

The power of quantum Fourier sampling

How powerful are Quantum Computers? Despite the prevailing belief that Quantum Computers are more powerful than their classical counterparts, this remains a conjecture backed by little formal evidence. Shor's famous factoring algorithm [Shor97] gives an example of a problem that can be solved efficiently on a quantum computer with no known efficient classical algorithm. Factoring, however, is unlikely to be NP-Hard, meaning that few unexpected formal consequences would arise, should such a classical algorithm be discovered. Could it then be the case that any quantum algorithm can be simulated efficiently classically? Likewise, could it be the case that Quantum Computers can quickly solve problems much harder than factoring? If so, where does this power come from, and what classical computational resources do we need to solve the hardest problems for which there exist efficient quantum algorithms?

We make progress toward understanding these questions through studying the relationship between classical nondeterminism and quantum computing. In particular, is there a problem that can be solved efficiently on a Quantum Computer that cannot be efficiently solved using nondeterminism? In this thesis we address this problem from the perspective of sampling problems. Namely, we give evidence that approximately sampling the Quantum Fourier Transform of an efficiently computable function, while easy quantumly, is hard for any classical machine in the Polynomial Time Hierarchy. In particular, we prove the existence of a class of distributions that can be sampled efficiently by a Quantum Computer, that likely cannot be approximately sampled in randomized polynomial time with an oracle for the Polynomial Time Hierarchy.

Our work complements and generalizes the evidence given in Aaronson and Arkhipov's work [AA2013] where a different distribution with the same computational properties was given. Our result is more general than theirs, but requires a more powerful quantum sampler.

Extended fractional Fourier transforms

The concept of an extended fractional Fourier transform (FRT) is suggested. Previous PBT's and complex FRT's are only its subclasses. Then, through this concept and its method, we explain the physical meaning of any optical Fresnel diffraction through a lens: It is just an extended FRT; a lens-cascaded system can equivalently be simplified to a simple analyzer of the FRT; the two-independent-parameter FRT of an object illuminated with a plane wave can be readily implemented by a lens of arbitrary focal length; when cascading, the Function of each lens unit and the relationship between the adjacent ones are clear and simple; and more parameters and fewer restrictions on cascading make the optical design easy. (C) 1997 Optical Society of America.

Dynamic full-range Fourier-domain optical coherence tomography using sinusoidal phase-modulating interferometry

We propose a technique for dynamic full-range Fourier-domain optical coherence tomography by using sinusoidal phase-modulating interferometry, where both the full-range structural information and depth-resolved dynamic information are obtained. A novel frequency-domain filtering algorithm is proposed to reconstruct a time-dependent complex spectral interferogram from the sinusoidally phase-modulated interferogram detected with a high-rate CCD camera. By taking the amplitude and phase of the inverse Fourier transform of the complex spectral interferogram, a time-dependent full-range cross-sectional image and depth-resolved displacement are obtained. Displacement of a sinusoidally vibrating glass cover slip behind a fixed glass cover slip is measured with subwavelength sensitivity to demonstrate the depth-resolved dynamic imaging capability of our system. (c) 2007 Society of Photo-Optical Instrumentation Engineers.

Dynamic full-range Fourier-domain optical coherence tomography using sinusoidal phase-modulating interferometry

We propose a technique for dynamic full-range Fourier-domain optical coherence tomography by using sinusoidal phase-modulating interferometry, where both the full-range structural information and depth-resolved dynamic information are obtained. A novel frequency-domain filtering algorithm is proposed to reconstruct a time-dependent complex spectral interferogram from the sinusoidally phase-modulated interferogram detected with a high-rate CCD camera. By taking the amplitude and phase of the inverse Fourier transform of the complex spectral interferogram, a time-dependent full-range cross-sectional image and depth-resolved displacement are obtained. Displacement of a sinusoidally vibrating glass cover slip behind a fixed glass cover slip is measured with subwavelength sensitivity to demonstrate the depth-resolved dynamic imaging capability of our system. (c) 2007 Society of Photo-Optical Instrumentation Engineers.

Um esquema de Fourier local para análise tempo-frequência de sinais não-estacionários aplicado a ruído eletroquímico

Sinais diversos estão presentes em nosso cotidiano, assim como nas medidas realizadas nas atividades de ciência e tecnologia. Dentre estes sinais, tem grande importância tecnológica aqueles associados à corrosão de estruturas metálicas. Assim, esta tese propõe o estudo de um esquema local de transformada de Fourier janelada, com a janela variando em função da curtose, aplicada a sinais de ruído eletroquímico. A curtose foi avaliada nos domínios do tempo e da frequência e processada pelo programa desenvolvido para esse fim. O esquema foi aplicado a sinais de ruído eletroquímico dos aços UNS S31600, UNS G10200 e UNS S32750 imersos em três soluções: FeCl3 0,1 mol=L (cloreto férrico), H2SO4 5%(ácido sulfúrico) e NaOH 0,1%(hidróxido de sódio). Para os aços inoxidáveis, estas soluções promovem corrosão localizada, uniforme e passivação, respectivamente. Visando testar o desempenho do esquema de Fourier desenvolvido, testes foram realizados utilizando-se inicialmente sinais sintéticos e em seguida sinais de ruído eletroquímico. Notou-se que os sinais têm características de não-estacionaridade e a maior parte da energia está presente em baixa frequência. Os intervalos de tempo e de frequência onde se concentra a maior parte da energia do sinal foram correlacionados. Para os picos máximos dos sinais de potencial e corrente obtidos de amperimetria de resistência nula, a correlação entre eles foi baixa, independente da forma de corrosão presente. Conclui-se que o método se adaptou bastante bem às características locais do sinal eletroquímico permitindo o monitoramento dos espectros tempo-frequência. O fato de ser sensível às características locais do sinal permite analisar aspectos dos sinais que do modo clássico não podem ser diretamente processados. O método da transformada de Fourier janelada variável (Variable Short-Time Fourier Transform - VSTFT) adaptou-se muito bem no monitoramento dos sinais originados de potencial de circuito aberto e amperimetria de resistência nula.

Improved digital processing method used for image motion measurement based on hybrid opto-digital joint transform correlator

Hybrid opto-digital joint transform correlator (HODJTC) is effective for image motion measurement, but it is different from the traditional joint transform correlator because it only has one optical transform and the joint power spectrum is directly input into a digital processing unit to compute the image shift. The local cross-correlation image can be directly obtained by adopting a local Fourier transform operator. After the pixel-level location of cross-correlation peak is initially obtained, the up-sampling technique is introduced to relocate the peak in even higher accuracy. With signal-to-noise ratio >= 20 dB, up-sampling factor k >= 10 and the maximum image shift <= 60 pixels, the root-mean-square error of motion measurement accuracy can be controlled below 0.05 pixels.