• The Journal of the Acoustical Society of Korea
• /
• v.39 no.1
• /
• pp.32-37
• /
• 2020

This paper proposes a new l₁-norm-Recursive Least Squares (RLS) algorithm which is numerically more robust than the conventional l₁-norm-RLS. The l₁-norm-RLS was proposed by Eksioglu and Tanc in order to estimate the sparse acoustic channel. However the algorithm has numerical instability in the inverse matrix calculation. In this paper, we propose a new algorithm which is robust against the numerical instability. We show that the proposed method improves stability under several numerically erroneous situations.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.10 no.2
• /
• pp.122-128
• /
• 2007

GIS is used much research for efficient forest fire management and forecasting and slope has been known as high-leverage thing in spread of forest fire specially. Various algorithms are used usually to calculate slope angle of topography from DEM(Digital elevation model). However, because spread speed of forest fire is different according to uphill slope and downhill slope, it need new slope calculation algorithm. Therefore, developed slope calculation algorithm can reflect uphill slope and forest fire spread speed of looking downhill slope.

• KIPS Transactions on Computer and Communication Systems
• /
• v.12 no.1
• /
• pp.41-46
• /
• 2023

Iterative reconstruction of CT takes a long time because projection and back-projection are alternatively repeated until taking a good image. To reduce the reconstruction time, we need a fast algorithm for calculating the projection which is a time-consuming step. In this paper, we proposed a new algorithm to calculate the line integral and the algorithm is approximately 10% faster than the well-known Siddon method (Jacobs version) and has a good image quality. Although the algorithm has been investigated for the case of parallel beams, it can be extended to the case of fan and cone beam geometries in the future.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.4 s.316
• /
• pp.101-108
• /
• 2007

Parallel processing algorithms, coupled with advanced networking and distributed computing architectures, improve the overall computational performance, dependability, and versatility of a digital signal processing system In this paper, novel parallel algorithms are introduced and investigated for advanced sonar algorithm, conventional matched-field processing (CMFP). Based on a specific domain, each parallel algorithm decomposes the sequential workload in order to obtain scalable parallel speedup. Depending on the processing requirement of the algorithm, the computational performance of the parallel algorithm reveals different characteristics. The high-complexity algorithm, CMFP shows scalable parallel performance on the array of DSP processors. The impact on parallel performance due to workload balancing, communication scheme, algorithm complexity, processor speed, network performance, and testbed configuration is explored.

• Proceedings of the KIEE Conference
• /
• 2005.11b
• /
• pp.295-297
• /
• 2005

본 논문은 Part 1 으로 배전계통의 분산형 조류계산을 위한 기본적인 수학적 모델을 제안한다. 송전계통과 비슷하게 배전계통의 조류계산은 배전계통의 실시간 모니터링과 제어를 위한 가장 유용한 도구이다. 배전계통은 지역적인 특성으로 인하여 그 구조가 변전소를 중심으로 여러 개의 주 피이드로 나누어지게 되고 이러한 변전소가 수많이 산재되어 있다. 이런 관점에서 볼때 배전계통에 대한 조류계산은 불산 조류계산(Distributed Computation of Load Flow) 알고리즘을 필요로 한다. 특히, 분산전원 출현으로 인한 이러한 필요성은 점점 증가하고 있다. 배전조류계산은 분산전원이 배전계통에 추가됨에 따라 더욱 부담이 되었다. 본 논문에서는 배전계통을 위한 분산형 조류계산 알고리즘의 구성에 필요한 기본적인 수학적 모델을 제안하고자 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.161-163
• /
• 1999

본 논문은 고정 우선순위를 가지는 주기 태스크와 동적으로 발생하는 비주기 태스크를 스케쥴링하는 방법으로 슬랙 스틸링(slack stealing) 알고리즘을 소개하고 발생되는 문제점으로부터 새로운 알고리즘을 제시한다. 기존의 실시간 스케쥴링 알고리즘을 RM 스케쥴링에 의해 할당된 주기 태스크의 우선순위가 동적으로 발생하는 비주기 태스크의 수행으로 인한 주기 태스크들간의 긴급함에 적절하게 대응하지 못하고 주기 태스크들이 자신의 제한시간을 넘길 수 있다. 이는 슬랙 스틸링(slack stealing) 알고리즘에서 슬랙 타임을 구하는 함수의 한 요소로서 주기 태스크의 필요 계산시간 값이 긴급하지 않은 상위 우선 순위 태스크의 계산시간 까지 포함하는데 있다. 따라서 제안한 확장된 실시간 스케쥴링 알고리즘은 RM 스케쥴링에 의한 스케쥴링 가능성을 위배하지 않으면서 동적으로 발생하는 비주기적 태스크로부터 긴급도의 변화에 적응할 수 있는 우선 순위 체제의 알고리즘을 제시하고, 제안한 알고리즘이 다른 실시간 알고리즘보다 성능 개선이 있음을 모의 실험을 통하여 증명한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1319-1322
• /
• 2004

