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

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

1997
L. Auslander J. R. Johnson R. W. Johnson

This paper shows that there are fast Fourier transform (FFT) algorithms that work, for a fixed number of points, independent of the dimension. Changing the dimension is achieved by relabeling the input and the output and changing the “twiddle factors.” An important consequence of this result, is that a program designed to compute the 1-dimensional Fourier transform can be easily modified to com...

Journal: :journal of solid mechanics 0
r kumar department of mathematics, kurukshetra university, kurukshetra, haryana,india r vohra department of mathematics& statistics, h.p.university, shimla, hp, india m.g gorla department of mathematics& statistics, h.p.university, shimla, hp, india

a dynamic two dimensional problem of thermoelasticity with double porous structure has been considered to investigate the disturbance due to normal force and thermal source. laplace and fourier transform technique is applied to the governing equations to solve the problem. the transformed components of stress and temperature distribution are obtained .the resulting expressions are obtained in t...

Journal: :Communications on Pure and Applied Analysis 2022

<p style='text-indent:20px;'>We give a simple proof of the sharp decay Fourier-transform surface-carried measures two-dimensional generic surfaces. The estimates are applied to prove Strichartz and resolvent for elliptic operators whose characteristic surfaces satisfy assumptions. We also obtain new results on spectral scattering theory discrete Schrödinger cubic lattice.</p>

Journal: :Eurasip Journal on Wireless Communications and Networking 2023

Abstract In this paper, a two-dimensional generalized weighted fractional Fourier transform (2DGWFRFT) and constellation scrambling (CS)-based secure spatial modulation (SM) scheme, called 2DGWFRFT-CS-SM, is proposed to enhance the physical layer security (PLS) of wireless communication system. The scheme executed by two steps. first step, 2DGWFRFT implemented as kernel for PLS provision. secon...

2005
Steven G. Johnson Matteo Frigo

Recent results by Van Buskirk et al. have broken the record set by Yavne in 1968 for the lowest arithmetic complexity (exact count of real additions and multiplications) to compute a power-of-two discrete Fourier transform. Here, we present a simple recursive modification of the split-radix algorithm that computes the DFT with asymptotically about 6% fewer operations than Yavne, matching the co...

Journal: :J. Applied Mathematics 2012
Bing-zhao Li Tian-Zhou Xu

This paper investigates the Parseval relationship of samples associated with the fractional Fourier transform. Firstly, the Parseval relationship for uniform samples of band-limited signal is obtained. Then, the relationship is extended to a general set of nonuniform samples of band-limited signal associated with the fractional Fourier transform. Finally, the two dimensional case is investigate...

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

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