• The Journal of the Acoustical Society of Korea
• /
• 제16권2E호
• /
• pp.38-46
• /
• 1997

The objective of the paper is to compare the computational complexity of five algorithms for computing time-domain second-order Volterra filter outputs in terms of number of real multiplication and addition operations required for implementation. This study shows that if the filter memory length is greater that or equal to 16, the fast algorithm using the overlap-save method and the frequency-domain symmetry properties of the quadratic coefficients is the most efficient among the algorithms investigated in this paper, When the filter memory length is less than 16, the algorithm using the time-domain symmetry properties is better than any other algorithm.

• 한국멀티미디어학회논문지
• /
• 제21권8호
• /
• pp.813-820
• /
• 2018

This paper proposes new frame rate up-conversion algorithms. Adaptive motion estimation based on block complexity information are used to obtain more accurate motion vectors. Because the information on block complexity is extracted from the motion estimation prediction size from the original frame, additional computational complexity is not imparted. In experimental results, the proposed algorithms provide robust frame interpolation performance for whole test sequences. Also, the computational complexity of the proposed algorithm is reduced to a benchmark algorithm.

• 한국자동차공학회논문집
• /
• 제19권4호
• /
• pp.84-90
• /
• 2011

In active noise control filter, LMS algorithms which used for control filter, assure the convergence property, and computational burden of these algorithms are proportionate to the filter taps. The convergence speed of LMS algorithms is mainly determined by value of the convergence coefficient, so optimal selection of the value of convergence coefficient is very important. In this paper, We proposed novel adaptive fuzzy logic LMS algorithms with FIR filter structure which has better convergence speed and less computational burden than conventional LMS algorithms, for single channel active noise control with ill conditioned signal case. Computer simulations were performed to show the effectiveness of a proposed algorithms.

• 전기전자학회논문지
• /
• 제6권2호
• /
• pp.111-118
• /
• 2002

본 논문은 가변 스텝사이즈 LMS (Least Mean Square) 알고리듬의 스텝사이즈 결정시 추가되는 계산량을 줄이기 위해 가변 블록을 사용하는 방법을 제안한다. 이 방법에서는 블록 길이를 스텝사이즈의 변화에 반비례하도록 하여 기존의 가변 스텝사이즈 알고리듬의 수렴속도와 정상상태 오차에 대해 성능의 저하 없이 계산량을 줄이고자 한다. 그리고 평균이 영인 백색 가우시안 입력신호 환경하에서 LMS 기반 적응 알고리듬의 초기 스텝사이즈를 최적으로 구하는 방법을 제안한다. 제안한 방법의 우수성을 입증하기 위한 컴퓨터 모의 실험을 통해 기존의 가변 스텝사이즈 알고리듬과 수렴속도, 계산량 면에서 성능을 평가한다.

• Journal of applied mathematics & informatics
• /
• 제12권1_2호
• /
• pp.375-384
• /
• 2003

We introduce some algorithms for computing Mathematics and also give some questions based on the results from computations using CoCoA and Splus.

• Journal of Multimedia Information System
• /
• 제8권3호
• /
• pp.191-196
• /
• 2021

Computational thinking refers to the process and method of solving everyday problems using computers. When teaching a computational thinking class for computer majors and non-majors at university, the easiest example to deliver the concept of computational thinking is sorting. Sorting is the concept of arranging given data in order. In this work, we have implemented four visualized sorting algorithms that anyone can easily use. In particular, it helps to understand the difference between the algorithms by showing the number of comparisons and exchanges between elements, which are the criteria for evaluating the performance of the sorting algorithm in real time. It was confirmed that the practice of using the sorting visualization app developed in this research contributed to the improvement of students' understanding of computational thinking.

• Journal of applied mathematics & informatics
• /
• 제7권2호
• /
• pp.439-451
• /
• 2000

To compute derivatives using matrix vector multiplication method, new algorithms were introduced in [1.2]n By these algorithms, we reduced roundoff error in computing derivative using Chebyshev collocation methods (CCM). In this paper, some applications of these algorithms ar presented.

• Journal of applied mathematics & informatics
• /
• 제15권1_2호
• /
• pp.393-404
• /
• 2004

We introduce several algorithms for adding up Artinian O-sequences to obtain the maximal possible Betti numbers among all minimal free resolutions with the given Hilbert function. Moreover, we give open questions based on the outputs using those algorithms.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2006년도 정기 학술대회 논문집
• /
• pp.535-540
• /
• 2006

Recently, the resizing algorithms based on the displacement participation factors have been developed for sizing members to satisfy stiffness criteria. It is proved that this resizing algorithms made for utilizing worker's stiffness design are practical and rational when applied to aseismatic design in the range of elastic until now. However, by the preceding research we confirmed that the inelastic performance of steel moment-resisting frame designed by resizing algorithms is not better than that of the frame before resizing. We present therefore a plan for improving inelastic performance of steel moment-resizing frame to which resizing algorithms applied in this paper.

• Journal of applied mathematics & informatics
• /
• 제15권1_2호
• /
• pp.53-75
• /
• 2004

First, we present two classes of sequential algorithms for minimum flow problem: decreasing path algorithms and preflow algorithms. Then we describe another approach of the minimum flow problem, that consists of applying any maximum flow algorithm in a modified network. In section 5 we present several parallel preflow algorithms that solve the minimum flow problem. Finally, we present an application of the minimum flow problem.