• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.9B
• /
• pp.1226-1235
• /
• 2001

The convergence analysis of the improved multiplication free adaptive digital filter (IMADF) with a fractionally-spaced equalizer (FSE) to remove the intersymbol interference (ISI) in fast data transmission is presented. The IMADF structure use the one-step predicted filter in the multiplication-free adaptive digital filter (MADF) structure using the DPCM and Sign algorithm. In the experimental results, the IMADF algorithm has reduced the computational complexity by use of only the addition operation without a multiplier. Also, under the condition of identical stationary-state error, it could obtain the stabled convergence characteristic that the IMADF algorithm is almost same as the sign algorithm, but is better than the MADF algorithm. Here, this algorithm has effective characteristics when the correlation of the input signal is highly.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.7
• /
• pp.100-106
• /
• 2015

In this paper, we propose a fast algorithm for low-power image enhancement method for mobile LCD. In the proposed fast algorithm, the spatial resolution of the input image is significantly reduced, and the image characteristics are analyzed on the reduced resolution image to find a dimming rate adaptive to the image content, thereby saving power. The proposed fast adaptive dimming and image enhancement algorithm is implemented as an application that runs on an Android device. Image quality evaluation and running time analysis experiments on the device indicate that the proposed fast algorithm jointly minimizes the quality degradation and power consumption, reducing the required computation load by over 95%.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.242-242
• /
• 2000

Comparing to the conventional adaptive filters using LMS algorithm, the proposed adaptive filters can reduce the amounts of computation and have robustness to variance of characteristics of input signals. LMS algorithm is performed in the domain of Hadamard transform after a reference signal and input signal are transformed by fast Hadamard transformation. As a transformation from time domain to Hadamard transformed domain, the proposed filter not only maintains the performance of estimating an input signal but also greatly reduces the number of multiplication. Moreover, the effect of characteristic changes of input signal is decreased. Computer simulation shows the stability and robustness of the proposed filter.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.1
• /
• pp.30-35
• /
• 2010

As of today, Frequency Hopping techniques are widely used for over-channel interference and anti-jamming communication systems. In this paper, analysis the performance of robustness on the focus of some general jamming channel. In FH/SS systems, usually SFH(Slow Frequency Hopping) and FFH(Fast Frequency Hopping) are took up on many special communication systems, the SFH, FFH are also combined with a channel diversity algorithm likes NED(Normalized Envelop Detection), EGC(Equal Gain Combines) and Clipped Combines to overcome jammer's attack. This paper propose Adaptive-NED and shows A-NED will be worked well than the others in the some general jamming environments.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.12
• /
• pp.793-798
• /
• 2004

In this paper, the problem of adaptively identifying time-varying nonlinear systems is considered. For that purpose, the discrete time-varying Volterra series is employed as a system model, and the filtered weighted least squares (FWLS) algorithm, developed for adaptive identification of linear time-varying systems, is utilized for the adaptive identification of time-varying quadratic Volterra systems. To demonstrate the performance of the proposed approach, some simulation results are provided. Note that the FWLS algorithm, decomposing the conventional weighted basis function (WBF) algorithm into a cascade of two (i.e., estimation and filtering) procedures, leads to fast parameter tracking with low computational burden, and the proposed approach can be easily extended to the adaptive identification of time-varying higher-order Volterra systems.

• Proceedings of the Korea Electromagnetic Engineering Society Conference
• /
• 2002.11a
• /
• pp.375-379
• /
• 2002

본 논문에서는 수 만개이상의 미지수를 필요로 하는 복잡한 3차원 구조에서의 정전용량 추출을 위한 고속화 알고리즘(Fast mutilpole method)과 결합한 효과적인 적응 삼각요소 분할법(Adaptive triangular mesh refinement algorithm)을 제안하였다. 요소세분화과정은 초기요소로 전하의 분포를 구하고, 전하밀도가 높은 영역에서의 요소세분화를 수행하여 이루어진다. 제안된 방법을 이용하여 많은 미지수를 필요로 하는 IC packaging 구조에서의 정전용량을 추출하였다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.2 no.1
• /
• pp.27-39
• /
• 1998

We describe a fast numerical method for non-separable elliptic equations in self-adjoin form on irregular adaptive domains. One of the most successful results in numerical PDE is developing rapid elliptic solvers for separable EPDEs, for example, Fourier transformation methods for Poisson problem on a square, however, it is known that there is no rapid elliptic solvers capable of solving a general nonseparable problems. It is the purpose of this paper to present an iterative solver for linear EPDEs in self-adjoint form. The scheme discussed in this paper solves a given non-separable equation using a sequence of solutions of Poisson equations, therefore, the most important key for such a method is having a good Poison solver. High performance is achieved by using a fast high-order adaptive Poisson solver which requires only about 500 floating point operations per gridpoint in order to obtain machine precision for both the computed solution and its partial derivatives. A few numerical examples have been presented.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.423-426
• /
• 2003

Adaptive algorithm used in Acoustic Echo Canceller (AEC) needs fast convergence algorithm when reference signal is colored speech signal. Set-Membership Affine Projection (SMAP) algorithm is derived from the constraint, which is the minimum value adaptive filter coefficient error. In this paper, we test the characteristic about noise of the SMAP algorithm and proposed modified version of SMAP algorithm fur using at AEC. As the projection order increase, the convergence characteristic of the SMAP algorithm is improved where no noise space. But if the noise uncorrelated with input signal exists, the AEC shows bad performance. In this paper, we propose normalized version of adaptive constants using estimated error signal for robust to noise and show the good performance through AEC simulation.

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

In this paper. we propose a fast search algorithm for nearest neighbor vector quantization (NNVQ). The proposed algorithm rejects those codewords which can not be the nearest codeword and reduces the search range of codebook. Hence it reduces computational time and complexity in encoding process, while it provides the same SD performance as the conventional full search algorithm. We apply the proposed algorithm to the adaptive multi-rate (AMR) speech coder and a general vector quantizer designed by LBG. algorithm. Simulation results show effectiveness of the proposed algorithm.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.218-220
• /
• 2004

Orthogonal frequency division multiplexing(OFDM) is one of the most promising technique for next generation wireless broadband communication systems. In this paper, we propose a new bit allocation algorithm in multiuser OFDM. The proposed algorithm is derived from the geometric progression of the additional transmit power of subcarriers and the arithmetic-geometric means inequality. The simulation shows that this algorithm has similar performance to the conventional adaptive bit allocation algorithm and lower computational complexity than the existing algorithms.