• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.5
• /
• pp.747-755
• /
• 1990

In this paper, we presented a method of constructing a multiplier and an inverse element generator over finite field GF(3**m). We proposed the multiplication method using a descending order arithmetics of mod F(X) to perform the multiplication and mod F(X) arithmetics at the same time. The proposed multiplier is composed of following parts. 1) multiplication part, 2) data assortment generation part and 5) multiplication processing part. Also the inverse element generator is constructed with following parts. 1) multiplier, 2) group of output registers Rs, 3) multiplication and cube selection gate Gl, 4) Ri term sequential selection part. 5) cube processing part and 6) descending order mod F(X) generation part. Especially, the proposed multiplier and inverse element generator give regularity, expansibility and modularity of circuit design.

• Journal of applied mathematics & informatics
• /
• v.40 no.1_2
• /
• pp.1-13
• /
• 2022

This article introduces a new distribution called length-biased powered inverse Rayleigh distribution. Some of its statistical properties are derived. Maximum likelihood procedure is applied to report the point and interval estimations of all model parameters. The proposed distribution is also applied to two real data sets for illustrative purposes.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1999.10a
• /
• pp.131-136
• /
• 1999

This paper proposes the robot inverse calibration method using a neural networks. A highorder networks called Pi-Sigma networks has been used. The Pi-Sigma networks uses linear summing units in the hidden layer and product unit in output layer. The inverse calibration model which compensates the difference of joint variables only between measuring value and analytic value about the desired pose(position, orientation) of a robot is proposed. The compensated values are determined by using the weights obtained from the learning process of the neural networks previously. To prove the reasonableness, the SCARA type direct drive robot(4-DOF) and anthropomorphic robot(6-DOF) are simulated. It shows that the proposed calibration method can reduce the errors of the joint variables from $\pm$2$^{\circ}$to $\pm$ 0.1$^{\circ}$.

• Journal of the Korean Society of Radiology
• /
• v.9 no.6
• /
• pp.343-348
• /
• 2015

The purpose of this study is a comparison of forward planning(FP) and inverse planning(IP) of a radiosurgery procedure. 10 patients of acoustic schwannoma MR image were used for treatment plan. FP-1,2 and IP were established under the same condition. FP and IP were compared by number of shot, conformity index(CI), paddic conformity index(PCI), gradiant index(GI) and treatment time. On average the treatment plan produced by IP tool provided an improved or similar CI, PCI, GI and reduced treatment time as compared to the FP (CI;FP-1:0.85, FP-2:0.86, IP:0.94, PCI;FP-1:0.79, FP-2:0.81, IP:0.78, GI;FP-1:2.94, FP-2:2.94, IP:3.01). The inverse planning system provides a clinically useful plan while reducing the planning time and treatment time.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.6
• /
• pp.696-702
• /
• 2001

In this paper, we design IDEA cipher algorithm which is cryptographically superior to DES. To improve the encryption throughput, we propose an efficient design methodology for high-speed implementation of multiplicative inverse modulo $2^{15}$+1 which requires the most computing powers in IDEA. The efficient hardware architecture for the multiplicative inverse in derived from applying of Fermat's Theorem. The computing powers for multiplicative inverse in our proposal is a decrease 50% compared with the existing method based on Extended Euclid Algorithm. We implement IDEA by applying a single iterative round method and our proposal for multiplicative inverse. With a system clock frequency 20MGz, the designed hardware permits a data conversion rate of more than 116 Mbit/s. This result show that the designed device operates about 2 times than the result of the paper by H. Bonnenberg et al. From a speed point of view, out proposal for multiplicative inverse is proved to be efficient.

• The Journal of the Acoustical Society of Korea
• /
• v.26 no.5
• /
• pp.214-219
• /
• 2007

This paper proposes a new IFFT(Inverse Fast Fourier Transform) algorithm, which is proper for IMDCT(Inverse Modified Discrete Cosine Transform) of MPEG-2 AAC(Advanced Audio Coding) decoder. The $2^n$(N-point) type IMDCT is the most powerful among many IMDCT algorithms, however it includes IFFT that requires many calculation cycles. The IFFT used in $2^n$(N-point) type IMDCT employ the bit-reverse data arrangement of inputs and N/4-point complex IFFT to reduce the calculation cycles. We devised a new data arrangement method of IFFT input and $N/4^{n+1}$-type IFFT and thus we can reduce multiplication cycles, addition cycles, and ROM size.

• East Asian mathematical journal
• /
• v.24 no.2
• /
• pp.139-144
• /
• 2008

Given an injective envelope E of a left R-module M, there is an associative Galois group Gal($\phi$). Let R be a left noetherian ring and E be an injective envelope of M, then there is an injective envelope E[$x^{-1}$] of an inverse polynomial module M[$x^{-1}$] as a left R[x]-module and we can define an associative Galois group Gal(${\phi}[x^{-1}]$). In this paper we extend the Galois group of inverse polynomial module and can get Gal(${\phi}[x^{-s}]$), where S is a submonoid of $\mathds{N}$ (the set of all natural numbers).

• Journal of Korea Multimedia Society
• /
• v.20 no.2
• /
• pp.289-297
• /
• 2017

When implementing a hardware elliptic curve cryptosystem (ECC) module, the efficient design of Modular Inverse (MI) algorithm is especially important since it requires much more computation than other finite field operations in ECC. Among the MI algorithms, binary Right-Shift modular inverse (RS) algorithm has good performance when implemented in hardware, but Montgomery Modular Inverse (MMI) algorithm is not considered in [1, 2]. Since MMI has a similar structure to that of RS, we show that the area-improvement idea that is applied to RS is applicable to MMI, and that we can improve the speed of MMI. We designed area- and speed-improved MMI variants as hardware modules and analyzed their performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.4
• /
• pp.322-331
• /
• 1988

In this thesis, an active RC filter using high order inverse chebyshev function is designed and the design method for cascading blocks with low sensitivity and maximum dynamic range is discussed. To have maximum dynamic range, we have proposed the simple algorithm with a pole-zero pairing, the cascading sequence by flatness matrix and optimum gain distribution for a given transfer function. And 2nd order Block is designed with negative feedback to improve the sensitivity problem which had a defect at active RC circuits. Using the suggested method, we have designed the active RC low pass filter of the normalized 7th order inverse chebyshev function, as a results, we have shown that this accord with the given specification.

• Journal of the Korean Statistical Society
• /
• v.23 no.2
• /
• pp.303-323
• /
• 1994

In this paper, distribution of Votaw's $\lambda_1$(mvc) criterion has been obtained using inverse Mellin transform, residue theorem and properties of special functions.