• Journal of information and communication convergence engineering
• /
• v.8 no.2
• /
• pp.159-162
• /
• 2010

This paper presents a new Kurtosis driven Variable Step-Size Normalized Least Mean Square (KVSSN-LMS) algorithm to prevent repeater from oscillation due to feedback signal of radio frequency (RF) repeater. To get better Mean Square Error (MSE) performance, step-size is adjusted using the kurtosis. The proposed algorithm shows the better performance of steady state MSE. The proposed algorithm shows a better ERLE performance than that of KVSS-LMS, VSS-NLMS, NLMS algorithms.

• Journal of Communications and Networks
• /
• v.9 no.1
• /
• pp.18-27
• /
• 2007

The conventional normalized least mean square (NLMS) algorithm is the most widely used for adaptive identification within a non-stationary input context. The convergence of the NLMS algorithm is independent of environmental changes. However, its steady state performance is impaired during input sequences with low dynamics. In this paper, we propose a new NLMS algorithm which is, in the steady state, insensitive to the time variations of the input dynamics. The square soot (SR)-NLMS algorithm is based on a normalization of the LMS adaptive filter input by the Euclidean norm of the tap-input. The tap-input power of the SR-NLMS adaptive filter is then equal to one even during sequences with low dynamics. Therefore, the amplification of the observation noise power by the tap-input power is cancelled in the misadjustment time evolution. The harmful effect of the low dynamics input sequences, on the steady state performance of the LMS adaptive filter are then reduced. In addition, the square root normalized input is more stationary than the base input. Therefore, the robustness of LMS adaptive filter with respect to the input non stationarity is enhanced. A performance analysis of the first- and the second-order statistic behavior of the proposed SR-NLMS adaptive filter is carried out. In particular, an analytical expression of the step size ensuring stability and mean convergence is derived. In addition, the results of an experimental study demonstrating the good performance of the SR-NLMS algorithm are given. A comparison of these results with those obtained from a standard NLMS algorithm, is performed. It is shown that, within a non-stationary input context, the SR-NLMS algorithm exhibits better performance than the NLMS algorithm.

• Journal of Broadcast Engineering
• /
• v.25 no.1
• /
• pp.36-47
• /
• 2020

The improved belief-propagation-based algorithms, such as normalized min-sum algorithm (NMSA) or offset min-sum algorithm (OMSA), are widely used to decode LDPC(Low-Density Parity-Check) codes because they are less computationally complex and work well even at low SNR(Signal-to-Noise Ratio). However, these algorithms work well only when an appropriate normalization factor or offset value is used. A new method that uses a CMD(Check Node Message Distribution) chart and least-square method, which has been recently proposed, has advantages on computational complexity over other approaches to get optimal coefficients. Furthermore, this method can be used to derive coefficients for each iteration. In this paper, we apply this method and propose an algorithm to derive a combination of normalization factor and offset value for a combined normalized and offset min-sum algorithm to further improve the decoding of LDPC codes. Simulations on the next-generation broadcasting standards, ATSC 3.0 LDPC codes, prove that a combined normalized and offset min-sum algorithm which takes the proposed coefficients as correction coefficients shows the best BER performance among other decoding algorithms.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.8
• /
• pp.14-25
• /
• 2002

In this paper, we propose a modified AFC algorithm which is suitable for the implementation of WCDMA reverse link receiver modem. To reduce the complexity, the modified CP-FDD algorithm named 'Normalized CP-FDD' is applied to the AFC loop. The proposed FDD algorithm overcomes the conventional CP-FDD's sensitivity to the variance of input signal amplitude and increases the linear range of S -curve. Therefore, offset frequency estimation using the proposed scheme can be more stable than the conventional method. Unlike IS-95, since pilot symbol in WCDMA is not transmitted continuously, we introduce a moving average filter at the FDD input to increase the number of cross-product. So, tracking speed and stability are improved. For more rapid frequency acquisition and tracking, we adopt a multi-stage tracking mode. Using NCO having ROM table structure, the frequency offset is compensated. We applied the proposed algorithm in the implementation of WCDMA base station modem successfully.

• Genomics & Informatics
• /
• v.1 no.1
• /
• pp.25-31
• /
• 2003

Local alignment is an important task in molecular biology to see if two sequences contain regions that are similar. The most popular approach to local alignment is the use of dynamic programming due to Smith and Waterman, but the alignment reported by the Smith-Waterman algorithm has some undesirable properties. The recent approach to fix these problems is to use the notion of normalized scores for local alignments by Arslan, Egecioglu and Pevzner. In this paper we consider the problem of finding all local alignments whose normalized scores are above a given threshold, and present a fast heuristic algorithm. Our algorithm is 180-330 times faster than Arslan et al.'s for sequences of length about 120 kbp and about 40-50 times faster for sequences of length about 30 kbp.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1892-1897
• /
• 2012

