• KEPCO Journal on Electric Power and Energy
• /
• 제8권2호
• /
• pp.159-179
• /
• 2022

Often a network becomes complex, and multiple entities would get in charge of managing part of the whole network. An example is a utility grid. While the entire grid would go under a single utility company's responsibility, the network is often split into multiple subsections. Subsequently, each subsection would be given as the responsibility area to the corresponding sub-organization in the utility company. The issue of how to make subsystems of adequate size and minimum number of interconnections between subsystems becomes more critical, especially in real-time simulations. Because the computation capability limit of a single computation unit, regardless of whether it is a high-speed conventional CPU core or an FPGA computational engine, it comes with a maximum limit that can be completed within a given amount of execution time. The issue becomes worsened in real time simulation, in which the computation needs to be in precise synchronization with the real-world clock. When the subject of the computation allows for a longer execution time, i.e., a larger time step size, a larger portion of the network can be put on a computation unit. This translates into a larger margin of the difference between the worst and the best. In other words, even though the worst (or the largest) computational burden is orders of magnitude larger than the best (or the smallest) computational burden, all the necessary computation can still be completed within the given amount of time. However, the requirement of real-time makes the margin much smaller. In other words, the difference between the worst and the best should be as small as possible in order to ensure the even distribution of the computational load. Besides, data exchange/communication is essential in parallel computation, affecting the overall performance. However, the exchange of data takes time. Therefore, the corresponding consideration needs to be with the computational load distribution among multiple calculation units. If it turns out in a satisfactory way, such distribution will raise the possibility of completing the necessary computation in a given amount of time, which might come down in the level of microsecond order. This paper presents an effective way to split a given electrical network, according to multiple criteria, for the purpose of distributing the entire computational load into a set of even (or close to even) sized computational loads. Based on the proposed system splitting method, heavy computation burdens of large-scale electrical networks can be distributed to multiple calculation units, such as an RTDS real time simulator, achieving either more efficient usage of the calculation units, a reduction of the necessary size of the simulation time step, or both.

• 한국통신학회논문지
• /
• 제23권4호
• /
• pp.1024-1034
• /
• 1998

정보통신망에서 사용하는 공개키 암호시스템은 대부분 지수 연산을 사용한다. 하지만, 암호시스템은 안전성을 고려한 큰 수의 지수 연산을 사용하기 때문에 많은 계산 량과 준비시간을 요구한다. 이러한 문제점을 해결하기 위하여 모듈러 감소 연산에서 Montgomery, Yang, Kawamura 등이 사전계산 방법, 중간계산, 그리고 테이블을 사용하는 방법을 제안하였으며, 지수 연산에서 Coster, Brickel, Lee 등이 addition chain, window, 그리고 고정된 수를 사용하는 경우 사전 계산을 하는 방법을 제안하였다. 본 논문에서는 sparse 소수를 사용한 모듈러 감소 연산 방법을 제안하고 지수연산시 계산 량을 줄이는 방법을 제안한다. 이는 이산대수 방식의 암호시스템에서 매우 효과적으로 적용할 수 있다.

• 한국음향학회:학술대회논문집
• /
• 한국음향학회 1998년도 학술발표대회 논문집 제17권 1호
• /
• pp.155-158
• /
• 1998

IMBE(Improved Multi-Band Excitation) vocoders exhibit good performance at low data rates. The major drawback to IMBE coders is their large computational requirements. In this paper, thus, we propose a new pitch search method that preserves the quality of the IMBE vocoder with reduced complexity. The basic idea is to reduce computation complexity of the pitch searching by using the SAMDF. Applying the proposed method to the IMBE vocoder, we can get approximately 52.02% searching time reduction in the pitch search. There is no difference in voice quality between conventional IMBE and proposed IMBE.

• International Journal of Internet, Broadcasting and Communication
• /
• 제14권3호
• /
• pp.149-154
• /
• 2022

In recent years, the application of deep learning method to computer vision has shown to achieve great performances. Thus, many research projects have also applied deep learning technology to railroad defect detection. In this paper, we have reviewed the researches that applied computer vision based deep learning method to railroad defect detection and inspection, and have discussed the current trend and the direction of those researches. Many research projects were targeted to operate automatically without visual inspection of human and to work in real-time. Therefore, methods to speed up the computation were also investigated. The reduction of the number of learning parameters was considered important to improve computation efficiency. In addition to computation speed issue, the problem of annotation was also discussed in some research projects. To alleviate the problem of time consuming annotation, some kinds of automatic segmentation of the railroad defect or self-supervised methods have been suggested.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2006년도 춘계학술대회논문집
• /
• pp.1432-1436
• /
• 2006

