• The KIPS Transactions:PartB
• /
• v.9B no.5
• /
• pp.643-652
• /
• 2002

This paper proposes an efficient hybrid fixed-point (FP) algorithm for improving performances of the independent component analysis (ICA) based on neural networks. The proposed algorithm is the FP algorithm based on secant method and momentum for ICA. Secant method is applied to improve the separation performance by simplifying the computation process for estimating the root of objective function, which is to minimize the mutual informations of the independent components. The momentum is applied for high-speed convergence by restraining the oscillation if the process of converging to the optimal solution. It can simultaneously achieve a superior properties of the secant method and the momentum. The proposed algorithm has been applied to the composite fingerprints and the images generated by random mixing matrix in the 8 fingerprints of $256\times{256}$-pixel and the 10 images of $512\times{512}$-pixel, respectively. The simulation results show that the proposed algorithm has better performances of the separation speed and rate than those using the FP algorithm based on Newton and secant method. Especially, the secant FP algorithm can be solved the separating performances depending on initial points settings and the nonrealistic learning time for separating the large size images by using the Newton FP algorithm.

• Journal of Korean Society of Transportation
• /
• v.28 no.6
• /
• pp.159-166
• /
• 2010

Trip distribution is to connect travel demand for each OD pair based on travel cost, trip production and attraction derived from trip generation step. In real world the travel cost is a function of travel demand, but existing models could not fully consider such functional relation between travel cost and demand, which leads to an equilibrium in trip distribution model. This paper proves the equilibrium trip distribution by using gravity model. In order to obtain such equilibrium this paper also presents a solution algorithm based on fixed point theorem. The algorithm will be tested with an example and confirmed the equilibrium solution of trip distribution.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.2
• /
• pp.431-448
• /
• 2018

This paper is concerned with the positive definite solutions of the nonlinear matrix equation $X-A^*{\bar{X}}^{-1}A=Q$, where A, Q are given complex matrices with Q positive definite. We show that such a matrix equation always has a unique positive definite solution and if A is nonsingular, it also has a unique negative definite solution. Moreover, based on Sherman-Morrison-Woodbury formula, we derive elegant relationships between solutions of $X-A^*{\bar{X}}^{-1}A=I$ and the well-studied standard nonlinear matrix equation $Y+B^*Y^{-1}B=Q$, where B, Q are uniquely determined by A. Then several effective numerical algorithms for the unique positive definite solution of $X-A^*{\bar{X}}^{-1}A=Q$ with linear or quadratic convergence rate such as inverse-free fixed-point iteration, structure-preserving doubling algorithm, Newton algorithm are proposed. Numerical examples are presented to illustrate the effectiveness of all the theoretical results and the behavior of the considered algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.3
• /
• pp.335-341
• /
• 1998

In this paper, we present a real time implementation of CS-ACELP(Conjugate Structure Algebraic Code Excited Linear Prediction) speech coder. ITU-T has standardized the CS-ACELP algorithm as G.729. Areal-time implementation of CS-ACELP speech coder algorithm is achieved using 16 bit fixed-point DSP chip. To implement in fixed-point DSP Chip, integer simulation of CS-ACELP algorithm is used. Furthermore. input/output function and communication function included in CS-ACELP speech coder is described. We develope CS-ACELP speech coder in DSP evaluation board and evaluate in IMT-2000 Test-bed.

• The KIPS Transactions:PartB
• /
• v.11B no.4
• /
• pp.429-436
• /
• 2004

This paper proposes an independent component analyses(ICAs) of the fixed-point (FP) algorithm based on Newton and secant method by adding the kurtosis, respectively. The kurtosis is applied to cluster the analyzed components, and the FP algorithm is applied to get the fast analysis and superior performance irrelevant to learning parameters. The proposed ICAs have been applied to the problems for separating the 6-mixed signals of 500 samples and 10-mixed images of $512\times512$ pixels, respectively. The experimental results show that the proposed ICAs have always a fixed analysis sequence. The results can be solved the limit of conventional ICA without a kurtosis which has a variable sequence depending on the running of algorithm. Especially. the proposed ICA can be used for classifying and identifying the signals or the images. The results also show that the secant method has better the separation speed and performance than Newton method. And, the secant method gives relatively larger improvement degree as the problem size increases.

• Aerospace Engineering and Technology
• /
• v.13 no.2
• /
• pp.60-65
• /
• 2014

In this paper, numerical integration method using operational matrix of integration is studied. Using the operational matrix of integration, modified fixed point iteration method is introduced in order to solve rapidly an initial value problem for non-linear equation of motion. As an example, an initial value problem for orbital motion is considered. Through the numerical example, it is shown that the algorithm is efficient from the computational time point of view.

• Journal of applied mathematics & informatics
• /
• v.31 no.5_6
• /
• pp.813-823
• /
• 2013

In this paper, a new iterative algorithm involving quasi-nonexpansive mapping in Hilbert space is proposed and proved to be strongly convergent to a point which is simultaneously a fixed point of a quasi-nonexpansive mapping, a solution of an equilibrium problem and the set of solutions of a variational inequality problem. The results of the paper extend previous results, see, for instance, Takahashi and Takahashi (J Math Anal Appl 331:506-515, 2007), P.E.Maing $\acute{e}$ (Computers and Mathematics with Applications, 59: 74-79,2010) and other results in this field.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.293-309
• /
• 2011

The purpose of this article is to prove strong convergence theorems for weak relatively nonexpansive mapping which is firstly presented in this article. In order to get the strong convergence theorems for weak relatively nonexpansive mapping, the monotone CQ iteration method is presented and is used to approximate the fixed point of weak relatively nonexpansive mapping, therefore this article apply above results to prove the strong convergence theorems of zero point for maximal monotone operators in Banach spaces. Noting that, the CQ iteration method can be used for relatively nonexpansive mapping but it can not be used for weak relatively nonexpansive mapping. However, the monotone CQ method can be used for weak relatively nonexpansive mapping. The results of this paper modify and improve the results of S.Matsushita and W.Takahashi, and some others.

• Journal of Satellite, Information and Communications
• /
• v.7 no.1
• /
• pp.92-96
• /
• 2012

This paper presents return link demodulation algorithm designed for hardware implementation using HDL that include complex signal processing work reliably even in low SNR. Simulation results show that performance of Es/$N_0$ has improved within 0.5dB at the point of uncoded BER $10^{-3}$ compared to the ideal QPSK signal. In addition, fixed-point simulation and HDL implementation performance compared to the simulation we can see that there is no difference.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.2
• /
• pp.411-432
• /
• 2021

In this paper, an inertial Halpern-type forward backward iterative algorithm for approximating solution of a monotone inclusion problem whose solution is also a fixed point of some nonlinear mapping is introduced and studied. Strong convergence theorem is established in a real Hilbert space. Furthermore, our theorem is applied to variational inequality problems, convex minimization problems and image restoration problems. Finally, numerical illustrations are presented to support the main theorem and its applications.