• The Journal of the Acoustical Society of Korea
• /
• v.22 no.4
• /
• pp.261-268
• /
• 2003

Conventional acoustic echo cancellers using ES algorithm have simple structure and fast convergence speed compared with those using NLMS algorithm, but they are very weak to external noise because ES algorithm updates the adaptive filter taps based on average energy reduction rate of room impulse response in specific acoustical condition. To solve this problem, in this paper, a new update algorithm for acoustic echo canceller with stepsize matrix generator is proposed. A set of stepsizes is determined based on residual error energy which is estimated by two moving average operators, and applied to the echo canceller in matrix from, resulting in improved convergence speed. Simulations in various noise condition show that the proposed algorithm improves the robustness of acoustic echo canceller to external noise.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.12
• /
• pp.1638-1643
• /
• 2019

In this paper, we propose an adaptive-perturbation-aided opportunistic precoding (APOP) scheme for multiple-input multiple-output (MIMO) systems. To update a precoding matrix in MIMO systems, the proposed algorithm produces a random perturbation in each time slot. Then the additional adaptive perturbation is also applied, which depends on the reports of achievable data-rates from users. If the prior random perturbation increased the data rate, the adaptive perturbation is set to be the same as the prior random perturbation, otherwise the negative value of the prior random perturbation is applied for adaptive perturbation. Furthermore, to enhance the achievable data rates, the information on the stored precoding matrices in the memory as well as the currently generated precoding matrix is used for scheduling. Simulation results show that compared to conventional opportunistic precoding schemes, higher data rates are achieved by the proposed APOP scheme, especially when there are a relatively small number of users.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.773-782
• /
• 2009

A DHT(Distributed Hash Table) based P2P is a method to overcome disadvantages of the existing unstructured P2P method. If a DHT algorithm is used, it can do a fast data search and maintain search efficiency independent of the number of peer. The peers in the DHT method send messages periodically to keep the routing table updated. In a mobile environment, the peers in the DHT method should send messages more frequently to keep the routing table updated and reduce the failure of a request. Therefore, this results in increase of network traffic. In our previous research, we proposed a method to reduce the update load of the routing table in the existing Chord by updating it in a reactive way, but the reactive method had a disadvantage to generate more traffic than the existing Chord if the number of requests per second becomes large. In this paper, we propose an adaptive method of routing table update to reduce the network traffic. In the proposed method, we apply different routing table update method according to the number of request message per second. If the number of request message per second is smaller than some threshold, we apply the reactive method. Otherwsie, we apply the existing Chord method. We perform experiments using Chord simulator (I3) made by UC Berkeley. The experimental results show the performance improvement of the proposed method compared to the existing methods.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.761-772
• /
• 2009

A DHT(Distributed Hash Table) based P2P is a method to overcome disadvantages of the existing unstructured P2P method. If a DHT algorithm is used, it can do a fast data search and maintain search efficiency independent of the number of peer. The peers in the DHT method send messages periodically to keep the routing table updated. In a mobile environment, the peers in the DHT method should send messages more frequently to keep the routing table updated and reduce the failure of a request. Therefore, this results in increase of network traffic. In our previous research, we proposed a method to reduce the update load of the routing table in the existing Chord by updating it in a reactive way, but the reactive method had a disadvantage to generate more traffic than the existing Chord if the number of requests per second becomes large. In this paper, we propose an adaptive method of routing table update to reduce the network traffic. In the proposed method, we apply different routing table update method according to the number of request message per second. If the number of request message per second is smaller than some threshold, we apply the reactive method. Otherwsie, we apply the existing Chord method. We perform experiments using Chord simulator (I3) made by UC Berkeley. The experimental results show the performance improvement of the proposed method compared to the existing methods.

• The Journal of the Acoustical Society of Korea
• /
• v.39 no.6
• /
• pp.559-567
• /
• 2020

