• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9C
• /
• pp.895-904
• /
• 2007

This paper proposes a robust sub-optimal smart antenna in Code Division Multiple Access (CDMA) basestation. It makes use of the property of the Least Mean Square (LMS) algorithm and the Conjugate Gradient Method (CGM) algorithm for beamforming processes. The weight update takes place at symbol level which follows the PN correlators of receiver module under the assumption that the post correlation desired signal power is far larger than the power of each of the interfering signals. The proposed algorithm is simple and has as low computational load as five times of the number of antenna elements(O(5N)) as a whole per each snapshot. The output Signal to Interference plus Noise Ratio (SINR) of the proposed smart antenna system when the weight vector reaches the steady state has been examined. It has been observed in computer simulations that proposed beamforming algorithm improves the SINR significantly compared to the single antenna case. The convergence property of the weight vector has also been investigated to show that the proposed hybrid algorithm performs better than CGM and LMS during the initial stage of the weight update iteration. The Bit Error Rate (BER) characteristics of the proposed array has also been shown as the processor input Signal to Noise Ratio (SNR) varies.

• 한국전산유체공학회:학술대회논문집
• /
• 2004.03a
• /
• pp.83-90
• /
• 2004

Substructuring methods are usually used in finite element structural analyses. In this study a multi-level substructuring algorithm is developed and proposed as a possible candidate for incompressible fluid solves. Finite element formulation for incompressible flow has been stabilized by a modified residual procedure proposed by Ilinca et.al.[5]. The present algorithm consists of four stages such as a gathering stage, a condensing stage, a solving stage and a scattering stage. At each level, a predetermined number of elements are gathered and condensed to form an element of higher level. At highest level, each subdomain consists of only one super-element. Thus, the inversion process of a stiffness matrix associated with internal degrees of freedom of each subdomain has been replaced by a sequential static condensation. The global algebraic system arising feom the assembly of each subdomains is solved using Conjugate Gradient Squared(CGS) method. In this case, pre-conditioning techniques usually accompanied by iterative solvers are not needed.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.8
• /
• pp.3384-3390
• /
• 2011

This paper describes a domain decomposition method of parallel finite element analysis for elasto-plastic structural problems. As a parallel numeral algorithm for the finite element analysis, the authors have utilized the domain decomposition method combined with an iterative solver such as the conjugate gradient method. Here the domain decomposition method algorithm was applied directly to elasto-plastic problem. The present system was successfully applied to three-dimensional elasto-plastic structural problems.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.6
• /
• pp.616-623
• /
• 1990

This paper includes the analysis and formulation of a new model for studying scattering from wire meshes that is more efficient and simpler to apply than the previous methods. In the new method, the conjugate gradient method is employed to improve each previous iterative and the fast Fourier transform (FFT) technique is utilized. A numerical computation of mesh scattering algorithm has been carried out in the Spectral Domain. A study on the electromagnetic properties such as reflection coefficients, induced currents and aperture fields has been presented and compared with data calculated by other methods to support the validity of the algorithm.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.50 no.11
• /
• pp.539-545
• /
• 2001

A simple analysis method for inverter-fed induction motor using F.E.M and harmonic equivalent circuit is proposed. And an optimum shape of rotor slot for 2Hp inverter-fed induction motor is determined by combining the proposed analysis method and an optimization algorithm. Conjugate gradient method is used for the optimization algorithm. The optimization is performed for higher efficiency and reduction of harmonic loss in the inverter-fed induction motor. The optimization results are verified by comparing with those of the time-step F.E.A.

• Proceedings of the KIEE Conference
• /
• 2000.11b
• /
• pp.250-252
• /
• 2000

