• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.7
• /
• pp.9-16
• /
• 2008

In this paper, a simple analytical model for deriving the threshold voltage of a short-gate SOI MESFET is suggested. Using the iteration method, the Poisson equation in the fully depleted silicon channel and the Laplace equation in the buried oxide region are solved two-dimensionally, Obtained potential distributions in each region are expressed in terms of fifth-order of $\chi$, where $\chi$ denotes the coordinate perpendicular to the silicon channel direction. From them, the bottom channel potential is used to describe the threshold voltage in a closed-form. Simulation results show the dependencies of the threshold voltage on the various device geometry parameters and applied bias voltages.

• International Journal of Fluid Machinery and Systems
• /
• v.5 no.2
• /
• pp.91-99
• /
• 2012

The Fighter aircraft transmission system consists of a light weight, High Speed Flexible Coupling (HSFC) known as Power Take-Off shaft (PTO) for connecting Engine gearbox (EGB) with Accessory Gear Box (AGB). The HSFC transmits the power through series of specially contoured metallic annular thin flexible plates whose planes are normal to the torque axis. The HSFC operates at high speed ranging from 10,000 to 18,000 rpm. The HSFC is also catered for accommodating larger lateral and axial misalignment resulting from differential thermal expansion of the aircraft engine and mounting arrangement. The contoured titanium alloy flexible plates are designed with a thin cross sectional profile to accommodate axial and parallel misalignment by the elastic material flexure. This paper investigates the effect of misalignment on the transmission characteristics of the HSFC couplings. A mathematical model for the HSFC coupling with misalignment has been developed for analyzing the torque transmission and force interaction characteristics. An extensive testing has been conducted for validating characteristics of the designed coupling under various misalignment conditions. With this the suitability of the model adapted for the design iteration of HSFC development is validated. This method will reduce the design iteration cycles of HSFC and can be extended for the similar development of flexible couplings.

• Journal of Korean Association for Spatial Structures
• /
• v.4 no.3 s.13
• /
• pp.103-109
• /
• 2004

The lowest load when the equilibrium condition becomes to be unstable is defined as the buckling load. The primary objective of this paper is to be analyse stability boundaries for star dome under combined loads and is to investigate the iteration diagram under the independent loading parameter. In numerical procedure of the geometrically nonlinear problems, Arc Length Method and Newton-Raphson iteration method is used to find accurate critical point(bifurcation point and limit point). In this paper independent loading vector is combined as proportional value and star dome was used as numerical analysis model to find stability boundary among load parameters and many other models as multi-star dome and arch were studied. Through this study we can find the type of buckling mode and the value of buckling load.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.12
• /
• pp.75-81
• /
• 2004

AE-CORDIC improves the CORDIC operation speed with a rotation direction pre-computation algorithm. Its CORDIC iteration stages consist of non-predictable rotation direction states and predictable rotation stages. The non-predictable stages are replaced with lookup-table which has smaller hardware size than CORDIC iteration stages. The predictable stages can determine rotation direction with the input angle and simple encoder. In this paper, a rotation direction pre-computation algorithm with input angle encoder is proposed. and AE-CORDIC which have optimized Lookup-table is compared with the P-CORDIC algorithm. Hardware size, delay, and SQNR of the AE-CORDIC are verified with Samsung 0.18㎛ technology and Synopsys design compiler when input angle bit length is 16.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.12
• /
• pp.142-151
• /
• 1994

This paper proposes new algorithms to solve canonical piecewise-linear equations with linear partitions and illustrates their efficiency through the analysis of resistive network. The basic idea of the proposed algorithm is to find the best next guess, closest to the actual solution, at each Newton-Raphson (N-R) iteration by comparing the images of nest guess candidates and that of the actual solution. The proposed algorithm can reduce the number of the N-R iterations rquired for convergence greatly, compared to the actual solution, at each Newton-Raphson (N-R) iteration by comparing the images of next guess candidates and that of the actual solution. The proposed algorithm can reduce the number of the N-R iterations required for convergence greatly, compared to the Katzenelson algorithm. When applied to analyzing test circuits, the proposed algorithm required 8 to 20 times fewer N-R iterations and 5 to 10 times less CPU time than the Katzenelson algorithm, depending on the size of the circuits. The experimental results also exhibit that the efficiency of the proposed algorithm over the Katzenelson algorithm increases as the number of the piecewise-linear regions for the representation of the circuit.

• Journal of Broadcast Engineering
• /
• v.17 no.6
• /
• pp.954-963
• /
• 2012

