• Title/Summary/Keyword: Real time computation

Search Result 852, Processing Time 0.035 seconds

A Study on the Reduction of LSP(Line Spectrum Pair) Transformation Time in Speech Coder for CDMA Digital Cellular System (이동통신용 음성부호화기에서의 LSP 계산시간 감소에 관한 연구)

  • Min, So-Yeon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.8 no.3
    • /
    • pp.563-568
    • /
    • 2007
  • We propose the computation reduction method of real root method that is used in the EVRC(Enhanced Variable Rate Codec) system. The real root method is that if polynomial equations have the real roots, we are able to find those and transform them into LSP. However, this method takes much time to compute, because the root searching is processed sequentially in frequency region. But, the important characteristic of LSP is that most of coefficients are occurred in specific frequency region. So, to reduce the computation time of real root, we used the met scale that is linear below 1kHz and logarithmic above. In order to compare real root method with proposed method, we measured the following two. First, we compared the position of transformed LSP(Line Spectrum Pairs) parameters in the proposed method with these of real root method. Second, we measured how long computation time is reduced. The experimental result is that the searching time was reduced by about 48% in average without the change of LSP parameters.

  • PDF

A Study on the Realization of Korean Digits Recognition System Using the Simplified DTW Method (간소화된 DTW방식을 이용한 한국어 숫자음 인식기 구현에 관한 연구)

  • 안병수
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1992.06a
    • /
    • pp.66-70
    • /
    • 1992
  • This paper describes the simplified DTW algorithm for real time korean digit recognition and construct the digit recognition system using that algorithm. The DTW algorithm which is used nowadays have problems on real time recognition because of its massive computation. But, simplified DTW algorithm, which is proposed in this paper, solved these problems. In the case of single syllable, we use the characteristic of uniform distribution of epansion and contraction on time ais, compare distance of input pattern and reference pattern using constrainedly restricted path. As a result, we can reduce a great deal of computation and achieved that the real time korean digit recognition system.

  • PDF

A Propagation Programming Neural Network for Real-time matching of Stereo Images (스테레오 영상의 실시간 정합을 위한 보간 신경망 설계)

  • Kim, Jong-Man
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2003.05c
    • /
    • pp.194-199
    • /
    • 2003
  • Depth error correction effect for maladjusted stereo cameras with calibrated pixel distance parameter is presented. The proposed neural network technique is the real time computation method based theory of inter-node diffusion for searching the safety distances from the sudden appearance-objects during the work driving. The main steps of the distance computation using the theory of stereo vision like the eyes of man is following steps. One is the processing for finding the corresponding points of stereo images and the other is the interpolation processing of full image data from nonlinear image data of objects. All of them request much memory space and time. Therefore the most reliable neural-network algorithm is derived for real-time matching of objects, which is composed of a dynamic programming algorithm based on sequence matching techniques.

  • PDF

Real-time and Power Hardware-in-the-loop Simulation of PEM Fuel Cell Stack System

  • Jung, Jee-Hoon
    • Journal of Power Electronics
    • /
    • v.11 no.2
    • /
    • pp.202-210
    • /
    • 2011
  • Polymer electrolyte membrane (PEM) fuel cell is one of the popular renewable energy sources and widely used in commercial medium power areas from portable electronic devices to electric vehicles. In addition, the increased integration of the PEM fuel cell with power electronics, dynamic loads, and control systems requires accurate electrical models and simulation methods to emulate their electrical behaviors. Advancement in parallel computation techniques, various real-time simulation tools, and smart power hardware have allowed the prototyping of novel apparatus to be investigated in a virtual system under a wide range of realistic conditions repeatedly, safely, and economically. This paper builds up advancements of optimized model constructions for a fuel cell stack system on a real-time simulator in the view points of improving dynamic model accuracy and boosting computation speed. In addition, several considerations for a power hardware-in-the-loop (PHIL) simulation are provided to electrically emulate the PEM fuel cell stack system with power facilities. The effectiveness of the proposed PHIL simulation method developed on Opal RT's RT-Lab Matlab/Simulink based real-time engineering simulator and a programmable power supply is verified using experimental results of the proposed PHIL simulation system with a Ballard Nexa fuel cell stack.

Dynamic ATC Computation for Real-Time Power Markets

  • Venkaiah, Ch.;Kumar, D.M. Vinod;Murali, K.
    • Journal of Electrical Engineering and Technology
    • /
    • v.5 no.2
    • /
    • pp.209-219
    • /
    • 2010
  • In this paper, a novel dynamic available transfer capability (DATC) has been computed for real time applications using three different intelligent techniques viz. i) back propagation algorithm (BPA), ii) radial basis function (RBF), and iii) adaptive neuro fuzzy inference system (ANFIS) for the first time. The conventional method of DATC is tedious and time consuming. DATC is concerned with calculating the maximum increase in point to point transfer such that the transient response remains stable and viable. The ATC information is to be continuously updated in real time and made available to market participants through an internet based Open Access Same time Information System (OASIS). The independent system operator (ISO) evaluates the transaction in real time on the basis of DATC information. The dynamic contingency screening method [1] has been utilized and critical contingencies are selected for the computation of DATC using the energy function based potential energy boundary surface (PEBS) method. The PEBS based DATC has been utilized to generate patterns for the intelligent techniques. The three different intelligent methods are tested on New England 68-bus 16 machine and 39-bus 10 machine systems and results are compared with the conventional PEBS method.

