• Journal of the Korean Society of Marine Environment & Safety
• /
• v.20 no.4
• /
• pp.419-425
• /
• 2014

The current work investigated the variation of numerical solutions according to the grid number, the distance of the first grid point off the ship surface, turbulence modeling and discretization. The subject vessel is KVLCC. A commercial code, Gridgen V15 and FLUENT were used the generation of the ship hull surface and spatial system and flow computation. The first part of examination, the effect of solutions were accessed depending on the grid number, turbulence modeling and discretization. The second part was focus on the suitable selection of the distance of the first grid point off the ship surface: $Y_P+$. When grid number and discretization were fixed the same value, the friction resistance showed differences within 1 % but the pressure resistance showed big differences 9 % depending on the turbulence modeling. When $Y_P+$ were set 30 and 50 for the same discretization, friction resistance showed almost same results within 1 % according to the turbulence modeling. However, when $Y_P+$ were fixed 100, friction resistance showed more differences of 3 % compared to $Y_P+$ of 30 and 50. Whereas pressure resistance showed big differences of 10 % regardless of turbulence modeling. When turbulence modeling and discretization were set the same value, friction, pressure and total resistance showed almost same result within 0.3 % depending on the grid number. Lastly, When turbulence modeling and discretization were fixed the same value, the friction resistance showed differences within 5~8 % but the pressure resistance showed small differences depending on the $Y_P+$.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.167-170
• /
• 2002

In this paper, we implement a 2.4 kbps STC speech codec using the TMS320C6201 DSP The main job for this work is twofold: one is to convert floating-point operation in the codec into fixed-point operation while maintaining the high resolution, and the other is to optimize the program to make it run in real time with memory size as small as possible. The implemented decoder uses 54.8 kbyte of program memory, 29.7 kbyte of data ROM and 55.2 kbyte of data RAM, respectively. It also uses about 45% of maximum computation capacity of TMS320C6201.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.6
• /
• pp.147-155
• /
• 1989

In this paper, a real-time implementation of the TWS(track-while-scan) system using the high-speed DSP (digital signal processor) TMS320C25 is described. First, attempts have been made to investigate the FWL (finite word length) effect, which is caused by employing a fixed point arithmetic, of implementing the Kalman filter. The real-time TWS system consists of TWS arithmetic unit, scan converter, and system controller. In addition, the TWS system is in tegrated in the Multi-Bus. In experiment, it is observed that by employing the floating point arithmetic the computation time of 0.35sec is required for tracking 8 targets simultaneously, while 0.28sec is required for the fixed point arithmetic. Since the TWS system is designed to track up to 8 targets simultaneously, we conclude that the system is enough to process Kalman filter in a real-time.

• 유체기계공업학회:학술대회논문집
• /
• 2006.08a
• /
• pp.349-352
• /
• 2006

The conventional segregated finite element formulation produces a small and simple matrix at each step than in an integrated formulation. And the memory and cost requirements of computations are significantly reduced because the pressure equation for the mass conservation of the Navier-Stokes equations is constructed only once if the mesh is fixed. However, segregated finite element formulation solves Poisson equation of elliptic type so that it always needs a pressure boundary condition along a boundary even when physical information on pressure is not provided. On the other hand, the conventional integrated finite element formulation in which the governing equations are simultaneously treated has an advantage over a segregated formulation in the sense that it can give a more robust convergence behavior because all variables are implicitly combined. Further it needs a very small number of iterations to achieve convergence. However, the saddle-paint-type matrix (SPTM) in the integrated formulation is assembled and preconditioned every time step, so that it needs a large memory and computing time. Therefore, we newly proposed the P2PI semi-segregation formulation. In order to utilize the fact that the pressure equation is assembled and preconditioned only once in the segregated finite element formulation, a fixed symmetric SPTM has been obtained for the continuity constraint of the present semi-segregation finite element formulation. The momentum equation in the semi-segregation finite element formulation will be separated from the continuity equation so that the saddle-point-type matrix is assembled and preconditioned only once during the whole computation as long as the mesh does not change. For a comparison of the CPU time, accuracy and condition number between the two methods, they have been applied to the well-known benchmark problem. It is shown that the newly proposed semi-segregation finite element formulation performs better than the conventional integrated finite element formulation in terms of the computation time.

