• Journal of IKEEE
• /
• v.19 no.3
• /
• pp.455-459
• /
• 2015

This paper proposes a dispatch unit of GP-GPU with SIMT architecture to support the acceleration of general-purpose operation as well as graphics processing. If all the information of an operand used instructions issued from the warp scheduler is decoded, an unnecessary operand load occurs, resulting in register loads. To resolve this problem, this paper proposes a method that can reduce the operand load and the load on the resister by decoding only the information of the operand using a pre-decoding method. The operand information from the dispatch unit is passed to the operand selection unit with preventing register bank collisions. Thus the overall performance are improved. In the simulation test, the total clock cycles required by processing 10,000 arbitrary instructions issued from the wrap scheduler using ModelSim SE 10.0b are measured. It shows that the application of the dispatch unit equipped with the pre-decoding function proposed in this paper can make an improvement of about 12% in processing performance compared to the conventional method.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.3
• /
• pp.21-30
• /
• 1990

This paper describes a hardware implementation of the interframe monochrome video CODEC using a MC-CVQ(Motion Compensated and Classified Vector Quantization) algorithm. The specifications of this CODEC are (1) the resolution of image is $128{\times}128$ pixels, and (2) the transmission rates are about 10frames/sec at the 64Kbps channel. In order to design the CODEC under these conditions, it is implemented by a multiprocessor system composed of MC unit, CVQ nuit and decoder unit, which are controlled by microprogramming technique. And the 3~stage pipelined ALU(Arithmetic and Logic Unit) is adopted to calculate the minimum error distance in the MC unit and CVQ nuit. The realized system shows that the transmission rates are 6-15 frames/sec according to the relative motion of the video signal.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.12
• /
• pp.1062-1070
• /
• 2002

In this paper, variable radix-two multibit coding algorithm is presented and applied in the implementation of discrete cosine transform(DCT) and inverse discrete cosine transform(IDCT). Variable radix-two multibit coding means the 2k SD (signed digit) representation of overlapped multibit scanning with variable shift method. SD represented by 2k generates partial products, which can be easily implemented with shifters and adders. This algorithm is most powerful for the hardware implementation of DCT/IDCT with constant coefficient matrix multiplication. This paper introduces the suggested algorithm, it's proof and the implementation of DCT/IDCT The implemented IDCT chip with 8 PEs(Processing Elements) and one transpose memory runs at a tate of 400 Mpixels/sec at 54MHz frequency for high speed parallel signal processing, and it's verified in HDTV and MPEG decoder.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.10
• /
• pp.89-98
• /
• 2012

In this paper, we proposed the efficient addressing scheme for improving the performance of routing algorithm by using ZigBee in Smart Grid environment. In a 16-bit address space and the network size of a few thousands, it is very unlikely to suffer from frequent address collisions. In response, we propose an elegant (x, y, z) coordinate axes addressing scheme from divided address space of 16 bit and its routing algorithm. One of disadvantages of (x, y) coordinate axes addressing, however, is that any router may not hold as many children as proposed, since sensor nodes tend to be connected to a geographically nearby router. We also present an adaptive routing algorithm for location-aware routing algorithms, using our addressing scheme. As a result, each node was reduced not only bitwise but also multi hop using the coordinate axes while routing and the effective address assignment and routing is to minimize the average energy consumption of each node in the network.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.4
• /
• pp.169-177
• /
• 2011

As demand for efficiency in handling dynamic XML data grows, new dynamic XML labeling schemes have been researched. The key idea of the dynamic XML labeling scheme is to find ancestor-descendent-sibling relationships and to minimize memory space to store total label, response time and range of relabeling incurred by update operations. The prime number labeling scheme is a representative scheme which supports dynamic XML documents. It determines the ancestor-descendant relationships between two elements by a simple divisibility test of labels. When a new element is inserted into the XML data using this scheme, it does not change the label values of existing nodes. However, since each prime number must be used exclusively, labels can become significantly large. Therefore, in this paper, we introduce a novel technique to effectively reduce the problem of label overflow. The suggested idea is based on tree decomposition. When label overflow occurs, the full tree is divided into several sub-trees, and nodes in each sub-tree are separately labeled. Through experiments, we show the effectiveness of our scheme.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.7
• /
• pp.107-115
• /
• 2012

