• Title/Summary/Keyword: 병렬 방법

Search Result 1,837, Processing Time 0.026 seconds

A Study on the Modularization of LED Driver for Illumination Using a Fly-Back Converter (플라이백 컨버터를 이용한 조명용 LED Driver의 모듈화 연구)

  • Choi, Jin-Bong;Kim, Kwan-Woo;Jung, Young-Gook;Lim, Young-Cheol
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.14 no.6
    • /
    • pp.504-513
    • /
    • 2009
  • This paper proposes the new type LED driver modularization for illumination LED driver. The proposed LED driver circuit insulates a hot GND of AC input power and a cold GND of LED driver part by using a fly-back converter. In order to control easily the current of the LED, the fly-back converter is operated in the discontinuous mode with excellent dynamic characteristics, and the characteristics of the LED are verified after the closed loop control is performed using a KIA2431. The LED driver module allows the wide AC power input ranges and realizes the burst dimming function which directly regulates a PWM control IC. This paper describes the operation principle of the LED driver module and it is proved the usefulness through the real model with experimentation. Besides, this paper proposes the multi-channel LED driver which the miniaturized and modularized LED driver module are connected by parallel, and verified its propriety by experiments.

Multistage Adaptive Partial PIC for CDMA System (CDMA 시스템을 위한 Multistage Adaptive Partial PIC)

  • Jeon Jae-Choon;Lee Bong-Hee;Hwang In-Kwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.1A
    • /
    • pp.37-52
    • /
    • 2004
  • In this paper, Multistage Adaptive Partial PIC eliminating effectively the multiple access and multipath interference for DS-CDMA based W-CDMA uplink system is designed and its performance is evaluated with computer simulation. By adaptively controlling the slope of the soft limiter with received signals, the efficiency of the soft limiter can be maximized and the better performance is obtained by solving error floor problem using further precise generation of interference signal. As a result, The proposed Multistage Adaptive Partial PIC with simple optimizing method for time-variant channel showed optimum performance at fewer stages. Besides fewer stages, the interference cancellation at the output of the rake receiver considerably reduced system complexity. The Multistage Adaptive Partial PIC with precise generation and efficient cancellation of interference signal can solve error eoor problem, resulted from initial false detection and improve system performance of high data rate system.

A CPU and GPU Heterogeneous Computing Techniques for Fast Representation of Thin Features in Liquid Simulations (액체 시뮬레이션의 얇은 특징을 빠르게 표현하기 위한 CPU와 GPU 이기종 컴퓨팅 기술)

  • Kim, Jong-Hyun
    • Journal of the Korea Computer Graphics Society
    • /
    • v.24 no.2
    • /
    • pp.11-20
    • /
    • 2018
  • We propose a new method particle-based method that explicitly preserves thin liquid sheets for animating liquids on CPU-GPU heterogeneous computing framework. Our primary contribution is a particle-based framework that splits at thin points and collapses at dense points to prevent the breakup of liquid on GPU. In contrast to existing surface tracking methods, the our method does not suffer from numerical diffusion or tangles, and robustly handles topology changes on CPU-GPU framework. The thin features are detected by examining stretches of distributions of neighboring particles by performing PCA(Principle component analysis), which is used to reconstruct thin surfaces with anisotropic kernels. The efficiency of the candidate position extraction process to calculate the position of the fluid particle was rapidly improved based on the CPU-GPU heterogeneous computing techniques. Proposed algorithm is intuitively implemented, easy to parallelize and capable of producing quickly detailed thin liquid animations.

Sharing Error Allowances for the Analysis of Approximation Schemes (근사접근법 분석을 위한 오차허용치의 분배방법)

  • Kim, Joon-Mo;Goo, Eun-Hee
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.5
    • /
    • pp.1-7
    • /
    • 2009
  • When constructing various mobile networks including sensor networks, the problem of finding the layout or graph to interconnect the terminals or nodes of the network may come up. Providing a common scheme that can be applied to the kind of problems, and formulating the bounds of the run time and the result of the algorithm from the scheme, one may evaluate precisely the plan of constructing analogous network systems. This paper, dealing with EMST(Euclidean Minimum Spanning Tree) that represents such problems, provides the scheme for constructing EMST by parallel processing over distributed environments, and the ground for determining the maximum difference of the layout or the graph produced from the scheme: the difference from EMST. In addition, it provides the upper bound of the run time of the algorithm from the scheme.

Design Optimization Techniques for the SSD Controller (SSD 컨트롤러 최적 설계 기법)

  • Yi, Doo-Jin;Han, Tae-Hee
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.48 no.8
    • /
    • pp.45-52
    • /
    • 2011
  • Flash memory is becoming widely prevalent in various area due to high performance, non-volatile features, low power, and robust durability. As price-per-bit is decreased, NAND flash based SSDs (Solid State Disk) have been attracting attention as the next generation storage device, which can replace HDDs (Hard Disk Drive) which have mechanical properties. Especially for the single package SSD, if channel number or FIFO buffer size per channel increases to improve performance, the size of a controller and I/O pin count will increase linearly with channel numbers and form factor will be affected. We propose a novel technique which can minimize form factor by optimizing the number of NAND flash channels and the size of interface FIFO buffer in the SSD. For SSD with 10 channel and double buffer, the experimental results show that buffer block size can be reduced about 73% without performance degradation and total size of a controller can be reduced about 40% because control block per channel and I/O pin count decrease according to decrease channel number.

