• 제목/요약/키워드: All one polynomial

검색결과 98건 처리시간 0.024초

효율적인 공간 복잡도의 LFSR 곱셈기 설계 (Design of an LFSR Multiplier with Low Area Complexity)

  • 정재형;이성운;김현성
    • 한국정보보호학회:학술대회논문집
    • /
    • 한국정보보호학회 2003년도 하계학술대회논문집
    • /
    • pp.33-36
    • /
    • 2003
  • 본 논문에서는 GF(2$^{m}$ ) 상에서 효율적인 공간 복잡도를 가진 LFSR(Linear Feedback Shift Register) 구조 기반의 모듈러 곱셈기를 제안한다. 제안된 구조는 기약다항식으로 모든 계수가 1인 속성의 AOP(All One Polynomial)를 이용한다. 제안된 구조는 구조복잡도 면에서 기존의 구조들보다 훨씬 효율적이다. 제안된 곱셈기는 공개키 암호의 기본 구조로 사용될 수 있다.

  • PDF

셀룰라 오토마타를 이용한 $GF({2^m})$상의 곱셈기$^1$ (Modular Multiplier based on Cellular Automata over $GF({2^m})$)

  • 이형목;김현성;전준철;하경주;구교민;김남연;유기영
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2001년도 가을 학술발표논문집 Vol.28 No.2 (1)
    • /
    • pp.709-711
    • /
    • 2001
  • 본 논문에서는 유한 확대 체 GF($^{m}$ )상에서 셀룰라 오토마타를 이용한 곱셈기 구조를 제안한다. 제안된 구조는 기약 다항식으로 AOP(All One Polynomial)의 특성을 사용하고 LSB방식으로 곱셈 연산을 수행한다. 제안된 곱셈기는 지연시간으로 m+1을 갖는 임계경로로는 1- $D_{AND}$+1- $D_{XOR}$를 갖는다. 특히 구조가 정규성, 모듈성, 병렬성을 가지기 때문에 VLSI구현에 효율적이다.적이다.

  • PDF

A GROWING ALGEBRA CONTAINING THE POLYNOMIAL RING

  • Choi, Seul-Hee
    • 호남수학학술지
    • /
    • 제32권3호
    • /
    • pp.467-480
    • /
    • 2010
  • There are various papers on finding all the derivations of a non-associative algebra and an anti-symmetrized algebra (see [2], [3], [4], [5], [6], [10], [13], [15], [16]). We and all the derivations of the growing algebra WN($e^{{\pm}x_1x_2x_3}$, 0, 3)[1] with the set of all right annihilators $T_3$ = $\{id,\;\partial_1,\;\partial_2,\;\partial_3\}$ in the paper. The dimension of $Der_{non}$(WN($e^{{\pm}x_1x_2x_3}$, 0, 3)$_{[1]}$) of the algebra WN($e^{{\pm}x_1x_2x_3}$, 0, 3)$_{[1]}$ is one and every derivation of the algebra WN($e^{{\pm}x_1x_2x_3}$, 0, 3)$_{[1]}$ is outer. We show that there is a class P of purely outer algebras in this work.

b-GENERALIZED DERIVATIONS ON MULTILINEAR POLYNOMIALS IN PRIME RINGS

  • Dhara, Basudeb
    • 대한수학회보
    • /
    • 제55권2호
    • /
    • pp.573-586
    • /
    • 2018
  • Let R be a noncommutative prime ring of characteristic different from 2, Q be its maximal right ring of quotients and C be its extended centroid. Suppose that $f(x_1,{\ldots},x_n)$ be a noncentral multilinear polynomial over $C,b{\in}Q,F$ a b-generalized derivation of R and d is a nonzero derivation of R such that d([F(f(r)), f(r)]) = 0 for all $r=(r_1,{\ldots},r_n){\in}R^n$. Then one of the following holds: (1) there exists ${\lambda}{\in}C$ such that $F(x)={\lambda}x$ for all $x{\in}R$; (2) there exist ${\lambda}{\in}C$ and $p{\in}Q$ such that $F(x)={\lambda}x+px+xp$ for all $x{\in}R$ with $f(x_1,{\ldots},x_n)^2$ is central valued in R.

