• Title/Summary/Keyword: Execution error

Search Result 188, Processing Time 0.027 seconds

Fuzzy Logic PID controller based on FPGA

  • Tipsuwanporn, V.;Runghimmawan, T.;Krongratana, V.;Suesut, T.;Jitnaknan, P.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.1066-1070
    • /
    • 2003
  • Recently technologies have created new principle and theory but the PID control system remains its popularity as the PID controller contains simple structure, including maintenance and parameter adjustment being so simple. Thus, this paper proposes auto tune PID by fuzzy logic controller based on FPGA which to achieve real time and small size circuit board. The digital PID controller design to consist of analog to digital converter which use chip TDA8763AM/3 (10 bit high-speed low power ADC), digital to analog converter which use two chip DAC08 (8 bit digital to analog converters) and fuzzy logic tune digital PID processor embedded on chip FPGA XC2S50-5tq-144. The digital PID processor was designed by fundamental PID equation which architectures including multiplier, adder, subtracter and some other logic gate. The fuzzy logic tune digital PID was designed by look up table (LUT) method which data storage into ROM refer from trial and error process. The digital PID processor verified behavior by the application program ModelSimXE. The result of simulation when input is units step and vary controller gain ($K_p$, $K_i$ and $K_d$) are similarity with theory of PID and maximum execution time is 150 ns/action at frequency are 30 MHz. The fuzzy logic tune digital PID controller based on FPGA was verified by control model of level control system which can control level into model are correctly and rapidly. Finally, this design use small size circuit board and very faster than computer and microcontroller.

  • PDF

A Study on the Preprocessing Method Using Construction of Watershed for Character Image segmentation

  • Nam Sang Yep;Choi Young Kyoo;Kwon Yun Jung;Lee Sung Chang
    • Proceedings of the IEEK Conference
    • /
    • 2004.08c
    • /
    • pp.814-818
    • /
    • 2004
  • Off-line handwritten character recognition is in difficulty of incomplete preprocessing because it has not dynamic and timing information besides has various handwriting, extreme overlap of the consonant and vowel and many error image of stroke. Consequently off-line handwritten character recognition needs to study about preprocessing of various methods such as binarization and thinning. This paper considers running time of watershed algorithm and the quality of resulting image as preprocessing For off-line handwritten Korean character recognition. So it proposes application of effective watershed algorithm for segmentation of character region and background region in gray level character image and segmentation function for binarization image and segmentation function for binarization by extracted watershed image. Besides it proposes thinning methods which effectively extracts skeleton through conditional test mask considering running time and quality. of skeleton, estimates efficiency of existing methods and this paper's methods as running time and quality. Watershed image conversion uses prewitt operator for gradient image conversion, extracts local minima considering 8-neighborhood pixel. And methods by using difference of mean value is used in region merging step, Converted watershed image by means of this methods separates effectively character region and background region applying to segmentation function. Average execution time on the previous method was 2.16 second and on this paper method was 1.72 second. We prove that this paper's method removed noise effectively with overlap stroke as compared with the previous method.

  • PDF

A Study on Japan's Policies on Vacant Houses - Based on Saga city and Arita cho in Saga prefecture - (일본의 빈집대책 정책방향 조사 연구 - 사가현(佐賀縣) 사가시(佐賀市) 및 아리타초(有田町)를 중심으로 -)

  • Park, Heon-Choon;Park, Jae-Yob;GOTO, Ryutaro
    • Journal of the Korean Institute of Rural Architecture
    • /
    • v.19 no.2
    • /
    • pp.1-8
    • /
    • 2017
  • The purpose of this study is to examine the policy direction and execution plans of the Japanese central and local governments for the use of vacant houses after the enactment of the "Special Act on Vacant Houses." It also seeks to provide suggestions for establishing vacant house policies in Korea by identifying the characteristics of the Japanese policies, and to suggest policy alternatives that can contribute to environmental improvement and regional revitalization through the use of vacant houses. For this purpose, we examined Japan's "Special Act on Vacant Houses," the process of establishing vacant house policies in the Japanese central and local governments, and the contents and direction of these policies. Below are the results of this study. First, the Japanese government revised mid to long-term policies related to housing after the enactment of the "Special Act on Vacant Houses", thereby providing ground for local governments to establish vacant house policies. Second, the government actively supported the operation and funding of related associations so that the private sector rather than the public sector could address vacant house problems. Third, the government subsidized administrative expenses such as cost of finding vacant house owners to prevent neglect of vacant houses, and showed its will to address vacant house problems by revising taxes such as property taxes and transfer income taxes. Fourth, the government has enacted distinct ordinances for each local government and made it possible to perform customized policies such as allowing residents and local stakeholders to participate in the establishment of vacant house policies. Fifth, the government made it possible to manage vacant houses efficiently by allowing the vacant house bank to provide all information related to the use of vacant houses. It is necessary for Korea's central and local governments to refer to these precedent cases and create efforts to reduce trial and error when establishing vacant house policies.

