• 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.

• Bulletin of the Korean Mathematical Society
• /
• v.49 no.5
• /
• pp.1067-1079
• /
• 2012

Let M be a right R-module, (S, ${\leq}$) a strictly totally ordered monoid which is also artinian and ${\omega}:S{\rightarrow}Aut(R)$ a monoid homomorphism, and let $[M^{S,{\leq}}]_{[[R^{S,{\leq}},{\omega}]]$ denote the generalized inverse polynomial module over the skew generalized power series ring [[$R^{S,{\leq}},{\omega}$]]. In this paper, we prove that $[M^{S,{\leq}}]_{[[R^{S,{\leq}},{\omega}]]$ has the same uniform dimension as its coefficient module $M_R$, and that if, in addition, R is a right perfect ring and S is a chain monoid, then $[M^{S,{\leq}}]_{[[R^{S,{\leq}},{\omega}]]$ has the same couniform dimension as its coefficient module $M_R$.

• Proceedings of the KIEE Conference
• /
• 1999.07b
• /
• pp.537-539
• /
• 1999

When dealing with a controller design in the two parameter configuration, there are some situations when neither a known pseudo inverse technique nor the inverse method can be applicable. In this case, we propose two methods of designing a controller by the gradient algorithm and the new pseudo inverse method such that the designed closed loop polynomial may be equal to or nearly equal to the desired closed loop polynomial. We compare the proposed methods with the known methods. We use the Manabe standard form as a desired closed loop characteristic polynomial.

• Journal of the Korean Mathematical Society
• /
• v.59 no.3
• /
• pp.621-634
• /
• 2022

The scaled inverse of a nonzero element a(x) ∈ ℤ[x]/f(x), where f(x) is an irreducible polynomial over ℤ, is the element b(x) ∈ ℤ[x]/f(x) such that a(x)b(x) = c (mod f(x)) for the smallest possible positive integer scale c. In this paper, we investigate the scaled inverse of (xⁱ - x^j) modulo cyclotomic polynomial of the form Φ_p^s (x) or Φ_p^sq^t (x), where p, q are primes with p < q and s, t are positive integers. Our main results are that the coefficient size of the scaled inverse of (xⁱ - x^j) is bounded by p - 1 with the scale p modulo Φ_p^s (x), and is bounded by q - 1 with the scale not greater than q modulo Φ_p^sq^t (x). Previously, the analogous result on cyclotomic polynomials of the form Φ_2ⁿ (x) gave rise to many lattice-based cryptosystems, especially, zero-knowledge proofs. Our result provides more flexible choice of cyclotomic polynomials in such cryptosystems. Along the way of proving the theorems, we also prove several properties of {x^k}_k∈ℤ in ℤ[x]/Φ_pq(x) which might be of independent interest.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.251-263
• /
• 2004

In this paper, algorithms for computing the minimal polynomial and the common minimal polynomial of resultant matrices over any field are presented by means of the approach for the Grobner basis of the ideal in the polynomial ring, respectively, and two algorithms for finding the inverses of such matrices are also presented. Finally, an algorithm for the inverse of partitioned matrix with resultant blocks over any field is given, which can be realized by CoCoA 4.0, an algebraic system over the field of rational numbers or the field of residue classes of modulo prime number. We get examples showing the effectiveness of the algorithms.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.45-57
• /
• 2005

An efficient algorithm for finding the inverse and the group inverse of the FLS $\gamma-circulant$ matrix is presented by Euclidean algorithm. Extension is made to compute the inverse of the FLS $\gamma-retrocirculant$ matrix by using the relationship between an FLS $\gamma-circulant$ matrix and an FLS $\gamma-retrocirculant$ matrix. Finally, some examples are given.

• Communications of the Korean Mathematical Society
• /
• v.15 no.2
• /
• pp.257-261
• /
• 2000

Northcott and Mckerrow proved that if R is a left noe-therian ring and E is an injective left R-module, then E[x-1] is an injective left R[x]-module. In this paper we generalize Northcott and McKerrow's result so that if R is a left noetherian ring and E is an in-jective left R-module, then E[x-S] is an injective left R[xS]-module, where S is a submonoid of N (N is the set of all natural numbers).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2C
• /
• pp.191-199
• /
• 2006

In this paper, we propose a method to implement a predistorter of the $rho$-th order inverse filter structure to prevent signal distortion and spectral re-growth due to the high PAPR (peak-to-average ratio) of the OFDM signals and the non-linearity of high-power amplifiers. We model the memory-less non-linearity of the high-power amplifier with a polynomial model and utilize the inverse of the model, the $rho$-th order inverse filter, for the predistorter. Once the non-linearity is modeled with a polynomial, since we can determine the $rho$-th order inverse filter only with the coefficients of the polynomial, large memory is not required. To update the coefficients of the non-linear high-power amplifier model, we can use LMS or RLS algorithms. The convergence speed is high since the number of coefficients is small, and the computation is simple since manipulation of complex numbers is not necessary.

• Management Science and Financial Engineering
• /
• v.19 no.1
• /
• pp.25-28
• /
• 2013

Consider the inverse bin-packing number problem. Given a set of items and a prescribed number K of bins, the inverse bin-packing number problem, IBPN for short, is concerned with determining the minimum perturbation to the item-size vector so that all the items can be packed into K bins or less. It is known that this problem is NP-hard (Chung, 2012). In this paper, we investigate some special cases of IBPN that can be solved in polynomial time. We propose an optimal algorithm for solving the IBPN instances with two distinct item sizes and the instances with large items.