نتایج جستجو برای: n transform

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

Journal: :Applicable Analysis and Discrete Mathematics 2023

We deal with applications of the transform T? we introduced in our paper On a generalized function-to-sequence transform, Appl. Anal. Disc. Math. Vol. 14 No 2 (2020) 300-316. Taking different sequences {?n}n?N0 linked to linear difference operator D? gives rise family transforms that enables mapping differential equation and its solutions solutions. It can map one as well.

Journal: :Journal of the Optical Society of America. A, Optics, image science, and vision 2005
Bryan M Hennelly John T Sheridan

The linear canonical transform (LCT) describes the effect of any quadratic phase system (QPS) on an input optical wave field. Special cases of the LCT include the fractional Fourier transform (FRT), the Fourier transform (FT), and the Fresnel transform (FST) describing free-space propagation. Currently there are numerous efficient algorithms used (for purposes of numerical simulation in the are...

Journal: :Mathematics 2023

The Hough transform, interpreted as the discretization of Radon is a widely used tool in image processing and machine vision. primary way to speed it up employ Brady–Yong algorithm. However, accuracy straight line utilized this algorithm limited. In study, we propose novel called ASD2 that offers fast computation transform for images arbitrary sizes. Our approach adopts scheme similar but incor...

Journal: :رادار 0
روح اله رمضانی مجید اخوت

s is a time-frequency transform based on the concept of short-time fourier transform and wavelet transform. the main property of this transform that separate it from the discrete short-time fourier transform is variable frequency resolution. but in this transform the change of resolution of high frequencies to low frequencies is very high. so another transform as a modified s transform is intro...

1993
A. G. RAMM A. I. ZASLAVSKY

Singularities of the Radon transform of a piecewise smooth function f(x), x e R" , n > 2, are calculated. If the singularities of the Radon transform are known, then the equations of the surfaces of discontinuity of f(x) are calculated by applying the Legendre transform to the functions, which appear in the equations of the discontinuity surfaces of the Radon transform of f(x) ; examples are gi...

F. Barikan S. Khanahmadzadeh,

Polyimide/Nickel oxide (polyimide/NiO) nanocomposite was successfully synthesized by sol gel technique, using Pyromellitic dianhydriede (PMDA), 4,4-oxydianiline (ODA) and N,N-dimethylacetamide (DMAC) and 10 wt% Nickel titanate nanopowders (NPs). Fourier transform infrared spectrometry (FTIR), X-ray diffraction (XRD), scanning electron microscopy (SEM), and vibrating sample magnetometer (VSM) we...

F. Barikan S. Khanahmadzadeh,

Polyimide/Nickel oxide (polyimide/NiO) nanocomposite was successfully synthesized by sol gel technique, using Pyromellitic dianhydriede (PMDA), 4,4-oxydianiline (ODA) and N,N-dimethylacetamide (DMAC) and 10 wt% Nickel titanate nanopowders (NPs). Fourier transform infrared spectrometry (FTIR), X-ray diffraction (XRD), scanning electron microscopy (SEM), and vibrating sample magnetometer (VSM) we...

1997
James Jacob P. Srinivas Sivakumar Vishwani D. Agrawal

An exclusive-OR transform of input variables significantly reduces the size of the PLA implementation for adder and comparator circuits. For n bit adder circuits, the size of PLA for transformed functions is O(n2). In comparison, when the complete truth-table of an adder is minimized, the PLA size will be O(2n+2). Similarly, for an n bit comparator, the size of the PLA is reduced from O(2n+1) t...

1991
Paraskevi Fragopoulou Selim G. Akl

Abstmcr-The n-star graph, denoted by S,, is one of the graph networks that have been recently proposed as attractive alternatives to the n-cube topology for interconnecting processors in parallel computers. In this paper, we present a parallel algorithm for the computation of the Fourier transform on the star graph. The algorithm requires O(n*)multiply-add steps for an input sequence of n! elem...

2015
Nicholas Hale Alex Townsend

An O(N(logN)2/ loglogN) algorithm for computing the discrete Legendre transform and its inverse is described. The algorithm combines a recently developed fast transform for converting between Legendre and Chebyshev coefficients with a Taylor series expansion for Chebyshev polynomials about equallyspaced points in the frequency domain. Both components are based on the FFT, and as an intermediate...

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

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