• IEMEK Journal of Embedded Systems and Applications
• /
• v.11 no.4
• /
• pp.227-233
• /
• 2016

Efficient finite field arithmetic is essential for fast implementation of error correcting codes and cryptographic applications. Among the arithmetic operations over finite fields, the multiplication is one of the basic arithmetic operations. Therefore an efficient design of a finite field multiplier is required. In this paper, two new bit-parallel systolic multipliers for $GF(2^m)$ fields defined by AOP(all-one polynomial) have proposed. The proposed multipliers have a little bit greater space complexity but save at least 22% area complexity and 13% area-time (AT) complexity as compared to the existing multipliers using AOP. As compared to related works, we have shown that our multipliers have lower area-time complexity, cell delay, and latency. So, we expect that our multipliers are well suited to VLSI implementation.

• Communications of the Korean Mathematical Society
• /
• v.32 no.4
• /
• pp.811-826
• /
• 2017

The reversible property of rings was initially introduced by Habeb and plays a role in noncommutative ring theory. In this note we study the reversible ring property on nilpotent elements, introducing the concept of commutativity of nilpotent elements at zero (simply, a CNZ ring) as a generalization of reversible rings. We first find the CNZ property of 2 by 2 full matrix rings over fields, which provides a basis for studying the structure of CNZ rings. We next observe various kinds of CNZ rings including ordinary ring extensions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5324-5337
• /
• 2017

In this paper, we investigate the feasibility of interference alignment(IA) in signal space in the scenario of multiple cell and multiple user cellular networks, as the feasibility issue is closely related to the solvability of a multivariate polynomial system, we give the mathematical analysis to support the constraint condition obtained from the polynomial equations with the tools of algebraic geometry, and a new distribute IA algorithm is also provided to verify the accessibility of the constraint condition for symmetric system in this paper. Simulation results illustrate that the accessibility of the constraint condition is hold if and only if the degree of freedom(DoF) of each user can be divided by both the transmit and receive antenna numbers.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.6
• /
• pp.1511-1528
• /
• 2020

A skew generalized power series ring R[[S, 𝜔]] consists of all functions from a strictly ordered monoid S to a ring R whose support contains neither infinite descending chains nor infinite antichains, with pointwise addition, and with multiplication given by convolution twisted by an action 𝜔 of the monoid S on the ring R. Special cases of the skew generalized power series ring construction are skew polynomial rings, skew Laurent polynomial rings, skew power series rings, skew Laurent series rings, skew monoid rings, skew group rings, skew Mal'cev-Neumann series rings, the "untwisted" versions of all of these, and generalized power series rings. In this paper we obtain some necessary conditions on R, S and 𝜔 such that the skew generalized power series ring R[[S, 𝜔]] is (uniquely) clean. As particular cases of our general results we obtain new theorems on skew Mal'cev-Neumann series rings, skew Laurent series rings, and generalized power series rings.

• Korean Journal of Mathematics
• /
• v.29 no.3
• /
• pp.483-492
• /
• 2021

This article concerns the property that for any element a in a ring, if a²ⁿ = aⁿ for some n ≥ 2 then a² = a. The class of rings with this property is large, but there also exist many kinds of rings without that, for example, rings of characteristic ≠2 and finite fields of characteristic ≥ 3. Rings with such a property is called reduced-over-idempotent. The study of reduced-over-idempotent rings is based on the fact that the characteristic is 2 and every nonzero non-identity element generates an infinite multiplicative semigroup without identity. It is proved that the reduced-over-idempotent property pass to polynomial rings, and we provide power series rings with a partial affirmative argument. It is also proved that every finitely generated subring of a locally finite reduced-over-idempotent ring is isomorphic to a finite direct product of copies of the prime field {0, 1}. A method to construct reduced-over-idempotent fields is also provided.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.2
• /
• pp.373-380
• /
• 2021

If $p(z)={\sum\limits_{{\nu}=0}^{n}}a_{\nu}z^{\nu}$ is a polynomial of degree n having all its zeros on |z| = k, k ≤ 1, then Govil [3] proved that $${\max\limits_{{\mid}z{\mid}=1}}\;{\mid}p^{\prime}(z){\mid}\;{\leq}\;{\frac{n}{k^n+k^{n-1}}}\;{\max\limits_{{\mid}z{\mid}=1}}\;{\mid}p(z){\mid}$$. In this paper, by involving certain coefficients of p(z), we not only improve the above inequality but also improve a result proved by Dewan and Mir [2].

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.4
• /
• pp.855-868
• /
• 2021

