• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1475-1478
• /
• 2002

This paper presents a performance analysis of an improved adaptive algorithm proposed by the authors recently. It is based on the normalized least mean square (NLMS) algorithm, which Is one of the major techniques to adapt the cofficients of a transversal filter. Generally, the performance of an adaptive algorithm is often discussed by investigating the mis-adjustment. In this paper, unlike these approaches, a novel analytical method is considered. letting the parameters so that the residual mean square error (MSE) after the convergence of the algorithm is equal to that of the NLMS algorithm, the MSE level is compared. It is shown that the theoretical analysis is agreed with the simulation results.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.12
• /
• pp.1337-1344
• /
• 2014

The objective of an echo canceller connected to any end of a communication line such as digital subscriber line (DSL) is to compensate the outgoing transmit signal in the receiving path that the hybrid circuit leaks. The echo canceller working in a full duplex environment is an adaptive system driven by the local signal. Conventional echo canceller that implement the least mean square (LMS) algorithm provides a low computational burden but poor convergence properties. The length of the echo canceller will directly affect both the degree of performance and the convergence speed of the adaptation process. To cancel long time-varying echoes, the number of tap coefficients of a conventional echo canceller must be large, which decreases the convergence speed of the adaptive filter. This paper proposes an alternative technique for the echo cancellation in a telecommunication channel. The new technique employs the bi-directional least mean square (LMS) algorithm for adaptively computing the optimal set of the coefficients of the echo canceller, which is composed of weighted combination of both feedforward and feedback algorithms. Finally, Simulation results as well as mathematical analysis demonstrates that the proposed echo canceller has faster convergence speed than the conventional LMS echo canceller with nearly equivalent complexity of computation.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.8
• /
• pp.54-62
• /
• 2000

Adaptive filtering method is one of signal processing area which is frequently used in the case of statistical characteristic change in time-varing situation. The performance of adaptive filter is usually evaluated with complexity of its structure, convergence speed and misadjustment. The structure of adaptive filter must be simple and its speed of adaptation must be fast for real-time implementation. In this paper, we propose chirp discrete cosine transform (CDCT), which has the characteristics of CZT (chrip z-transform) and DCT (discrete cosine transform), and then CDCTLMS (chirp discrete cosine transform LMS) using the above mentioned algorithm for the improvement of its speed of adaptation. Using loaming curve, we prove that the proposed method is superior to the conventional US (normalized LMS) algorithm and DCTLMS (discrete cosine transform LMS) algorithm. Also, we show the real application for the ultrasonic signal processing.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.4
• /
• pp.18-26
• /
• 1996

In this paper we propose a new dual structured tap selection algorithm for voice echo canceller in digital cellular communication system, investigating adaptive filtering algorithms for echo cancellation in long distance telephony or mobile communication system. The proposed algorithm has a two-stage processing structure that after a dispersive region in an impulse response of an echo path is found out, the tap coefficients of a short length filter are adjusted adaptively for the region, because the impuse response has a very little portion of the dispersion. Simulation results show that the proposed algorithm with 256 taps gives a performance of convergence speed superior to both full-tap normalized least mean with 256 taps gives a performance of convergence speed superior to both full-tap normalized least mean square (NLMS) and a scrub taps waiting in a queue (STWQ) algorithms by about eighty per cent, also to a tap selection algorithm by about twenty per cent. And the resutls diplay that if the more tap coefficients are used due to a long delayed dispersive zone, the proposed algorithm produces the better performance.

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

We have proposed the adaptive noise reduction algorithm using the MDFT. The algorithm proposed use the linear prediction coefficients of the AR method based on Sign algorithm that is the modified LMS instead of the least mean square(LMS). The signals with a random noise tracking performance are examined through computer simulations and confirmed that the high speed adaptive noise reduction processing system is realized with rapid convergence.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.06a
• /
• pp.179-180
• /
• 2014

The main goal of this paper is to present an adaptive filter system using NLMS(Normalized Least mean square) adaptive algorithm for noise cancellation. The proposed algorithm has less computational complexity and better convergence property than the former algorithms like spectral subtraction algorithm, etc. We use TIMIT criterion voice and Noisex-92 for the experiment. The experimental result shows the feasibility of our algorithm for filtering noise from voice effectively.

• Journal of Satellite, Information and Communications
• /
• v.10 no.2
• /
• pp.19-23
• /
• 2015

In this paper, we present the return link ACM method to improve the link availability and system throughput for satellite communication service. Also, we describe the optimization of an algorithm for channel prediction using the LMS (Least Mean Square) adaptive filter and the MODCOD (Modulation & Code rate) decision. The simulation results show that the optimized filter taps and step-size of adaptive filter are 2 and 0.00026, respectively. And also confirms the required SNR margin for minimization of MODCOD decision error is 0.3dB.

• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.19-25
• /
• 2004

In this paper, we present a trellis-based blind channel estimation and equalization technique coupling two kinds of adaptive Viterbi algorithms. First, the initial blind channel estimation is accomplished by incorporating the list parallel Viterbi algorithm with the least mean square (LMS) updating approach. In this operation, multiple trellis mappings are preserved simultaneously and ranked in terms of path metrics. Equivalently, multiple channel estimates are maintained and updated once a single symbol is received. Second, the best channel estimate from the above operation will be adopted to set up the whole trellis. The conventional adaptive Viterbi algorithm is then applied to detect the signal and further update the channel estimate alternately. A small delay is introduced for the symbol detection and the decision feedback to smooth the noise impact. An automatic switch between the above two operations is also proposed by exploiting the evolution of path metrics and the linear constraint inherent in the trellis mapping. Simulation has shown an overall excellent performance of the proposed scheme in terms of mean square error (MSE) for channel estimation, robustness to the initial channel guess, computational complexity, and channel equalization.

• Structural Engineering and Mechanics
• /
• v.36 no.2
• /
• pp.225-241
• /
• 2010

In this study, a hybrid search algorithm combining genetic programming with orthogonal least squares (GP/OLS) is utilized to generate prediction models for compressive strength of high performance concrete (HPC) mixes. The GP/OLS models are developed based on a comprehensive database containing 1133 experimental test results obtained from previously published papers. A multiple least squares regression (LSR) analysis is performed to benchmark the GP/OLS models. A subsequent parametric study is carried out to verify the validity of the models. The results indicate that the proposed models are effectively capable of evaluating the compressive strength of HPC mixes. The derived formulas are very simple, straightforward and provide an analysis tool accessible to practicing engineers.

• Journal of computational fluids engineering
• /
• v.14 no.4
• /
• pp.93-100
• /
• 2009

The gridless (or meshfree) methods, such as MPS, SPH, FPM an so forth, are feasible and robust for the problems with moving boundary and/or complicated boundary shapes, because these methods do not need to generate a grid system. In this study, a gridless solver, which is based on the combination of moving least square interpolations on a cloud of points with point collocation for evaluating the derivatives of governing equations, is presented for two-dimensional unsteady incompressible Navier-Stokes problem in the low Reynolds number. A MAC-type algorithm was adopted and the Poission equation for the pressure was solved successively in the moving least square sense. Some typical problems were solved by the presented solver for the validation and the results obtained were compared with analytic solutions and the numerical results by conventional CFD methods, such as a FVM.