• Investigative Magnetic Resonance Imaging
• /
• v.11 no.2
• /
• pp.95-102
• /
• 2007

Purpose: To acquire high-resolution spiral-scan images at higher magnetic field, high homogeneous magnetic field is needed. Field inhomogeneity mapping and in-vivo shimming are important for rapid imaging such as spiral-scan imaging. The rapid scanning sequences are very susceptible to inhomogeneity. In this paper, we proposed a higher-order shimming method to obtain homogeneous magnetic field. Materials and Methods: To reduce measurement time for field inhomogeneity mapping, simultaneous axial/ sagittal, and coronal acquisitions are done using multi-slice based Fast Spin echo sequence. Acquired field inhomogeneity map is analyzed using the spherical harmonic functions, and shim currents are obtained by the multiplication of the pseudo-inverse of the field pattern with the inhomogeneity map. Results: Since the field inhomogeneity is increasing in proportion to the magnetic field, higher order shimming to reduce the inhomogeneity becomes more important in high field imaging. The shimming technique in which axial, sagittal, and coronal section inhomogeneity maps are obtained in one scan is developed, and the shimming method based on the analysis of spherical harmonics of the imhomogenity map is applied. The proposed technique is applicable to a localized shimming as well. High resolution spiral-scan imaging was successfully obtained with the proposed higher order shimming. Conclusion: Proposed pulse sequence for rapid measurement of inhomogeneity map and higher order shimming based on the inhomogeneity map work very well at 3 Tesla MRI system. With the proposed higher order shimming and localized higher order shimming techniques, high resolution spiral-scan images are successfully obtained at 3 T MRI system.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.55 no.3
• /
• pp.141-145
• /
• 2006

The line current problem(2-dimensional space : point source) is not easy to analyze the magnetic field using the standard finite element method(FEM), such as overhead trolley line or transmission line. To supplement such a defect this paper is proposed the coupling scheme of analytical solution and FEM. In analysis of the magnetic field using the standard FEM. If the current region is a relatively small compared to the whole region. Therefore the current region must be finely divided using a large number of elements. And the large number of elements increase the number of unknown variables and the use of computer memories. In this paper, an analytical solution is suggested to supplement this weak points. When source is line current and the part of interest is far from line current, the analytical solution can be coupling with FEM at the boundary. Analytical solution can be described by the multiplication of two functions. One is power function of radius, the other is a trigonometric function of angle in the cylindrical coordinate system. There are integral constants of two types which can be established by fourier series expansion. Also fourier series is represented as the factor to apply the continuity of the magnetic vector potential and magnetic field intensity with tangential component at the boundary. To verify the proposed algorithm, we chose simplified model existing magnetic material in FE region. The results are compared with standard FE solution. And it is good agreed by increasing harmonic order.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5C
• /
• pp.726-736
• /
• 2004

In this paper, we proposed a new scalar multiplier structure needed for an elliptic curve cryptosystem(ECC) over the standard basis in GF(2$^{163}$ ). It consists of a bit-serial multiplier and a divider with control logics, and the divider consumes most of the processing time. To speed up the division processing, we developed a new division algorithm based on the extended Euclid algorithm. Dynamic data dependency of the Euclid algorithm has been transformed to static and fixed data flow by a localization technique, to make it independent of the input and field polynomial. Compared to other existing scalar multipliers, the new scalar multiplier requires smaller gate counts with improved processor performance. It has been synthesized using Samsung 0.18 um CMOS technology, and the maximum operating frequency is estimated 250 MHz. The resulting performance is 148 kbps, that is, it takes 1.1 msec to process a 163-bit data frame. We assure that this performance is enough to be used for digital signature, encryption/decryption, and key exchanges in real time environments.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.3
• /
• pp.113-123
• /
• 2007

This paper presents a high-performance elliptic curve cryptographic processor over $GF(2^m)$. The proposed design adopts Lopez-Dahab Montgomery algorithm for elliptic curve point multiplication and uses Gaussian normal basis for $GF(2^m)$ field arithmetic operations. We select m=163 which is the smallest value among five recommended $GF(2^m)$ field sizes by NIST and it is Gaussian normal basis of type 4. The proposed elliptic curve cryptographic processor consists of host interface, data memory, instruction memory, and control. We implement the proposed design using Xilinx XCV2000E FPGA device. Based on the FPGA implementation results, we can see that our design is 2.6 times faster and requires significantly less hardware resources compared with the previously proposed best hardware implementation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.324-329
• /
• 2003