This paper proposes a noise cancelling algorithm to remove own-ship noise for a towed array sonar. Extra beamforming is performed using partial channels of the acoustic array to get a reference beam signal robust to the noise bearing. Frequency domain Adaptive Noise Cancelling (ANC) is applied based on Normalized Least Mean Square (NLMS) algorithm using the reference beam. The bearing of own-ship noise is estimated from the coherence between the reference beam and input beam signals. Own-ship noise level is calculated using a beampattern of the noise with estimated steering angle, which prevents loss of a target signal by determining whether to update a filter so that removed signal level does not exceed the estimated noise level. Simulation results show the proposed algorithm maintains its performance when the own-ship gets out off its bearing 40 % more than the conventional algorithm's limit and detects the target even when the frequency of the target signal is same with the frequency of the own-ship signal.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.5
• /
• pp.115-121
• /
• 2019

In this paper, we propose MSAG-SCS-MMA-I adaptive blind equalization with double step size with very small residual ISI and MSE at steady-state while significantly improving the convergence speed of the traditional SCS-MMA-I algorithm in 256-QAM system. And we evaluate the equalization performance for this algorithm. Different step sizes according to the absolute value of decision-directed error instead of a fixed step-size are applied to the tap update equation of MSAG-SCS-MMA-I, which is controlled by binary flags of '1' or '0' obtained from SCS-MMA-I and decision-directed algorithms. This makes for excellent equalization performance. As a result of computer simulation, we confirmed that the proposed algorithm has more better performance than the MMA, SCS-MMA-I, and MSAG-SCS-MMA-I algorithms in terms of the performance index such as residual ISI, MSE, and MD.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.12
• /
• pp.49-54
• /
• 2017

Pathfinding for pedestrians provided by various navigation programs is based on a shortest path search algorithm. There is no big difference in their guide results, which makes the path quality more important. Multiple criteria should be included in the search cost to calculate the path quality, which is called a multi-criteria pathfinding. In this paper we propose a user adaptive pathfinding algorithm in which the cost function for a multi-criteria pathfinding is defined as a weighted sum of multiple criteria and the weights are learned automatically by Perceptron learning. Weight learning is implemented in two ways: short-term weight learning that reflects weight changes in real time as the user moves and long-term weight learning that updates the weights by the average value of the entire path after completing the movement. We use the weight update method with momentum for long-term weight learning, so that learning speed is improved and the learned weight can be stabilized. The proposed method is implemented as an app and is applied to various movement situations. The results show that customized pathfinding based on user preference can be obtained.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.8 no.3
• /
• pp.224-228
• /
• 2015

In this paper, we study the method for desired signals estimation that array antennas are received signals. We apply sub spatial method of direction of arrival algorithm and adaptive array antennas in order to remove interference and noise signal of received antenna signals. Array response vector of adaptive array antenna is probability, it is correctly estimation of direction of arrival of targets to update weight signal. Desired signals are estimated updating covariance matrix after moving interference and noise signals among received signals. We estimate signals using eigen decomposition and eigen value, high resolution direction of arrival estimation algorithm is devided signal sub spatial and noise sub spatial. Though simulation, we analyze to compare proposed method with general method.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1986-1989
• /
• 2003

This paper proposes the information retrieval improvement for the Web using the structure and hyperlinks of HTML documents along with user profile. The method bases on the rationale that terms appearing in different structure of documents may have different significance in identifying the documents. The method partitions the occurrence of terms in a document collection into six classes according to the tags in which particular terms occurred (such as Title, H1-H6 and Anchor). We use genetic algorithm to determine class importance values and expand user query. We also use this value in similarity computation and update user profile. Then a genetic algorithm is used again to select some terms from user profile to expand the original query. Lastly, the search engine uses the expanded query for searching and the results of the search engine are scored by similarity values between each result and the user profile. Vector space model is used and the weighting schemes of traditional information retrieval were extended to include class importance values. The tested results show that precision is up to 81.5%.

• Convergence Security Journal
• /
• v.2 no.2
• /
• pp.99-108
• /
• 2002

In this paper, I propose a reference image updating algorithm for Intruder Detection System using a difference image method that can reliably separate moving objects from noisy background in the image sequence received from a camera at the fixed position. The proposed algorithm consists of four process determines threshold value and quantization, segmentation of a moving object area, generation of adaptive temporary image that removes a moving object area, and updates reference image using median filtering. The test results show that the proposed algorithm can generate reference image very effectively in the noisy environment.