• Journal of applied mathematics & informatics
• /
• v.14 no.1_2
• /
• pp.123-136
• /
• 2004

In this paper, a combining trust region and line search algorithm for equality constrained optimization is proposed. At each iteration, we only need to solve the trust region subproblem once, when the trust region trial step can not be accepted, we switch to line search to obtain the next iteration. Hence, the difficulty of repeated solving trust region subproblem in an iterate is avoided. In order to allow the direction of negative curvature, we add second correction step in trust region step and employ nonmonotone technique in line search. The global convergence and local superlinearly rate are established under certain assumptions. Some numerical examples are given to illustrate the efficiency of the proposed algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.8
• /
• pp.689-697
• /
• 1990

This paper proposes ADAPTIVE STOCHASTIC ITERATION ALGORITHM that can be used for the full-duplex digital data transmission over existing twisted-pair cables. The canceller step size changes according to the residual echo level. Thus convergence speed increases by an order of magnitude over the conventional stochastic interation alogorithm. And it can be combined with the sequential type adaptive digital filter that simplifies the conventional echo canceller circuit. Thus it is suitable for LSI implementation. Theoretical analysis on two algorithms is carried out and the algorithm simulation program is developed.

• Journal of electromagnetic engineering and science
• /
• v.2 no.2
• /
• pp.81-86
• /
• 2002

This paper presents the full wave analysis of microwave circuits with nonlinear device using the finite difference time domain method. The equivalent current source is used to model nonlinear device and all the electric field components at the nonlinear device are updated by FDTD algorithm. The currents and voltages of nonlinear device are calculated by the state equations and iteration method. To validate the proposed method, the S-parameters of NEC NE72089 MESFET in various conditions are analyzed and the results are compared with those of the ADS. The proposed method is applied to the analysis of a microwave amplifier, which includes NEC NE72089 MESFET. The analysis results obtained by the present method show good agreement with those of the ADS.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.73-81
• /
• 2004

To extract the creditable features in fingerprint image, many people use the thinning algorithm that has a very important position in the preprocessing. In this paper, we propose the robust parallel thinning algorithm that can preserve the connectivity of the binarized fingerprint image, make the thinnest skeleton with 1-pixel width and get near to the medial axis extremely. The proposed thinning method repeats three sub-iterations. The first sub-iteration takes off only the outer boundary pixel by using the interior points. To extract the one side skeletons, the second sub-iteration finds the skeletons with 2-pixel width. The third sub-iteration prunes the needless pixels with 2-pixel width existing in the obtained skeletons and then the proposed thinning algorithm has the robustness against the rotation and noise and can make the balanced medial axis. To evaluate the performance of the proposed thinning algorithm we compare with and analyze the previous algorithms.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.2
• /
• pp.62-68
• /
• 2007

This paper proposes an efficient integer division algorithm for high speed FPGAs' which support built-in RAMs' and multipliers. The integer division algorithm is iterative with RAM-based LUT and multipliers, which minimizes the usage of logic fabric and connection resources. Compared with some popular division algorithms such as division by subtraction or division by multiply-subtraction, the number of iteration is much smaller, so that very low latency can be achieved with pipelined implementations. We have implemented our algorithm in the Xilinx virtex-4 FPGA with VHDL coding and have achieved 300MSPS data rate in 17bit integer division. The algorithm used less than 1/6 of logic slices, 1/4 of the built-in multiply-accumulation units, and 1/3 of the latencies compared with other popular algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3338-3355
• /
• 2018

Images acquired by Large Aperture Static Imaging Spectrometer (LASIS) exhibit obvious interference stripes, which are vertical and stationary due to the special imaging principle of interference hyperspectral image (IHI) data. As the special characteristics above will seriously affect the intrinsic structure and sparsity of IHI, decomposition of IHI has drawn considerable attentions of many scientists and lots of efforts have been made. Although some decomposition methods for interference hyperspectral data have been proposed to solve the above problem of interference stripes, too many times of iteration are necessary to get an optimal solution, which will severely affect the efficiency of application. A novel algorithm for decomposition of interference hyperspectral images based on split Bregman iteration is proposed in this paper, compared with other decomposition methods, numerical experiments have proved that the proposed method will be much more efficient and can reduce the times of iteration significantly.

• Smart Media Journal
• /
• v.3 no.2
• /
• pp.9-13
• /
• 2014

The Levenberg-Marquardt (LM) algorithm is the most widely used fitting algorithm. It outperforms simple gradient descent and other conjugate gradient methods in a wide variety of problems. Based on the work of paper[1], we propose a modified Levenberg-Marquardt algorithm for better performance of mobile system. The LM parameter at the $k_{th}$ iteration is chosen ${\mu}=A{\bullet}{\parallel}f(x){\parallel}{\bullet}I$ where f is the residual function, and J is the Jacobi of f. In this paper, we show this method is more efficient than traditional method under the situation that the system iteration is limited.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.41 no.7
• /
• pp.532-538
• /
• 2013

This paper describes a vision-based only attitude estimation technique for the leader in the formation flight. The feature points in image obtained from the X-PLANE simulator are extracted by the SURF(Speed Up Robust Features) algorithm. We use POSIT(Pose from Orthography and Scaling with Iteration) algorithm to estimate attitude. Finally we verify that attitude estimation using vision only can yield small estimated error of $1.1{\sim}1.76^{\circ}$.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1330-1350
• /
• 2022

As a preprocessing operation of transmitter antennas, the hybrid precoding is restricted by the limited computing resources of the transmitter. Therefore, this paper proposes a novel hybrid precoding that guarantees the communication efficiency with low complexity and a fast computational speed. First, the analog and digital precoding matrix is derived from the maximum eigenvectors of the channel matrix in the sub-connected architecture to maximize the communication rate. Second, the extended power iteration (EPI) is utilized to obtain the maximum eigenvalues and their eigenvectors of the channel matrix, which reduces the computational complexity caused by the singular value decomposition (SVD). Third, the Aitken acceleration method is utilized to further improve the convergence rate of the EPI algorithm. Finally, the hybrid precoding based on the EPI method and the Aitken acceleration algorithm is evaluated in millimeter-wave (mmWave) massive multiple-input and multiple-output (MIMO) systems. The experimental results show that the proposed method can reduce the computational complexity with the high performance in mmWave massive MIMO systems. The method has the wide application prospect in future wireless communication systems.

• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.1
• /
• pp.73-82
• /
• 2010

In an infinite-dimensional Hilbert space, the normal Mann iteration has only weak convergence, in general, even for nonexpansive mappings. The purpose of this paper is to modify the normal Mann iteration to have strong convergence for a closed quasi-$\phi$-nonexpansive mapping in the framework of Banach spaces.