A simple analysis method for inverter-fed induction motor using F.E.M and equivalent circuit is proposed. And an optimum shape of rotor slot for 2Hp inverter-fed induction motor is determined by combining the proposed analysis method and an optimization algorithm. Conjugate gradient method is used for the optimization algorithm. The optimization is performed for higher efficiency and reduction of harmonic loss in the inverter-fed induction motor. The optimization results are verified by comparing with those of the time-step F.E.A and the experiment.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.692-704
• /
• 2005

With the improvement of computer hardware, GPUs(Graphics Processor Units) have tremendous memory bandwidth and computation power. This leads GPUs to use in general purpose computation. Especially, GPU implementation of compute-intensive physics based simulations is actively studied. In the solution of differential equations which are base of physics simulations, tridiagonal matrix systems occur repeatedly by finite-difference approximation. From the point of view of physics based simulations, fast solution of tridiagonal matrix system is important research field. We propose a fast GPU implementation for the solution of tridiagonal matrix systems. In this paper, we implement the cyclic reduction(also known as odd-even reduction) algorithm which is a popular choice for vector processors. We obtained a considerable performance improvement for solving tridiagonal matrix systems over Thomas method and conjugate gradient method. Thomas method is well known as a method for solving tridiagonal matrix systems on CPU and conjugate gradient method has shown good results on GPU. We experimented our proposed method by applying it to heat conduction, advection-diffusion, and shallow water simulations. The results of these simulations have shown a remarkable performance of over 35 frame-per-second on the 1024x1024 grid.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.1
• /
• pp.35-44
• /
• 2009

This paper describes an application of domain decomposition method for parallel finite element analysis which is required to large scale 3D structural analysis. A parallel finite element method system which adopts a domain decomposition method is developed. Node is generated if its distance from existing node points is similar to the node spacing function at the point. The node spacing function is well controlled by the fuzzy knowledge processing. The Delaunay triangulation method is introduced as a basic tool for element generation. Domain decomposition method using automatic mesh generation system holds great benefits for 3D analyses. Aa parallel numerical algorithm for the finite element analyses, domain decomposition method was combined with an iterative solver, i.e. the conjugate gradient(CG) method where a whole analysis domain is fictitiously divided into a number of subdomains without overlapping. Practical performance of the present system are demonstrated through several examples.

• Composites Research
• /
• v.12 no.1
• /
• pp.1-10
• /
• 1999

In order to predict the dynamic behavior of composite laminated plate accurately, the parametric identification is performed using its mechanical properties- $E_1,\;E_2,\;V_{12},\;G_{12}$ as design parameters. After natural frequencies are measured through simple vibration test, the objective function consists of the sum of errors between experimental and numerical frequencies of a structure. As optimization algorithm, conjugate gradient method is used to minimize the objective function. Sensitivity Analysis is performed to update design parameters during this process and can explain the result of parametric identification. In order to check the propriety of result, mode shapes are compared before and after identification. The improved prediction of natural frequencies of composite laminated plate is obtained with updated properties. For the application of result, updated properties is applied to the composite laminated plate that has different stacking sequence.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.12
• /
• pp.85-96
• /
• 1999

In a number of predictive video compression standards, the motion is compensated by the block-based motion compensation (BMC). The effective motion field used for the prediction by the BMC is obviously discontinuous since one motion vector is used for the entire macro-block. The usage of discontinuous motion field for the prediction causes the blocky artifacts and one obvious approach for eliminating such artifacts is to use a smoothed motion field. The optimal procedure will depend on the type of motion within the video. In this paper, several procedures for the motion vectors are considered. For any interpolation or approaches, however, the motion vectors as provided by the block matching algorithm(BMA) are no longer optimal. The optimum motion vectors(still one per macro-block) must minimize the of the displaced frame difference (DFD). We propose a unified algorithm that computes the optimum motion vectors to minimize the of the DFD using a conjugate gradient search. The proposed algorithm has been implemented and tested for the affine transformation based motion compensation (ATMC), the bilinear transformation based motion compensation (BTMC) and our own filtered motion compensation(FMC). The performance of these different approaches will be compared against the BMC.