• 대한수학회보
• /
• 제40권3호
• /
• pp.425-435
• /
• 2003

In this paper, a new kind of matrices, i.e., $level-{\kappa}$ II-circulant matrices is considered. Algorithms for computing minimal polynomial of this kind of matrices are presented by means of the algorithm for the Grobner basis of the ideal in the polynomial ring. Two algorithms for finding the inverses of such matrices are also presented based on the Buchberger's algorithm.

• 대한수학회보
• /
• 제47권1호
• /
• pp.211-219
• /
• 2010

Let P be a Jacobian polynomial such as deg P = $deg_y$ P. Suppose the Jacobian polynomial P satisfies the intersection condition satisfying $dim_C$ C[x, y]/$P_y$> = deg P - 1, we can prove that the Keller map which has P as one of coordinate polynomial always has its inverse.

• 융합신호처리학회논문지
• /
• 제12권3호
• /
• pp.163-168
• /
• 2011

본 논문은 감마보정을 위한 비선형 곡선 알고리즘의 개선에 관한 연구이다. 기존의 비선형 감마 곡선 생성 방법은 Gauss-Jordan 역행렬을 적용한 최소 자승 다항식(Least Square Polynomial)을 사용하였다. 이 방법은 다항식 계수 값 계산 과정 중 고차행렬의 역행렬 연산에서 $10^{-11}$ 이하의 매우 작은 값은 절단함으로써 곡선접합의 정밀도가 감소된다. 또한 입력으로 사용되는 샘플 포인트가 10-bit 기준으로 0~1023의 밝기 값에 대하여 고루 분포되어있는 경우에만 정확한 동작이 가능하다. 본 논문은 이러한 기존 알고리즘의 단점을 보완하기 위하여, 고차 다항식의 계수 값을 반데몬드 행렬(Vandemond Matrix)에 SVD분해(Singular Value Decomposition)와 QR분해법(QR Decomposition)을 적용하여 행렬의 고유치와 직교성분만으로 연산하였다 또한, 입력 데이터의 구간을 분할하여 각 구간의 다항식을 생성하고, 새롭게 생성된 다항식을 이용하여 곡선 접합을 수행하도록 하였다. 입력 데이터와 곡선 접합결과의 평균제곱오차(Mean Square Error: MSE)와 표준편차(Standard Deviation: STD)를 통한 오차율 비교 결과 최하위 비트(Least Significant Bit: LSB) 에러 범위에서 MSE가 약 $10^{-9}$ 이고 STD는 약 $10^{-5}$로 정밀도가 향상되었다.

• 한국통신학회논문지
• /
• 제31권1C호
• /
• pp.8-13
• /
• 2006

A new RS(Reed Solomon) Decoder design method, using Galois Subfield GF($2^4$) Multiplier, is described. The Decoder is designed using Normalized error position stored ROM. Here New Inverse Calculator in GF($2^8$) is designed, which is simpler and faster than the classical GF($2^8$) direct inverse calculator, using the Galois Subfield GF($2^4$) Arithmatic operator.

• Journal of applied mathematics & informatics
• /
• 제23권1_2호
• /
• pp.193-203
• /
• 2007

In this paper we consider the inverse minimum flow (ImF) problem, where lower and upper bounds for the flow must be changed as little as possible so that a given feasible flow becomes a minimum flow. A linear time and space method to decide if the problem has solution is presented. Strongly and weakly polynomial algorithms for solving the ImF problem are proposed. Some particular cases are studied and a numerical example is given.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• pp.741-744
• /
• 1999

In this paper, We represent a low complexity of parallel canonical basis multiplier for GF( q$^{n}$ ), ( q＞ 2). The Mastrovito multiplier is investigated and applied to multiplication in GF(q$^{n}$ ), GF(q$^{n}$ ) is different with GF(2$^{n}$ ), when MVL is applied to finite field. If q is larger than 2, inverse should be considered. Optimized irreducible polynomial can reduce number of operation. In this paper we describe a method for choosing optimized irreducible polynomial and modularizing recursive polynomial operation. A optimized irreducible polynomial is provided which perform modulo reduction with low complexity. As a result, multiplier for fields GF(q$^{n}$ ) with low gate counts. and low delays are constructed. The architectures are highly modular and thus well suited for VLSI implementation.