Stochastic Power-efficient DVFS Scheduling of Real-time Tasks on Multicore Processors with Leakage Power Awareness (멀티코어 프로세서의 누수 전력을 고려한 실시간 작업들의 확률적 저전력 DVFS 스케쥴링)

  • Lee, Kwanwoo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.4
    • /
    • pp.25-33
    • /
    • 2014
  • This paper proposes a power-efficient scheduling scheme that stochastically minimizes the power consumption of real-time tasks while meeting their deadlines on multicore processors. In the proposed scheme, uncertain computation amounts of given tasks are translated into probabilistic computation amounts based on their past completion amounts, and the mean power consumption of the translated probabilistic computation amounts is minimized with a finite set of discrete clock frequencies. Also, when system load is low, the proposed scheme activates a part of all available cores with unused cores powered off, considering the leakage power consumption of cores. Evaluation shows that the scheme saves up to 69% power consumption of the previous method.

Heterogeneous Computation on Mobile Processor for Real-time Signal Processing and Visualization of Optical Coherence Tomography Images

  • Aum, Jaehong;Kim, Ji-hyun;Dong, Sunghee;Jeong, Jichai
    • Current Optics and Photonics
    • /
    • v.2 no.5
    • /
    • pp.453-459
    • /
    • 2018
  • We have developed a high-performance signal-processing and image-rendering heterogeneous computation system for optical coherence tomography (OCT) on mobile processor. In this paper, we reveal it by demonstrating real-time OCT image processing using a Snapdragon 800 mobile processor, with the introduction of a heterogeneous image visualization architecture (HIVA) to accelerate the signal-processing and image-visualization procedures. HIVA has been designed to maximize the computational performances of a mobile processor by using a native language compiler, which targets mobile processor, to directly access mobile-processor computing resources and the open computing language (OpenCL) for heterogeneous computation. The developed mobile image processing platform requires only 25 ms to produce an OCT image from $512{\times}1024$ OCT data. This is 617 times faster than the naïve approach without HIVA, which requires more than 15 s. The developed platform can produce 40 OCT images per second, to facilitate real-time mobile OCT image visualization. We believe this study would facilitate the development of portable diagnostic image visualization with medical imaging modality, which requires computationally expensive procedures, using a mobile processor.

Efficient Solving Methods Exploiting Sparsity of Matrix in Real-Time Multibody Dynamic Simulation with Relative Coordinate Formulation

  • Choi, Gyoojae;Yoo, Yungmyun;Im, Jongsoon
    • Journal of Mechanical Science and Technology
    • /
    • v.15 no.8
    • /
    • pp.1090-1096
    • /
    • 2001
  • In this paper, new methods for efficiently solving linear acceleration equations of multibody dynamic simulation exploiting sparsity for real-time simulation are presented. The coefficient matrix of the equations tends to have a large number of zero entries according to the relative joint coordinate numbering. By adequate joint coordinate numbering, the matrix has minimum off-diagonal terms and a block pattern of non-zero entries and can be solved efficiently. The proposed methods, using sparse Cholesky method and recursive block mass matrix method, take advantages of both the special structure and the sparsity of the coefficient matrix to reduce computation time. The first method solves the η$\times$η sparse coefficient matrix for the accelerations, where η denotes the number of relative coordinates. In the second method, for vehicle dynamic simulation, simple manipulations bring the original problem of dimension η$\times$η to an equivalent problem of dimension 6$\times$6 to be solved for the accelerations of a vehicle chassis. For vehicle dynamic simulation, the proposed solution methods are proved to be more efficient than the classical approaches using reduced Lagrangian multiplier method. With the methods computation time for real-time vehicle dynamic simulation can be reduced up to 14 per cent compared to the classical approach.

  • PDF

A Dynamic Programming Neural Network to find the Safety Distance of Industrial Field (산업 현장의 안전거리 계측을 위한 동적 계획 신경회로망)

  • Kim, Jong-Man;Kim, Won-Sub;Kim, Yeong-Min;Hwang, Jong-Sun;Park, Hyun-Chul
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2001.09a
    • /
    • pp.23-27
    • /
    • 2001
  • Making the safety situation from the various work system is very important in the industrial fields. The proposed neural network technique is the real titre computation method based theory of inter-node diffusion for searching the safety distances from the sudden appearance-objests during the work driving. The main steps of the distance computation using the theory of stereo vision like the eyes of man is following steps. One is the processing for finding the corresponding points of stereo images and the other is the interpolation processing of full image data from nonlinear image data of obejects. All of them request much memory space and titre. Therefore the most reliable neural-network algorithm is drived for real time recognition of obejects, which is composed of a dynamic programming algorithm based on sequence matching techniques. And the real time reconstruction of nonlinear image information is processed through several simulations. I-D LIPN hardware has been composed, and the real time reconstruction is verified through the various experiments.

  • PDF

A Adaptive Motion Estimation Using Spatial correlation and Slope of Motion vector for Real Time Processing and Its Architecture (실시간 적응형 Motion Estimation 알고리듬 및 구조 설계)

  • 이준환;김재석
    • Proceedings of the IEEK Conference
    • /
    • 2000.11d
    • /
    • pp.57-60
    • /
    • 2000
  • This paper presents a new adaptive fast motion estimation algorithm along with its architecture. The conventional algorithm such as full - search algorithm, three step algorithm have some disadvantages which are related to the amount of computation, the quality of image and the implementation of hardware, the proposed algorithm uses spatial correlation and a slope of motion vector in order to reduce the amount of computation and preserve good image quality, The proposed algorithm is better than the conventional Block Matching Algorithm(BMA) with regard to the amount of computation and image quality. Also, we propose an efficient at chitecture to implement the proposed algorithm. It is suitable for real time processing application.

  • PDF