Recognition of Basic Motions for Figure Skating using AHRS (AHRS를 이용한 피겨스케이팅 기본 동작 인식)

  • Kwon, Ki-Hyeon;Lee, Hyung-Bong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.3
    • /
    • pp.89-96
    • /
    • 2015
  • IT is widely used for biomechanics and AHRS sensor also be highlighted with small sized characteristics and price competitiveness in the field of motion measurement and analysis of sports. In this paper, we attach the AHRS to the figure skate shoes to measure the motion data like spin, forward/backward, jump, in/out edge and toe movement. In order to reduce the measurement error, we have adopted the sensors equipped with Madgwick complementary filtering and also use Euler angle to quaternion conversion to reduce the Gimbal-lock effect. We test and experiment the accuracy and execution time of the pattern recognition algorithms like PCA, ICA, LDA, SVM to show the recognition possibility of it on the basic motions of figure skating from the 9-axis trajectory information which is gathered from AHRS sensor. From the result, PCA, ICA have low accuracy, but LDA, SVM have good accuracy to use for recognition of basic motions of figure skating.

Power Prediction of Mobile Processors based on Statistical Analysis of Performance Monitoring Events (성능 모니터링 이벤트들의 통계적 분석에 기반한 모바일 프로세서의 전력 예측)

  • Yun, Hee-Sung;Lee, Sang-Jeong
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.7
    • /
    • pp.469-477
    • /
    • 2009
  • In mobile systems, energy efficiency is critical to extend battery life. Therefore, power consumption should be taken into account to develop software in addition to performance, Efficient software design in power and performance is possible if accurate power prediction is accomplished during the execution of software, In this paper, power estimation model is developed using statistical analysis, The proposed model analyzes processor behavior Quantitatively using the data of performance monitoring events and power consumption collected by executing various benchmark programs, And then representative hardware events on power consumption are selected using hierarchical clustering, The power prediction model is established by regression analysis in which the selected events are independent variables and power is a response variable, The proposed model is applied to a PXA320 mobile processor based on Intel XScale architecture and shows average estimation error within 4% of the actual measured power consumption of the processor.

An Improved Fractal Color Image Decoding Based on Data Dependence and Vector Distortion Measure (데이터 의존성과 벡터왜곡척도를 이용한 개선된 프랙탈 칼라영상 복호화)

  • 서호찬;정태일;류권열;권기룡;문광석
    • Journal of Korea Multimedia Society
    • /
    • v.2 no.3
    • /
    • pp.289-296
    • /
    • 1999
  • In this paper, an improved fractal color image decoding method using the data dependence parts and the vector distortion measure is proposed. The vector distortion measure exploits the correlation between different color components. The pixel in RGB color space can be considered as a 30dimensional vector with elements of RGB components. The root mean square error(rms) in RGB color for similarity measure of two blocks R and R' was used. We assume that various parameter necessary in image decoding are stored in the transform table. If the parameter is referenced in decoding image, then decoding is performed by the recursive decoding method. If the parameter is not referenced in decoding image, then the parameters recognize as the data dependence parts and store its in the memory. Non-referenced parts can be decoded only one time, because its domain informations exist in the decoded parts by the recursive decoding method. Non-referenced parts are defined the data dependence parts. Image decoding method using data dependence classifies referenced parts and non-referenced parts using information of transform table. And the proposed method can be decoded only one time for R region decoding speed than Zhang & Po's method, since it is decreased the computational numbers by execution iterated contractive transformations for the referenced range only.

  • PDF

