The convergence speed of a single least mean square (LMS) filter contradicts its stable state error incompatibly. Such a situation significantly restrains the performance of the recognition system. The convex combination of least mean square (CLMS) algorithm is employed in this paper to ensure that had good output. However, the rule for modifying mixing parameter is based on the steepest descent method, when the algorithm converges, it will take a lot of detours and do a lot of hard. In order to settle this problem, a new rule based on the conjugate gradient method is proposed in this paper. Meanwhile, modified hyperbolic tangent function is used to reduce computational complexity. Theoretical analysis and simulation results demonstrate that under different simulation environment, the proposed algorithm performs good property of mean square and tracking.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.