• Title/Summary/Keyword: Algorithm decomposition

Search Result 789, Processing Time 0.03 seconds

Algorithm of Extended Current Synchronous Detection for Active Power Filters (능동전력필터를 위한 확장된 전류 동기 검출 알고리즘)

  • 정영국
    • Proceedings of the KIPE Conference
    • /
    • 2000.07a
    • /
    • pp.111-114
    • /
    • 2000
  • Harmonics and fundamental reactive power of nonlinear loads in serious unbalanced power condition are compensated by current synchronous detection(CSD) theory which is also acceptable for single phase power system, but the CSD theory is not suitable any more in case of controlled independently harmonics and reactive component. Therefore a new algorithm the extended current synchronous detection (ECSD)theory for a three phase active power filter based on decomposition of fundamental reactive distorted components is proposed in this paper. The proposed ECSD theory is simulated and tested comparison with a few power theories under asymmtrical condition in power system.

  • PDF

Speaker Localization in Reverberant Environments Using Sparse Priors on Acoustic Channels (음향 채널의 '성김' 특성을 이용한 반향환경에서의 화자 위치 탐지)

  • Cho, Ji-Won;Park, Hyung-Min
    • MALSORI
    • /
    • no.67
    • /
    • pp.135-147
    • /
    • 2008
  • In this paper, we propose a method for source localization in reverberant environments based on an adaptive eigenvalue decomposition (AED) algorithm which directly estimates channel impulse responses from a speaker to microphones. Unfortunately, the AED algorithm may suffer from whitening effects on channels estimated from temporally correlated natural sounds. The proposed method which applies sparse priors to the estimated channels can avoid the temporal whitening and improve the performance of source localization in reverberant environments. Experimental results show the effectiveness of the proposed method.

  • PDF

