نتایج جستجو برای: generalized memory polynomial
تعداد نتایج: 510061 فیلتر نتایج به سال:
The present study introduces a generalized 2-unknown’s higher order shear deformation theory (HSDT) for isotropic and orthotropic plates. The well-known Shimpi’s two-unknown's HSDT is reproduced as a special case. Reddy’s shear strain shape function (SSSF) is also adapted to the present generalized theory. The results show that both Shimpi and the adapted Reddy’ HSDT are essentially the same, i...
A recurrent neural network with a linear memory update is proposed to exactly represent any matrix product state (MPS) and further generalized 2D lattices using multilinear update. It supports perfect sampling wave-function evaluation in polynomial time, provides exact representation of an area law entanglement entropy, outperforms MPS by orders magnitude parameter efficiency.
williams, watts, macleod and mathews' (1988) model of anxiety and depression leads to the prediction that anxious patients will show mood – congreuent implicit memory bias, while depressed patients will show mood-congruent explicit memory bias.although this prediction has been supported by some researchers (denny & hunt, 1992 mathews, moog, et al , 1989 watkins, et al, 1992), the reliabili...
On the generalized tangent bundle of a smooth manifold, we study skew-symmetric endomorphism satisfying an arbitrary polynomial equation with real constant coefficients. We compatibility these structures de Rham operator and Courant-Dorfman bracket. In particular isolate several conditions that when restricted to motivating example almost complex structure are equivalent notion integrability.
Being able to compute efficiently a low-weight multiple of a given binary polynomial is often a key ingredient of correlation attacks to LFSR-based stream ciphers. The best known general purpose algorithm is based on the generalized birthday problem. We describe an alternative approach which is based on discrete logarithms and has much lower memory complexity requirements with a comparable time...
In this paper, an efficient algorithm for the efficiency maximization of the multilevel linear amplification using nonlinear components (M-LINC) systems is proposed regarding the linearity of the system. In this algorithm, we use the generalized memory polynomial (GMP) to provide a behavioral model for the power amplifier (PA) and calculate the power spectral density (PSD) of the output signal ...
Digital predistortion (DPD) is used to compensate for the distortion of power amplifiers (PAs). Inspired by physical structure PA circuit, a feedback in DPD model favored. In this letter, we proposed an infinite impulse response (IIR) modeling and linearization, modifying generalized memory polynomial (GMP) model. We also propose iterative identification algorithm estimate IIR-DPD coefficients....
We study a generalization of the k-list problem, also known as the Generalized Birthday problem. In the k-list problem, one starts with k lists of binary vectors and has to find a set of vectors – one from each list – that sum to the all-zero target vector. In our generalized Approximate k-list problem, one has to find a set of vectors that sum to a vector of small Hamming weight ω. Thus, we re...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید