• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.3
• /
• pp.210-219
• /
• 2017

This paper proposes a modified min-max algorithm (MMMA) for nonbinary quasi-cyclic low-density parity-check (NB-QC-LDPC) codes and an efficient parallel block-layered decoder architecture corresponding to the algorithm on a graphics processing unit (GPU) platform. The algorithm removes multiplications over the Galois field (GF) in the merger step to reduce decoding latency without any performance loss. The decoding implementation on a GPU for NB-QC-LDPC codes achieves improvements in both flexibility and scalability. To perform the decoding on the GPU, data and memory structures suitable for parallel computing are designed. The implementation results for NB-QC-LDPC codes over GF(32) and GF(64) demonstrate that the parallel block-layered decoding on a GPU accelerates the decoding process to provide a faster decoding runtime, and obtains a higher coding gain under a low $10^{-10}$ bit error rate and low $10^{-7}$ frame error rate, compared to existing methods.

• International Journal of Precision Engineering and Manufacturing
• /
• v.8 no.1
• /
• pp.16-20
• /
• 2007

Although conventional contour parallel tool paths obtained from geometric information have successfully been used to produce desired shapes, they seldom consider physical process concerns such as cutting forces and chatter. In this paper, we introduce an optimized contour parallel path that maintains a constant material removal rate at all times. The optimized tool path is based on a conventional contour parallel tool path. Additional tool path segments are appended to the basic path to achieve constant cutting forces and to avoid chatter vibrations over the entire machining area. The algorithm was implemented for two-dimensional contiguous end milling operations with flat end mills, and cutting tests were conducted to verify the performance of the proposed method.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.3
• /
• pp.853-874
• /
• 2016

Based on a particular overlapping domain decomposition technique, a parallel finite element discretization algorithm for the generalized Stokes equations is proposed and investigated. In this algorithm, each processor computes a local approximate solution in its own subdomain by solving a global problem on a mesh that is fine around its own subdomain and coarse elsewhere, and hence avoids communication with other processors in the process of computations. This algorithm has low communication complexity. It only requires the application of an existing sequential solver on the global meshes associated with each subdomain, and hence can reuse existing sequential software. Numerical results are given to demonstrate the effectiveness of the parallel algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.2
• /
• pp.148-155
• /
• 1995

When we analize many amount of patterns, it is necessary for these patterns are to be clustering into several groups according to a certain evaluation function. This process, in case that there are lots of input patterns, needs a considerable amount of computations and is reqired parallel algorithm for these. To solve this problem, this paper propose parallel clustering algorithm which parallelized k-means algorithm and implemented it under the MIMD parallel computer based message passing. The result is through the experiment and performance analysis, that this parallel algorithm is appropriate in case these are many input patterns.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.848-853
• /
• 2001

Electrostatic actuation was adopted for ease of fabrication. We proposed a new driving scheme that uses the vector sum of force generated by comb-finger and by parallel plate. The moving and fixed electrodes are arranged to maximize the driving force. In this paper, an electrostatic field analysis is performed by Maxwell analysis tool for micro actuators. From the analysis, a comb-parallel type micro-actuator with 4${\mu}{\textrm}{m}$ width, 6${\mu}{\textrm}{m}$ overlap and 45${\mu}{\textrm}{m}$ height could be designed. In order to compare the new type of actuator with the conventional comb type of actuator, we arranged that both types have the same area and the same number of actuators. To make a high aspect ratio structure, we are developing fabrication process using SU-8 and electro-plating.

• Journal of the Korean Society for Precision Engineering
• /
• v.23 no.2 s.179
• /
• pp.35-42
• /
• 2006