• Structural Engineering and Mechanics
• /
• v.7 no.2
• /
• pp.159-180
• /
• 1999

The present paper shows a new non-tensorial approach to derive basic equations for various structural analyses. It can be used directly in numerical computation procedures. The aim of the paper is, however, to show that the approach serves as an excellent tool for analytical purposes also, working as a link between analytical and numerical techniques. The paper gives a method to derive, at first, expressions for strains in general beam and shell analyses, and secondly, the governing equilibrium equations. The approach is based on the utilization of local fixed Cartesian coordinate systems. Applying these, all the definitions required are the simple basic ones, well-known from the analyses in common global coordinates. In addition, the familiar principle of virtual work has been adopted. The method will be, apparently, most powerful in teaching the theories of curved beam and shell structures for students not familiar with tensor analysis. The final results obtained have no novelty value in themselves, but the procedure developed opens through its systematic and graphic progress a new standpoint to theoretical considerations.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.129-131
• /
• 2004

Elliptic Curve Cryptography (ECC) coprocessors support massive scalar multiplications of a point. We research the design for multi-segment multipliers in fixed-size ECC coprocessors using the multi-segment Karatsuba algorithm on GF($2^m$). ECC coprocessors of the proposed multiplier is verified on the SoC-design verification kit which embeds ALTERA EXCALIBUR FPGAs. As a result of our experiment, the multi-segment Karatsuba multiplier, which has more efficient performance about twice times than the traditional multi-segment multiplier, can be implemented as adding few H/W resources. Therefore the multi-segment Karatsuba multiplier which satisfies performance for the cryptographic algorithm, is adequate for a low cost embedded system, and is implemented in the minimum area.

• Water for future
• /
• v.25 no.3
• /
• pp.79-86
• /
• 1992

ARF(Areal Reduction Factor) have been developed and used to convert point I-D-F to areal I-D-F in many countries. In Korea, through ARF was calculated in Han river basin by several researchers, it has limit to apply to other regions \ulcorner 새 low density of rainfall gauge station and shortage of data. In this study ARF has developed in areas of high density of rainfall gauge station, Pyungchang river(han river), Wi stream(nakdong river), and Bochung stream(Guem river) basin by fixed-area method. And coefficient of variation of annual mean precipitation was presented to use ARF in othere areas and its applicability was analyzed.

• Korean Journal of Hydrosciences
• /
• v.4
• /
• pp.105-116
• /
• 1993

Areal Reduction Factor(ARF) has been developed and used to convert point Rainfall intensity-Duration-Frequency(I-D-F) to areal I-D-F in many countries. In Korea, though ARF was estimated in Han river basin by several researchers, it has some limitations to apply to other regions due to low denisity of rainfall gauging station and shortage of data. In this study ARF has been developed in area of relatively high density of rainfall gauging station, i.e., Pyungchang river(Han river), Wi stream(Nakdong river), and Bochung stream(Guem river) basin by geographically fixed-area method. And coefficient of variation of mean annual precipitation was presented to use ARE in other areas and its applicability was analyzed.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.10
• /
• pp.168-176
• /
• 1996

This paper presetns a 2-D DCT architecture adopting accurac y compensator for reducing the hardware complexity and increasing processing speed in VL\ulcornerSI implementation. In the application fields such as moving pictures experts group (MPEG) and joint photographic experts group (JPEG), 2-D DCT processor must be implemented precisely enough to meet the accuracy specifications of the ITU-T H.261. Almost all of 2-D DCT processors have been implemented using many multiplications and accumulations of matrices and vectors. The number of multiplications and accumulations seriously influence on comlexity and speed of 20D DCT processor. In 2-D DCT with fixed-point calculations, the computation bit width must be sufficiently large for the above accuracy specifications. It makes the reduction of hardware complexity hard. This paper proposes the accuracy compensator which compensates the accuracy of the finite word length calculation. 2-D DCT processor with the proposed accuracy compensator shows fairly reduced hardware complexity and improved processing speed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.3
• /
• pp.221-230
• /
• 1988

This paper presents an effective block matching algorithm(BMA) in which the number of search point is about a half of that of three step search, and the number of search step is fixed a four. The performance of the proposed algorithm is compared with those of three step search and one-at-at time search(OTS) for three video sequences composed of 16 framse. Moreover the performance of applying subsampling or integral projection to each BMA for further reducing the amount of computation is considered.