Recently, Li and Hwang scheme proposed a biometrics-based remote user authentication scheme using smart card. It is asserted that this scheme has very excellent benefits by the operation cost efficiency based on the smart card, one-way function and biometrics using random numbers. But this scheme cannot provide the properly authentication, especially, it is analyzed as the vulnerable security scheme for Denial-of-Service(DoS) attacks by impersonate attacks. The attacker controls the insecure channel, they can easily fabricate messages to pass the user's or server's authentication, and the malicious attacker can impersonate the user to cheat the server and can impersonate the server to cheat the user without knowing any secret information. This paper proposes the strong improved scheme which can respond to multiple attacks by supplementing the function of integrity check from the server which applied variable authenticator and OSPA without exposing the user's password information. It is supplemented pregnable of disguise attack and mutual authentication of Li and Hwang scheme.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.4
• /
• pp.25-32
• /
• 2015

The Genetic algorithm is a search algorithm using evaluation, genetic operator, natural selection to populational solution iteratively. The convergence and divergence characteristic of genetic algorithm are affected by selection strategy, generation replacement method, genetic operator when genetic algorithm is designed. This paper proposes fast convergence genetic algorithm for time-limited robot path planning. In urgent situation, genetic algorithm for robot path planning does not have enough time for computation, resulting in quality degradation of found path. Proposed genetic algorithm uses fast converging selection strategy and generation replacement method. Proposed genetic algorithm also uses not only traditional crossover and mutation operator but additional genetic operator for shortening the distance of found path. In this way, proposed genetic algorithm find reasonable path in time-limited situation.

• Journal of Korea Spatial Information System Society
• /
• v.2 no.1 s.3
• /
• pp.5-16
• /
• 2000

OGC(Open GIS Consortium) suggests the 'OpenGIS Simple Feature Specification for CORBA' which is the OpenGIS implementation specification for CORBA to specify standard interfaces for reuse and interoperation among distributed heterogeneous GIS resources in the CORBA distributed computing environment. An OpenGIS server that supports this implementation specification moat correctly implement all interfaces defined in the OpenGIS implementation specification to be interoperable with wrapped GISs efficiently. In this paper, we have designed and implemented an OpenGIS server based an object relational GIS, called GEUS that integrates GIS and database technologies to provide spatial data types and spatial operators from the DBMS engine level. In the CORBA distributed computing environment, clients can access geospatial data stored in GIS wrapped by the OpenGIS server through the standard interfaces defined in the OpenGIS implementation specification for CORBA. In addition, clients can use geospatial operation features provided by a back-end GIS and interoperate with other GISs.

• Journal of Korean Society of Steel Construction
• /
• v.23 no.5
• /
• pp.581-593
• /
• 2011

The underlying advantages of using thin-walled corrugatedwebs instead of plate girders with stiffeners are the elimination of instability problems associated with buckling of the thin-walled flat plate, and elimination of the need for transverse stiffeners, which alsoresults in economic advantages. This paper focuses on two aspects related to the structural design technique forsinusoidal corrugated web steel beams, and the optimum design of the beams using real-value genetic algorithms. The structural design process and design variables used in this optimization werecomposed with EN 1993-1-5, DASt-R015 standard and Pasternak et al. (2004), and the valid design capacity of shear buckling of the standards were compared. For the optimum structural design, the objective function, presented as the fullweight of the sinusoidal corrugated web beams, and the slenderness, member forces, and maximum deflection of the beam, were considered constraints. Finally, the simple beam under the uniform load was adopted as a numerical example, and the effective probability parameters of the genetic operators were considered to find the global minimum point.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.8
• /
• pp.18-26
• /
• 2015

Measuring the heart rate during exercise is important to properly control the amount of exercise. With the recent advent of smart device usage, there is a dramatic increase in interest in devices for the real-time measurement of the heart rate during exercise. During intensive exercise, accurate heart rate estimation from wrist-type photoplethysmography (PPG) signals is a very difficult problem due to motion artifact (MA). In this study, we propose an efficient algorithm for an accurate estimation of the heart rate from wrist-type PPG signals. For the twelve data sets, the proposed algorithm achieves the average absolute error of 1.38 beat per minute (BPM) and the Pearson correlation between the estimates and the ground-truth of heart rate was 0.9922. The proposed algorithm presents the strengths in an accurate estimation together with a fast computation speed, which is attractive in application to wearable devices.