• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4C
• /
• pp.403-413
• /
• 2009

We compare three predistortion methods to prevent signal distortion and spectral re-growth due to the high PAPR (peak-to-average ratio) of OFDM signal and the non-linearity of high-power amplifiers. The three predistortion methods are pth order inverse, indirect learning architecture and look up table. The pth order inverse and indirect learning architecture methods requires less memory and has a fast convergence because these methods use a polynomial model that has a small number of coefficients. Nevertheless the convergence is fast due to the small number of coefficients and the simple computation that excludes manipulation of complex numbers by separate compensation for the magnitude and phase. The look up table method is easy to implement due to simple computation but has the disadvantage that large memory is required. Computer simulation result reveals that indirect learning architecture shows the best performance though the gain is less than 1 dB at $BER\;=\;10^{-4}$ for 64-QAM. The three predistorters are adaptive to the amplifier aging and environmental changes, and can be selected to the requirements for implementation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.11
• /
• pp.2355-2364
• /
• 2012

Recently, the novel loop-up table(N-LUT) method to solve the tremendous memory problem of the conventional look-up table (LUT) method as well as to increase the generation speed of hologram patterns has been proposed. But, as the resolution of an input 3-D object is enhanced, the number of object points to be calculated for generation of its hologram pattern also increases, which results in a sharp increase of the computation time. Therefore, in this paper, a new approach for fast generation of the hologram pattern of 3-D object images is proposed by using the block redundancy feature of 3-D object images and the N-LUT method. Experimental results show that in the proposed method the number of object points and the overall computation time have been reduced by 43.3 % and 47.9 %, respectively compared to those of the conventional method for the case of the $5{\times}5$ block size. These good experimental results finally confirm the feasibility of the proposed method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.2
• /
• pp.1-8
• /
• 2018

K-means algorithm is one of the most popular and widely used clustering method because it is easy to implement and very efficient. However, this method has the limitation to be used with fixed number of clusters because of only considering the intra-cluster distance to evaluate the data clustering solutions. Silhouette is useful and stable valid index to decide the data clustering solution with number of clusters to consider the intra and inter cluster distance for unsupervised data. However, this valid index has high computational burden because of considering quality measure for each data object. The objective of this paper is to propose the fast and simple speed-up method to overcome this limitation to use silhouette for the effective large-scale data clustering. In the first step, the proposed method calculates and saves the distance for each data once. In the second step, this distance matrix is used to calculate the relative distance rate ($V_j$) of each data j and this rate is used to choose the suitable number of clusters without much computation time. In the third step, the proposed efficient heuristic algorithm (Group search optimization, GSO, in this paper) can search the global optimum with saving computational capacity with good initial solutions using $V_j$ probabilistically for the data clustering. The performance of our proposed method is validated to save significantly computation time against the original silhouette only using Ruspini, Iris, Wine and Breast cancer in UCI machine learning repository datasets by experiment and analysis. Especially, the performance of our proposed method is much better than previous method for the larger size of data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.10
• /
• pp.1973-1979
• /
• 2016

As technologies evolve, diverse 3D measurement techniques using cameras and pattern projectors have been developed continuously. In 3D measurement, high accuracy, fast speed, and easy implementation are very important factors. Recently, 3D measurement using multi-frequency fringe patterns for absolute phase computation has been widely used in the fringe projection profilometry. This paper proposes an improved method to compute the object's absolute phase using the reference plane's absolute phase and phase difference between the object and the reference plane. This method finds the object's absolute phase by adding the difference between the reference plane's wrapped phase and the object's wrapped phase to the reference plane's absolute phase already obtained in the calibration stage. Through this method, there is no need to obtain multi-frequency fringe patterns about new object for the absolute phase computation. Instead, we only need the object's phase difference relative to the reference planes's phase in the measurement stage.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.6
• /
• pp.1-8
• /
• 2008

This paper introduces three efficient frame selection schemes to reduce the computation complexity for the multi-reference and variable block size Motion Estimation (ME). The proposed RSP (Reference Selection Pass) scheme can minimize the overhead of frame selection. The MFS (Modified Frame Selection) scheme can reduce the number of search points about 18% compared with existing schemes considering the motion of image during the reference frame selection process. In addition, the TPRFS (Two Pass Reference frame Selection) scheme can minimize the frame selection operation for the variable block size ME in H.264/AVC using the character of selected reference frame according to the block size. The simulation results show the proposed schemes can save up to 50% of the ME computation without degradation of image Qualify. Because the proposed schemes can be separated from the block matching process, they can be used with any existing single reference fast search algorithms.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.12
• /
• pp.682-691
• /
• 2004