Although the conventional contour parallel tool path obtained from geometric information has been successful to make desirable shape, it seldom consider physical process concerns like cutting forces and chatters. In this paper, an optimized contour parallel path, which maintains constant MRR(material removal rates) at all time, is introduced and the result is verified. The optimized tool path is based on a conventional contour parallel tool path. Additional tool path segments are appended to the basic tool path in order to achieve constant cutting forces and to avoid chatter vibrations at the entire machining area. The algorithm has been implemented for two dimensional contiguous end milling operations with flat end mills, and cutting tests were conducted to verify the significance of the proposed method.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.24 no.2
• /
• pp.161-197
• /
• 2020

Total variation minimization is standard in mathematical imaging and there have been numerous researches over the last decades. In order to process large-scale images in real-time, it is essential to design parallel algorithms that utilize distributed memory computers efficiently. The aim of this paper is to illustrate recent advances of domain decomposition methods for total variation minimization as parallel algorithms. Domain decomposition methods are suitable for parallel computation since they solve a large-scale problem by dividing it into smaller problems and treating them in parallel, and they already have been widely used in structural mechanics. Differently from problems arising in structural mechanics, energy functionals of total variation minimization problems are in general nonlinear, nonsmooth, and nonseparable. Hence, designing efficient domain decomposition methods for total variation minimization is a quite challenging issue. We describe various existing approaches on domain decomposition methods for total variation minimization in a unified view. We address how the direction of research on the subject has changed over the past few years, and suggest several interesting topics for further research.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1992.10a
• /
• pp.5-5
• /
• 1992

The DEVS(discrete event system specification) formalism describes a discrete event system in a hierarchical, modular form. DEVSIM++ is C++ based general purpose DEVS abstract simulator which can simulate systems to be modeled by the DEVS formalism in a sequential environment. We implement P-DEVSIM++ which is a parallel version of DEVSIM++. In P-DEVSIM++, the external and internal event of models can be processed in parallel. To process in parallel, we introduce a hierarchical distributed simulation technique and some optimistic distributed simulation techniques. But in our algorithm, the rollback of a model is localized itself in contrast to the Time Warp approach. To evaluate its performance, we simulate a single bus multiprocessor architecture system with an external common memory. Simulation result shows that significant speedup is made possible with our algorithm in a parallel environment.

• Journal of Korean Society for Quality Management
• /
• v.50 no.1
• /
• pp.35-42
• /
• 2022

Purpose: The purpose of this study is to examine the characteristics and problems of existing research through various literature investigations on the existing R&D process. Implications are identified through the investigation of existing studies and the characteristics of the digital transformation era are analyzed. We research and propose a new R&D process suitable for the new era of digital transformation. Methods: The research method investigates various literature precedent studies on the existing R&D process and the methods used by companies. Research new R&D processes that reflect the characteristics of the digital transformation era and develop new related models. Results: In the era of digital transformation, the parallel R&D process is being reorganized to respond quickly to the demands of rapid market changes. In order to respond quickly to various customers, the R&D process can respond flexibly in a parallel structure. Conclusion: Along with the development of the R&D process, additional research on indicators and evaluation models that can evaluate them fairly and flexibly is needed. Further research is needed to determine whether the R&D process suitable for the digital transformation era is operating properly.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.13 no.5
• /
• pp.90-97
• /
• 2014

This paper presents a simplified dynamics model, dynamics simulations, and computed torque control experiments of the Delta high-speed parallel robot. Using the typical Newton-Euler method, a simplified but accurate dynamics model with practical assumptions is derived. Accuracy and fast calculations of the dynamics are essential in the computed torque control for high-speed applications. It was found that the simplified dynamics equation is in very god agreement with the ADAMS model, and the calculation time of the inverse kinematics and inverse dynamics is about 0.04 msec. From the dynamics simulations, the cycle trajectory along the y-axis requires less peak motor torque and a lower angular velocity and less power than that along the x-axis. The computed torque control scheme can reduce the position error by half as compared to a PD control scheme. Finally, the developed Delta parallel robot prototype, half the size of the ABB Flexpicker robot, can achieve a cycle time of 0.43 sec with a 1.0kg payload.