• The Journal of Information Technology
• /
• v.8 no.3
• /
• pp.1-10
• /
• 2005

Cosine and Sine function is widely used for the arithmetic, translation, object drawing, Simulation and etc. of Computer Graphics in Natural Science and Engineering. In general, Cordic Algorithm is effective method since it has relatively small size and simple architecture on trigonometric function generation. However profitably it has those merits, the problem of operation speed is occurred. In graphic display system, the operation result of object drawing is quantized and has the condition that is satisfied with rms error less than 1. So in this paper, the proposed generator is composed of partition operation at each ${\pi}/4$ and basic Cosine, Sine function generator in the range of $0{\sim}{\pi}/4$ using the lower order of Tayler's series in an acceptable error range, that enlarge the range of $0{\sim}2{\pi}$ according to a definition of the trigonometric function for the purpose of having a high speed Cosine, Sine function generation. And, division operator using code partition for divisor three is proposed, the proposed function generator has high speed operation, but it has the problems in the other application parts with accurate results, is need to increase the speed of the multiplication.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.9
• /
• pp.1965-1970
• /
• 2011

This paper proposes the method of switching function implementation using switching function extraction based on graph over finite fields. After we deduce the matrix equation from path number of directional graph, we propose the switching function circuit algorithm, also we propose the code assignment algorithm for nodes which is satisfied the directional graph characteristics with designed circuits. We can implement more optimal switching function compare with former algorithm, also we can design the switching function circuit which have any natural number path through the proposed switching function circuit implementation algorithms. Also the proposed switching function implementation using graph theory over finite fields have decrement number of input-output, circuit construction simplification, increment arithmetic speed and decrement cost etc.

• Journal of Korea Water Resources Association
• /
• v.40 no.2 s.175
• /
• pp.159-170
• /
• 2007

This study evaluated the parameters of Clark unit hydrograph (UH) estimated using the rainfall-runoff measurements and evaluated their variability. This also includes the quantification of basin and meteorological factors using probability density functions, selection of storm events with mean affecting factors, and derivation of average parameters of the Clark UH from storm events selected. Summarizing the results from this procedure are as follows. (1) It is not easy to avoid much uncertainty on the decision of runoff characteristics (that is, the concentration time and storage coefficient) even with some rainfall-runoff events are available. (2) As the distribution function of concentration time is very skewed, a simple arithmetic mean may lead a biased estimate. That is, the arithmetic mean based on the normal distribution can not be representative anymore. The mode may well be the representative in this case. On the other hand, the storage coefficient shows a symmetric distribution function, so the arithmetic mean may be used use for its representative. For the basin in this study, the concentration time in this study is estimated to be about 7 hours, and the storage coefficient about 22 hours.

• Communications of the Korean Mathematical Society
• /
• v.29 no.1
• /
• pp.51-63
• /
• 2014

In the paper, several properties of geometric-arithmetically s-convex functions are provided, an integral identity in which the integrands are products of a function and a derivative is found, and then some inequalities of Hermite-Hadamard type for integrals whose integrands are products of a derivative and a function whose derivative is of the geometric-arithmetic s-convexity are established.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.52 no.11
• /
• pp.647-654
• /
• 2003

As electrical power system has become complicated and enlarged to cope with the increasing electric demand, it has to be expected that higher speed, higher reliability, higher function and higher arithmetic ability in protective relay should be realized. Therefore, in this papers, by hardware design and implementation used DMA controller that transfer blocks of data to any location in the memory map without interfering with CPU operation, CPU utilization is increased effectively, as a result it made possible to implement multi-function digital protective relay which has high trust and high function of protection as well as control and metering for power transformers using single processor(DSP).

• Communications of the Korean Mathematical Society
• /
• v.34 no.4
• /
• pp.1105-1115
• /
• 2019

For positive integers n and k, let $S_k(n)$ and $S^{\prime}_k(n)$ be the sums of the elements in the finite sets {$x^k:1{\leq}x{\leq}n$, (x, n) = 1} and {$x^k:1{\leq}x{\leq}n/2$, (x, n) = 1}respectively. The formulae for both $S_k(n)$ and $S^{\prime}_k(n)$ are established. The explicit formulae when k = 1, 2, 3 are also given.

• The Pure and Applied Mathematics
• /
• v.30 no.3
• /
• pp.337-345
• /
• 2023

Different versions of the boundary Schwarz lemma for the 𝒩 (𝜌) class are discussed in this study. Also, for the function g(z) = z+b₂z²+b₃z³+... defined in the unit disc D such that g ∈ 𝒩 (𝜌), we estimate a modulus of the angular derivative of g(z) function at the boundary point 1 ∈ 𝜕D with g'(1) = 1 + 𝜎 (1 - 𝜌), where ${\rho}={\frac{1}{n}}{\sum\limits_{i=1}^{n}}g(c_i)={\frac{g^{\prime}(c_1)+g^{\prime}(c_2)+{\ldots}+g^{\prime}(c_n)}{n}}{\in}g^{\prime}(D)$ and 𝜌≠1, 𝜎 > 1 and c₁, c₂, ..., c_n ∈ 𝜕D. That is, we shall give an estimate below |g"(1)| according to the first nonzero Taylor coefficient of about two zeros, namely z = 0 and z ≠ 0. Estimating is made by using the arithmetic average of n different derivatives g'(c₁), g'(c₂), ..., g'(c_n).

• International Journal of Computer Science & Network Security
• /
• v.23 no.6
• /
• pp.84-90
• /
• 2023

In this article the problem of computing floating-point reciprocal cube root functions is considered. Our new algorithms for this task decrease the number of arithmetic operations used for computing $1/{\sqrt[3]{x}}$. A new approach for selection of magic constants is presented in order to minimize the computation time for reciprocal cube roots of arguments with movable decimal point. The underlying theory enables partitioning of the base argument range x∈[1,8) into 3 segments, what in turn increases accuracy of initial function approximation and decreases the number of iterations to one. Three best algorithms were implemented and carefully tested on 32-bit microcontroller with ARM core. Their custom C implementations were favourable compared with the algorithm based on cbrtf(x) function taken from C ＜math.h＞ library on three different hardware platforms. As a result, the new fast approximation algorithm for the function $1/{\sqrt[3]{x}}$ was determined that outperforms all other algorithms in terms of computation time and cycle count.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.1
• /
• pp.131-141
• /
• 2003

In this paper, we prove that multi-variate fuzzy polynomials are universal approximators for multi-variate fuzzy functions which are the extension principle of continuous real-valued function under $T_W-based$ fuzzy arithmetic operations for a distance measure that Buckley et al.(1999) used. We also consider a class of fuzzy polynomial regression model. A mixed non-linear programming approach is used to derive the satisfying solution.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.2
• /
• pp.44-50
• /
• 1993

In this paper, we will present an array processor for implementation of digital neural networks. Back-propagation model can be formulated as a consecutive matrix-vector multiplication problem with some prespecified thresholding operation. This operation procedure is suited for the design of an array processor, because it can be recursively and repeatedly executed. Systolic array circuit architecture with Residue Number System is suggested to realize the efficient arithmetic circuit for matrix-vector multiplication and compute sigmoid function. The proposed design method would expect to adopt for the application field of neural networks, because it can be realized to currently developed VLSI technology.