We present a novel haptic sculpting system where the user intuitively adds to and carves out material from a volumetric model using new sculpting tools in the similar way to handling real clay Haptic rendering and model deformation are implemented based on volumetric implicit surface. We enhance previous volume-based haptic sculpting systems by presenting fast and stable force computation on 3D models to be deformed. In order to bridge the gap between fast haptic process (1 KHz) and much slower visual update frequency(~30Hz), the system generates intermediate implicit surfaces between two consecutive physical models being deformed. It performs collision detection and force computation on the intermediate surface in haptic process. The volumetric model being sculpted is visualized as a geometric model which is adaptively polygonized according to the surface complexity. We also introduce various visual effects for the real-time sculpting system including mesh-based solid texturing, painting, and embossing/engraving techniques.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.4
• /
• pp.588-594
• /
• 2021

SIMON, a lightweight block cipher developed by the US National Security Agency, is a family of block ciphers optimized for hardware implementation. It supports many kinds of standards to operate in various environments. The counter mode of operation is one of the operational modes. It provides to encrypt plaintext which is longer than the original size. The counter mode uses a constant(Nonce) and Counter value as an input value. Since Nonce is the identical for all blocks, so it always has same result when operates with other constant values. With this feature, it is possible to skip some instructions of round function by pre-computation. In general, the input value of SIMON is affected by the counter. However in an 8-bit environment, it is calculated in 8-bit units, so there is a part that can be pre-computed. In this paper, we focus the part that can be pre-calculated, and compare with previous works.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.956-959
• /
• 2005

The overall goal of this thesis is to develop a new algorithm based on the octree model for geometric and mechanistic milling operation at the same time. Most commercial machining simulators are based on the Z map model, which has several limitations in terms of achieving a high level of precision in five-axis machining simulation. Octree representation being a three-dimensional (3D) decomposition method, an octree-based algorithm is expected to be able to overcome such limitations. With the octree model, storage requirement is reduced. Moreover, recursive subdivision is processed in the boundaries, which reduces useless computations. To achieve a high level of accuracy, fast computation time and less memory consumption, the advanced octree model is suggested. By adopting the supersampling technique of computer graphics, the accuracy can be significantly improved at approximately equal computation time. The proposed algorithm can verify the NC machining process and estimate the material removal volume at the same time.

• Annual Conference of KIPS
• /
• 2017.04a
• /
• pp.618-620
• /
• 2017

Currently, IoT mobile applications are growing fast in number and complexity. As a result, the applications quality issue became crucial, hence to ensure their quality a proper testing is highly required. Testing such mobile applications is always tedious, time-consuming and expensive. To cope with these issues, we propose a testing approach using activity diagram with data flow information. The main functionality of IoT applications is exposing the meaningful data obtained from the sensors to the users by doing a lot of analysis, comparison, and computation. Therefore, our focus is on identifying and selecting the most appropriate paths at which calculation is taking place and the paths at which predicate exists. In our case study, we have used a real-world IoT mobile application and identified a total of ten test paths with two predicate uses and two computation uses through an example. With applying only this four critical paths, we can adequately test the application's core functionalities while significantly reduce the testing effort and cost.

• Wind and Structures
• /
• v.9 no.3
• /
• pp.231-243
• /
• 2006

An improvement to the spectral representation algorithm for the simulation of wind velocity fields on large scale structures is proposed in this paper. The method proposed by Deodatis (1996) serves as the basis of the improved algorithm. Firstly, an interpolation approximation is introduced to simplify the computation of the lower triangular matrix with the Cholesky decomposition of the cross-spectral density (CSD) matrix, since each element of the triangular matrix varies continuously with the wind spectra frequency. Fast Fourier Transform (FFT) technique is used to further enhance the efficiency of computation. Secondly, as an alternative spectral representation, the vectors of the triangular matrix in the Deodatis formula are replaced using an appropriate number of eigenvectors with the spectral decomposition of the CSD matrix. Lastly, a turbulent wind velocity field through a vertical plane on a long-span bridge (span-wise) is simulated to illustrate the proposed schemes. It is noted that the proposed schemes require less computer memory and are more efficiently simulated than that obtained using the existing traditional method. Furthermore, the reliability of the interpolation approximation in the simulation of wind velocity field is confirmed.