As a greedy algorithm reconstructing the sparse signal from underdetermined system, orthogonal matching pursuit (OMP) algorithm has received much attention. In this paper, we multiple candidate matching pursuit (MuCaMP), which builds up candidate support set in every iteration and uses the minimum residual at last iteration. Using the restricted isometry property (RIP), we derive the sufficient condition for MuCaMP to recover the sparse signal exactly. The MuCaMP guarantees to reconstruct the K-sparse signal when the sensing matrix satisfies the RIP constant ${\delta}_{N+K}<\frac{\sqrt{N}}{\sqrt{K}+3\sqrt{N}}$. In addition, we show a recovery performance both noiseless and noisy measurements.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.963-968
• /
• 1990

An iterative learning control scheme for tracking control of a class of uncertain nonlinear systems is presented. By introducing a model reference adaptive controller in the learning control structure, it is possible to achieve zero tracking of unknown system even when the upperbound of uncertainty in system dynamics is not known apriori. The adaptive controller pull the state of the system to the state of reference model via control gain adaptation at each iteration, while the learning controller attracts the model state to the desired one by synthesizing a suitable control input along with iteration numbers. In the controller role transition from the adaptive to the learning controller takes place in gradually as learning proceeds. Another feature of this control scheme is that robustness to bounded input disturbances is guaranteed by the linear controller in the feedback loop of the learning control scheme. In addition, since the proposed controller does not require any knowledge of the dynamic parameters of the system, it is flexible under uncertain environments. With these facts, computational easiness makes the learning scheme more feasible. Computer simulation results for the dynamic control of a two-axis robot manipulator shows a good performance of the scheme in relatively high speed operation of trajectory tracking.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1253-1272
• /
• 2010

In this paper, we propose a new affine shape adaptation scheme for the affine invariant feature detector, in which the convergence stability is still an opening problem. This paper examines the relation between the integration scale matrix of next iteration and the current second moment matrix and finds that the convergence stability of the method can be improved by adjusting the relation between the two matrices instead of keeping them always proportional as proposed by previous methods. By estimating and updating the shape of the integration kernel and differentiation kernel in each iteration based on the anisotropy of the current second moment matrix, we propose a coarse-to-fine affine shape adaptation scheme which is able to adjust the pace of convergence and enable the process to converge smoothly. The feature matching experiments demonstrate that the proposed approach obtains an improvement in convergence ratio and repeatability compared with the current schemes with relatively fixed integration kernel.

• Proceedings of the KSEEG Conference
• /
• 2002.04a
• /
• pp.167-169
• /
• 2002

The extended Born, or localized nonlinear approximation of integral equation (IE) solution has been applied to inverting single-hole electromagnetic (EM) data using a cylindrically symmetric model. The extended Born approximation is less accurate than a full solution but much superior to the simple Born approximation. When applied to the cylindrically symmetric model with a vertical magnetic dipole source, however, the accuracy of the extended Born approximation is greatly improved because the electric field is scalar and continuous everywhere. One of the most important steps in the inversion is the selection of a proper regularization parameter for stability. Occam's inversion (Constable et al., 1987) is an excellent method for obtaining a stable inverse solution. It is extremely slow when combined with a differential equation method because many forward simulations are needed but suitable for the extended Born solution because the Green's functions, the most time consuming part in IE methods, are repeatedly re-usable throughout the inversion. In addition, the If formulation also readily contains a sensitivity matrix, which can be revised at each iteration at little expense. The inversion algorithm developed in this study is quite stable and fast even if the optimum regularization parameter Is sought at each iteration step. Tn this paper we show inversion results using synthetic data obtained from a finite-element method and field data as well.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.12
• /
• pp.67-74
• /
• 2015

The heat conduction equation, a type of a Poisson equation which can be applied in various areas of engineering is calculating its value with the iteration method in general. The equation which had difference discretization of the heat conduction equation is the simultaneous equation, and each line has the characteristic of expressing in sparse matrix of the equivalent number of none-zero elements with neighboring grids. In this paper, we propose a data structure for sparse matrix that can calculate the value faster with less memory use calculate the heat conduction equation. To verify whether the proposed data structure efficiently calculates the value compared to the other sparse matrix representations, we apply the representative iteration method, CG (Conjugate Gradient), and presents experiment results of time consumed to get values, calculation time of each step and relevant time consumption ratio, and memory usage amount. The results of this experiment could be used to estimate main elements of calculating the value of the general heat conduction equation, such as time consumed, the memory usage amount.