• Bulletin of the Korean Mathematical Society
• /
• v.58 no.5
• /
• pp.1129-1147
• /
• 2021

This paper aims to analyze the PTG module for the finite-dimensional odd Contact superalgebra over a field of prime characteristic by using the method of Hu and Shen's mixed product realization. The general acting law in odd Contact superalgebra is obtained. In addition, the structure and irreducibility of graded module for odd Contact superalgebra are discussed.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.3
• /
• pp.781-787
• /
• 2022

In this paper, we show that under certain conditions the Wedderburn decomposition of a finite semisimple group algebra 𝔽_qG can be deduced from a subalgebra 𝔽_q(G/H) of factor group G/H of G, where H is a normal subgroup of G of prime order P. Here, we assume that q = p^r for some prime p and the center of each Wedderburn component of 𝔽_qG is the coefficient field 𝔽_q.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.1
• /
• pp.57-67
• /
• 2005

Fast scalar multiplication of points on elliptic curve is important for elliptic curve cryptography applications. In order to vary field sizes depending on security situations, the cryptography coprocessors should support variable length finite field arithmetic units. To determine the effective variable length finite field arithmetic architecture, two well-known curve scalar multiplication algorithms were implemented on FPGA. The affine coordinates algorithm must use a hardware division unit, but the projective coordinates algorithm only uses a fast multiplication unit. The former algorithm needs the division hardware. The latter only requires a multiplication hardware, but it need more space to store intermediate results. To make the division unit versatile, we need to add a feedback signal line at every bit position. We proposed a method to mitigate this problem. For multiplication in projective coordinates implementation, we use a widely used digit serial multiplication hardware, which is simpler to be made versatile. We experimented with our implemented ECC coprocessors using variable length finite field arithmetic unit which has the maximum field size 256. On the clock speed 40 MHz, the scalar multiplication time is 6.0 msec for affine implementation while it is 1.15 msec for projective implementation. As a result of the study, we found that the projective coordinates algorithm which does not use the division hardware was faster than the affine coordinate algorithm. In addition, the memory implementation effectiveness relative to logic implementation will have a large influence on the implementation space requirements of the two algorithms.

• Journal of applied mathematics & informatics
• /
• v.8 no.2
• /
• pp.591-611
• /
• 2001

In this paper, we classify elliptic curve by isomorphism classes over some finite fields. We consider finite field as a quotient ring, saying $\mathbb{Z}[i]/{\pi}\mathbb{Z}[i]$ where $\pi$ is a prime element in $\mathbb{Z}[i]$. Here $\mathbb{Z}[i]$ is the ring of Gaussian integers.

• Korean Journal of Mathematics
• /
• v.22 no.3
• /
• pp.455-462
• /
• 2014

Let D be an integral domain with Spec(D) finite, K the quotient field of D, [D,K] the set of rings between D and K, and SFc(D) the set of semistar operations of finite character on D. It is well known that |Spec(D)| ${\leq}$ |SFc(D)|. In this paper, we prove that |Spec(D)| = |SFc(D)| if and only if D is a valuation domain, if and only if |Spec(D)| = |[D,K]|. We also study integral domains D such that |Spec(D)|+1 = |SFc(D)|.

• Korean Journal of Mathematics
• /
• v.26 no.3
• /
• pp.537-544
• /
• 2018

There is a standard construction of lifting cyclic codes over the prime finite field ${\mathbb{Z}}_p$ to the rings ${\mathbb{Z}}_{p^e}$ and to the ring of p-adic integers. We generalize this construction for arbitrary finite fields. This will naturally enable us to lift codes over finite fields ${\mathbb{F}}_{p^r}$ to codes over Galois rings GR($p^e$, r). We give concrete examples with all of the lifts.

• Structural Engineering and Mechanics
• /
• v.5 no.2
• /
• pp.127-135
• /
• 1997

Patch recovery attempts to derive a more accurate stress filed over a particular element than the finite element shape function used for that particular element. Elements that have a free edge being the boundary to the structure have particular stress relationship that can be incorporated to the stress field to improve the accuracy of the approximation.

• Proceedings of the Optical Society of Korea Conference
• /
• 1989.02a
• /
• pp.157-160
• /
• 1989

The most serious difficulty in using the finite element method is the appearance of the so-called spurious, nonphysical modes. We have proposed the finite element formulation of the variational expression in the three-component magnetic field based on Galerkin's method. In this approach, the divergence relation H is satisfied and spurious modes does not appear and finite-element solutions agree with the exact solutions.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.11
• /
• pp.28-33
• /
• 2002

In this paper, the impedance-tuned monopole microstrip antenna designed for PCS is analyzed using finite difference time domain(FDTD) method. The perfectly matched layer(PML) absorbing material condition proposed by Berenger is used for the truncation of finite difference time domain lattice. A Gaussian pulse is selected as an excitation signal and a resistive voltage source model is used to reduce the error caused by the reflection waves. The FDTD method is inherently a near field technique. Therefore, the near field to far field transformation is need to compute far field antenna parameters such as radiation patterns and gain. The near field to far field transformation can be done both in the time domain and the frequency domain. We use the frequency domain transformation to compute the far field radiation patterns at single frequency. All the numerical results obtained by the FDTD method are compared with simulation results using the HFSS software. Good agreements are obtained in all cases.

• KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
• /
• v.5B no.3
• /
• pp.267-271
• /
• 2005

This paper deals with two kinds of novel shape switched reluctance motors (SRM) with magnetic barriers in order to improve operating performances of prototype. The magnetic barriers make rotor poles more saturated, and consequently inductance profiles are distorted. The changed inductance affects input current shape and eventually torque characteristics. In order to analyze the complicated flux pattern of the SRM with magnetic barriers and its terminal characteristics simultaneously, coupled field circuit modeling method is used. The finite element method is used to model the nonlinear magnetic field, and coupled to the circuit model of the SRM overall system. After experimental results are presented to prove the accuracy of the method, the several analysis results are compared, and the improved rotor shape is presented.