• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.65 no.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.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.19 no.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.

• MALSORI
• /
• no.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
• /
• v.4 no.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.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.8
• /
• pp.3647-3653
• /
• 2012

In active noise control filter, IIR filter structure which used for control filter assures the stability property. The stability characteristics of IIR filter structure is mainly determined by pole location of control filter within unit disc, so stable selection of the value of control filter coefficient is very important. In this paper, we proposed novel adaptive stabilized Filtered_U LMS algorithms with IIR filter structure which has better convergence speed and less computational burden than conventional FIR structures, for multi-channel active noise control with vehicle enclosure signal case. For better convergence speed in adaptive algorithms, fuzzy LMS algorithms where convergence coefficient computed by a fuzzy PI type controller was proposed.

• Journal of Positioning, Navigation, and Timing
• /
• v.10 no.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
• /
• v.16 no.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.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• 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.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.05a
• /
• 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.

• The Journal of the Acoustical Society of Korea
• /
• v.38 no.4
• /
• pp.415-426
• /
• 2019

In this paper, we discussed automatic target tracking algorithms for diver detection sonar that observes penetration forces of coastal military installations and major infrastructures. First of all, we analyzed sea trial data in diver detection sonar and composed automatic target tracking algorithms based on track existence probability as track quality measure in clutter environment. In particular, these are presented track management algorithms which include track initiation, confirmation, termination, merging and target tracking algorithms which include single target tracking IPDAF (Integrated Probabilistic Data Association Filter) and multitarget tracking LMIPDAF (Linear Multi-target Integrated Probabilistic Data Association Filter). And we analyzed performances of automatic target tracking algorithms using sea trial data and monte carlo simulation data.