• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.9
• /
• pp.33-38
• /
• 2009

The group CSD (GCSD) multiplier was recently proposed based on the variation of canonic signed digit (CSD) encoding and partial product sharing. This multiplier provides an efficient design when the multiplications are performed only with a few predetermined coefficients (e.g., FFT). In many DSP applications such as FFT, the (2W-1)-bit product obtained from W-bit multiplicand and W-bit multiplier is quantized to W-bits by eliminating the (W-1) least-significant bits. This paper presents an error compensation method for a fixed-width GCSD multiplier that receives a W-bit input and produces a W-bit product. To efficiently compensate for the quantization error, the encoded signals from the GCSD multiplier are used for the generation of error compensation bias. By Synopsys simulations, it is shown that the proposed method leads to up to 84% reduction in power consumption and up to 79% reduction in area compared with the fixed-width modified Booth multiplier.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.5
• /
• pp.747-755
• /
• 1990

In this paper, we presented a method of constructing a multiplier and an inverse element generator over finite field GF(3**m). We proposed the multiplication method using a descending order arithmetics of mod F(X) to perform the multiplication and mod F(X) arithmetics at the same time. The proposed multiplier is composed of following parts. 1) multiplication part, 2) data assortment generation part and 5) multiplication processing part. Also the inverse element generator is constructed with following parts. 1) multiplier, 2) group of output registers Rs, 3) multiplication and cube selection gate Gl, 4) Ri term sequential selection part. 5) cube processing part and 6) descending order mod F(X) generation part. Especially, the proposed multiplier and inverse element generator give regularity, expansibility and modularity of circuit design.

• Journal of the Korean GEO-environmental Society
• /
• v.10 no.5
• /
• pp.69-73
• /
• 2009

In this study, three dimensional numerical analyses were performed with variation of pile spacing (S=3D, 4D, 5D) to compare the behaviour of single pile and pile group with cap in granite soil. In order to compare and analyze the lateral resistance of single pile and pile group by changing pile spacing, the pile group with array of $1{\times}3$ was employed. To reduce the computation time the symmetric boundary condition was used. And Druker-Prager model and elasticity model were used for granite soil and for concrete pile and cap, respectively. Using the analyses results of pile group in granite soil under lateral loading, p-y curve for pile group and single pile with changing pile spacing was drawn. With p-y curve p-multiplier was evaluated. As a result of analysis, the value of p-multiplier was increased with increasing pile spacing under 1.0 due to pile shadow effects.

• Communications of the Korean Mathematical Society
• /
• v.11 no.3
• /
• pp.547-555
• /
• 1996

In this paper, we shall study the generalized covering group which plays a role for Schur multiplier. We discuss the lifting property over covering group and product of covering groups.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2576-2578
• /
• 2001

Elliptic curve cryptosystems based on discrete logarithm problem in the group of points of an elliptic curve defined over a finite field. The discrete logarithm in an elliptic curve group appears to be more difficult than discrete logarithm problem in other groups while using the relatively small key size. An implementation of elliptic curve cryptosystems needs finite field arithmetic computation. Hence finite field arithmetic modules must require less hardware resources to archive high performance computation. In this paper, a new architecture of finite field multiplier using conversion scheme of normal basis representation into polynomial basis representation is discussed. Proposed architecture provides less resources and lower complexity than conventional bit serial multiplier using normal basis representation. This architecture has synthesized using synopsys FPGA express successfully.

• International Journal of Computer Science & Network Security
• /
• v.22 no.9
• /
• pp.414-426
• /
• 2022

Elliptic Curve Cryptography (ECC) is one of the finest cryptographic technique of recent time due to its lower key length and satisfactory performance with different hardware structures. In this paper, a High Throughput Multiplier architecture is introduced for Elliptic Cryptographic applications based on concurrent computations. With the aid of the concurrent computing approach, the High Throughput Concurrent Computation (HTCC) technology that was just presented improves the processing speed as well as the overall efficiency of the point-multiplier architecture. Here, first and second distinct group operation of point multiplier are combined together and synthesised concurrently. The synthesis of proposed HTCC technique is performed in Xilinx Virtex - 5 and Xilinx Virtex - 7 of Field-programmable gate array (FPGA) family. In terms of slices, flip flops, time delay, maximum frequency, and efficiency, the advantages of the proposed HTCC point multiplier architecture are outlined, and a comparison of these advantages with those of existing state-of-the-art point multiplier approaches is provided over GF(2¹⁶³), GF(2²³³) and GF(2²⁸³). The efficiency using proposed HTCC technique is enhanced by 30.22% and 75.31% for Xilinx Virtex-5 and by 25.13% and 47.75% for Xilinx Virtex-7 in comparison according to the LC design as well as the LL design, in their respective fashions. The experimental results for Virtex - 5 and Virtex - 7 over GF(2²³³) and GF(2²⁸³)are also very satisfactory.

