KEYWORDS: Digital filtering, Computer simulations, Detection and tracking algorithms, Single mode fibers, Chemical elements, Algorithm development, Curium, Signal to noise ratio, Optimization (mathematics), Stochastic processes
The constant modulus algorithm (CMA) has low computational complexity while presenting slow convergence and possible
convergence to local minima, the CMA family of algorithms based on affine projection version (AP-CMA) alleviates the speed
limitations of the CMA. However, the computational complexity has been a weak point in the implementation of AP-CMA. To reduce
the computational complexity of the adaptive filtering algorithm, a new AP-CMA algorithm based on set membership (SM-AP-CMA)
is proposed. The new algorithm combines a bounded error specification on the adaptive filter with the concept of data-reusing.
Simulations confirmed that the convergence rate of the proposed algorithm is significantly faster; meanwhile, the excess mean square
error can be maintained in a relatively low level and a substantial reduction in the number of updates when compared with its
conventional counterpart.
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.