• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.7 s.349
• /
• pp.115-121
• /
• 2006

The efficiency of the multiplier largely depends on the representation of finite filed elements such as normal basis, polynomial basis, dual basis, and redundant representation, and so on. In particular, the redundant representation is attractive since it can simply implement squaring and modular reduction. In this paper, we propose an efficient bit-parallel multiplier for GF(2m) defined by an irreducible all-one polynomial using a redundant representation. We modify the well-known multiplication method which was proposed by Karatsuba to improve the efficiency of the proposed bit-parallel multiplier. As a result, the proposed multiplier has a lower space complexity compared to the previously known multipliers using all-one polynomials. On the other hand, its time complexity is similar to the previously proposed ones.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.14 no.6
• /
• pp.313-319
• /
• 2019

Finite field operations have played an important role in error correcting codes and cryptosystems. Recently, the necessity of efficient computation processing is increasing for security in cyber physics systems. Therefore, efficient implementation of finite field arithmetics is more urgently needed. These operations include addition, multiplication, division and inversion. Addition is very simple and can be implemented with XOR operation. The others are somewhat more complicated than addition. Among these operations, multiplication is the most important, since time-consuming operations, such as exponentiation, division, and computing multiplicative inverse, can be performed through iterative multiplications. In this paper, we propose a multiplexer based parallel computation algorithm that performs Montgomery multiplication over finite field using redundant basis. Then we propose an efficient multiplexer based semi-systolic multiplier over finite field using redundant basis. The proposed multiplier has less area-time (AT) complexity than related multipliers. In detail, the AT complexity of the proposed multiplier is improved by approximately 19% and 65% compared to the multipliers of Kim-Han and Choi-Lee, respectively. Therefore, our multiplier is suitable for VLSI implementation and can be easily applied as the basic building block for various applications.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.1
• /
• pp.13-19
• /
• 2020

In this paper, we propose a multiplexer based scheme that performs modular AB² multiplication using redundant basis over finite field. Then we propose an efficient multiplexer based semi-systolic AB² multiplier using proposed scheme. We derive a method that allows the multiplexers to perform the operations in the cell of the modular AB² multiplier. The cell of the multiplier is implemented using multiplexers to reduce cell latency. As compared to the existing related structures, the proposed AB² multiplier saves about 80.9%, 61.8%, 61.8%, and 9.5% AT complexity of the multipliers of Liu et al., Lee et al., Ting et al., and Kim-Kim, respectively. Therefore, the proposed multiplier is well suited for VLSI implementation and can be easily applied to various applications.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.237-240
• /
• 1996

Internal Force based control of dual redundant manipulator is proposed. One is resolved acceleration type control in the decoupled joint space which includes null motion space and the other is in the impedance control fashion in which the desired impedances are decoupled in three subspace, internal motion controlled space, orthogonal to that space, and the null motion controlled space. The internal force is formulated with its basis set meaningful. The object dynamics is also briefly evolved beforehand.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.1150-1155
• /
• 1990

This paper proposes an optimal redundancy resolution of a kinematically redundant manipulator while considering homotopy classes. The necessary condition derived by minimizing an integral cost criterion results in a second-order differential equation. Also boundary conditions as well as the necessary condition are required to uniquely specify the solution. In the case of a cyclic task, we reformulate the periodic boundary value problem as a two point boundary value problem to find an initial joint velocity as many dimensions as the degrees of redundancy for given initial configuration. Initial conditions which provide desirable solutions are obtained by using the basis of the null projection operator. Finally, we show that the method can be used as a topological lifting method of nonhomotopic extremal solutions and also show the optimal solution with considering the manipulator dynamics.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.19 no.2
• /
• pp.171-188
• /
• 2015

In this paper, the efficient column-wise/row-wise lattice reduction (LR) updating and downdating methods are developed and their complexities are analyzed. The well-known LLL algorithm, developed by Lenstra, Lenstra, and Lov${\acute{a}}$sz, is considered as a LR method. When the column or the row is appended/deleted in the given lattice basis matrix H, the proposed updating and downdating methods modify the preconditioning matrix that is primarily computed for the LR with H and provide the initial parameters to reduce the updated lattice basis matrix efficiently. Since the modified preconditioning matrix keeps the information of the original reduced lattice bases, the redundant computational complexities can be eliminated when reducing the lattice by using the proposed methods. In addition, the rounding error analysis of the proposed methods is studied. The numerical results demonstrate that the proposed methods drastically reduce the computational load without any performance loss in terms of the condition number of the reduced lattice basis matrix.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.2
• /
• pp.3-10
• /
• 2008

