Format:
Online Ressource (1 PDF (ix, 105 pages))
,
illustrations.
Edition:
Online-Ausg.
ISBN:
9781627052320
Series Statement:
Synthesis lectures on communications 1932-1708 # 10
Content:
Adaptive filters play an important role in the fields related to digital signal processing and communication, such as system identification, noise cancellation, channel equalization, and beamforming. In practical applications, the computational complexity of an adaptive filter is an important consideration. The Least Mean Square (LMS) algorithm is widely used because of its low computational complexity (O(N)) and simplicity in implementation. The least squares algorithms, such as Recursive Least Squares (RLS), Conjugate Gradient (CG), and Euclidean Direction Search (EDS), can converge faster and have lower steady-state mean square error (MSE) than LMS. However, their high computational complexity (O(N2)) makes them unsuitable for many real-time applications. A well-known approach to controlling computational complexity is applying partial update (PU) method to adaptive filters. A partial update method can reduce the adaptive algorithm complexity by updating part of the weight vector instead of the entire vector or by updating part of the time. In the literature, there are only a few analyses of these partial update adaptive filter algorithms. Most analyses are based on partial update LMS and its variants. Only a few papers have addressed partial update RLS and Affine Projection (AP). Therefore, analyses for PU least-squares adaptive filter algorithms are necessary and meaningful
Note:
Part of: Synthesis digital library of engineering and computer science. - Series from website. - Includes bibliographical references (pages 99-103). - Compendex. INSPEC. Google scholar. Google book search. - Title from PDF title page (viewed on May 21, 2014)
,
System requirements: Adobe Acrobat Reader.
Language:
English
