• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.29 no.10
• /
• pp.89-96
• /
• 2015

Explicit numerical integration methods for power system transient stability simulation require very small time steps to avoid numerical instability. The EXST1 exciter model is a primary source of fast dynamics in power system transients. In case of the EXST1, the required small integration time step for entire system simulation increases the computational demands in terms of running time and storage. This paper presents a practical exciter model reduction approach which allows the increase of the required step size and thus the method can decrease the computational demands. The fast dynamics in the original EXST1 are eliminated in the reduced exciter model. The use of a larger time step improves the computational efficiency. This paper describes the way to eliminate the fast dynamics from the original exciter model based on linear system theory. In order to validate the performance of the proposed method, case studies with the GSO-37 bus system are provided. Comparisons between the original and reduced models are made in simulation accuracy and critical clearing time.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2451-2454
• /
• 2003

In this paper, we propose the computation reduction methods of LSP(Line spectrum pairs) transformation that is mainly used in CELP vocoders. In order to decrease the computational time in real root method the characteristic of four proposed algorithms is as the following. First, scheme to reduce the LSP transformation time uses met scale. Developed the second scheme is the control of searching order by the distribution characteristic of LSP parameters. Third, scheme to reduce the LSP transformation time uses voice characteristics. Developed the fourth scheme is the control of searching interval and order by the distribution characteristic of LSP parameters. As a result of searching time, computational amount, transformed LSP parameters, SNR, MOS test, waveform of synthesized speech, speech, spectrogram analysis, searching time reduced about 37.5％, 46.21％, 46.3％, 51.29％ in average, computational amount is reduced about 44.76％, 49.44％, 47.03％, 57.40％. But the transformed LSP parameters of the proposed methods were the same as those of real root method.

• Proceedings of the KAIS Fall Conference
• /
• 2010.05a
• /
• pp.257-260
• /
• 2010

In this paper, we propose the computation reduction methods of LSP(Line spectrum pairs) transformation that is mainly used in CELP vocoders. In order to decrease the computational time in real root method the characteristic of four proposed algorithms is as the following. First, scheme to reduce the LSP transformation time uses mel scale. Developed the second scheme is the control of searching order by the distribution characteristic of LSP parameters. Third, scheme to reduce the LSP transformation time uses voice characteristics. Developed the fourth scheme is the control of searching interval and order by the distribution characteristic of LSP parameters. As a result of searching time, computational amount, transformed LSP parameters, SNR, MOS test, waveform of synthesized speech, spectrogram analysis, searching time is reduced about 37.5%, 46.21%, 46.3%, 51.29% in average, computational amount is reduced about 44.76%, 49.44%, 47.03%, 57.40%. But the transformed LSP parameters of the proposed methods were the same as those of real root method.

• Nuclear Engineering and Technology
• /
• v.38 no.3
• /
• pp.225-230
• /
• 2006

With the advent of inexpensive computing power over the past two decades, applications of Monte Carlo radiation transport techniques have proliferated dramatically. At Los Alamos, the Monte Carlo codes MCNP5 and MCNPX are used routinely on personal computer platforms for radiation shielding analysis and dosimetry calculations. These codes feature a rich palette of variance reduction (VR) techniques. The motivation of VR is to exchange user efficiency for computational efficiency. It has been said that a few hours of user time often reduces computational time by several orders of magnitude. Unfortunately, user time can stretch into the many hours as most VR techniques require significant user experience and intervention for proper optimization. It is the purpose of this paper to outline VR strategies, tested in practice, optimized for several common radiation shielding tasks, with the hope of reducing user setup time for similar problems. A strategy is defined in this context to mean a collection of MCNP radiation transport physics options and VR techniques that work synergistically to optimize a particular shielding task. Examples are offered in the areas of source definition, skyshine, streaming, and transmission.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.2
• /
• pp.180-185
• /
• 2008

A new method for relative error continuous and discrete time model order reduction is proposed. The reduction technique is based on two recently developed methods, namely frequency domain balanced truncation within a frequency bound and inner-outer factorization techniques. The proposed method is of interest for practical model order reduction because in this context it shows to keep the accuracy of the approximation as high as possible without sacrificing the computational efficiency. Numerical results show the accuracy and efficiency enhancement of the method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8A
• /
• pp.583-591
• /
• 2009

OFDM(orthogonal frequency division multiplexing) signal with high PAPR(peak to average power ratio) produces the nonlinear distortion and/or decreases down the power efficiency of HPA(high power amplifier). So, the IMD(inter-modulation distortion) reduction method was proposed to reduce the nonlinear distortion, which shows better BER(bit error rate) performance than the PAPR reduction methods. However, IMD reduction method has inherent problem which system complexity and processing time increases because the FFT(fast Fourier transform) processor is added in transmitter and decision criterion of IMD reduction method is computed in frequency domain,. In this paper, therefore, we propose a new IMD reduction method to reduce the computational complexity and structure of IMD computation. And we apply this proposed method into OFDM system using PTS(partial transmit sequence) scheme and compare the computational complexity between conventional and proposed IMD reduction method. This method can reduce the system size and computational complexity. Also, the proposed has almost same BER performance with the conventional IMD reduction method.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.2035-2038
• /
• 2002

The necessity of the filter coefficients compensation for the LTJ adaptive filter was explained generally and easily by analyzing it with respect to the time-varying transform domain adaptive filter. And also the reduction method of computational complexity for filter coefficients compensation was proposed and its effectiveness was verified through experiments using artificial and real speech signals. The proposed adaptive filter reduces the computational complexity for filter coefficients compensation by 95%, and when the filter is applied to the acoustic echo canceller with 1000 taps, the total complexity is reduced by 82%

• Journal of Korea Multimedia Society
• /
• v.21 no.1
• /
• pp.18-25
• /
• 2018

In High Efficiency Video Coding (HEVC), integer motion estimation (IME) requires a large amount of computational complexity because HEVC adopts the high flexible and hierarchical coding structures. In order to reduce the computational complexity of IME, this paper proposes the search range reduction algorithm, which takes advantage of motion vectors similarity between different layers. It needs only a few modification for HEVC reference software. Based on the experimental results, the proposed algorithm reduces the processing time of IME by 28.1% on average, whereas its the $Bj{\emptyset}ntegaard$ delta bitrate (BD-BR) increase is 0.15% which is negligible.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.93-96
• /
• 2022

DTW can eliminate gaps between sequences of different lengths and find out the similarity of patterns, but due to the time and space complexity, it requires a high computational cost on large datasets. In this paper, we propose a DDTW algorithm that not only reduces computational costs but also has no error in the results. In addition, the algorithm complexity of DTW and DDTW is compared by measuring the computational time according to the length of the sequence. Simulation results show a noticeable reduction in computational time in DDTW compared to DTW.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.9
• /
• pp.1299-1305
• /
• 2013

In this paper, we investigate a method of reducing the computational cost in speech recognition by dimensionality reduction of MFCC feature vectors. Eigendecomposition of the feature vectors renders linear transformation of the vectors in such a way that puts the vector components in order of variances. The first component has the largest variance and hence serves as the most important one in relevant pattern classification. Therefore, we might consider a method of reducing the computational cost and achieving no degradation of the recognition performance at the same time by dimensionality reduction through exclusion of the least-variance components. Experimental results show that the MFCC components might be reduced by about half without significant adverse effect on the recognition error rate.