• East Asian mathematical journal
• /
• 제16권1호
• /
• pp.111-123
• /
• 2000

Northcott and McKerrow proved that if R is a left noetherian ring and E is an injective left R-module, then $E[x^{-1}]$ is an injective left R[xl-module. Park generalize Northcott and McKerrow's result so that if R is a left noetherian ring and E is an injective left R-module, then $E[x^{-S}]$ is an injective left $R[x^s]$-module, where S is a submonoid of N(N is the set of all natural numbers). In this paper we show $$Hom_{R[x^S]}(M[x^{-S}],\;N[x^{-S}]){\cong}Hom_R(M,\;N)[[x^S]]$$ and using the above result and this isomorphism, finally we show that $$Ext^i_{R[x^S]}(M[x^{-S}],\;N[x^{-S}]){\cong}Ext^i_R(M,\;N)[[x^S]]$$.

• 전기학회논문지
• /
• 제67권2호
• /
• pp.277-284
• /
• 2018

In this paper, a new numerical method of finding the roots of a nonlinear system is proposed, which extends the conventional fixed point iterative method by relaxing the constraints on it. The proposed method determines the real valued roots and expands the convergence region by relaxing the constraints on the conventional fixed point iterative method, which transforms the diverging root searching iterations into the converging iterations by employing the metric induced by the geometrical characteristics of a polynomial. A metric is set to measure the distance between a point of a real-valued function and its corresponding image point of its inverse function. The proposed scheme provides the convenience in finding not only the real roots of polynomials but also the roots of the nonlinear systems in the various application areas of science and engineering.

• Kyungpook Mathematical Journal
• /
• 제50권2호
• /
• pp.177-193
• /
• 2010

Working with the various special functions of mathematical physics and applied mathematics we often encounter inverse relations of the type $F_n(x)=\sum\limits_{k=0}^{n}A^n_kG_k(x)$ and $ G_n(x)=\sum\limits_{k=0}^{n}B_k^nF_k(x)$, where 0, 1, 2,$\cdots$. Here $F_n(x)$, $G_n(x)$ denote special polynomial functions, and $A_k^n$, $B_k^n$ denote coefficients found by use of the orthogonal properties of $F_n(x)$ and $G_n(x)$, or by skillful series manipulations. Typically $G_n(x)=x^n$ and $F_n(x)=P_n(x)$, the n-th Legendre polynomial. We give a collection of inverse series pairs of the type $f(n)=\sum\limits_{k=0}^{n}A_k^ng(k)$ if and only if $g(n)=\sum\limits_{k=0}^{n}B_k^nf(k)$, each pair being based on some reasonably well-known special function. We also state and prove an interesting generalization of a theorem of Rainville in this form.

• 한국전자파학회논문지
• /
• 제27권1호
• /
• pp.69-75
• /
• 2016

본 논문에서는 표적의 관측각도 변화율이 일정하지 않은 표적의 회전운동 성분의 결과로 인한, 역합성 개구면 레이다(Inverse Synthetic Aperture Radar: ISAR) 영상의 초점 저하 현상을 해결하는 회전운동보상(Rotational Motion Compensation: RMC) 기법을 제안한다. 먼저, 하나의 산란원이 존재하는 레인지 빈(range bin)을 선택한다. 다음으로, 퓨리에 변환(Fourier Transform: FT)과 다항식-위상 변환(Polynomial-Phase Transform: PPT)를 활용하여, 선택된 레인지 빈에 대한 위상함수를 추정한다. 마지막으로, 관측 각도의 변화율을 일정하게 하는 새로운 시간 변수를 정의한 후, 보간법(interpolation)을 통해 새롭게 정의된 시간변수에 대한 레이다 신호를 획득한다. 이에 대한 결과로, 관측 각도의 변화율을 일정하지 않게 하는 표적의 회전운동 성분을 제거함으로써, 초점이 맞는 ISAR 영상을 획득할 수 있다. 전함(battleship) 모델을 사용한 시뮬레이션을 통해 본 논문에서 제안된 RMC 기법의 효용성을 검증하였다.