High-Performance Givens Rotation-based QR Decomposition Architecture Applicable for MIMO Receiver (MIMO 수신기에 적용 가능한 고성능 기븐스 회전 기반의 QR 분해 하드웨어 구조)

  • Yoon, Ji-Hwan;Lee, Min-Woo;Park, Jong-Sun
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.49 no.3
    • /
    • pp.31-37
    • /
    • 2012
  • This paper presents an efficient hardware architecture to enable the high-speed Givens rotation-based QR decomposition. The proposed architecture achieves a highly parallel givens rotation process by maximizing the number of pivots selected for parallel zero-insertions. Sign-select lookahed (SSL)-CORDIC is also efficiently used for the high-speed givens rotation. The performance of QR decomposition hardware considerably increases compared to the conventional triangular systolic array (TSA) architecture. Moreover, the circuit area of QR decomposition hardware was reduced by decreasing the number of flip-flops for holding the pre-computed results during the decomposition process. The proposed QR decomposition hardware was implemented using TSMC $0.25{\mu}m$ technology. The experimental results show that the proposed architecture achieves up to 70 % speed-up over the TACR/TSA-based architecture for the $8{\times}8$ matrix decomposition.

Bit Operation Optimization and DNN Application using GPU Acceleration (GPU 가속기를 통한 비트 연산 최적화 및 DNN 응용)

  • Kim, Sang Hyeok;Lee, Jae Heung
    • Journal of IKEEE
    • /
    • v.23 no.4
    • /
    • pp.1314-1320
    • /
    • 2019
  • In this paper, we propose a new method for optimizing bit operations and applying them to DNN(Deep Neural Network) in software environment. As a method for this, we propose a packing function for bitwise optimization and a masking matrix multiplication operation for application to DNN. The packing function converts 32-bit real value to 2-bit quantization value through threshold comparison operation. When this sequence is over, four 32-bit real values are changed to one 8-bit value. The masking matrix multiplication operation consists of a special operation for multiplying the packed weight value with the normal input value. And each operation was then processed in parallel using a GPU accelerator. As a result of this experiment, memory saved about 16 times than 32-bit DNN Model. Nevertheless, the accuracy was within 1%, similar to the 32-bit model.

Design of Asynchronous 16-Bit Divider Using NST Algorithm (NST알고리즘을 이용한 비동기식 16비트 제산기 설계)

  • 이우석;박석재;최호용
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.3
    • /
    • pp.33-42
    • /
    • 2003
  • This paper describes an efficient design of an asynchronous 16-bit divider using the NST (new Svoboda-Tung) algorithm. The divider is designed to reduce power consumption by using the asynchronous design scheme in which the division operation is performed only when it is requested. The divider consists of three blocks, i.e. pre-scale block, iteration step block, and on-the-fly converter block using asynchronous pipeline structure. The pre-scale block is designed using a new subtracter to have small area and high performance. The iteration step block consists of an asynchronous ring structure with 4 division steps for area reduction. In other to reduce hardware overhead, the part related to critical path is designed by a dual-rail circuit, and the other part is done by a single-rail circuit in the ring structure. The on-the-fly converter block is designed for high performance using the on-the-fly algorithm that enables parallel operation with iteration step block. The design results with 0.6${\mu}{\textrm}{m}$ CMOS process show that the divider consists of 12,956 transistors with 1,480 $\times$1,200${\mu}{\textrm}{m}$$^2$area and average-case delay is 41.7㎱.

Photo-Sensorless Solar Tracking System based on Modular Structure and IoT Technology (모듈화 구조와 IoT 기반의 광센서리스 태양광 추적 시스템)

  • Kim, Dae-Won;Kim, Jeong-Tae;Chung, Gyo-Bum
    • Journal of IKEEE
    • /
    • v.24 no.2
    • /
    • pp.392-402
    • /
    • 2020
  • This paper proposes a solar tracking system without photo-sensors. The system can be classified into four modules: Solar Tracking, MPPT, ESS, and Real-Time Monitoring. Nine solar panels, as a basic unit, are adopted with grid structures of different heights to reduce wind influence and to enable solar tracking without photo-sensors. The low-cost MCU implements MPPT method which generates PWM switching signal for boost converter. The unit of ESS consists of three-series and four-parallel lithium-ion batteries in order to enable monitoring for abnormalities in temperature and electrical characteristics of battery. Four MCUs used in the system consists of two AVR Atmega128, and two Raspberry PI, and they exchanges operation informations. Experimental results of the proposed system show the solar tracking performance, the possibility of on-site and remote monitoring and the convenience of maintenance based on IoT technology.

A New Asynchronous Pipeline Architecture for CISC type Embedded Micro-Controller, A8051 (CISC 임베디드 컨트롤러를 위한 새로운 비동기 파이프라인 아키텍쳐, A8051)

  • 이제훈;조경록
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.4
    • /
    • pp.85-94
    • /
    • 2003
  • The asynchronous design methods proved to have the higher performance in power consumption and execution speed than synchronous ones because it just needs to activate the required module without feeding clock in the system. Despite the advantage of CISC machine providing the variable addressing modes and instructions, its execution scheme is hardly suited for a synchronous Pipeline architecture and incurs a lot of overhead. This paper proposes a novel asynchronous pipeline architecture, A80sl, whose instruction set is fully compatible with that of Intel 80C51, an embedded micro controller. We classify the instructions into the group keeping the same execution scheme for the asynchronous pipeline and optimize it eliminating the bubble stage that comes from the overhead of the multi-cycle execution. The new methodologies for branch and various instruction lengths are suggested to minimize the number of states required for instructions execution and to increase its parallelism. The proposed A80C51 architecture is synthesized with 0.35${\mu}{\textrm}{m}$ CMOS standard cell library. The simulation results show higher speed than that of Intel 80C51 with 36 MHz and other asynchronous counterparts by 24 times.