<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>LMS on Mi&amp;Bee Blog</title><link>/en/tags/lms/</link><description>Recent content in LMS on Mi&amp;Bee Blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><managingEditor>蓝宝石的傻话</managingEditor><lastBuildDate>Thu, 07 May 2026 10:00:00 +0800</lastBuildDate><atom:link href="/en/tags/lms/rss.xml" rel="self" type="application/rss+xml"/><item><title>Adaptive Filtering: From LMS to NLMS</title><link>/en/posts/physical-world/adaptive-filtering-lms-nlms/</link><pubDate>Thu, 07 May 2026 10:00:00 +0800</pubDate><guid>/en/posts/physical-world/adaptive-filtering-lms-nlms/</guid><description>&lt;h2 id="the-lms-algorithm"&gt;The LMS Algorithm&lt;/h2&gt;
&lt;p&gt;The core problem in adaptive filtering is: given a reference signal &lt;code&gt;x(n)&lt;/code&gt; and a desired signal &lt;code&gt;d(n)&lt;/code&gt;, find a filter coefficient vector &lt;code&gt;w&lt;/code&gt; such that the output &lt;code&gt;y(n)&lt;/code&gt; approximates &lt;code&gt;d(n)&lt;/code&gt;.&lt;/p&gt;
&lt;p&gt;The Least Mean Square (LMS) algorithm is the most classic solution to this problem, proposed by Widrow and Hoff in 1960. The core idea is to take one step down the steepest gradient of the error surface at each iteration — stochastic gradient descent.&lt;/p&gt;</description></item></channel></rss>