• Journal of Korean Society of Transportation
• /
• v.24 no.2 s.88
• /
• pp.169-178
• /
• 2006

Traffic assignment has been used both for predicting travel demands and for evaluating the tools for alleviating congestion on road network in advance. Some assignment models have been proposed such as equivalent mathematical minimization method, variational inequality problem, nonlinear complementary problem and fixed point method, in following the principle of Wardrop (1952) that no driver can not Improve his travel cost by unilaterally changing his route. Recently Jin(2005a) presented a traffic assignment model based on dynamic process. This paper proposes a solution algorithm for the model of Jin and assesses the performances. Compared to the Frank-Wolfe method, which has been wildly used for solving the existing assignment models, the proposed algorithm is expected to be more efficient because it does not need to evaluate the objective function. Two numerical examples are used for assessing the algorithm, and they show that the algorithm converges to user equilibrium of Wardrop.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.263-266
• /
• 1996

A method to determine an optimal temperature trajectory that guarantees polymer products having controlled molecular weight distribution and desired values of molecular weight is presented. The coordinate transformation method and the optimal control theory are applied to a batch PMMA polymerization system to calculate the optimal temperature trajectory. Coordinate transformation method converts the original fixed-end-point, free-end-time problem to a free-end-point, fixed-end-time problem. The idea is that by making the reactor temperature track the optimal temperature trajectory one may be able to produce polymer products having the prespecified physical property in a minimum time. The on-line control experiments with the PID control algorithm have been conducted to establish the validity of the scheme proposed in this study. The experimental results show that prespecified polymer product could be obtained with tracking the calculated optimal temperature trajectory.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1211-1214
• /
• 1998

Real-time implementation of Conjugate-Structure Algebraic CELP(CS-ACELP) is presented. ITU-T Study Group(SG) 15 has standardized the CS-ACELP speech coding algorithm as G.729. A real-time implementation of the CS-ACELP is achieved using 16 bit fixed point DSP16210 Digital Signal Processor (DSP) of Lucent Technologies. The speech coder has been implemented in the bit-exact manner using the fixed point CS-ACELP C source which is the part of the G.729 standard. To provide a multi-channel vocoder solution to digital communication system, we try to minimize the complexity(e.g., MIPS, ROM, RAM) of CS-ACELP. Our speech coder shows 15.5 MIPS in performance which enables 4 channel CS-ACELP to be processed with one DSP16210.

• Journal of Industrial Technology
• /
• v.27 no.A
• /
• pp.211-218
• /
• 2007

As demands for interaction of humans and robots are increasing, robots are expected to be equipped with intelligibility which humans have. Especially, for natural communication, hearing capabilities are so essential that speech recognition technology for robot is getting more important. In this paper, we implement a speech recognizer suitable for robot applications. One of the major problem in robot speech recognition is poor speech quality captured when a speaker talks distant from the microphone a robot is mounted with. To cope with this problem, we used wireless transmission of commands recognized by the speech recognizer implemented using TMS320VC5510 DSK. In addition, as for implementation, since TMS320VC5510 DSP is a fixed-point device, we represent efficient realization of HMM algorithm using fixed-point arithmetic.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.409-413
• /
• 2008

In this paper, we introduce a platform of advanced multiple antenna system based on orthogonal frequency-division multiplexing (OFDM). The advanced multiple antennas have beamforming gain using array antenna. In array antenna systems, received signal has phase delay caused distance of each antennas, therefore it should compensate with optimum weight vector which calculated by Lagrange algorithm. To implement the presented above procedures using Digital Signal Processor (DSP), we should fixed-point design. The performance of implemented platform is verified through MATLAB$^{(R)}$ simulations with various signal environments.

• Kyungpook Mathematical Journal
• /
• v.56 no.1
• /
• pp.221-233
• /
• 2016