Maximum Degree Vertex Central Located Algorithm for Bandwidth Minimization Problem

  • Lee, Sang-Un
    • 한국컴퓨터정보학회논문지
    • /
    • 제20권7호
    • /
    • pp.41-47
    • /
    • 2015
  • The bandwidth minimization problem (BMP) has been classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. This paper suggests polynomial time heuristic algorithm is to find the solution of bandwidth minimization problem. To find the minimum bandwidth ${\phi}^*=_{min}{\phi}(G)$, ${\phi}(G)=_{max}\{{\mid}f(v_i)-f(v_j):v_i,v_j{\in}E\}$ for given graph G=(V,E), m=|V|,n=|E|, the proposed algorithm sets the maximum degree vertex $v_i$ in graph G into global central point (GCP), and labels the median value ${\lceil}m+1/2{\rceil}$ between [1,m] range. The graph G is partitioned into subgroup, the maximum degree vertex in each subgroup is set to local central point (LCP), and we adjust the label of LCP per each subgroup as possible as minimum distance from GCP. The proposed algorithm requires O(mn) time complexity for label to all of vertices. For various twelve graph, the proposed algorithm can be obtains the same result as known optimal solution. For one graph, the proposed algorithm can be improve on known solution.

An Arithmetic System over Finite Fields

  • Park, Chun-Myoung
    • Journal of information and communication convergence engineering
    • /
    • 제9권4호
    • /
    • pp.435-440
    • /
    • 2011
  • This paper propose the method of constructing the highly efficiency adder and multiplier systems over finite fields. The addition arithmetic operation over finite field is simple comparatively because that addition arithmetic operation is analyzed by each digit modP summation independently. But in case of multiplication arithmetic operation, we generate maximum k=2m-2 degree of ${\alpha}^k$ terms, therefore we decrease k into m-1 degree using irreducible primitive polynomial. We propose two method of control signal generation for the purpose of performing above decrease process. One method is the combinational logic expression and the other method is universal signal generation. The proposed method of constructing the highly adder/multiplier systems is as following. First of all, we obtain algorithms for addition and multiplication arithmetic operation based on the mathematical properties over finite fields, next we construct basic cell of A-cell and M-cell using T-gate and modP cyclic gate. Finally we construct adder module and multiplier module over finite fields after synthesizing ${\alpha}^k$ generation module and control signal CSt generation module with A-cell and M-cell. Next, we constructing the arithmetic operation unit over finite fields. Then, we propose the future research and prospects.

위성 단말 송신부의 주파수 응답 평탄도를 향상시키기 위한 모뎀 출력 조절 방법 (Control Technique of Modem Output Level to improve Frequency Response Equalization of Satellite TX Terminals)

  • 조태종
    • 한국인터넷방송통신학회논문지
    • /
    • 제19권5호
    • /
    • pp.129-133
    • /
    • 2019
  • 넓은 BW를 사용하는 위성 통신 시스템에서 주파수 자원을 최대한 효율적으로 사용하는 것은 매우 중요하다. 주파수 자원의 낭비를 초래하는 원인들 중 하나는 사용 대역의 평탄도가 좋지 못하는 경우이다. 사용 대역의 평탄도가 좋지 못한 위성 단말 송신부는 ACI와 가드밴드로 인해 주파수 자원 효율이 낮아지게 된다. 이를 극복하기 위해 본 논문에서는 위성 단말 송신부의 평탄도를 보정하는 방법을 제안한다. 우선, 선별하여 측정한 데이터로부터 최소 자승법을 만족하는 다항식을 생성하고 측정하지 않은 주파수 응답 특성을 보간 하였다. 그리고 최소 자승법을 만족하는 다항식을 이용하여 모뎀의 출력 레벨을 조절하였다. 시뮬레이션 결과 보정된 데이터는 보정 전 데이터 대비 pk-pk와 표준편차가 낮아졌고 이를 통해 평탄도가 보정되었음을 확인하였다.

