• International Journal of Contents
• /
• v.3 no.2
• /
• pp.1-5
• /
• 2007

This paper proposes a technique for principal component analysis (PCA) to raise the recognition rate of a front face in a low dimension by hierarchical image and parallel processing structure. The conventional PCA shows a recognition rate of less than 50% in a low dimension (dimensions 1 to 6) when used for facial recognition. In this paper, a face is formed as images of 3 fixed-size levels: the 1st being a region around the nose, the 2nd level a region including the eyes, nose, and mouth, and the 3rd level image is the whole face. PCA of the 3-level images is treated by parallel processing structure, and finally their similarities are combined for high recognition rate in a low dimension. The proposed method under went experimental feasibility study with ORL face database for evaluation of the face recognition function. The experimental demonstration has been done by PCA and the proposed method according to each level. The proposed method showed high recognition of over 50% from dimensions 1 to 6.

• ETRI Journal
• /
• v.35 no.5
• /
• pp.767-774
• /
• 2013

In this paper, a novel parallel Viterbi decoding scheme is proposed to decrease the decoding latency and power consumption for the software-defined radio (SDR) system. It implements a divide-and-conquer approach by first dividing a block into a series of subblocks, then performing independent Viterbi decoding for each subsequence, and finally merging the surviving subpaths into the final path. Moreover, a network-on-chip-based SDR platform is used to evaluate the performance of the proposed parallel Viterbi decoding scheme. The experiment results show that our scheme can speed up the Viterbi decoding process without increasing the BER, and it performs better than the current state-of-the-art methods.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.32 no.10
• /
• pp.38-45
• /
• 2004

In this paper, a parallel visualization algorithm is proposed for efficient visualization of the massive data generated from large-scale parallel finite element analysis through investigating the characteristics of parallel rendering methods. The proposed parallel visualization algorithm is designed to be highly compatible with the characteristics of domain-wise computation in parallel finite element analysis by using the sort-last-sparse approach. In the proposed algorithm, the binary tree communication pattern is utilized to reduce the network communication time in image composition routine. Several benchmarking tests are carried out by using the developed in-house software, and the performance of the proposed algorithm is investigated.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.4
• /
• pp.373-382
• /
• 2000

This paper is concerned with development of a communication module of POFS(Parallel Operating File System), which is the parallel file system to be operated on SPAX computer. SPAX is multiprocessor computer with clustering SMP architecture and being developed by ETRI. The operating system for SPAX is MISIX based on the Chorus microkernel. POFS has client/server architecture basically so that it is important to design a communication module. The communication module is so easily affected by network environment that bad design is the major reason that decreases the portability and performance of the parallel file system. This paper describes the structure and performance of the communication of the POFS. the theme is issued in the course of designing and developing POFS. The communication module of POFS was designed to support the portability and the architecture of parallel file system.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.12
• /
• pp.1-9
• /
• 2010

This paper describes parallel event-driven remote IT convergence applications which are a combination of traditional industry and IT Technology including advanced communication. In IT convergence system, events can occur currently from many sensors of devices or users. And IT convergence system must have a parallel processing method. In this paper, the parallel processing method was implemented using a thread and we developed a connection method between a device and a mode of communication which is a wireless communication or a power line communication. In addition to that, we developed object modeling, device, user and event modeling, based on XML (eXtensible Markup Language) using object-oriented modeling method. To efficiently show results in real time, systems provide various graphic user interfaces such as a bar graph, a table, and a combination of the two.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.743-744
• /
• 2006

This paper presents implementation of parallel processing system for image processing. The parallel processing system proposed consisted of 16 processing elements, and multi-access memory system, and interface modules. The multi-access memory system we introduced is made up of a memory module selection, a data routing module, and an address calculation and routing module.

• ETRI Journal
• /
• v.26 no.5
• /
• pp.397-404
• /
• 2004

In this paper, we provide a new detection scheme for a pilot symbol assisted interference nulling and cancellation operation to reduce unexpected effects owing to parallel transmission in orthogonal frequency division multiplexing (OFDM)-based spatial multiplexing systems. We have shown that the investigated OFDM vertical Bell laboratories layered space time (VBLAST) detection based on hybrid processing performs better than ordinary OFDM-VBLAST detections based on serial processing and parallel processing, respectively.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.1105-1108
• /
• 2005

Media service model is divided into 3 models that are Client Pull, Server Push, and IPP(Interleaving Pull & Push) model. In most single VOD(Video On Demand) environment, Client Pull model was sufficient to play the movie Because most media contents has a low bitrate and resolution. But according to an increment of the demand of the high definition media, Client Pull model is not sufficient. Parallel VOD environment is made of several of VOD servers and provides the parallel media stream simultaneously for one client. We compared and analyzed the performance of service models with respect to network delay and data size in buffer in the single and parallel VOD environment and we found that IPP service model keeps the least network delay and stable client buffer state in the parallel VOD environment.

• 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.

• 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.