• Title/Summary/Keyword: Recursion

Search Result 103, Processing Time 0.031 seconds

An Efficient Evaluation of Proof-theoretic meaning for Normalized Recursive Rules using Shared-nothing Parallel Architecture (비공유 병렬구조를 이용한 정규화된 재귀규칙에 대한 증명-이론적 의미의 효율적 계산)

  • Cho, Woo-Hyun;Lee, Jong-Hee
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.11
    • /
    • pp.2981-2988
    • /
    • 1999
  • A deductive database consists of facts being the extensional database and rules being the intensional database. Because of the difficulty of evaluating rules, many parallel evaluation algorithms for rules have been presented. But we have not gotten an acceptable result. This paper proposes a new methodology to evaluate proof-theoretic meaning of the linear recursion rule which contains transitive dependency by using a shared-nothing parallel architecture. As first, we prove that there exists the equivalent expression for a linear recursion rule, design the algorithm for evaluating the linear recursion rule based on the equivalent expression, and finally analyse performance of the proposed algorithm.

  • PDF

A Covariance Type ARMA Fast Transversal Filter (공분산형 ARMA 고속 Transversal 필터에 관한 연구)

  • Lee, Chul-Heui;Jang, Young-Soo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.11 no.1
    • /
    • pp.67-79
    • /
    • 1992
  • For effective on-line ARMA parameter estimation, a covariance type ARMA fast transversal filter (FTF) algorithm is presented. The proposed algorithm is a covariance type implementation of ELS(Extended Least Squares) estimator and it is a fast time update recursion which is based on the fact that the correlation matrix of ARMA model satisfies the shift invariance property in each sub-block. The geometric approach is used in the derivation of the proposed algorithm. It takes small computational burden of 13N+37 MADPR(Multiplication And Division Per Recursion). Also, AR and MA orders can be independetly and arbitrarily specified.

  • PDF

Motion Estimation and Compensation based on Advanced DCT (변환 영역에서 개선된 DCT를 기반으로 한 움직임 예측 및 보상)

  • Jang, Young;Cho, Hyo-Moon;Cho, Sang-Bock
    • Proceedings of the KIEE Conference
    • /
    • 2007.04a
    • /
    • pp.38-40
    • /
    • 2007
  • In this paper, we propose a novel architecture, which is based on DCT (Discrete Cosine Transform), for ME (Motion Estimation) and MC (Motion Compensation). The traditional algorithms of ME and MC based on DCT did not suffer the advantage of the coarseness of the 2-dimensional DCT (2-D DCT) coefficients to reduce the operational time. Therefore, we derive a recursion equation for transform-domain ME and MC and design the structure by using highly regular, parallel, and pipeline processing elements. The main difference with others is removing the IDCT block by using to transform domain. Therefore, the performance of our algorithm is more efficient in practical image processing such as DVR (Digital Video Recorder) system. We present the simulation result which is compare with the spatial domain methods. it shows reducing the calculation cost. compression ratio. and peak signal to noise ratio (PSNR).

  • PDF

The Effects of Recursion in Problem-Solving Processes on the Problem-Solving Time : a Simulation Study (문제해결과정의 단계별 회귀가 문제해결시간에 미치는 영향에 관한 연구)

  • 손달호;최무진
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.19 no.1
    • /
    • pp.53-67
    • /
    • 1994
  • Over the last decades, interest in the application of decision support systems (DSS) in organizations has increased rapidly. Despite the growing number of investigations exmaining decision support system, relatively few empirical studies have evaluated the effects of DSS on problem-solving processes. This study examined, using a computer simulation technique, the effects of recursion in problem-solving processes on the problem-solving time. Results indicate that the recursions at the early stage of problem-solving processes scarcely influenced the problem-solving time, which is contrasted with the case of the recursions at the final stage.

  • PDF

Self-consistent electronic structure of impurities using the recursion method

  • Park, Jin-Ho;Cho, Hwa-Suck;Lee, Gun-Woo
    • Journal of Korean Vacuum Science & Technology
    • /
    • v.2 no.1
    • /
    • pp.13-19
    • /
    • 1998
  • We have calculated the electronic structure of impurity atoms in metal host by using the tight binding model in the recursion method. For a self-consistent calculation, we assumed that the effect of impurity introduction was localized only at the impurity site and its neighbours. We calculated the Madelung term by limiting the contribution to Vm of the charge perturbations to the first shell around the impurity with Evjen technique. The calculated local density of states and charge transfer values have been compared with the experimental values for a single impurity in metal host. We fund that d-reso-nance state came from the repulsive interaction between impurity d-state and host band, and the position of d-resonance state depended on the difference of valence electrons between the host and the impurity. the results also showed that the charge transfer value between an impurity and host metal was comparable to the ionicity difference between them.

Overlap Integrals and Recoursion Formulas for Morse Wavefunction

  • Lee, Mu-Sang;Carreira, L.A.;Berkowitz, D.A.
    • Bulletin of the Korean Chemical Society
    • /
    • v.7 no.1
    • /
    • pp.6-12
    • /
    • 1986
  • Overlap integrals for the case in which the ground and excited states are represented by Morse potential functions were derived. In order to calculate the spectral intensities in Morse wavefunctions, a method of expanding the wavefunctions of one state in terms of the other was developed to allow the ground and the excited state frequencies to be different. From the expansion of Morse wavefunctions, recursion formulas were developed for variational matrix elements of Morse wavefunctions. The matrix elements can be calculated using these recursion formulas and the diagonalized results which eigenvalues (allowed energies) were all successfully satisfied to Morse energy formulas.

RECURSIONS FOR TRACES OF SINGULAR MODULI

  • Kim, Chang Heon
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.21 no.2
    • /
    • pp.183-188
    • /
    • 2008
  • We will derive recursion formulas satisfied by the traces of singular moduli for the higher level modular function.

  • PDF

Design of a Lossless Audio Coding Using Cholesky Decomposition and Golomb-Rice Coding (콜레스키 분해와 골롬-라이스 부호화를 이용한 무손실 오디오 부호화기 설계)

  • Cheong, Cheon-Dae;Shin, Jae-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.11
    • /
    • pp.1480-1490
    • /
    • 2008
  • Design of a linear predictor and matching of an entropy coder is the art of lossless audio coding. In this paper, we use the covariance method and the Choleskey decomposition for calculating linear prediction coefficients instead of the autocorreation method and the Levinson-Durbin recursion. These results are compared to the polynomial predictor. Both of them, the predictor which has small prediction error is selected. For the entropy coding, we use the Golomb-Rice coder using the block-based parameter estimation method and the sequential adaptation method with LOCO-land RLGR. The proposed predictor and the block-based parameter estimation have $2.2879%{\sim}0.3413%$ improved compression ratios compared to FLAC lossless audio coder which use the autocorrelation method and the Levinson-Durbin recursion. The proposed predictor and the LOCO-I adaptation method could improved by $2.2879%{\sim}0.3413%$. But the proposed predictor and the RLGR adaptation method got better results with specific signals.

  • PDF