• Journal of Electrical Engineering and Technology
• /
• v.13 no.4
• /
• pp.1655-1662
• /
• 2018

This paper studies the magnetic fields between the power lines which are finite length and other ones which are infinitely long around the first tower in the proximity of the power transformers. They will be used as a source of disturbance applied to the power line. The method applied in this study was gradual; develop the theoretical formulation of the magnetic fields of these lines which are finite length and other ones which are infinitely long, examine the effects of different couplings between the different neighboring lines and the distribution transformers on behavior of magnetic fields. The method also focused on the experimental results analyzing the magnetic fields which will be used as a source applied to the auditory implants EMC. The theoretical and experimental results were compared and discussed for three power lines (90kV, 150kV and 225kV) near the power station, and it proved the effect of these substations on the simulated and measured results of the magnetic field. The maximum intensities of magnetic fields measured at the height of 1m from the ground for the circuit of three lines close to each substation were significantly lower than the ICNIRP reference levels for occupational and non occupational exposures.

• Journal of the Korean Mathematical Society
• /
• v.56 no.2
• /
• pp.559-578
• /
• 2019

We list all subfields of cyclotomic function fields over rational function fields with class number three. We also determine all the imaginary abelian extensions with relative class number three, explicitly.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.514-518
• /
• 2004

This paper presents an algorithm generating inverse element over finite fields $GF(3^{m})$, and constructing method of inverse element generator based on inverse element generating algorithm. A method computing inverse of an element over $GF(3^{m})$ which corresponds to a polynomial over $GF(3^{m})$ with order less than equal to m-l. Here, the computation is based on multiplication, square and cube method derived from the mathematics properties over finite fields.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.768-771
• /
• 2008

This paper presents an algorithm for generating inverse element over finite fields $GF(3^m)$, and constructing method of inverse element generator based on inverse element generating algorithm. The method need to compute inverse of an element eve. $GF(3^m)$ which corresponds to a polynomial eve. $GF(3^m)$ with order less than equal to m-1. Here, the computation is based on multiplication, square and cube method derived from the mathematics properties over finite fields.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.7
• /
• pp.1209-1217
• /
• 2008

In this paper, we present a new bit-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 vector code generator(VCG) 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 VCG have two AND gates and two XOR gates. Using these VCG, 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 VCGs 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.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.6
• /
• pp.3-15
• /
• 2009

Recently, Wu proposed a three small classes of finite fields $F_{2^n}$ for low-complexity bit-parallel multipliers. The proposed multipliers have low-complexities compared with those based on the irreducible pentanomials. In this paper, we propose a new Repeated Polynomial(RP) for low-complexity bit-parallel multipliers over $F_{2^n}$. Also, three classes of Irreducible Repeated polynomials are considered which are denoted, respectively, by case 1, case 2 and case3. The proposed RP bit-parallel multiplier has lower complexities than ones based on pentanomials. If we consider finite fields that have neither a ESP nor a trinomial as an irreducible polynomial when $n\leq1,000$. Then, in Wu''s result, only 11 finite fields exist for three types of irreducible polynomials when $n\leq1,000$. However, in our result, there are 181, 232, and 443 finite fields of case 1, 2 and 3, respectively.

• Journal of the Chungcheong Mathematical Society
• /
• v.26 no.4
• /
• pp.853-867
• /
• 2013

In this paper we study the cardinality of the dot product set generated by two subsets of vector spaces over finite fields. We notice that the results on the dot product problems for one set can be simply extended to two sets. Let E and F be subsets of the d-dimensional vector space $\mathbb{F}^d_q$ over a finite field $\mathbb{F}_q$ with q elements. As a new result, we prove that if E and F are subsets of the paraboloid and ${\mid}E{\parallel}F{\mid}{\geq}Cq^d$ for some large C > 1, then ${\mid}{\Pi}(E,F){\mid}{\geq}cq$ for some 0 < c < 1. In particular, we find a connection between the size of the dot product set and the number of lines through both the origin and a nonzero point in the given set E. As an application of this observation, we obtain more sharpened results on the generalized dot product set problems. The discrete Fourier analysis and geometrical observation play a crucial role in proving our results.

• Journal of Korea Society of Industrial Information Systems
• /
• v.18 no.2
• /
• pp.41-46
• /
• 2013

Finite field multipliers are the basic building blocks in many applications such as error-control coding, cryptography and digital signal processing. Recently, many semi-systolic architectures have been proposed for multiplications over finite fields. Also, Montgomery multiplication algorithm is well known as an efficient arithmetic algorithm. In this paper, we induce an efficient multiplication algorithm and propose an efficient semi-systolic Montgomery multiplier based on polynomial basis. We select an ideal Montgomery factor which is suitable for parallel computation, so our architecture is divided into two parts which can be computed simultaneously. In analysis, our architecture reduces 30%~50% of time complexity compared to typical architectures.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.25 no.6
• /
• pp.57-67
• /
• 2011

Purpose of this study is to find the mitigation method of magnetic field by finite length multi-conductors such as indoor distribution lines and to be applicable to design of the distribution lines. For this purpose, exact formula about the components $B_x$, $B_y$, $B_z$ of magnetic field need in case of straight line-conductor with finite length forward any direction. In this study simple formula of the components were deduced and by using these formula magnetic fields for various models of line-configurations were calculated. And also a calculation method of induced currents in conductive shield was presented and using this method, programing of calculation is relatively easy and calculation time is short. The magnetic field after cancellation by these induced currents was calculated. All of calculations were performed by Matlab 7.0 programs. Through the calculation results it could be obtained followings for the mitigation of magnetic fields. The separation between conductors ought to be smaller than smaller as possible. In case of 3-phase, delta configuration is more effective than flat configuration. In case of 3-phase, unbalanced currents ought to be reduced as possible.. In case of more than two circuits of 3-phase, adequate locations of each phase-conductor such as rotating configuration of 3-phase conductors are more effective. The magnetic shielding effect of the conductive shielding sheet is very high.

• Journal of computational fluids engineering
• /
• v.1 no.1
• /
• pp.64-70
• /
• 1996

Three dimensional turbulent flow fields around ships are simulated by a numerical method. Reynolds Averaged Navier-Stokes equations are used where Reynolds stresses are approximated by Baldwin-Lomax and Sub-Grid Scale(SGS) turbulence models. Body-fitted coordinate system is introduced to conform three dimensional ship geometries. The governing equations are discretized by a finite volume method. Temporal derivatives are approximated by the forward differencing and the convection terms are approximated by the QUICK or Kawamura scheme. The 2nd-order centered differencing is used for other spatial derivatives. Pressure and velocity fields are simultaneously iterated by the Highly Simplified Marker-And-Cell method. To verify the numerical method and turbulence models, flow fields around ships are simulated and compared to the experiments.