• 전기학회논문지P
• /
• 제65권3호
• /
• pp.171-177
• /
• 2016

Noise problem that occurs in living environment is a big trouble in the economic, social and environmental aspects. In this paper, the filtered-X LMS algorithms, the adjoint LMS algorithms, and the robust adjoint LMS algorithms will be introduced for applications in active noise control(ANC). The filtered-X LMS algorithms is currently the most popular method for adapting a filter when the filter exits a transfer function in the error path. The adjoint LMS algorithms, that prefilter the error signals instead of divided reference signals in frequency band, is also used for adaptive filter algorithms to reduce the computational burden of multi-channel ANC systems such as the 3D space. To improve performance of the adjoint LMS ANC system, an off-line measured transfer function is connected parallel to the LMS filter. This parallel-fixed filter acts as a noise controller only when the LMS filter is abnormal condition. The superior performance of the proposed system was compared through simulation with the adjoint LMS ANC system when the adaptive filter is in normal and abnormal condition.

• 한국자동차공학회논문집
• /
• 제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.

• 대한음성학회지:말소리
• /
• 제67호
• /
• pp.195-216
• /
• 2008

This paper addresses the problem of single-channel speech separation to extract the speech signal uttered by the speaker of interest from a mixture of speech signals. We propose to apply time-frequency smoothing to the existing statistical single-channel speech separation algorithms: The soft mask and the minimum-mean-square-error (MMSE) algorithms. In the proposed method, we use the two smoothing later. One is the uniform mask filter whose filter length is uniform at the time-Sequency domain, and the other is the met-scale filter whose filter length is met-scaled at the time domain. In our speech separation experiments, the uniform mask filter improves speaker-to-interference ratio (SIR) by 2.1dB and 1dB for the soft mask algorithm and the MMSE algorithm, respectively, whereas the mel-scale filter achieves 1.1dB and 0.8dB for the same algorithms.

• IEIE Transactions on Smart Processing and Computing
• /
• 제4권3호
• /
• pp.163-168
• /
• 2015

Many IP address lookup approaches employ Bloom filters to obtain a high-speed search performance. Especially, it has been recently studied that the search performance of trie-based algorithms can be significantly improved by adding Bloom filters. In such algorithms, the number of trie accesses can be greatly reduced because Bloom filters can determine whether a node exists in a trie without actually accessing the trie. Bloom filters do not have false negatives but have false positives. False positives can lead to unnecessary trie accesses. The false positive rate must thus be reduced to enhance the performance of lookup algorithms applying Bloom filters. One important characteristic of trie-based algorithms is that all the ancestors of a node are also stored. The proposed algorithm utilizes this characteristic in reducing the false positive rate of a Bloom filter without increasing the size of the memory for the Bloom filter. When a Bloom filter produces a positive result for a node of a trie, we propose to check whether the ancestors of the node are also positives. Because Bloom filters have no false negatives, the negatives of any of the ancestors mean that the positive of the node is false. In other words, we propose to use more Bloom filter queries to reduce the false positive rate of a Bloom filter in trie-based algorithms. Simulation results show that querying one ancestor of a node can reduce the false positive rate by up to 67% with exactly the same architecture and the same memory requirement. The proposed approach can be applied to other trie-based algorithms employing Bloom filters.

• 한국산학기술학회논문지
• /
• 제13권8호
• /
• pp.3647-3653
• /
• 2012

능동 소음제어 시스템에 사용되는 IIR 필터 구조는 구조적으로 안정성이 보장되어야 하며 이는 분모 전달 함수의 근이 단위원 내부에 존재하여야 한다. 따라서 이를 결정하는 제어 필터의 계수의 적절한 조정이 중요해 진다. 본 논문에서는 적응과정에서 불안정할 우려가 있는 IIR 필터 구조를 가지는 Filtered_U LMS 알고리즘에 안정화 알고리즘과 수렴속도 향상을 위한 퍼지논리를 이용한 수렴계수 계산 알고리즘을 제안하였다. 제안한 알고리즘이 FIR 필터 구조 알고리즘보다 계산량이 적고 수렴특성이 우수함을 시뮬레이션을 통하여 보였다.

• Journal of Positioning, Navigation, and Timing
• /
• 제10권3호
• /
• pp.197-206
• /
• 2021

We compared two typical ensemble time scale algorithms; AT1 and Kalman filter. Four commercial atomic clocks composed of two hydrogen masers and two cesium atomic clocks provided measurement data to the algorithms. The allocation of relative weights to the clocks is important to generate a stable ensemble time. A 30 day-average-weight model, which was obtained from the average Allan variance of each clock, was applied to the AT1 algorithm. For the reduced Kalman filter (Kred) algorithm, we gave the same weights to the two hydrogen masers. We also compared the frequency stabilities of the outcome from the algorithms when the frequency offsets and/or the frequency drift offsets estimated by the algorithms were corrected or not corrected by the KRISS-made primary frequency standard, KRISS-F1. We found that the Kred algorithm is more effective to generate a stable ensemble time scale in the long-term, and the algorithm also generates much enhanced short-term stability when the frequency offset is used for the calculation of the Allan deviation instead of the phase offset.

• 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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(4)
• /
• pp.191-194
• /
• 2000

Frequency domain adaptive filter is effective to communication fields of many computational requirements. In this paper we propose a new variable step size algorithms which improves the convergence speed and reduces computational complexity for frequency domain adaptive filter. we compared MSE of the proposed algorithms with one of normalized FLMS using computer simulation of adaptive noise canceler based on synthesis speech.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2018년도 춘계학술발표대회
• /
• pp.469-470
• /
• 2018

Object tracking is a common task in computer vision, an essential part of various vision-based applications. After several years of development, object tracking in video is still a challenging problem because of various visual properties of objects and surrounding environment. Particle filter is a well-known technique among common approaches, has been proven its effectiveness in dealing with difficulties in object tracking. However, particle filter is a high-complexity algorithms, which is an severe disadvantage because object tracking algorithms are required to run in real time. In this research, we utilize parallel programming to accelerate particle filter-based object tracking algorithms. Experimental results showed that our approach reduced the execution time significantly.

• 한국음향학회지
• /
• 제38권4호
• /
• pp.415-426
• /
• 2019

본 논문은 연안 군사시설 및 주요 기반시설에 대한 침투세력을 감시하는 수영자 탐지 소나에서의 자동 표적추적 알고리즘을 다루었다. 이를 위해 수영자 탐지 소나에서의 해상실험 데이터를 분석하였고, 클러터 환경에서 자동표적 추적을 위한 트랙평가수단으로서 트랙존재확률 기반의 알고리즘을 적용하여 시스템을 구성하였다. 특히 트랙초기화, 확정, 제거, 합병 등의 트랙관리 알고리즘과 단일표적추적 IPDAF(Integrated Probabilistic Data Association Filter), 다중표적추적 LMIPDAF(Linear Multi-target Integrated Probabilistic Data Association Filter) 등의 표적추적 알고리즘을 제시하였으며, 해상실험 데이터 및 몬테카를로 모의실험 데이터를 이용하여 성능을 분석하였다.