The choice of basis for representation of element in $GF(2^m)$ affects the efficiency of a multiplier. Among them, a multiplier using redundant representation efficiently supports trade-off between the area complexity and the time complexity since it can quickly carry out modular reduction. So time of a previous multiplier using redundant representation is faster than time of multiplier using others basis. But, the weakness of one has a upper space complexity compared to multiplier using others basis. In this paper, we propose a new efficient multiplier with consideration that polynomial exponentiation operations are frequently used in cryptographic hardwares. The proposed multiplier is suitable fer left-to-right exponentiation environment and provides efficiency between time and area complexity. And so, it has both time delay of $T_A+({\lceil}{\log}_2m{\rceil})T_x$ and area complexity of (2m-1)(m+s). As a result, the proposed multiplier reduces $2(ms+s^2)$ compared to the previous multiplier using equally-spaced polynomials in area complexity. In addition, it reduces $T_A+({\lceil}{\log}_2m+s{\rceil})T_x$ to $T_A+({\lceil}{\log}_2m{\rceil})T_x$ in the time complexity.($T_A$:Time delay of one AND gate, $T_x$:Time delay of one XOR gate, m:Degree of equally spaced irreducible polynomial, s:spacing factor)

• Korean Institute of Interior Design Journal
• /
• v.15 no.6 s.59
• /
• pp.77-88
• /
• 2006

According to critics and architects, non-linear structure is not only an organic form of space, but also a form of space detached from modem style. Accordingly, non-linear structure can be accepted as an alternative to what has remained unsolved by deconstructionist. However, they are criticized for not clarifying the interdependent relationship between non-linearity of space and cognitive structure of human being. They ended up remaining the hypothesis just an intuitive and abstract one. This research began on the basis that their hypothesis is hard to be objectified, and it needs further inquiry. The purpose of this thesis is to explore how the redundant factors constitute non-linear structures of digital media centered space design. Geometric compositions of space structure were analyzed to define what types of redundant factors are contrived in the process of visual information. This study about the visual form, researching the Information Theory, and then offer a quantitative analysis that makes those more objective. Space structure and geometric composition were analyzed to define what types of redundancy are contrived in the process of visual information. In particular, I put higher theoretical emphasis on what characteristics are ensued in the process of structuring spaces than any other subjects. Followings are the conclusion of analysis. First, as a result of examining, we can assume that NOX' space structure is not a chaotic form, but has an operating the form of its own. Second, in case of curvilinear, the structure was found redundancy on mid deviation ratio and discontinuous circular fabric. Although most of their structures appeared complex with a higher coherent constant, they were found to be stable factors because of the low deviation ratio between systems. The amount of surplus information was stable structure as well.

• Journal of the Korean Society for information Management
• /
• v.9 no.2
• /
• pp.20-42
• /
• 1992

MARC format for bibliographic data is to make the functions of shared cataloging easier and to provide exhaustivity for storing national bibliographic information, and powerful and flexible structure to communicate with international cataloging information. KORMARC format was developed in 1984 to form the basis for storing bibliographic information in a consistent and non-redundant form, and for sharing that information and manupulating it by computer. MARC format needs evolution to make the format more consistent and more useful, and to support new forms of material and new forms of control. The purpose of this study is to evaluate and discuss the original KORMARC format for monographs developed by the National Central Library in 1984 in order to provide the basis for a new revised format and format integration.

• Journal of the Korean Home Economics Association
• /
• v.40 no.2
• /
• pp.1-13
• /
• 2002

The purpose of this study is to analyze typologic methods in the Family Studies. For this goal, we reviewed literatures related to social research methodology, and analyzed articles in the Family Studies part on the basis of themes and typologic methods. The major resets can be summarized as follow: Typology methods used to clarify complex and subtle family phenomena and distinguish redundant interaction in everyday life. Especially, they can show family system type, communication mode style, leisure activity type, life altitude type, and personality traits type. Typology was made by the methods as follow: the insight, crossing the two single question, intersecting scale's mean or middle point, cluster analysis, and factor analysis. Typology is useful method in the Family Studies, but the accuracy standard needs in the future studies.