• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.2809-2811
• /
• 1999

In this paper, we develope an algorithm to calculate field inhomogeneity in MR imaging using a dual fast spin echo pulse sequence. Because phase modulation time can be easily modified with this pulse sequence, high resolution image can be obtained and acquisition time can be reduced compared to gradient echo technique. In the case of phase wrapping in field map, phase corrected using image processing technique. We assume the field pattern to be second order polynomial and apply Pseudo-Inverse equation to calculate second order polynomial coefficients. These coefficients can be used for the shimming of the magnetic field.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.82-87
• /
• 2002

RFM is the sensor model of IKONOS imagery for end-users. IKONOS imagery vendors provide RPC (Rational Polynomial Coefficients), Ration Function Model coefficients for IKONOS, for end-users with imagery. So it is possible that end-users obtain geospatial information in their IKONOS imagery without additional any effort. But there are requirements still fur rigorous 3D positions on RPC user. Provided RPC can not satisfy user and company to generate precision 3D terrain model. In IKONOS imagery, physical sensor modeling is difficult because IKONOS vendors do not provide satellite ephemeris data and abstract sensor modeling requires many GCP well distributed in the whole image as well as other satellite imagery. Therefore RPC modification is better choice. If a few GCP are available, RPC can be modified by method which is introduced in this paper. Study on evaluation modified RPC in IKONOS reports reasonable result. Pseudo GCP generated with vendor's RPC and additional GCP make it possible through sequential solution.

• ETRI Journal
• /
• v.30 no.4
• /
• pp.495-505
• /
• 2008

This paper presents a parallel processing searcher structure for the initial synchronization of a direct sequence ultra-wideband (DS-UWB) system, which is suitable for the digital implementation of baseband functionalities with a 1.32 Gsample/s chip rate analog-to-digital converter. An initial timing acquisition algorithm and a data demodulation method are also studied. The proposed searcher effectively acquires initial symbol and frame timing during the preamble transmission period. A hardware efficient receiver structure using 24 parallel digital correlators for binary phase-shift keying DS-UWB transmission is presented. The proposed correlator structure operating at 55 MHz is shared for correlation operations in a searcher, a channel estimator, and the demodulator of a RAKE receiver. We also present a pseudo-random noise sequence generated with a primitive polynomial, $1+x^2+x^5$, for packet detection, automatic gain control, and initial timing acquisition. Simulation results show that the performance of the proposed parallel processing searcher employing the presented pseudo-random noise sequence outperforms that employing a preamble sequence in the IEEE 802.15.3a DS-UWB proposal.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.6
• /
• pp.25-30
• /
• 2004

Linear cellular automata(CA) which generate maximum-length cycles, have wide applications in generation of pseudo-random patterns, signature analysis, cryptography and error correcting codes etc. Linear CA whose characteristic polynomial is primitive has been studied. In this paper Ive propose a effective method for generation of a variety of maximum-length CA(MLCA). And we show that the complemented CA's derived from a linear MLCA are all MLCA. Also we analyze the Properties of complemented MLCA. And we prove that the number of n-cell MLCA is ${\phi}(2^{n}-1)2^{n+1}$/n.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.2
• /
• pp.333-342
• /
• 2022

Cellular Automata (CA) is a discrete and abstract computational model that is being applied in various fields. Applicable as an excellent pseudo-random sequence generator, CA has recently developed into a basic element of cryptographic systems. Several studies on CA-based stream ciphers have been conducted and it has been observed that the encryption strength increases when the radius of a CA's neighbor is increased when appropriate CA rules are used. In this paper, among CAs that can be applied as a one-dimensional pseudo-random number sequence generator (PRNG), one-dimensional 5-neighbor CAs are classified according to the connection state of their neighbors, and the ignition relationship of the characteristic polynomial is obtained. Also this paper propose a synthesis algorithm for an asymmetric 1-D linear 5-neighbor MLCA in which the radius of the neighbor is increased by 2 using the one-dimensional 3-neighbor 90/150 CA state transition matrix.

• Journal of Biomedical Engineering Research
• /
• v.27 no.6
• /
• pp.409-417
• /
• 2006

