Signal and Data Processing

fa یک مدل تحلیلی برای پیش‌بینی رفتار همگرایی الگوریتم حداقل میانگین ترکیب نُرم (LMMN) An Analytical Model for Predicting the Convergence Behavior of the Least Mean Mixed-Norm (LMMN) Algorithm مقالات پردازش داده‌های رقمی Paper بنیادی بنیادی <div style="text-align: justify;">الگوریتم کمینه میانگین ترکیب نُرم (LMMN)، الگوریتمی مبتنی بر شیب تصادفی خطا است که هدف آن کمینه‌‌سازی ترکیبی از توابع هزینه الگوریتم‌های کمینه میانگین مربعات (LMS) و کمینه میانگین چهارم (LMF) است. این الگوریتم بسیاری از ویژگی‌ها و مزایای الگوریتم‌های LMS و LMF را با خود به ارث برده است و از جهاتی ضعف‌های این دو الگوریتم را هم برطرف کرده است. بزرگ‌ترین مشکل الگوریتم LMMN فقدان یک مدل تحلیلی برای پیش‌بینی رفتار آن است، به‌طوری‌که کاربرد عملی آن‌را محدود کرده است. ما در این مقاله باهدف حل این مشکل، مدلی تحلیلی را ارائه می‌کنیم که قادر است رفتار میانگین مربعات خطا و میانگین خطای وزن‌ها را با دقت بالایی پیش‌بینی کند. دقت مدل استخراج‌شده از طریق آزمایش‌های متعددی تأیید می‌شود.</div> <div style="text-align: justify;">Stochastic gradient-based adaptation algorithms have received a great attention in various applications. The most well-known algorithm in this category is the Least Mean Squares (LMS) algorithm that tries to minimize the second-order criterion of mean squares of the error signal. On the other hand, it has been shown that higher-order adaptive filtering algorithms based on higher-order statistics can perform better in many applications, particularly in the presence of intense noises. However, these algorithms are more prone to instability and also their convergence rates decline in the vicinity of their optimum solutions. In attempt to make use of the useful aspects of these algorithms, it has been proposed to combine the second-order criterion with higher-order ones, e.g. that of the Least Mean Fourth (LMF) algorithm. The Least Mean Mixed-Norm (LMMN) algorithm is a stochastic gradient-based algorithm which aim is to minimize an affine combination of the cost functions of the LMS and LMF algorithms. This algorithm has inherited many properties and advantages of the LMS and the LMF algorithms and mitigated their weaknesses in some ways. These advantages are achieved at the cost of the additional computation burden of just one addition and four multiplications per iteration. The main issue of the LMMN algorithm is the lack of an analytical model for predicting its behaviour, the fact that has restricted its practical application. To address this issue, an analytical model is presented in the current paper that is able to predict the mean-square-error and the mean-weights-error behaviour with a high accuracy. This model is derived using the Isserlis’ theorem, based on two mild and practically valid assumptions; namely the input signal is stationary, zero-mean Gaussian and the measurement noise are additive zero-mean with an even probability distribution function (pdf). The accuracy of the derived model is verified using several simulation tests. These results show that the model is of a high accuracy in various settings for the noise’s power level and distribution as well as the unknown filter characteristics. Furthermore, since the LMF and the LMS algorithms are special cases of the more general LMMN algorithm, the proposed model can also be used for predicting the behaviour of these algorithms.</div> الگوریتم‌های وفقی, الگوریتم LMMN, مدل تحلیلی Adaptive Algorithms, LMMN Algorithm, Analytical Model 19 28 http://jsdp.rcisp.ac.ir/browse.php?a_code=A-10-1748-2&slc_lang=fa&sid=1 Mesyam Kazemi Eghbal میثم کاظمی اقبال m.eghbal@stu.hut.ac.ir 100319475328460010479 100319475328460010479 No Hamedan University of Technology دانشگاه صنعتی همدان Ghasem Alipoor قاسم علی‌پور alipoor@hut.ac.ir 100319475328460010480 100319475328460010480 Yes Hamedan University of Technology دانشگاه صنعتی همدان