• Journal of computational fluids engineering
• /
• v.6 no.4
• /
• pp.15-25
• /
• 2001

Numerical prediction of the diffusion controlled transition in a turbine gas pass is important because it can change the local heat transfer rate over a turbine blade as much as three times. In this study, the gas flow over turbine blade is simplified to the flat plate boundary layer, and an adaptive grid scheme redistributing grid points within the computation domain is proposed with a great emphasis on the construction of the grid control function. The function is sensitized to the second invariant of the mean strain tensor, its spatial gradient, and the interaction of pressure gradient and flow deformation. The transition process is assumed to be described with a κ-ε turbulence model. An elliptic solver is employed to integrate governing equations. Numerical results show that the proposed adaptive grid scheme is very effective in obtaining grid independent numerical solution with a very low grid number. It is expected that present scheme is helpful in predicting actual flow within a turbine to improve computation efficiency.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.2 s.95
• /
• pp.153-163
• /
• 1999

본 연구에서는 격자패널을 통한 소음전달을 감소시키기 위하여 외부 구조적 가진으로부터 유발된 경량 패널의 진동을 능동 제어하는 기법을 기술한다. 최적 되먹임제어기와 적응 앞먹임제어기가 결합된 혼합형 제어기가 진동제어기로 사용된다. 되먹임제어기는 주파수 영역의 모델규명법에 의해 추출된 다중 입/출력 패널진동계 모델에 대하여 LQG 최적기법을 이용하여 감쇠능을 향상시키도록 설계된다. 앞먹임제어기는 되먹임 궤환의 결합효과를 자동적으로 보정할 수 있는 제안된 학습법칙에 기초하여 패널의 잔류진동이 최소가 되도록 적응된다. 45.7${\times}$45.7${\times}$2.54 ${cm^3}$ 벌집형상의 고강도 패널, 4개의 관성형 구동기 및 이산신호처리장치에 의해 구현된 패널 진동계에 대한 능동제어 실험을 수행해 본 결과 600Hz 주파수대역에 대한 12dB 진동저감이 이루어 질 수 있었다.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.13 no.4
• /
• pp.485-500
• /
• 2000

In this paper the adaptive crack propagation analysis based on the estimated local and global error in the element-free Galerkin (EFG) method is presented. It is possible to keep consistency and accuracy of analysis in each propagation step by adaptive analysis. The adaptivity analysis in crack propagation is achieved by adding and removing the node along the background integration cell that are refined or recovered as estimated error. These errors are obtained by calculating the difference between the values of the projected stresses and original EFG stresses. To evaluate the performance of proposed adaptive procedure, the convergence behavior is investigated lot several examples. The results of these examples show the efficiency of proposed scheme in crack propagation analysis.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.33 no.8
• /
• pp.1-7
• /
• 2005

This paper proposes a local improvement method that combines extended topological clean up and optimization-based smoothing for homogenizing triangular grid system. First extended topological clean up procedures are applied to improve the connectivities of grid elements. Then, local optimization-based smoothing is performed for maximizing the distortion metric that measures grid quality. Using the local improvement strategy, we implement the grid homogenizations for two triangular grid examples. It is shown that the suggested algorithm improves the quality of the triangular grids to a great degree in an efficient manner and also can be easily applied to the remeshing algorithm in adaptive mesh refinement technique.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2004.10a
• /
• pp.79-82
• /
• 2004

In this study, a new refinement technique for 3-dimensional hexahedral element mesh is proposed, which is aimed at the control of mesh density. With the proposed scheme the mesh is refined adaptively to the elemental error which is estimated by 'a posteriori' error estimator based on the energy norm. A desired accuracy of an analysis i.e. a limit of error defines the new desired mesh density map on the current mesh. To obtain the desired mesh density, the refinement procedure is repeated iteratively until no more elements to be refined exist. In the algorithm, at first the regions of mesh to be refined are defined and, then, the zero-thickness element layers are inserted into the interfaces between the regions. All the meshes in the regions, in which the zero-thickness layers are inserted, are to be regularized in order to improve the shape of the slender elements on the interfaces. This algorithm is tested on a simple shape of 2-d quadrilateral element mesh and 3-d hexahedral element mesh. A numerical example of elastic deformation of a plate with a hole shows the effectiveness of the proposed refinement scheme.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.14 no.4
• /
• pp.525-535
• /
• 2001

In this paper, a new adaptive analysis scheme for element-free Galerkin method(EFGM) is proposed. The novel point of this scheme is that the triangular cell structure based on the Delaunay triangulation is used in the numerical integration and the node adding/removing process. In adaptive analysis with this scheme, there is no need to divide the integration cell and the memory cell structure. For the adaptive analysis of crack propagation, the reconstruction of cell structure by adding and removing the nodes on integration cells based the estimated error should be carried out at every iteration step by the Delaunay triangulation technique. This feature provides more convenient user interface that is closer to the real mesh-free nature of EFGM. The analysis error is obtained basically by calculating the difference between the values of the projected stresses and the original EFG stresses. To evaluate the performance of proposed adaptive procedure, the crack propagation behavior is investigated for several examples.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1996.10a
• /
• pp.728-731
• /
• 1996

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.12
• /
• pp.1219-1228
• /
• 1991

In the actual case, a model of noise canceller using adaptive filter has both a channel transfer function from noise source to main signal input and to noise canceller input. The previous models of noise canceller have been considered to be only one side channel transfer function. Therefore, it is proposed that a new model has two channel transfer functions and derives an optimal tranfer function of adaptive noise canceller. The adaptive filter is using the joint process lattice filter that has fast adaptive speed. The signal noise radio has been improved by a model of ANC-ALE and it is confirmed with computer simulation. Beside, a dc bias is very effective for noise cancelling, especially to the particular signal.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.33 no.1
• /
• pp.1-10
• /
• 2005

An aerodynamic shape optimization technique has been developed for helicopter rotor blades in hover based on a continuous adjoint method on unstructured meshes. The Euler flow solver and the continuous adjoint sensitivity analysis were formulated on the rotating frame of reference for hovering rotor blades. In order to handle the repeated evaluation of the design cycle efficiently, the flow and adjoint solvers were parallelized using a domain decomposition strategy. A solution-adaptive mesh refinement technique was adopted for the accurate capturing of the tip vortex. Applications were made for the aerodynamic shape optimization of Caradonna-Tung rotor blades and UH60 rotor blades in hover. The results showed that the present method is an effective tool to determine optimum aerodynamic shapes of rotor blades requiring less torque while maintaining the desired thrust level.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.10 s.352
• /
• pp.1-7
• /
• 2006

Lattice decoding concept has been proposed for the implementation of the Maximum-Likelihood detection which is the optimal receiver from the viewpoint of the BER (Bit Error Rate) performance for MIMO (Multiple Input Multiple Output) systems. Sphere decoding algorithm and K-best decoding algorithm are based on the lattice decoding concept. A K-best decoding algorithm shows a good BER performance with relatively low complexity. However, with small K value, the error propagation effect severely degrades the performance. In this paper, we propose an adaptive K-best decoding algorithm which has lower average complexity and better BER performance than conventional K-best decoding algorithm.