نتایج جستجو برای: fast fourier transform

تعداد نتایج: 353482  

1991
Joan Daemen Antoon Bosselaers René Govaerts Joos Vandewalle

A method is described to generate collisions for the hash function FFT-Hash that was presented by Claus Schnorr at Crypto '91. A set of colliding messages is given that was obtained by this method.

Journal: :Math. Comput. 2014
Gang Bao Shui-Nee Chow Peijun Li Hao-Min Zhou

This paper is concerned with an inverse random source problem for the one-dimensional stochastic Helmholtz equation, which is to reconstruct the statistical properties of the random source function from boundary measurements of the radiating random electric field. Although the emphasis of the paper is on the inverse problem, we adapt a computationally more efficient approach to study the soluti...

2010
Jérôme Le Rousseau

We consider the first-order Cauchy problem ∂zu + a(z, x,Dx)u = 0, 0 < z ≤ Z, u |z=0 = u0, with Z > 0 and a(z, x,Dx) a k×k matrix of pseudodifferential operators of order one, whose principal part a1 is assumed symmetrizable: there exists L(z, x, ξ) of order 0, invertible, such that a1(z, x, ξ) = L(z, x, ξ) (−iβ1(z, x, ξ) + γ1(z, x, ξ)) (L(z, x, ξ))−1, where β1 and γ1 are hermitian symmetric and...

2008
Lei Fu

We calculate the local Fourier transformations for a class of Q l -sheaves. In particular, we verify a conjecture of Laumon and Malgrange ([L] 2.6.3).

2011
David S. Wise

K e y W o r d s a n d P h r a s e s : V L S I , s w i t c h i n g n e t w o r k s , d e l t a n e t w o r k s , omega n e t w o r k s , m u l t i p r o c e s s i n g . CR C a t e g o r i e s : 6 . 1 , 4 . 3 2 , 3 . 8 1 , 3 . 8 3 .

Journal: :EURASIP J. Adv. Sig. Proc. 2004
Colin P. Ratcliffe William J. Bagaria Sonia M. F. Garcia Richard P. Fahey

The type of signal studied in this paper is a periodic pulse, with the pulse length short compared to the period, and the signal is buried in noise. If standard techniques such as the fast Fourier transform are used to study the signal, the data record needs to be very long. Additionally, there would be a very large number of calculations. The rapid binary gage function was developed to quickly...

Journal: :SIAM J. Numerical Analysis 2014
Ying Jiang Bo Wang Yuesheng Xu

s of IWANASP, October 22 – 24, 2015, Lagos, Portugal A FAST FOURIER–GALERKIN METHOD SOLVING A BOUNDARY INTEGRAL EQUATION FOR THE BIHARMONIC EQUATION

2007
J. Sakai H. Kobayashi

When an extreme earthquake occurs, it is essential to detect the severe structural damage that affect the structural safety immediately. This paper proposes a method for quick earthquake damage detection/evaluation of reinforced concrete bridge columns. An intelligent sensor unit is developed that captures changes in the natural period of a bridge column by FFT of response acceleration recorded...

2015
K. Jayaram

FFT mainly involved important role in electronics & communication field. The various types of FFT radix algorithm have analyzed and is to be modified in future. As a result of its exhaustive computational necessities, it occupies large area and consumes high power if implemented in hardware. Efficient algorithms are developed to improve its architecture.In this paper, we have conversed about FF...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید