نتایج جستجو برای: n transform
تعداد نتایج: 1081153 فیلتر نتایج به سال:
In this paper, we used tetranuclear copper (II) Schiff base complexes, [Cu4 (μ-sal2hn) (μ-N3)2(N3)2] (1) and [Cu4 (μ-salophen) (μ1, 1-N3)2(N3)2] (2), as new precursor in solid-state thermal decomposition for the synthesis of CuO ...
The Hankel transform of an integer sequence (an) is defined as a sequence formed by the determinants of the matrices An, where An is the upper-left submatrix of size n× n of the Hankel matrix A = a0 a1 a2 a3 · · · a1 a2 a3 a4 · · · a2 a3 a4 a5 · · · .. .. .. .. . . . . In this talk, methods in deriving the Hankel transform of Bell and other Bell-type numbers will be discussed, particu...
A method for constructing spread spectrum sequences is presented. The method is based on a linear, orthogonal, symmetric transform, the Rudin-Shapiro transform (RST), which is in many respects quite similar to the Haar wavelet packet transform. The RST provides the means for generating large sets of spread spectrum signals. This presentation provides a simple definition of the symmetric RST tha...
The act of measuring a physical signal or field suggests a generalization of the wavelet transform that turns out to be a windowed version of the Radon transform. A reconstruction formula is derived which inverts this transform. A special choice of window yields the " Analytic–Signal transform " (AST), which gives a partially analytic extension of functions from R n to C n. For n =1, this reduc...
The term FFT is used to signify a specific method to compute the DFT in an efficient manner. While a transform in its own right, the DFT/FFT can be interpreted in terms of the CT-Fourier transform for a sampled signal x(t). Let us consider a signal x(t), sampled at the time instants nT, n = 0,1,...N-1, and suppose that the signal is 0 outside the sampled interval [0, (N-1)T]. The Fourier transf...
We present algorithms for the discrete cosine transform (DCT) and discrete sine transform (DST), of types II and III, that achieve a lower count of real multiplications and additions than previously published algorithms, without sacrificing numerical accuracy. Asymptotically, the operation count is reduced from ∼ 2N log2 N to ∼ 17 9 N log2 N for a power-of-two transform size N . Furthermore, we...
We develop an analytic approach to the Radon transform f̂(ζ) = ∫ τ⊂ζ f(τ), where f(τ) is a function on the affine Grassmann manifold G(n, k) of k-dimensional planes in Rn, and ζ is a k′-dimensional plane in the similar manifold G(n, k′), k′ > k. For f ∈ Lp(G(n, k)), we prove that this transform is finite almost everywhere on G(n, k′) if and only if 1 ≤ p < (n− k)/(k′− k), and obtain explicit inv...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید