Statistical Tracking Behavior Analysis for the Affine Projection Algorithm Based on Direction Error
نویسندگان
چکیده
منابع مشابه
The fast affine projection algorithm
This paper discusses a new adaptive filtering algorithm called fast affine projections (FAP). FAP’s key features include LMS like complexity and memory requirements (low), and RLS like convergence (fast) for the important case where the excitation signal is speech. Another of FAP’s important features is that it causes no delay in the input or output signals. In addition, the algorithm is easily...
متن کاملNew Proportionate Affine Projection Algorithm
A new proportionate-type affine projection algorithm with intermittent update of the weight coefficients is proposed. It takes into account the “history” of the proportionate factors and uses a fast recursive filtering procedure. Also, the effect of using dichotomous coordinate descent iterations is investigated. Simulation results indicate that the proposed algorithm has improved performance a...
متن کاملThe Gauss-seidel Fast Affine Projection Algorithm
In this paper we propose a new stable Fast Affine Projection algorithm based on Gauss -Seidel iterations (GSFAP). We investigate its implementation using the logarithmic number system (LNS) and compare it with other two FAP algorithms. A method to simplify its implementation is also proposed. We show that the 32-bit or 20-bit LNS implementation of the GSFAP algorithm is superior to those of oth...
متن کاملThe data-selective constrained affine-projection algorithm
This paper introduces a constrained version of the recently proposed set-membership affine projection algorithm based on the set-membershp criteria for coefficient update. The algorithm is suitable for linearly-constrained minimum-varianc filtering applications. The data selective property of the proposed algorithm greatly reduces the computational burden as compared with a nonselective approac...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Wireless Communications and Mobile Computing
سال: 2021
ISSN: 1530-8677,1530-8669
DOI: 10.1155/2021/5536455