Simultaneous fault Current Analysis by the Ybus Decomposition Method (Ybus분해법에 의한 다중사고 고장전류 해석)

  • 문영현;오용택;박재용
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.37 no.2
    • /
    • pp.73-79
    • /
    • 1988
  • A fault current in Simultaneous faults is calulated, which satisfies the reliability for expansion of power scale. New algorithm for analyzing fault current is developed, which calculates exactly thevnin equivalent impedance from fault point by cecomposing increment bus admittance matrix ( Ybus), and fault current is calculated by applying multiport theory. The signeficant results are as follows ` 1) When system fault changes system configulation, equivalent impedance can be calculated simply with this new algorithm. 2) Mutual coupling of transmission line can be calculated efficiently. 3) Simultaneous fault current is analyzed by applying multiport theory, which can be applicable to large scale systems.

  • PDF

A New Algorithm for Extracting Fetal ECG from Multi-Channel ECG using Singular Value Decomposition in a Discrete Cosine Transform Domain (산모의 다채널 심전도 신호로부터 이산여현변환영역에서 특이값 분해를 이용한 태아 심전도 분리 알고리듬)

  • Song In-Ho;Lee Sang-Min;Kim In-Young;Lee Doo-Soo;Kim Sun I.
    • Journal of Biomedical Engineering Research
    • /
    • v.25 no.6
    • /
    • pp.589-598
    • /
    • 2004
  • We propose a new algorithm to extract the fetal electrocardiogram (FECG) from a multi-channel electrocardiogram (ECG) recorded at the chest and abdomen of a pregnant woman. To extract the FECG from the composite abdominal ECG, the classical time-domain method based on singular value decomposition (SVD) has been generally used. However, this method has some disadvantages, such as its high degree of computational complexity and the necessary assumption that vectors between the FECG and the maternal electrocardiogram (MECG) should be orthogonal. The proposed algorithm, which uses SVD in a discrete cosine transform (DCT) domain, compensates for these disadvantages. To perform SVD with lower computational complexity, DCT coefficients corresponding to high-frequency components were eliminated on the basis of the properties of the DCT coefficients and the frequency characteristics of the FECG. Moreover, to extract the pure FECG with little influence of the direction of the vectors between the FECG and MECG, three new channels were made out of the MECG suppressed in the composite abdominal ECG, and the new channels were appended to the original multi-channel ECG. The performance of the proposed algorithm and the classical time-domain method based on SVD were compared using simulated and real data. It was experimentally verified that the proposed algorithm can extract the pure FECG with reduced computational complexity.

Multi-Level and Multi-Objective Optimization of Framed Structures Using Automatic Differentiation (자동미분을 이용한 뼈대구조의 다단계 다목적 최적설계)

  • Cho, Hyo-Nam;Min, Dae-Hong;Lee, Kwang-Min;Kim, Hoan-Kee
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2000.04b
    • /
    • pp.177-186
    • /
    • 2000
  • An improved multi-level(IML) optimization algorithm using automatic differentiation (AD) for multi-objective optimum design of framed structures is proposed in this paper. In order to optimize the steel frames under seismic load, two main objective functions need to be considered for minimizing the structural weight and maximizing the strain energy. For the efficiency of the proposed algorithm, multi-level optimization techniques using decomposition method that separately utilizes both system-level and element-level optimizations and an artificial constraint deletion technique are incorporated in the algorithm. And also to save the numerical efforts, an efficient reanalysis technique through approximated structural responses such as moments, frequencies, and strain energy with respect to intermediate variables is proposed in the paper. Sensitivity analysis of dynamic structural response is executed by AD that is a powerful technique for computing complex or implicit derivatives accurately and efficiently with minimal human effort. The efficiency and robustness of the IML algorithm, compared with a plain multi-level (PML) algorithm, is successfully demonstrated in the numerical examples.

  • PDF

Tucker Modeling based Kronecker Constrained Block Sparse Algorithm

  • Zhang, Tingping;Fan, Shangang;Li, Yunyi;Gui, Guan;Ji, Yimu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.2
    • /
    • pp.657-667
    • /
    • 2019
  • This paper studies synthetic aperture radar (SAR) imaging problem which the scatterers are often distributed in block sparse pattern. To exploiting the sparse geometrical feature, a Kronecker constrained SAR imaging algorithm is proposed by combining the block sparse characteristics with the multiway sparse reconstruction framework with Tucker modeling. We validate the proposed algorithm via real data and it shows that the our algorithm can achieve better accuracy and convergence than the reference methods even in the demanding environment. Meanwhile, the complexity is smaller than that of the existing methods. The simulation experiments confirmed the effectiveness of the algorithm as well.

A Fast Search Algorithm for Raman Spectrum using Singular Value Decomposition (특이값 분해를 이용한 라만 스펙트럼 고속 탐색 알고리즘)

  • Seo, Yu-Gyung;Baek, Sung-June;Ko, Dae-Young;Park, Jun-Kyu;Park, Aaron
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.12
    • /
    • pp.8455-8461
    • /
    • 2015
  • In this paper, we propose new search algorithms using SVD(Singular Value Decomposition) for fast search of Raman spectrum. In the proposed algorithms, small number of the eigen vectors obtained by SVD are chosen in accordance with their respective significance to achieve computation reduction. By introducing pilot test, we exclude large number of data from search and then, we apply partial distance search(PDS) for further computation reduction. We prepared 14,032 kinds of chemical Raman spectrum as the library for comparisons. Experiments were carried out with 7 methods, that is Full Search, PDS, 1DMPS modified MPS for applying to 1-dimensional space data with PDS(1DMPS+PDS), 1DMPS with PDS by using descending sorted variance of data(1DMPS Sort with Variance+PDS), 250-dimensional components of the SVD with PDS(250SVD+PDS) and proposed algorithms, PSP and PSSP. For exact comparison of computations, we compared the number of multiplications and additions required for each method. According to the experiments, PSSP algorithm shows 64.8% computation reduction when compared with 250SVD+PDS while PSP shows 157% computation reduction.

Domain Decomposition Strategy for Pin-wise Full-Core Monte Carlo Depletion Calculation with the Reactor Monte Carlo Code

  • Liang, Jingang;Wang, Kan;Qiu, Yishu;Chai, Xiaoming;Qiang, Shenglong
    • Nuclear Engineering and Technology
    • /
    • v.48 no.3
    • /
    • pp.635-641
    • /
    • 2016
  • Because of prohibitive data storage requirements in large-scale simulations, the memory problem is an obstacle for Monte Carlo (MC) codes in accomplishing pin-wise three-dimensional (3D) full-core calculations, particularly for whole-core depletion analyses. Various kinds of data are evaluated and quantificational total memory requirements are analyzed based on the Reactor Monte Carlo (RMC) code, showing that tally data, material data, and isotope densities in depletion are three major parts of memory storage. The domain decomposition method is investigated as a means of saving memory, by dividing spatial geometry into domains that are simulated separately by parallel processors. For the validity of particle tracking during transport simulations, particles need to be communicated between domains. In consideration of efficiency, an asynchronous particle communication algorithm is designed and implemented. Furthermore, we couple the domain decomposition method with MC burnup process, under a strategy of utilizing consistent domain partition in both transport and depletion modules. A numerical test of 3D full-core burnup calculations is carried out, indicating that the RMC code, with the domain decomposition method, is capable of pin-wise full-core burnup calculations with millions of depletion regions.

S-PARAFAC: Distributed Tensor Decomposition using Apache Spark (S-PARAFAC: 아파치 스파크를 이용한 분산 텐서 분해)

  • Yang, Hye-Kyung;Yong, Hwan-Seung
    • Journal of KIISE
    • /
    • v.45 no.3
    • /
    • pp.280-287
    • /
    • 2018
  • Recently, the use of a recommendation system and tensor data analysis, which has high-dimensional data, is increasing, as they allow us to analyze the tensor and extract potential elements and patterns. However, due to the large size and complexity of the tensor, it needs to be decomposed in order to analyze the tensor data. While several tools are used for tensor decomposition such as rTensor, pyTensor, and MATLAB, since such tools run on a single machine, they are unable to handle large data. Also, while distributed tensor decomposition tools based on Hadoop can handle a scalable tensor, its computing speed is too slow. In this paper, we propose S-PARAFAC, which is a tensor decomposition tool based on Apache Spark, in distributed in-memory environments. We converted the PARAFAC algorithm into an Apache Spark version that enables rapid processing of tensor data. We also compared the performance of the Hadoop based tensor tool and S-PARAFAC. The result showed that S-PARAFAC is approximately 4~25 times faster than the Hadoop based tensor tool.

Data-Driven Signal Decomposition using Improved Ensemble EMD Method (개선된 앙상블 EMD 방법을 이용한 데이터 기반 신호 분해)

  • Lee, Geum-Boon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.2
    • /
    • pp.279-286
    • /
    • 2015
  • EMD is a fully data-driven signal processing method without using any predetermined basis function and requiring any user parameters setting. However EMD experiences a problem of mode mixing which interferes with decomposing the signal into similar oscillations within a mode. To overcome the problem, EEMD method was introduced. The algorithm performs the EMD method over an ensemble of the signal added independent identically distributed white noise of the same standard deviation. Even so EEMD created problems when the decomposition is complete. The ensemble of different signal with added noise may produce different number of modes and the reconstructed signal includes residual noise. This paper propose an modified EEMD method to overcome mode mixing of EMD, to provide an exact reconstruction of the original signal, and to separate modes with lower cost than EEMD's. The experimental results show that the proposed method provides a better separation of the modes with less number of sifting iterations, costs 20.87% for a complete decomposition of the signal and demonstrates superior performance in the signal reconstruction, compared with EEMD.