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

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

Journal: :مهندسی برق مدرس 0
mohammad moltafet m.sc. student, department of electrical and computer engineering, tarbiat modares university, tehran iran paiz azmi full professor department of electrical and computer engineering, tarbiat modares university, tehran , iran

in this paper, the energy efficient resource allocation in noma-based heterogeneous cellular network(hcn) systems is investigated. since energy consumption and its limitations is one of the important challenges in fifth generation of cellular networks (5g), we propose a resource allocation problem which allocates power and subcarriers to multiple users to achieve the best system energy efficien...

2017
CHUNPING PAN

In this paper, we study the iterative algorithms for saddle point problems(SPP). We present a new symmetric successive over-relaxation method with three parameters, which is the extension of the SSOR iteration method. Under some suitable conditions, we give the convergence results. Numerical examples further confirm the correctness of the theory and the effectiveness of the method. Key–Words: i...

Journal: :Operations Research 1980
Awi Federgruen

T HIS PAPER considers two-person, zero-sum stochastic games with finite state space = {1, -, N} and in each state i E 2, two finite sets K(i) and L(i) of actions available to player 1 and 2, respectively. The state of the system is observed at equidistant epochs. When the system is observed to be in state i, the two players choose an action, or a randomization of actions out of K(i) and L(i), r...

2016
Amr Farag

Successive – Approximation ADCs are widely used in ultra – low – power applications. This paper describes a systematic design procedure for designing Successive – Approximation ADCs for biomedical sensor nodes. The proposed scheme is adopted in the design of a 12 bit 1 kS/s ADC. Implemented in 65 nm CMOS, the ADC consumes 354 nW at a sampling rate of 1 kS/s operating with 1.2 supply voltage. Th...

2008
Marek Petrik Shlomo Zilberstein

Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), exploits structured interaction to produce significant computational gains. Empirically, CSA exhibits very good anytime performance, but an error bound on the results has not been established. We reformulate the algorithm a...

2003
Martin Margala Quentin Diduck Eric Moule

With the increased sophistication of System-on-Chip (SOC) architectures comes an increased need for low power Analog to Digital converters. These converters have many uses including Built-in-Self-Test (BIST) applications. In this paper, we present a novel Successive Approximation ADC. We show how one can utilize an existing DAC structure on an SOC to realize an effective Analog-to-Digital conve...

1999
Randal W. Beard Timothy W. McLain John T. Wen

The successive Galerkin approximation (SGA) algorithm has recently been developed for approximating solutions to the Hamilton-Jacobi-Isaacs equation. The algorithm produces feedback control laws that are stabilizing on a well-deened region of state space. The objective of this paper is to demonstrate the application of the SGA algorithm to two simple examples. The examples serve several purpose...

1999
KOLDO BASTERRETXEA ESTHER ALONSO JOSÉ MANUEL TARELA INÉS DEL CAMPO

A piecewise linear (PWL) function approximation scheme is described by a lattice algebra of modified operators that allows for the interpolation of PWL function vertexes. A new recursive method called Centred Recursive Interpolation (CRI) based on such modified operators is analysed for successive function smoothing and more accurate approximation. This approximation method, simple but accurate...

1996
Hiroya Fujisaki Sumio Ohno

The process of generating an F0 contour from a small number of linguistically meaningful parameters, has been modeled quite accurately, and the model has been used extensively in speech synthesis. The present study deals with the inverse problem, i.e., that of extracting the model parameters from a given contour, which can only be solved by successive approximation. This paper presents a method...

2011
JinRong Wang Yong Zhou

The paper is devoted to the study of an approximation process of time optimal control for fractional evolution systems in Banach spaces. We firstly convert time optimal control problem into Meyer problem. By virtue of the properties of the family of solution operators given by us, the existence of optimal controls for Meyer problem is proved. Secondly, we construct a sequence of Meyer problems ...

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

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