نتایج جستجو برای: successive approximation method

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

Sina Mahdavi

A new high-resolution and high-speed fully differential Successive Approximation Register (SAR) Analog to Digital Converter (ADC) based on Capacitor Merged Technique is presented in this paper. The main purposes of the proposed idea are to achieve high-resolution and high-speed SAR ADC simultaneously as well. It is noteworthy that, exerting the suggested method the total capacitance and the rat...

In this paper, a one-sample point predictor of the random variable X is studied. X is the occurrence of an event in any successive visits $L_i$ and $R_i$ :i=1,2…,n (interval censoring). Our proposed method is based on finding the expected value of the conditional distribution of X given $L_i$ and $R_i$ (i=1,2…,n). To make the desired prediction, our approach is on the basis of approximating the...

2016
Tamil Selvi Rajiv Kannan

To improve the performance of video compression produced by the previous solution, we propose a region based texture approximation technique. There are situations where the tiny part of the image would vary and transmitting the entire image will not necessary. To overcome such problem, the method splits the video into frames and for each successive frame the method splits the frame into number ...

Journal: :journal of mahani mathematical research center 0
fatemeh salary pour sharif abad department of mathematics, shahid bahonar university of kerman, azim rivaz department of mathematics, shahid bahonar university of kerman

in this paper, we present gauss-sidel and successive over relaxation (sor) iterative methods for finding the approximate solution system of fuzzy sylvester equations (sfse), ax + xb = c, where a and b are two m*m crisp matrices, c is an m*m fuzzy matrix and x is an m*m unknown matrix. finally, the proposed iterative methods are illustrated by solving one example.

2012
I. K. Youssef

Problem statement: A new variant of the Successive Overrelaxation (SOR) method for solving linear algebraic systems, the KSOR method was introduced. The treatment depends on the assumption that the current component can be used simultaneously in the evaluation in addition to the use the most recent calculated components as in the SOR method. Approach: Using the hidden explicit characterization ...

2013
K. Sindhuja

This concise presents a Modified Successive Approximation Register (MSAR)-based duty cycle corrector (DCC), which achieves low jitter, fast lock time with an accurate 50% duty cycle correction. This Modified SAR adopts a binary search method to condense lock time while maintaining tight synchronization between effort and production clocks. The projected DCC consists of a duty-cycle detector, a ...

Journal: :J. Applied Mathematics 2012
Snezhana G. Hristova Angel Golev Kremena Stefanova

The object of investigation of the paper is a special type of difference equations containing the maximum value of the unknown function over a past time interval. These equations are adequate models of real processes which present state depends significantly on their maximal value over a past time interval. An algorithm based on the quasilinearization method is suggested to solve approximately ...

1999
JONG YEOUL PARK HYO KEUN HAN H. K. HAN

By using the method of successive approximation, we prove the existence and uniqueness of a solution of the fuzzy differential equation x′(t)= f(t,x(t)), x(t0)= x0. We also consider an -approximate solution of the above fuzzy differential equation.

2013
A. Sanyal N. Sun

A high energy-efficiency switching scheme for a successive approximation register (SAR) analogue-to-digital converter (ADC) is presented. The proposed method can achieve 98.4% savings in switching energy when compared to a conventional SAR. The proposed technique also achieves a 4 × reduction in total capacitance used in the digital-to-analogue converter (DAC) compared to the conventional DAC.

Journal: :Universität Trier, Mathematik/Informatik, Forschungsbericht 2001
Alexander Kaplan Rainer Tichatschke

For variational inequalities characterizing saddle points of Lagragians associated with convex programming problems in Hilbert spaces, the convergence of an interior proximal method based on Bregman distance functionals is studied. The convergence results admit a successive approximation of the variational inequality and an inexact treatment of the proximal iterations.

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

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