Research on neural circuit is a difficult area due to complexity and inaccessibility. Due to recent developments, the research using multi-electrode array of cells or tissues has become an important research area. However, there are some difficulties to decode the submerged meaning from huge and complex neural data. Moreover, it needs a harmonic collaboration between informatics and bioscience. In this paper, we have developed a custom-designed signal processing technique for multi-electrode array measured neural responses induced by electrical stimuli to the hippocampal tissue slices of the rat brain. The raw data from hippocampal slice using the multi-electrode array system were saved in a computer. Then we estimated characteristic points in each channel and calculated the total activity. To estimate the points, we used the Polynomial Fitting Approximation Method. Using the calculated total activity, we could provide the histogram or pseudo-image matrix to help interpretation of results.

• Smart Structures and Systems
• /
• v.31 no.2
• /
• pp.113-130
• /
• 2023

Hybrid simulation (HS) has attracted community attention in recent years as an efficient and effective experimental technique for structural performance evaluation in size-limited laboratories. Traditional hybrid simulations usually take deterministic properties for their numerical substructures therefore could not account for inherent uncertainties within the engineering structures to provide probabilistic performance assessment. Reliable structural performance evaluation, therefore, calls for stochastic hybrid simulation (SHS) to explicitly account for substructure uncertainties. The experimental design of SHS is explored in this study to account for uncertainties within analytical substructures. Both computational simulation and laboratory experiments are conducted to evaluate the pseudo-random Sobol sequence for the experimental design of SHS. Meta-modeling through polynomial chaos expansion (PCE) is established from a computational simulation of a nonlinear single-degree-of-freedom (SDOF) structure to evaluate the influence of nonlinear behavior and ground motions uncertainties. A series of hybrid simulations are further conducted in the laboratory to validate the findings from computational analysis. It is shown that the Sobol sequence provides a good starting point for the experimental design of stochastic hybrid simulation. However, nonlinear structural behavior involving stiffness and strength degradation could significantly increase the number of hybrid simulations to acquire accurate statistical estimation for the structural response of interests. Compared with the statistical moments calculated directly from hybrid simulations in the laboratory, the meta-model through PCE gives more accurate estimation, therefore, providing a more effective way for uncertainty quantification.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.4
• /
• pp.819-826
• /
• 2018

The generalized Hamming weight is one of the important parameters of the linear code. It determines the performance of the code when the linear codes are applied to a cryptographic system. In addition, when the block code is decoded by soft decision using the lattice diagram, it becomes a measure for evaluating the state complexity required for the implementation. In particular, a bit-parallel multiplier on finite fields based on trinomials have been studied. Cellular automata(CA) has superior randomness over LFSR due to its ability to update its state simultaneously by local interaction. In this paper, we deal with the efficient synthesis of the pseudo random number generator, which is one of the important factors in the design of effective cryptosystem. We analyze the property of the characteristic polynomial of the simple 90/150 transition rule block, and propose a synthesis algorithm of the reversible 90/150 CA corresponding to the trinomials $x^2^n+x^{2^n-1}+1$($n{\geq}2$) and the 90/150 reversible CA(RCA) corresponding to the maximum weight polynomial with $2^n$ degree by using this rule block.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.15 no.2
• /
• pp.544-556
• /
• 1991

The optimization of many engineering design problems requires a nonlinear programming algorithm that is robust and efficient. A general-purpose nonlinear optimization program IDOL (Interactive Design Optimization Library) is developed based on the Augmented Lagrange Mulitiplier (ALM) method. The ideas of selecting a good initial design point, using resonable initial values for Lagrange multipliers, constraints scaling, descent vector restarting, and dynamic stopping criterion are employed for computational enhancement to the ALM method. A descent vector is determined by using the Broydon-Fletcher-Goldfarb-Shanno (BFGS) method. For line search, the Incremental-Search method is first used to find bounds on the solution, then the bounds are reduced by the Golden Section method, and finally a cubic polynomial approximation technique is applied to locate the next design point. Seven typical test problems are solved to show IDOL efficient and robust.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.14 no.3
• /
• pp.54-59
• /
• 2005

The cylindrical object are widely used as mechanical parts in the manufacturing process. In order to handling those objects using a robot or an automated machine automatically, the pose of the object must be known. The pose can be described by two rotation angles; one angle about the x axis and the other about the y axis. In the many previous researches these angles were obtained by the computationally intensive algorithm, that is, fitting the data as a polynomial and doing pseudo inverse. So that, this method required high performance microprocessor. In this paper in order to avoid complex computation, a new method based on a genetic algorithm is proposed and analyzed through a series of simulations. This algorithm utilized the geometry of the cylindrical shape. The simulation results show that this method find the pose angles very well In most cases, but the computation time is randomly changed because the genetic algorithm is basically one of the random search method.