In this paper, efficient CNU(Check Node Update) algorithms are analyzed for high speed LDPC decoding in DVB-S2 standard. In aspect to CNU methods, there are some kinds of CNU methods. Among of them, MP (Min Product) method is quite often used in LDPC decoding. However MP needs LUT (Look Up Table) that is critical path in LDPC decoding speed. A new SC-NMS (Self-Corrected Normalized Min-Sum) method is proposed in the paper. NMS needs only normalized scaling factor instead of LUT and compensates the overestimation of MP approximation. In addition, SC method is proposed. It gives a faster convergence toward a decoded codeword. If a message change its sign between two iterations, it is not reliable and to avoid to propagate noisy information, its module is set to 0. The performance of SC-NMS has a little degrade compare to MP by 0.1 dB, however considering computational complexity and decoding speed, SC-NMS algorithm is optimal method for CNU algorithm.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.3E
• /
• pp.93-98
• /
• 2009

In this paper, we propose a new VSS-NLMS algorithm through a simple modification of the conventional NLMS algorithm, which leads to a low complexity algorithm with enhanced performance. The step size of the proposed algorithm becomes smaller as the error signal is getting orthogonal to the input vector. We also show that the proposed algorithm is an approximated normalized version of the KZ-algorithm and requires less computation than the KZ-algorithm. We carried out a performance comparison of the proposed algorithm with the conventional NLMS and other VSS algorithms using an adaptive channel equalization model. It is shown that the proposed algorithm presents good convergence characteristics under both stationary and non-stationary environments despites its low complexity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.12
• /
• pp.4567-4583
• /
• 2021

This study proposes an analytical approximation algorithm based on extreme value theory (EVT) for the inverse of the power of the incomplete Gamma function. First, the Gumbel function is used to approximate the power of the incomplete Gamma function, and the corresponding inverse problem is transformed into the inversion of an exponential function. Then, using the tail equivalence theorem, the normalized coefficient of the general Weibull distribution function is employed to replace the normalized coefficient of the random variable following a Gamma distribution, and the approximate closed form solution is obtained. The effects of equation parameters on the algorithm performance are evaluated through simulation analysis under various conditions, and the performance of this algorithm is compared to those of the Newton iterative algorithm and other existing approximate analytical algorithms. The proposed algorithm exhibits good approximation performance under appropriate parameter settings. Finally, the performance of this method is evaluated by calculating the thresholds of space-time block coding and space-frequency block coding pattern recognition in multiple-input and multiple-output orthogonal frequency division multiplexing. The analytical approximation method can be applied to other related situations involving the maximum statistics of independent and identically distributed random variables following Gamma distributions.

• Structural Engineering and Mechanics
• /
• v.70 no.2
• /
• pp.209-219
• /
• 2019

By normalizing the internal hysteresis variable and eliminating the redundant parameter, the normalized Bouc-Wen model is considered to be an improved and more reasonable form of the Bouc-Wen model. In order to facilitate application and further research of the normalized Bouc-Wen model, some key aspects of the model need to be uncovered. In this paper, hysteresis characterization of the normalized Bouc-Wen model is first studied with respect to the model parameters, which reveals the influence of each model parameter to the shape of the hysteresis loops. The parameter identification scheme is then proposed based on an improved genetic algorithm (IGA), and verified by experimental test data. It is proved that the proposed method can be an efficacious tool for identification of the model parameters by matching the reconstructed hysteresis loops with the target hysteresis loops. Meanwhile, the IGA is shown to outperform the standard GA. Finally, a simplified identification method is proposed based on parameter sensitivity, which indicates that the efficiency of the identification process can be greatly enhanced while maintaining comparable accuracy if the low-sensitivity parameters are reasonably restricted to narrower ranges.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.385-388
• /
• 2003

In this paper, we propose a new saturation enhancement algorithm which is processed on the new color space, called Normalized YCbCr(NYCbCr). The algorithm consists of two processing unit. One is color space conversion from YCbCr to NYCbCr, and the other is using adaptive saturation mapping function(ASMF). NYCbCr color space is designed to prevent shortcomings such as luminance and hue shift of YCbCr color space and by saturation enhancement. ASMF is effective to enhance saturation properly for each image and to protect low saturation regions of color images from over-saturation. we verified our method using several color images. Experimental results show that the proposed method enhance the saturation with minimizing Luminance and Hue shift.