• Title/Summary/Keyword: implementation algorithm

Search Result 4,233, Processing Time 0.033 seconds

A Study on the Implementation of an Intelligent Tutoring System (지능형 튜터링 시스템 실행에 관한 연구)

  • 임기영;김형래
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.9
    • /
    • pp.1372-1377
    • /
    • 1990
  • We constructed an intelligent tutoring system that compose four devices i.e. intelligent interface, acqusition module, tutoring controller and tutorial knowledge. We implemented the intelligent tutoring system using prolog as an authoring language in the ultrix os under VAX-11/750, and we propose goal opriented tutoring system algorithm.

  • PDF

Implementation ECC algorithm over GF(2$^m$) with Java (GF(2$^m$)상의 타원곡선 암호 시스템의 객체지향적 설계 및 구현)

  • 이항록;류희수
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04a
    • /
    • pp.434-436
    • /
    • 2003
  • 본 논문에서는 디자인패턴 개념을 이용하여 GF(2$^{m}$ )상에서의 타원곡선 암호알고리즘을 객체지향적으로 설계하는 방법에 대해서 논해보고, 이틀 이용하여 타원곡선 암호 라이브러리 구현에 핵심이 되는 연산 클래스에 대한 전체적인 framework 및 UML을 제시한다.

  • PDF

IDEA Implementation On TMS320C54X DSP Board (TMS320C54X DSP 보드를 이용 IDEA의 구현)

  • 송종관;윤병우;류대현
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 1998.05a
    • /
    • pp.377-382
    • /
    • 1998
  • 본 논문에서는 암호화 알고리즘인 IDEA(International Data Encryption Algorithm)를 분석하고 TMS320C542 EVM 보드에서 어셈블리 언어로 구현하였다. 또한 수행 속도에 매우 큰 영향을 미치는 핵심 연산인 모듈러 곱셈 연산에 대한 고속 알고리즘을 채택하여 속도 개선을 이루었다.

  • PDF

Fast Multi-Reference Frame Motion Estimation Algorithm Using a Relation of Motion Vector with Distance of Each Reference Frame (움직임 벡터와 참조 프레임간의 거리를 이용한 고속 다중 참조 프레임 움직임 추정)

  • Byun, Ju-Won;Choi, Jin-Ha;Kim, Jae-Seok
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.2
    • /
    • pp.69-76
    • /
    • 2010
  • This paper proposed a new fast multi-reference frame motion estimation algorithm. The proposed algorithm reduces search areas of motion estimation using a linear relation of motion vector with distance of each reference frame. New algorithm executes full search area motion estimation in reference frame 0 and reference frame 1. After that, search areas in reference frame 2, reference frame 3 and reference frame 4 are minimized by distance of each reference frame and results of motion estimation in reference frame 0 and reference frame 1. The proposed algorithm does not use a threshold value which is obstacle of hardware implementation and processing time schedule. Also, it reduced computation quantity of multi-reference motion estimation. Hardware implementation of multi-reference frame motion estimation is possible by these features. Simulation results show that PSNR drop and bitrate increase of proposed algorithm are lower than those of previous fast multi-reference frame motion estimation algorithm The number of computation of new algorithm is reduced 52.5% and quality of result is negligible when compared with full search area motion estimation which has 5 reference frames.

Fast Algorithm for Constructing Wavelet Packet Bases Yielding the Maximum Coding Gain (최대 부호화 이득을 내는 웨이블릿 기저를 구축하기 위한 고속 알고리즘)

  • Kim, Won-Ha
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.38 no.2
    • /
    • pp.16-26
    • /
    • 2001
  • This paper develops the fast dynamic programming technique to construct the subband structure yielding the maximum coding gain for given filter bases and a given limit of implementation complexity. We first derive the unified coding gain which can be applied to non-orthogonal filter basis as well as orthogonal filter basis and to arbitrary subband decompositions. Then, we verify that the unified coding gains in real systems are monotonically increasing function for the implementation complexities which are proportional to the number of subbands. By using this phenomenon, the implementation complexity and the coding gain are treated in the same way as the rate and distortion function. This makes it possible to use the Lagrangian multiplier method for finding the optimal subband decomposition producing the maximum coding gain [or a given limit of implementation complexity.

  • PDF

Implementation of Optimal Flicker Free Display Controller for LED Display System (LED 디스플레이 시스템을 위한 최적의 플리커 프리 디스플레이 제어장치 구현)

  • Lee, Juyeon;Kim, Daesoon;Lee, Jongha
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.6
    • /
    • pp.123-133
    • /
    • 2017
  • In this paper, we developed an optimal flicker-free control algorithm operating within 16 luminance implementation bits and 512 brightness implementation pulses irrespective of LPM(LED Pixel Matrix) module configuration on dynamic driving method of LED display system. As an implementation method, we turned the refresh rate up by increasing the number of scans through multiple shift-latches which were devised from conventional shift-latch scheme for full color representation. As a result, the LED display system of this method has no flicker phenomenon because of the novel refresh rate higher than 2,040[Hz] incomparable to 240~480[Hz] of conventional system.