The present paper proposes a new monotone iteration method for existence as well as approximation of the coupled solutions for a coupled periodic boundary value problem of first order ordinary nonlinear differential equations. A new hybrid coupled fixed point theorem involving the Dhage iteration principle is proved in a partially ordered normed linear space and applied to the coupled periodic boundary value problems for proving the main existence and approximation results of this paper. An algorithm for the coupled solutions is developed and it is shown that the sequences of successive approximations defined in a certain way converge monotonically to the coupled solutions of the related differential equations under some suitable mixed hybrid conditions. A numerical example is also indicated to illustrate the abstract theory developed in the paper.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.177.4-177
• /
• 2001

In this paper, we propose a new type of nonlinear fixed interval smoothing filter which is modified from the existing nonlinear smoothing filter. A nonlinear smoothing filter is derived from two-filter formulas. For the backward filter, the propagation and update equation of error states are derived. Particularly the modified update equation of the backward filter use the estimated error terms from the forward filter. Smoothing algorithm is altered into the compatible form with the new type of the backward fitter. An advantage of the proposed algorithm is more efficient than the existing one because propagation in backward filter is very simple from the implementation point of view. We apply the proposed nonlinear smoothing ...

• Journal of Power Electronics
• /
• v.12 no.1
• /
• pp.164-171
• /
• 2012

Variable step size maximum power point trackers (MPPTs) are widely used in photovoltaic (PV) systems to extract the peak array power which depends on solar irradiation and array temperature. One essential factor which judges system dynamics and steady state performances is the scaling factor (N), which is used to update the controlling equation in the tracking algorithm to determine a new duty cycle. This paper proposes a novel stability study of variable step size incremental resistance maximum power point tracking (INR MPPT). The main contribution of this analysis appears when developing the overall small signal model of the PV system. Therefore, by using linear control theory, the boundary value of the scaling factor can be determined. The theoretical analysis and the design principle of the proposed stability analysis have been validated using MATLAB simulations, and experimentally using a fixed point digital signal processor (TMS320F2808).

• ETRI Journal
• /
• v.45 no.1
• /
• pp.119-130
• /
• 2023

We propose a quantized gradient search algorithm that can achieve global optimization by monotonically reducing the quantization step with respect to time when quantization is composed of integer or fixed-point fractional values applied to an optimization algorithm. According to the white noise hypothesis states, a quantization step is sufficiently small and the quantization is well defined, the round-off error caused by quantization can be regarded as a random variable with identically independent distribution. Thus, we rewrite the searching equation based on a gradient descent as a stochastic differential equation and obtain the monotonically decreasing rate of the quantization step, enabling the global optimization by stochastic analysis for deriving an objective function. Consequently, when the search equation is quantized by a monotonically decreasing quantization step, which suitably reduces the round-off error, we can derive the searching algorithm evolving from an optimization algorithm. Numerical simulations indicate that due to the property of quantization-based global optimization, the proposed algorithm shows better optimization performance on a search space to each iteration than the conventional algorithm with a higher success rate and fewer iterations.

• The KIPS Transactions:PartB
• /
• v.11B no.7 s.96
• /
• pp.813-820
• /
• 2004

This paper proposes a digital image watermarking which is robust to geometric distortions using an independent component analysis(ICA) of fixed-point(FP) algorithm based on secant method. The FP algorithm of secant method is applied for better performance in a separation time and rate, and ICA is applied to reject the prior knowledges for original image, key, and watermark such as locations and size, etc. The proposed method embeds the watermark into the spatial domain of original image The proposed watermarking technique has been applied to lena, key, and two watermarks(text and Gaussian noise) respectively. The simulation results show that the proposed method has higher speed and better rate for extracting the original images than the FP algorithm of Newton method. And the proposed method has a watermarking which is robust to geometric distortions such as resizing, rotation, and cropping. Especially, the watermark of images with Gaussian noise has better extraction performance than the watermark with text since Gaussian noise has lower correlation coefficient than the text to the original and key images. The watermarking of ICA doesn't require the prior knowledge for the original images.