Feasibility of optimizing Zwicker's loudness has been shown by using MSC/NASTRAN, SYSNOISE, and a semi-analytical design sensitivity by Wang and Kang. Design sensitivity analysis of Zwicker's loudness is developed by using ANSYS, COMET, and an adjoint variable method in order to reduce computation. A numerical example shows significant reduction of computation time for design sensitivity analysis.

• 한국산학기술학회논문지
• /
• 제8권3호
• /
• pp.563-568
• /
• 2007

본 논문에서는 EVRC 시스템에 사용되어지는 실근 방식의 계산량 감소 알고리즘을 치안한다. 실근 방법에서는 다항식에서의 근을 구하여 LSP로 변환하는 과정이 필요하다. 그러나, 근을 구하는 과정에서 주파수 대역을 순차적으로 검색하므로 계산시간이 많이 소요된다. LSP 파라미터의 중요한 특징은 대부분의 계수가 특정 주파수 대역에 주로 분포한다는 것이다. 그러므로, 본 논문에서는 실근 방식에서의 계산시간을 줄이기 위하여 1KHz 대역까지는 선형적이고 1KHz 대역 이상에서는 로그 스케일인 멜 스케일을 사용하였다. 실근 방식과 제안한 방법을 비교하기 위하여 두 가지를 측정하였다. 첫째, 제안한 방법에서의 LSP 파라미터의 값과 실근방식에서의 LSP 파라미터 값을 비교하였다. 둘째, 계산 시간 감소율을 측정하였다. 실험결과, LSP 파라미터의 값은 변화하지 않았으며 계산량은 약 48% 정도 감소하였다.

• Journal of Information Technology Applications and Management
• /
• 제22권3호
• /
• pp.105-114
• /
• 2015

This paper presents a fast Time Difference of Arrival (TDOA) estimation for sound source localization. TDOA is the time difference between the arrival times of a signal at two sensors. We propose a partial cross correlation method to increase the speed of TDOA estimation for sound source localization. We do this by predicting which part of the cross correlation function contains the required TDOA value with the help of the signal energies, and then we compute the cross correlation function in that direction only. Experiments show approximately 50% reduction in the cross correlation computation time thereby increasing the speed of TDOA computation. This makes it very relevant for real world surveillance.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2005년도 추계종합학술대회
• /
• pp.639-642
• /
• 2005

Motion Estimation(ME) is an important part of video compression, because it requires a large amount of computation. Half-pixel and quarter-pixel motion estimation allows high video compression rates but it also has high computation complexity. In this paper we suggest a new and efficient motion estimation algorithm for half-pixel and quarter-pixel motion estimation using SAD values. In the method, an integer-pixel motion vector is found and then only three neighboring points of the integer-pixel motion vector is evaluated to find the half-pixel motion vector. The quarter-pixel motion vector is also found by using a similar method. Experimental results of our method shows 20% reduction in computation time, when compared with those of a conventional method, while producing same quality motion vectors.

• 대한음성학회지:말소리
• /
• 제51호
• /
• pp.71-84
• /
• 2004

In this paper, we propose the automatic speech database verification method(or called automatic verification) based on confidence measure for a large speech database. This method verifies the consistency between given transcription and speech using the confidence measure. The automatic verification process consists of two stages : the word-level likelihood computation stage and multi-level likelihood ratio computation stage. In the word-level likelihood computation stage, we calculate the word-level likelihood using the viterbi decoding algorithm and make the segment information. In the multi-level likelihood ratio computation stage, we calculate the word-level and the phone-level likelihood ratio based on confidence measure with anti-phone model. By automatic verification, we have achieved about 61% error reduction. And also we can reduce the verification time from 1 month in manual to 1-2 days in automatic.

• 한국전자파학회논문지
• /
• 제29권10호
• /
• pp.791-798
• /
• 2018

CFAR(Constant False Alarm Rate)는 레이다 시스템에서 표적 탐지에 주요 사용된다. 그 중에서 OS(Ordered Statistic) CFAR는 비균일 잡음환경에서 사용된다. 그러나 OS CFAR는 참조 셀을 오름차순으로 정렬하여 임계값을 계산하므로 많은 연산량이 필요하다. 이로 인하여 실시간 적용에 어려움이 있다. 본 논문에서는 OS CFAR의 연산량을 줄이는 방안을 서술한다. 단순 표적 유무만 판단하기 위하여 참조 셀들을 오름차순 정렬하는 대신 참조 셀과 크기 비교하는 방식으로 수행하였다. 그리고 3개의 테스트 셀을 묶어 구역을 나누고, 구역 내에서 공통 참조 셀을 구하였다. 공통 참조 셀과 테스트 셀과의 크기 비교를 우선 수행함으로써 연산시간을 단축한다.