Development of In-Plane Strength Analysis Software for Composite Laminated Structure with Parallel Processing Technique (병렬처리 기법을 이용한 복합재 적층 구조물의 면내 파손 해석 소프트웨어 개발)

  • Jung, Yeji;Choi, Soo Young;Ahn, Hyon Su;Ha, Seok Wun;Moon, Yong Ho
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.46 no.2
    • /
    • pp.133-140
    • /
    • 2018
  • In this paper, we develop an automated software for in-plane structural analysis of composite laminated structures. The developed software supports various failure criteria and reports the analysis results considering user's convenience. It also provides batch job analysis function based on parallel processing technique. To verify the performance of the software, we compared margin of safety(MS) calculated in the software to those obtained from in-house method and the specimen experiment. As a result of comparisons, there was an error of less than 0.01 in the in-house method and it is within about ${\pm}10%$ with the specimen experiment. In addition, we confirmed the improvement of execution speed of batch job analysis based on parallel processing technique.

Analysis of Programming Techniques for Creating Optimized CUDA Software (최적화된 CUDA 소프트웨어 제작을 위한 프로그래밍 기법 분석)

  • Kim, Sung-Soo;Kim, Dong-Heon;Woo, Sang-Kyu;Ihm, In-Sung
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.7
    • /
    • pp.775-787
    • /
    • 2010
  • Unlike general-purpose CPUs, the GPUs have been specialized as many-core streaming processors, and are frequently replacing the CPUs in an increasing range of computations thanks to their outstanding parallel computing capacity. In order to respond to such trend, NVIDIA has recently issued a new parallel computing architecture called CUDA(Compute Unified Device Architecture), offering a flexible GPU programming environment for GPGPU(General Purpose GPU) computing. In general, when programmers use the CUDA API, they should clearly understand many aspects of GPU's computing architecture to produce efficient parallel software. In this article, we explain several optimization techniques for CUDA programming that we have verified through a lot of experiment and trial and error, and review how those techniques affect the performance of code execution. In particular, we use a specific problem as an example to analyze several elements that affect performances, such as effective accesses to hierarchical memory system, processor occupancy, and latency hiding. In conclusion, we present several directions that may be utilized effectively in CUDA-based parallel programming.

On the Design of ToA Based RSS Compensation Scheme for Distance Measurement in WSNs (ToA 기반 RSS 보정 센서노드 거리 측정 방법)

  • Han, Hyeun-Jin;Kwon, Tae-Wook
    • The KIPS Transactions:PartC
    • /
    • v.16C no.5
    • /
    • pp.615-620
    • /
    • 2009
  • Nowadays, wireless infrastructures such as sensor networks are widely used in many different areas. In case of sensor networks, the wirelessly connected sensors can execute different kind of tasks in a diversity of environments, and one of the most important parameter for a successful execution of such tasks is the location information of each node. As to localization problems in WSNs, there are ToA (Timer of Arrival), RSS (Received Signal Strength), AoA (Angle of Arrival), etc. In this paper, we propose a modification of existing ToA and RSS based methods, adding a weighted average scheme to measure more precisely the distance between nodes. The comparison experiments with the traditional ToA method show that the average error value of proposed method is reduced by 0.1 cm in indoor environment ($5m{\times}7m$) and 0.6cm in outdoor environment ($10{\times}10m$).

Wavelet-Galerkin Scheme of Inhomogeneous Electromagnetic Problems in the time Domain

  • 정영욱;이용민;최진일;나극환;강준길;신철재
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.10 no.4
    • /
    • pp.550-563
    • /
    • 1999
  • A wavelet-Galerkin scheme based on the time-dependent Maxwell's equations is presented. Daubechies wavelet with two vanishing wavelet moments is expanded for basis function in spatial domain and Yee's leap-frog approach is applied. The shifted interpolation property of Daubechies wavelet family leads to the simplified formulations for inhomogeneous media without the additional matrices for the integral or material operator. The stability condition is formulated. The dispersion characteristics are analyzed and compared with those of finite difference time domain and multiresolution time domain methods. The analyses show the excellent trade-off between the regularity and the support width of the basis function. Although the basis function has only two vanishing wavelet moments, it is enough to provide negligible dispersive error in the numerical analysis and its compact support enables only several involved terms per nodes. The storage effectiveness, execution time reduction and accuracy of this scheme are demonstrated by calculating the resonant frequencies of the homogeneous and inhomogeneous cavities.

  • PDF