• Title/Summary/Keyword: Three step iteration

Search Result 36, Processing Time 0.028 seconds

Design of Asynchronous 16-Bit Divider Using NST Algorithm (NST알고리즘을 이용한 비동기식 16비트 제산기 설계)

  • 이우석;박석재;최호용
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.3
    • /
    • pp.33-42
    • /
    • 2003
  • This paper describes an efficient design of an asynchronous 16-bit divider using the NST (new Svoboda-Tung) algorithm. The divider is designed to reduce power consumption by using the asynchronous design scheme in which the division operation is performed only when it is requested. The divider consists of three blocks, i.e. pre-scale block, iteration step block, and on-the-fly converter block using asynchronous pipeline structure. The pre-scale block is designed using a new subtracter to have small area and high performance. The iteration step block consists of an asynchronous ring structure with 4 division steps for area reduction. In other to reduce hardware overhead, the part related to critical path is designed by a dual-rail circuit, and the other part is done by a single-rail circuit in the ring structure. The on-the-fly converter block is designed for high performance using the on-the-fly algorithm that enables parallel operation with iteration step block. The design results with 0.6${\mu}{\textrm}{m}$ CMOS process show that the divider consists of 12,956 transistors with 1,480 $\times$1,200${\mu}{\textrm}{m}$$^2$area and average-case delay is 41.7㎱.

A Design Process Analysis with the DSM and the QFD in Automatic Transmission Lever Design (DSM과 QFD 분석을 이용한 오토레버 설계 과정의 분석)

  • 천준원;박지형
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2003.06a
    • /
    • pp.9-12
    • /
    • 2003
  • This paper describes a step-by-step method to minimize design iterations in a process of product design change. In the design process, two components are coupled if a change of a component can require the other components change, and design iterations are generated by the coupling. The design iteration is one of main factors that increase design effort. In this study, three matrices are used to solve the design iteration of automatic transmission lever, Requirement-Engineering matrix, Engineering-Components matrix, and DSM(Design Structure Matrix). Firstly, with the DSM, the product architecture and conceptual design process are proposed from product function analysis. Secondly, with the QFD, the Requirement-Engineering matrix and Engineering-Components matrix present the relationship among customer requirements, engineering issues, and product components. Lastly, the results of the QFD analysis are used in the DSM to solve the component interactions and to provide design

  • PDF

THREE-STEP MEAN VALUE ITERATIVE SCHEME FOR VARIATIONAL INCLUSIONS AND NONEXPANSIVE MAPPINGS

  • Zhang, Fang;Su, Yongfu
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.3_4
    • /
    • pp.557-566
    • /
    • 2009
  • In this paper, we present the three-step mean value iterative scheme and prove that the iteration sequence converge strongly to a common element of the set of fixed points of a nonexpansive mappings and the set of the solutions of the variational inclusions under some mild conditions. The results presented in this paper extend, generalize and improve the results of Noor and Huang and some others.

  • PDF

NUMERICAL METHODS SOLVING THE SEMI-EXPLICIT DIFFERENTIAL-ALGEBRAIC EQUATIONS BY IMPLICIT MULTISTEP FIXED STEP SIZE METHODS

  • Kulikov, G.Yu.
    • Journal of applied mathematics & informatics
    • /
    • v.4 no.2
    • /
    • pp.341-378
    • /
    • 1997
  • We consider three classes of numerical methods for solv-ing the semi-explicit differential-algebraic equations of index 1 and higher. These methods use implicit multistep fixed stepsize methods and several iterative processes including simple iteration, full a2nd modified Newton iteration. For these methods we prove convergence theorems and derive error estimates. We consider different ways of choosing initial approximations for these iterative methods and in-vestigate their efficiency in theory and practice.

AN EFFICIENT THIRD ORDER MANN-LIKE FIXED POINT SCHEME

  • Pravin, Singh;Virath, Singh;Shivani, Singh
    • Nonlinear Functional Analysis and Applications
    • /
    • v.27 no.4
    • /
    • pp.785-795
    • /
    • 2022
  • In this paper, we introduce a Mann-like three step iteration method and show that it can be used to approximate the fixed point of a weak contraction mapping. Furthermore, we prove that this scheme is equivalent to the Mann iterative scheme. A comparison is made with the other third order iterative methods. Results are presented in a table to support our conclusion.

ITERATIVE APPROXIMATION OF FIXED POINTS FOR φ-HEMICONTRACTIVE OPERATORS IN BANACH SPACES

  • Liu, Zeqing;An, Zhefu;Li, Yanjuan;Kang, Shin-Min
    • Communications of the Korean Mathematical Society
    • /
    • v.19 no.1
    • /
    • pp.63-74
    • /
    • 2004
  • Suppose that X is a real Banach space, K is a nonempty closed convex subset of X and T : $K\;\rightarrow\;K$ is a uniformly continuous ${\phi}$-hemicontractive operator or a Lipschitz ${\phi}-hemicontractive$ operator. In this paper we prove that under certain conditions the three-step iteration methods with errors converge strongly to the unique fixed point of T. Our results extend the corresponding results of Chang [1], Chang et a1. [2], Chidume [3]-[7], Chidume and Osilike [9], Deng [10], Liu and Kang [13], [14], Osilike [15], [16] and Tan and Xu [17].

A Dynamic Simulation of the Slider in HDD (하드디스크 슬라이더의 동적수치해석)

  • 김도완;임윤철
    • Tribology and Lubricants
    • /
    • v.16 no.4
    • /
    • pp.295-301
    • /
    • 2000
  • The dynamic simulation of slider in hard disk drive is performed using Factored Implicit Finite Difference method. The modified Reynolds equation with Fukui and Kaneko model is employed as a governing equation. Equations of motion for the slider of three degrees of freedom are solved simultaneously with the modified Reynolds equation. The transient responses of the slider for disk step bumps and slider impulse forces are shown for various cases and are compared for the iteration algorithm and new algorithm.

POLYNOMIAL CONVERGENCE OF PRIMAL-DUAL ALGORITHMS FOR SDLCP BASED ON THE M-Z FAMILY OF DIRECTIONS

  • Chen, Feixiang
    • Journal of applied mathematics & informatics
    • /
    • v.30 no.1_2
    • /
    • pp.127-133
    • /
    • 2012
  • We establish the polynomial convergence of a new class of path-following methods for SDLCP whose search directions belong to the class of directions introduced by Monteiro [3]. We show that the polynomial iteration-complexity bounds of the well known algorithms for linear programming, namely the short-step path-following algorithm of Kojima et al. and Monteiro and Alder, carry over to the context of SDLCP.

A Numerical Dynamic Simulation of the Slider in HDD (하드디스크 슬라이더의 동적수치해석)

  • 김도완;임윤철
    • Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
    • /
    • 1999.11a
    • /
    • pp.146-153
    • /
    • 1999
  • A numerical dynamic simulation is necessary to investigate the capacity of the HDD. The slider surface become more and more complicated to make the magnetized area smaller and readback signal stronger. So a numerical dynamic simulation must be preceded to develop a new slider in HDD. The dynamic simulations of air-lubricated slider bearing have been peformed using FIFD(Factored Implicit Finite Difference) method. The governing equation, Reynolds equation Is modified with Fukui and Kaneko model(FK model) which includes the first and the second-order slip. The equations of motion for the slider bearing are solved simultaneously with the modified Reynolds equation for the case of three degrees of freedom. The slider transient response for disk step bump and slider impulse force is given for various case and for iteration algorithm and new algorithm.

  • PDF