Improvement of WRF forecast meteorological data by Model Output Statistics using linear, polynomial and scaling regression methods

  • Jabbari, Aida;Bae, Deg-Hyo
    • 한국수자원학회:학술대회논문집
    • /
    • 한국수자원학회 2019년도 학술발표회
    • /
    • pp.147-147
    • /
    • 2019
  • The Numerical Weather Prediction (NWP) models determine the future state of the weather by forcing current weather conditions into the atmospheric models. The NWP models approximate mathematically the physical dynamics by nonlinear differential equations; however these approximations include uncertainties. The errors of the NWP estimations can be related to the initial and boundary conditions and model parameterization. Development in the meteorological forecast models did not solve the issues related to the inevitable biases. In spite of the efforts to incorporate all sources of uncertainty into the forecast, and regardless of the methodologies applied to generate the forecast ensembles, they are still subject to errors and systematic biases. The statistical post-processing increases the accuracy of the forecast data by decreasing the errors. Error prediction of the NWP models which is updating the NWP model outputs or model output statistics is one of the ways to improve the model forecast. The regression methods (including linear, polynomial and scaling regression) are applied to the present study to improve the real time forecast skill. Such post-processing consists of two main steps. Firstly, regression is built between forecast and measurement, available during a certain training period, and secondly, the regression is applied to new forecasts. In this study, the WRF real-time forecast data, in comparison with the observed data, had systematic biases; the errors related to the NWP model forecasts were reflected in the underestimation of the meteorological data forecast by the WRF model. The promising results will indicate that the post-processing techniques applied in this study improved the meteorological forecast data provided by WRF model. A comparison between various bias correction methods will show the strength and weakness of the each methods.

  • PDF

RINGS WITH A RIGHT DUO FACTOR RING BY AN IDEAL CONTAINED IN THE CENTER

  • Cheon, Jeoung Soo;Kwak, Tai Keun;Lee, Yang;Piao, Zhelin;Yun, Sang Jo
    • 대한수학회보
    • /
    • 제59권3호
    • /
    • pp.529-545
    • /
    • 2022
  • This article concerns a ring property that arises from combining one-sided duo factor rings and centers. A ring R is called right CIFD if R/I is right duo by some proper ideal I of R such that I is contained in the center of R. We first see that this property is seated between right duo and right π-duo, and not left-right symmetric. We prove, for a right CIFD ring R, that W(R) coincides with the set of all nilpotent elements of R; that R/P is a right duo domain for every minimal prime ideal P of R; that R/W(R) is strongly right bounded; and that every prime ideal of R is maximal if and only if R/W(R) is strongly regular, where W(R) is the Wedderburn radical of R. It is also proved that a ring R is commutative if and only if D3(R) is right CIFD, where D3(R) is the ring of 3 by 3 upper triangular matrices over R whose diagonals are equal. Furthermore, we show that the right CIFD property does not pass to polynomial rings, and that the polynomial ring over a ring R is right CIFD if and only if R/I is commutative by a proper ideal I of R contained in the center of R.

Sealing design optimization of nuclear pressure relief valves based on the polynomial chaos expansion surrogate model

  • Chaoyong Zong;Maolin Shi;Qingye Li;Tianhang Xue;Xueguan Song;Xiaofeng Li;Dianjing Chen
    • Nuclear Engineering and Technology
    • /
    • 제55권4호
    • /
    • pp.1382-1399
    • /
    • 2023
  • Pressure relief valve (PRV) is one of the important control valves used in nuclear power plants, and its sealing performance is crucial to ensure the safety and function of the entire pressure system. For the sealing performance improving purpose, an explicit function that accounts for all design parameters and can accurately describe the relationship between the multi-design parameters and the seal performance is essential, which is also the challenge of the valve seal design and/or optimization work. On this basis, a surrogate model-based design optimization is carried out in this paper. To obtain the basic data required by the surrogate model, both the Finite Element Model (FEM) and the Computational Fluid Dynamics (CFD) based numerical models were successively established, and thereby both the contact stresses of valve static sealing and dynamic impact (between valve disk and nozzle) could be predicted. With these basic data, the polynomial chaos expansion (PCE) surrogate model which can not only be used for inputs-outputs relationship construction, but also produce the sensitivity of different design parameters were developed. Based on the PCE surrogate model, a new design scheme was obtained after optimization, in which the valve sealing stress is increased by 24.42% while keeping the maximum impact stress lower than 90% of the material allowable stress. The result confirms the ability and feasibility of the method proposed in this paper, and should also be suitable for performance design optimizations of control valves with similar structures.