If p(z) is a polynomial of degree n having all its zeros in |z| ≤ k, k ≤ 1, then for 𝜌R ≥ k² and 𝜌 ≤ R, Aziz and Zargar [4] proved that $${\max_{{\mid}z{\mid}=1}}{\mid}p^{\prime}(z){\mid}{\geq}n{\frac{(R+k)^{n-1}}{({\rho}+k)^n}}\{{\max_{{\mid}z{\mid}=1}}{\mid}p(z){\mid}+{\min_{{\mid}z{\mid}=k}}{\mid}p(z){\mid}\}$$. We prove a generalized L^r extension of the above result for a more general class of polynomials $p(z)=a_nz^n+\sum\limits_{{\nu}={\mu}}^{n}a_n-_{\nu}z^{n-\nu}$, $1{\leq}{\mu}{\leq}n$. We also obtain another L^r analogue of a result for the above general class of polynomials proved by Chanam and Dewan [6].

• Aerospace Engineering and Technology
• /
• v.8 no.2
• /
• pp.75-82
• /
• 2009

In order to help general users to analyze the KOMPSAT-2 data, an application of sensor modeling to commercial software was explained in this document. The sensor modeling is a basic step to extract the quantity and quality information from KOMPSAT-2 data. First, we introduced the contents and type of ancillary data offered with KOMPSAT-2 PAN image data, and explained how to use it with commercial software. And then, we applied the polynomial-base and refine RFM sensor modeling with ground control points. In the polynomial-base sensor modeling, the accuracy which is average RMSE of check points is highest when the satellite position was calculated by type of 1st order function and the satellite attitude was calculated by type of 1st order function for (Y axis), (Z axis) or constant for (X axis), (Y axis), (Z axis) in perspective center position and satellite attitude parameters. As a result of refine RFM sensor modeling, the accuracy is less than 1 pixel when we applied affine model..

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.43 no.5 s.311
• /
• pp.36-43
• /
• 2006

In this paper we present a new high-speed parallel multiplier for Performing the bit-parallel multiplication of two polynomials in the finite fields $GF(2^m)$. Prior to construct the multiplier circuits, we consist of the MOD operation part to generate the result of bit-parallel multiplication with one coefficient of a multiplicative polynomial after performing the parallel multiplication of a multiplicand polynomial with a irreducible polynomial. The basic cells of MOD operation part have two AND gates and two XOR gates. Using these MOD operation parts, we can obtain the multiplication results performing the bit-parallel multiplication of two polynomials. Extending this process, we show the design of the generalized circuits for degree m and a simple example of constructing the multiplier circuit over finite fields $GF(2^4)$. Also, the presented multiplier is simulated by PSpice. The multiplier presented in this paper use the MOD operation parts with the basic cells repeatedly, and is easy to extend the multiplication of two polynomials in the finite fields with very large degree m, and is suitable to VLSI. Also, since this circuit has a low propagation delay time generated by the gates during operating process because of not use the memory elements in the inside of multiplier circuit, this multiplier circuit realizes a high-speed operation.

• Journal of The Korean Astronomical Society
• /
• v.43 no.5
• /
• pp.169-181
• /
• 2010

We develop a proto-model of an off-axis reflective telescope for infrared wide-field observations based on the design of Schwarzschild-Chang type telescope. With only two mirrors, this design achieves an entrance pupil diameter of 50 mm and an effective focal length of 100 mm. We can apply this design to a mid-infrared telescope with a field of view of $8^{\circ}{\times}8^{\circ}$. In spite of the substantial advantages of off-axis telescopes in the infrared compared to refractive or on-axis reflective telescopes, it is known to be difficult to align the mirrors in off-axis systems because of their asymmetric structures. Off-axis mirrors of our telescope are manufactured at the Korea Basic Science Institute (KBSI). We analyze the fabricated mirror surfaces by fitting polynomial functions to the measured data. We accomplish alignment of this two-mirror off-axis system using a ray tracing method. A simple imaging test is performed to compare a pinhole image with a simulated prediction.