• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.6 no.1
• /
• pp.53-60
• /
• 1996

오증 요소로부터 오류위치다항식의 계수를 계산함으로서 (23,12) Golay 부호를 복호할 수 있는 대수적 복호법이 최근 증명되었다. GF(2)상에서의 3중 오류정정 BCH부호의 복호법을 이 부호에 완벽하게 적용하여 해석하는 것을 소개한다. 그리고 GF(2)에 대한 최적의 정규기저를 구하여 이를 유한체 연산에 적용하며 단계별로 복호 회로의 구성을 제시한다. 이는 기존의 복호기보다 논리회로적으로 간단하며, 복호된 정보를 얻기까지 35번의 치환이 필요하다.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.5 no.2
• /
• pp.107-120
• /
• 1993

This paper presents a new modal solution of linear three-dimensional hydrodynamic equations using similarity transform technique. The governing equations are first separated into external and internal mode equations. The solution of the internal mode equation then proceeds as in previous modal models using the Galerkin method but with expansion of arbitrary basis functions. Application of similarity transform to resulting full matrix equations gives rise to a set of uncoupled partial differential equations of which the unknowns are coefficients of mode vector. Using the transform technique a computationally efficient time integration is possible. In present from the model use Chebyshev polynomials for Galerkin solution of internal mode equations. To examine model performance the model is applied to a homogeneous, rectangular basin of constant depth under steady, uniform wind field.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.43 no.5 s.311
• /
• pp.36-43
• /
• 2006

In this paper we present a new high-speed parallel multiplier for Performing the bit-parallel multiplication of two polynomials in the finite fields $GF(2^m)$. Prior to construct the multiplier circuits, we consist of the MOD operation part to generate the result of bit-parallel multiplication with one coefficient of a multiplicative polynomial after performing the parallel multiplication of a multiplicand polynomial with a irreducible polynomial. The basic cells of MOD operation part have two AND gates and two XOR gates. Using these MOD operation parts, we can obtain the multiplication results performing the bit-parallel multiplication of two polynomials. Extending this process, we show the design of the generalized circuits for degree m and a simple example of constructing the multiplier circuit over finite fields $GF(2^4)$. Also, the presented multiplier is simulated by PSpice. The multiplier presented in this paper use the MOD operation parts with the basic cells repeatedly, and is easy to extend the multiplication of two polynomials in the finite fields with very large degree m, and is suitable to VLSI. Also, since this circuit has a low propagation delay time generated by the gates during operating process because of not use the memory elements in the inside of multiplier circuit, this multiplier circuit realizes a high-speed operation.

• Journal of KIISE:Software and Applications
• /
• v.31 no.5
• /
• pp.563-569
• /
• 2004

A set of Zernike moments has been successfully used for object recognition or content-based image retrieval systems. Real time applications using Zernike moments, however, have been limited due to its complicated definition. Conventional methods to compute Zernike moments fast have focused mainly on the radial components of the moments. In this paper, utilizing symmetric/anti-symmetric properties of Zernike basis functions, we propose a fast and efficient method for Zernike moments. By reducing the number of operations to one quarter of the conventional methods in the proposed method, the computation time to generate Zernike basis functions was reduced to about 20% compared with conventional methods. In addition, the amount of memory required for efficient computation of the moments is also reduced to a quarter. We also showed that the algorithm can be extended to compute the similar classes of rotational moments, such as pseudo-Zernike moments, and ART descriptors in same manner.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.3
• /
• pp.27-33
• /
• 2007

Recently, a new hard problem on a two dimensional vector space called vector decomposition problem (VDP) was proposed by M. Yoshida et al. and proved that it is at least as hard as the computational Diffe-Hellman problem (CDHP) on a one dimensional subspace under certain conditions. However, in this paper we present the VDP relative to a specific basis can be solved in polynomial time although the conditions proposed by M. Yoshida on the vector space are satisfied. We also suggest strong instances based on a certain type basis which make the VDP difficult for any random vector relative to the basis. Therefore, we need to choose the basis carefully so that the VDP can serve as the underlying intractable problem in the cryptographic protocols.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1145-1148
• /
• 2003

We show the mixed finite element method which induces solutions that has the same order of errors for both the gradient of the solution and the solution itself. The technique to construct an efficient reusable matrix is suggested. Two families of mixed finite element methods are introduced with an automatic generating technique for matrix with my order of basis. The generated matrix by this technique has more accurate values and is a sparse matrix. This new technique is applied to solve a minimal surface problem.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4A
• /
• pp.197-204
• /
• 2012

We propose a new scheme combining the compensation of HPA nonlinearity and the calibration of the path imperfections in the downlink OFDM smart antenna systems. We use a two term third-order polynomial (without second-order term) and the feedforward method for compensation and calibration to make each path of the antenna array have equal characteristics. Since the proposed scheme does not alter the base-band signal, it can be applied to the smart antenna system independently of the base-band signal processing section. The result of computer simulations shows that, with the addition of only one third-order term, the adverse nonlinear effects can be effectively compensated, and the those of linear imperfections can be calibrated as well.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2A
• /
• pp.102-109
• /
• 2003

In this paper, the new multiplicative algorithm using standard basis over GF(2m) is proposed. The multiplicative process is simplified by data select method in proposed algorithm. After multiplicative operation, the terms of degree greater than m can be expressed as a polynomial of standard basis with degree less than m by irreducible polynomial. For circuit implementation of proposed algorithm, we design the circuit using multiplexer and show the example over GF(24). The proposed architectures are regular and simple extension for m. Also, the comparison result show that the proposed architecture is more simple than privious multipliers. Therefore, it well suited for VLSI realization and application other operation circuits.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.51-58
• /
• 2004

Most of pubic-key cryptosystems are built on the basis of arithmetic operations defined over the finite field GF$GF(2^m)$ .The other operations of finite fields except addition can be computed by repeated multiplications. Therefore, it is very important to implement the multiplication operation efficiently in public-key cryptosystems. We propose an efficient bit-parallel normal basis multiplier for$GF(2^m)$ fields defined by All-One Polynomials. The gate count and time complexities of our proposed multiplier are lower than or equal to those of the previously proposed multipliers of the same class. Also, since the architecture of our multiplier is regular, it is suitable for VLSI implementation.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.6
• /
• pp.586-591
• /
• 2014

In this study, we introduce Radial Basis Function Neural Networks(RBFNNs) classifier using Artificial Bee Colony(ABC) algorithm in order to classify between precipitation event and non-precipitation event from given radar data. Input information data is rebuilt up through feature analysis of meteorological radar data used in Korea Meteorological Administration. In the condition phase of the proposed classifier, the values of fitness are obtained by using Fuzzy C-Mean clustering method, and the coefficients of polynomial function used in the conclusion phase are estimated by least square method. In the aggregation phase, the final output is obtained by using fuzzy inference method. The performance results of the proposed classifier are compared and analyzed by considering both QC(Quality control) data and CZ(corrected reflectivity) data being used in Korea Meteorological Administration.