• ETRI Journal
• /
• v.20 no.2
• /
• pp.133-148
• /
• 1998

The objective of this paper is to present an adaptive algorithm for computing the weight vector which provides a beam pattern having its maximum gain along the direction of the mobile target signal source in the presence of interfering signals within a cell. The conjugate gradient method (CGM) is modified in such a way that the suboptimal weight vector is produced with the computational load of O(16N), which has been found to be small enough for the real-time processing of signals in most land mobile communications with the digital signal processor (DSP) off the shelf, where N denotes the number of antenna elements of the array. The adaptive procedure proposed in this paper is applied to code division multiple access (CDMA) mobile communication system to show its excellent performance in terms of signal to interference plus noise ratio (SINR), bit error rate (BER), and capacity, which are enhanced by about 7 dB, ${\frac{1}{100}}$ times, and 7 times, respectively, when the number of antenna elements is 6 and the processing gain is 20 dB.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.4
• /
• pp.271-280
• /
• 2004

This paper presents a new iterative image restoration algorithm with removal of boundary/object-oriented ringing, The proposed method is based on CGM(Conjugate Gradient Method) iterations with inter-wavelet shrinkage. The proposed method provides a fast restoration as much as CGM, while having adaptive do-noising and do-ringing by using wavelet shrinkage. In order to have effective do-noising and do-ringing simultaneously, the proposed method uses a space-dependent shrinkage rule. The improved performance of the proposed method over more traditional iterative image restoration algorithms such as LR(Lucy-Richardson) and CGM in do-noising and do-ringing is shown through numerical experiments.

• Journal of the military operations research society of Korea
• /
• v.34 no.1
• /
• pp.1-11
• /
• 2008

A methodology for the improvement of simulation based training system for the artillery is proposed in this paper. The complex nonlinear relationship inherent among parameters in artillery firing is difficult to model and analyze. By introducing neural network based simulation, accurate representation of artillery firing is made possible. The artillery training system can greatly benefit from the improved prediction. Neural networks learning is conducted using the conjugate gradient algorithm. The evaluation of the proposed methodology is performed through simulation. Prediction errors of both regression analysis model and neural networks model are analyzed. Implementation of neural networks to training system enables more realistic training, improved combat power and reduced budget.

• Journal of the Institute of Convergence Signal Processing
• /
• v.16 no.4
• /
• pp.134-138
• /
• 2015

Heart sound is used for a basic clinical examination to check for abnormalities in the lungs and heart that can be heard with a stethoscope or phonocardiography. In this paper, we try to find an easier and non-invasive method to diagnose heart diseases using neural network classifier. The classifier has been developed for one normal heart sound and five murmurs by using Shannon entropy and conjugate scaled back propagation algorithm. The experimental results showed that the classification is possible with 1.63185e-6 of classification error.

• Communications of the Korean Mathematical Society
• /
• v.10 no.3
• /
• pp.735-750
• /
• 1995

We present a domain decomposition algorithm for solving large sparse linear systems of equations arising from queuing networks. Such techniques are attractive since the problems in subdomains can be solved independently by parallel processors. Many of the methods proposed so far use some form of the preconditioned conjugate gradient method to deal with one large interface problem between subdomains. However, in this paper, we propose a "nested" domain decomposition method where the subsystems governing the interfaces are small enough so that they are easily solvable by direct methods on machines with many parallel processors. Convergence of the algorithms is also shown.lso shown.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.23 no.6
• /
• pp.693-702
• /
• 2010

In this paper, FETI(Finite Element Tearing and Interconnecting) method is introduced in order to improve numerical efficiency of Staggered method. The porous media theory, the Staggered method and the FETI method are briefly introduced in this paper. In addition, we account for the MPI(Message Passing Interface) library for parallel analysis, and the proposed combined Staggered method with FETI method. Finally Lagrange multipliers and CG(Conjugate Gradient) algorithm to solve decomposed domain are proposed, and then the proposed method is verified to be numerically efficient by MPI library.

• Journal of the Korean Mathematical Society
• /
• v.52 no.2
• /
• pp.349-372
• /
• 2015

This paper concerns with exploiting an oblique projection technique to solve a general class of large and sparse least squares problem over symmetric arrowhead matrices. As a matter of fact, we develop the conjugate gradient least squares (CGLS) algorithm to obtain the minimum norm symmetric arrowhead least squares solution of the general coupled matrix equations. Furthermore, an approach is offered for computing the optimal approximate symmetric arrowhead solution of the mentioned least squares problem corresponding to a given arbitrary matrix group. In addition, the minimization property of the proposed algorithm is established by utilizing the feature of approximate solutions derived by the projection method. Finally, some numerical experiments are examined which reveal the applicability and feasibility of the handled algorithm.

• Structural Engineering and Mechanics
• /
• v.38 no.4
• /
• pp.405-416
• /
• 2011

An efficient two-level domain decomposition parallel algorithm is suggested to solve large-DOF structural problems with nonlinear material models generating unsymmetric tangent matrices, such as a group of plastic-damage material models. The parallel version of the stabilized bi-conjugate gradient method is developed to solve unsymmetric coarse problems iteratively. In the present approach the coarse DOF system is solved parallelly on each processor rather than the whole system equation to minimize the data communication between processors, which is appropriate to maintain the computing performance on a non-supercomputer level cluster system. The performance test results show that the suggested algorithm provides scalability on computing performance and an efficient approach to solve large-DOF nonlinear structural problems on a cluster system.

• 한국지구물리탐사학회:학술대회논문집
• /
• 2007.06a
• /
• pp.124-129
• /
• 2007

For seismic imaging and inversion, the inverted image depends on how we define the objective function. ${\ell}^1$-norm is more robust than ${\ell}^2$-norm. However, it is difficult to apply the Newton-type algorithm directly because the partial derivative for ${\ell^1$-norm has a singularity. In our paper, to overcome the difficulties of singularities, Huber function given by hybrid ${\ell}^1/{\ell}^2$-norm is used. We tested the robustness of our new object function with several noisy data set. Numerical results show that the new objective function is more robust to band limited spiky noise than the conventional object function.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1997.10a
• /
• pp.329-334
• /
• 1997

A tomography algorithm to maximize the entropy of image using Lagrangian multiplier technique and conjugate gradient method has been designed for the measurement of 2D spatial distribution of intense neutral beams of KSTAR NBI(Korea Superconducting Tokamak Advanced Research Neutral Beam Injector) which is now being designed. A possible detection system was assumed and a numerical simulation has been implemented to test the reconstruction quality of given beam profiles. This algorithm has the good applicability for sparse projection data and thus, can be used for the neutral beam tomography.