947 resultados para Nonnegative sine polynomial
Resumo:
We have examined the dynamical behavior of the kink solutions of the one-dimensional sine-Gordon equation in the presence of a spatially periodic parametric perturbation. Our study clarifies and extends the currently available knowledge on this and related nonlinear problems in four directions. First, we present the results of a numerical simulation program that are not compatible with the existence of a radiative threshold predicted by earlier calculations. Second, we carry out a perturbative calculation that helps interpret those previous predictions, enabling us to understand in depth our numerical results. Third, we apply the collective coordinate formalism to this system and demonstrate numerically that it reproduces accurately the observed kink dynamics. Fourth, we report on the occurrence of length-scale competition in this system and show how it can be understood by means of linear stability analysis. Finally, we conclude by summarizing the general physical framework that arises from our study.
Resumo:
Efficient hardware implementations of arithmetic operations in the Galois field are highly desirable for several applications, such as coding theory, computer algebra and cryptography. Among these operations, multiplication is of special interest because it is considered the most important building block. Therefore, high-speed algorithms and hardware architectures for computing multiplication are highly required. In this paper, bit-parallel polynomial basis multipliers over the binary field GF(2(m)) generated using type II irreducible pentanomials are considered. The multiplier here presented has the lowest time complexity known to date for similar multipliers based on this type of irreducible pentanomials.
Resumo:
This correspondence presents an efficient method for reconstructing a band-limited signal in the discrete domain from its crossings with a sine wave. The method makes it possible to design A/D converters that only deliver the crossing timings, which are then used to interpolate the input signal at arbitrary instants. Potentially, it may allow for reductions in power consumption and complexity in these converters. The reconstruction in the discrete domain is based on a recently-proposed modification of the Lagrange interpolator, which is readily implementable with linear complexity and efficiently, given that it re-uses known schemes for variable fractional-delay (VFD) filters. As a spin-off, the method allows one to perform spectral analysis from sine wave crossings with the complexity of the FFT. Finally, the results in the correspondence are validated in several numerical examples.
Resumo:
"Supported in part by ... Grant no. US NSF GP-9665."
Resumo:
Bibliography: p. 16.
Resumo:
Vita: p. 105.
Resumo:
Mode of access: Internet.
Resumo:
CCPB,
Resumo:
ICCU, IT\ICCU\RAVE\015850.
Resumo:
Contiene: T. I-IV. Iliadis. -T V-VIII. Odysseae.
Resumo:
Mode of access: Internet.
Resumo:
Mode of access: Internet.
Resumo:
Mode of access: Internet.
Resumo:
Mode of access: Internet.
Resumo:
Mode of access: Internet.