• Journal of the Korean Geotechnical Society
• /
• v.34 no.5
• /
• pp.53-63
• /
• 2018

Dynamic soil-pile interaction is the main concern in the design of group piles under earthquake loadings. The lateral resistance of the pile group under dynamic loading becomes different from that of a single pile due to the group pile effect. However, this aspect has not yet been properly studied for the pile group under seismic loading condition. Thus, in this study the group pile effect was evaluated by performing a series of dynamic centrifuge tests on $3{\times}3$ group pile in dry loose sand. The multiplier coefficients for ultimate lateral resistance and subgrade reaction modulus were suggested to obtain the p-y curve of the group pile. The suggested coefficients were verified by performing the nonlinear dynamic analyses, which adopted Beam on Nonlinear Winkler Foundation model. The predicted behavior of the pile group showed the reasonable agreement compared with the results of the centrifuge tests under sinusoidal wave and artificial wave.

• Journal of the Korean Geotechnical Society
• /
• v.27 no.7
• /
• pp.47-57
• /
• 2011

The p-y curve has been used to design pile foundations subjected to lateral loading. Although the p-y curve has a large influence on the pile lateral behavior, p-y curves have not been clearly suggested. In this study, the p-y curve of clay was evaluated for drilled shafts in marine deposits by using 3-dimensional numerical analyses. First, the optimization study was performed to properly determine boundary extent, mesh size, and interface stiffness. The numerical modeling in the study was verified by comparing the calculated and the pile loading test results. Then, the p-y curves of single and group piles were evaluated from the parametric study. The selected parameters were pile diameter, pile Young's modulus and pile head fixed condition for a single pile, and pile spacing for group piles. Finally, the p-multiplier was evaluated by comparing the p-y curves of a single pile and group piles. As a result, the p-multiplier at pile spacing of 3D was 0.83, 0.67 and 0.78 for the front, middle, and back row piles, respectively, and showed values similar to those of O'Neill and Reese (1999). For the pile group with pile spacing larger than 60, the group effect can be ignorable.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2610-2630
• /
• 2021

The aim of this paper is to propose the alternative algorithm to finish the process in public key cryptography. In general, the proposed method can be selected to finish both of modular exponentiation and point multiplication. Although this method is not the best method in all cases, it may be the most efficient method when the condition responds well to this approach. Assuming that the binary system of the exponent or the multiplier is considered and it is divided into groups, the binary system is in excellent condition when the number of groups is small. Each group is generated from a number of 0 that is adjacent to each other. The main idea behind the proposed method is to convert the exponent or the multiplier as the subtraction between two integers. For these integers, it is impossible that the bit which is equal to 1 will be assigned in the same position. The experiment is split into two sections. The first section is an experiment to examine the modular exponentiation. The results demonstrate that the cost of completing the modular multiplication is decreased if the number of groups is very small. In tables 7 - 9, four modular multiplications are required when there is one group, although number of bits which are equal to 0 in each table is different. The second component is the experiment to examine the point multiplication process in Elliptic Curves Cryptography. The findings demonstrate that if the number of groups is small, the costs to compute point additions are low. In tables 10 - 12, assigning one group is appeared, number of point addition is one when the multiplier of a point is an even number. However, three-point additions are required when the multiplier is an odd number. As a result, the proposed method is an alternative way that should be used when the number of groups is minimal in order to save the costs.

• Journal of the Korean GEO-environmental Society
• /
• v.13 no.3
• /
• pp.85-90
• /
• 2012

This paper deals with the results for a numerical analysis of single piles and pile groups in multi-layers soil(granite soil-clay-granite soil) subjected to monotonous lateral loading using the ABAQUS finite element software. The investigated variables in this study include free head and embedded capped single pile, pile diameter (0.5m), pile length (10m), and pile groups. Numerical analyses were conducted by variation of spacing piles(s=3D, 4D, 5D) to compare the behaviour of single pile without cap and group pile. The $1{\times}3$ pile group(leading pile, middle pile, trail pile) was selected to investigate the individual pile and group lateral resistance, the distribution of the resistance among the piles. The analysis model of clay and the material of granite soil was modeled by using Druker-Prager constitutive relationship and existing treatise respectively. The pile was considered as a elastic circular concrete pile. As a result, the more pile space was extended, the value of P-multiplier is appeared to be less effective to leading pile. The lateral resistance of single-layer showed approximately 4-20% larger than the multi-layers.