• ETRI Journal
• /
• 제20권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.

• 융합신호처리학회논문지
• /
• 제5권4호
• /
• pp.271-280
• /
• 2004

본 논문에서는 반복적 영상복원과정에서 자주 등장하는 경계관련 오류와 물체관련 오류를 효과적으로 제거하기 위한 새로운 반복적 영상복원방법을 제안하고자 한다. 제안한 방법은 반복과정내부에 웨이블렛 축소법을 이용한 변형된 CGM(Conjugate Gradient Method)을 이용하였다. 제안한 방법은 CGM과 같은 빠른 복원과 함께 웨이블렛 축소법에 의한 적응적인 잡음제거와 오류제거를 동시에 제공한다. 효과적인 잡음제거와 오류제거를 동시에 얻기 위해 웨이블렛 축소는 위치에 따라 변하는 웨이블렛 축소규칙을 사용하였다. 기존의 반복적 영상복원 알고리즘인 LR(Lucy-Richardson), CGM과의 비교실험을 통해 제한한 방법이 LR에 비교해서는 전체적으로 향상된 복원과 물체관련오류가 거의 없다는 측면, 그리고 CGM과의 비교에서는 물체 및 경계 관련오류가 거의 없다는 측면에서 기존의 방법에 비해 우수하다는 것을 확인하였다.

• 한국국방경영분석학회지
• /
• 제34권1호
• /
• pp.1-11
• /
• 2008

본 연구에서는 다양하고 복잡한 변수간의 비선형적인 관계를 분석할 수 있는 신경망의 특성을 이용하여 곡사화기를 사용하는 포병의 모의훈련체계를 향상시킬 수 있는 방안을 제시하였다. 신경망 모델은 Conjugate Gradient 학습알고리즘을 사용하였고, 모델의 신뢰성은 모의실험을 통해 수학적 회귀분석모델과 신경망 모델의 예측오차를 비교하여 입증하였다. 신경망모델을 곡사화기 모의훈련체계 개선에 활용한다면, 보다 실전적인 모의훈련을 가능하게 하여 전투력 향상 및 예산절감에도 크게 기여할 것이다.

• 융합신호처리학회논문지
• /
• 제16권4호
• /
• pp.134-138
• /
• 2015

본 논문은 심장질환을 비침습적 방법으로 빠르고 쉽게 진단할 수 있도록 심음을 이용하는 방법에 대한 가능성을 찾는 것이다. 일반적으로 심음의 분류를 위하여 심음을 분리한 후에 특징파라미터를 추출하는 과정을 거치지 않고, 심음 분리에 사용되는 Shannon 엔트로피로 정규화하여 신경회로망의 입력으로 사용하였다. 심장질환에 따른 심잡음 분류를 위하여 Scaled conjugate gradient 역전파 알고리즘을 이용하여 신경회로망 분류기를 구현하였다. 정상 심음과 심장 질환의 경우 5가지를 포함하여 6종류의 심잡음에 대하여 분류가 가능함을 확인하였다.

• 대한수학회논문집
• /
• 제10권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.

• 한국전산구조공학회논문집
• /
• 제23권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.

• 대한수학회지
• /
• 제52권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
• /
• 제38권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년도 공동학술대회 논문집
• /
• 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.

• 한국원자력학회:학술대회논문집
• /
• 한국원자력학회 1997년도 추계학술발표회논문집(1)
• /
• 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.