The public-key cryptosystems such as Diffie-Hellman Key Distribution and Elliptical Curve Cryptosystems are built on the basis of the operations defined in GF(2$^{m}$ ):addition, subtraction, multiplication and multiplicative inversion. It is important that these operations should be computed at high speed in order to implement these cryptosystems efficiently. Among those operations, as being the most time-consuming, multiplicative inversion has become the object of lots of investigation Formant's theorem says $\beta$$^{-1}$ =$\beta$$^{2}$sup m/-2/, where $\beta$$^{-1}$ is the multiplicative inverse of $\beta$$\in$GF(2$^{m}$ ). Therefore, to compute the multiplicative inverse of arbitrary elements of GF(2$^{m}$ ), it is most important to reduce the number of times of multiplication by decomposing 2$^{m}$ -2 efficiently. Among many algorithms relevant to the subject, the algorithm proposed by Itoh and Tsujii[2] has reduced the required number of times of multiplication to O(log m) by using normal basis. Furthermore, a few papers have presented algorithms improving the Itoh and Tsujii's. However they have some demerits such as complicated decomposition processes[3,5]. In this paper, in the case of 2$^{m}$ -2, which is mainly used in practical applications, an efficient algorithm is proposed for computing the multiplicative inverse at high speed by using both the factorization formula x$^3$-y$^3$=(x-y)(x$^2$＋xy＋y$^2$) and normal basis. The number of times of multiplication of the algorithm is smaller than that of the algorithm proposed by Itoh and Tsujii. Also the algorithm decomposes 2$^{m}$ -2 more simply than other proposed algorithms.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.5
• /
• pp.17-30
• /
• 2001

In this paper, we implemented a scalar multiplier needed at an elliptic curve cryptosystem over standard basis in $GF(2^{163})$. The scalar multiplier consists of a radix-16 finite field serial multiplier and a finite field inverter with some control logics. The main contribution is to develop a new fast finite field inverter, which made it possible to avoid time consuming iterations of finite field multiplication. We used an algorithmic transformation technique to obtain a data-independent computational structure of the Extended Euclid GCD algorithm. The finite field multiplier and inverter shown in this paper have regular structure so that they can be easily extended to larger word size. Moreover they can achieve 100% throughput using the pipelining. Our new scalar multiplier is synthesized using Hyundai Electronics 0.6$\mu\textrm{m}$ CMOS library, and maximum operating frequency is estimated about 140MHz. The resulting data processing performance is 64Kbps, that is it takes 2.53ms to process a 163-bit data frame. We assure that this performance is enough to be used for digital signature, encryption & decryption and key exchange in real time embedded-processor environments.

• Smart Structures and Systems
• /
• v.14 no.6
• /
• pp.1131-1150
• /
• 2014

One of the issues in extending the range of applicable problems of real-time hybrid simulation is the computation speed of the simulator when large-scale computational models with a large number of DOF are used. In this study, functionality of real-time dynamic simulation of MDOF systems is achieved by creating a logic circuit that performs the step-by-step numerical time integration of the equations of motion of the system. The designed logic circuit can be implemented to an FPGA-based system; FPGA (Field Programmable Gate Array) allows large-scale parallel computing by implementing a number of arithmetic operators within the device. The operator splitting method is used as the numerical time integration scheme. The logic circuit consists of blocks of circuits that perform numerical arithmetic operations that appear in the integration scheme, including addition and multiplication of floating-point numbers, registers to store the intermediate data, and data busses connecting these elements to transmit various information including the floating-point numerical data among them. Case study on several types of linear and nonlinear MDOF system models shows that use of resource sharing in logic synthesis is crucial for effective application of FPGA to real-time dynamic simulation of structural response with time step interval of 1 ms.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.5
• /
• pp.979-984
• /
• 2015

In this paper, we proposed a Semi-Systolic multiplier of $GF(2^n)$ with Type II optimal Normal Basis. Comparing the complexity of the proposed multiplier with Chiou's multiplier proposed in 2012, it is saved $2n^2+44n+26$ in total transistor numbers and decrease 4 clocks in time delay. This means that, for $GF(2^{333})$ of the field recommended by NIST for ECDSA, the space complexity is 6.4% less and the time complexity of the 2% decrease. In addition, this structure has an advantage as applied to Chiou's method of concurrent error detection and correction in multiplication of $GF(2^n)$.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.31 no.12
• /
• pp.1200-1207
• /
• 2007

An experimental test is presented for photoelastic stress analysis around a crack tip in tensile loaded plate. The hybrid method coupling photoelastsic fringe inputs calculated by finite element method and complex variable formulations involving conformal mappings and analytical continuity is used to calculate full-field stress around the crack tip in uniaxially loaded, finite width tensile plate. In order to accurately compare calculated fringes with experimental ones, both actual and regenerated photoelastic fringe patterns are two times multiplied and sharpened by digital image processing. Regenerated fringes by hybrid method are quite comparable to actual fringes. The experimental results indicate that Mode I stress intensity factor analyzed by the hybrid method are accurate within three percent compared with ones obtained by empirical equation and finite element analysis.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.23 no.6 s.165
• /
• pp.988-1000
• /
• 1999

An experimental study is presented for the effect of number of terms of a pewee series type stress function on stress analysis around a hole in tensile loaded plate. The hybrid method coupling photoelastsic data inputs and complex variable formulations involving conformal mappings and analytical continuity is used to calculate tangential stress on the boundary of the hole in uniaxially loaded, finite width tensile plate. In order to measure isochromatic data accurately, actual photoelastic fringe patterns are two times multiplied and sharpened by digital image processing. For qualitative comparison, actual fringes are compared with calculated ones. For quantitative comparison, percentage errors and standard deviations with respect to percentage errors are caculated for all measured points by changing the number of terms of stress function. The experimental results indicate that stress concentration factors analyzed by the hybrid method are accurate within three percent compared with ones obtained by theoretical and finite element analysis.