스무딩은 가변 비트율로 저장된 비디오 데이터를 클라이언트로 전송할 때 일련의 고정 비트율로 전송할 수 있도록 전송 계획을 세우는 것이다. 이러한 스무딩 알고리즘에는 CBA, MCBA, MVBA, PCRTT, e-PCRTT등이 있다. 특히, PCRTT 알고리즘의 문제점을 개선한 e-PCRTT 알고리즘은 전송률 변화 횟수가 주어지고 구간의 크기가 고정적인 특징을 갖고 있어 전송률 변화 횟수, 첨두 전송률, 버퍼 이용률등의 평가 요소들이 증가될 수 있다. 따라서, 본 논문에서는 e-PCRTT 알고리즘의 문제점을 해결하기 위해 전송률 변화 횟수의 제한이 없고 구간의 크기가 가변적인 스무딩 알고리즘을 제안한다. 제안 알고리즘의 성능 평가를 위해 3개의 비디오 소스를 사용하여 전송률 변화 횟수, 첨두 전송률, 그리고 버퍼 이용률을 비교한다. 제안 알고리즘은 전송률 변화 횟수, 첨두 전송률은 e-PCRTT 알고리즘 보다 우수하고, 버퍼 이용률 비교에서는 비슷한 결과를 보인다.

• Journal of Korea Multimedia Society
• /
• v.12 no.4
• /
• pp.483-491
• /
• 2009

In this paper, we propose a fast motion estimation algorithm using adaptive elimination of sub-block partial coefficients. The proposed algorithm predicts an adaptive threshold for each sub-block by using relationship of an initial sum of absolute difference(SAD) and a minimum SAD at the current point, and efficiently reduces unnecessary calculation time of the conventional partial distortion elimination(PDE) algorithm with the predicted threshold. Our algorithm reduces about 60% of computations of the conventional PDE algorithm without any degradation of prediction quality compared with the con ventional full search. Additionally, the proposed algorithm can be applied to other fast motion estimation 떠gorithms. the proposed Our proposing algorithm will be useful to real-time video coding applications using MPEG-2 or MPEG-4 AVC standards.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.9
• /
• pp.759-764
• /
• 2013

We present a square root algorithm in $F_q$ which generalizes Atkin's square root algorithm [9] for finite field $F_q$ of q elements where $q{\equiv}5$ (mod 8) and Kong et al.'s algorithm [11] for the case $q{\equiv}9$ (mod 16). Our algorithm precomputes ${\xi}$ a primitive $2^s$-th root of unity where s is the largest positive integer satisfying $2^s|q-1$, and is applicable for the cases when s is small. The proposed algorithm requires one exponentiation for square root computation and is favorably compared with the algorithms of Atkin, M$\ddot{u}$ller and Kong et al.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.35 no.5
• /
• pp.249-257
• /
• 2022

This paper presents an improved computational framework for the direct-solution-based finite element tearing and interconnecting (FETI) algorithm. The FETI-local algorithm is further improved herein, and localized Lagrange multipliers are used to define the interface among its subdomains. Selective inverse entry computation, using a property of the Boolean matrix, is employed for the computation of the subdomain interface stiffness and load, in which the original FETI-local algorithm requires a full matrix inverse computation of a high computational cost. In the global interface computation step, the original serial computation is replaced by a parallel multi-frontal method. The performance of the improved FETI-local algorithm was evaluated using a numerical example with 64 million degrees of freedom (DOFs). The computational time was reduced by up to 97.8% compared to that of the original algorithm. In addition, further stable and improved scalability was obtained in terms of a speed-up indicator. Furthermore, a performance comparison was conducted to evaluate the differences between the proposed algorithm and commercial software ANSYS using a large-scale computation with 432 million DOFs. Although ANSYS is superior in terms of computational time, the proposed algorithm has an advantage in terms of the speed-up increase per processor increase.