Abstract

This paper presents a statistical analysis of a Pseudo Affine Projection (PAP) algorithm, obtained from the Affine Projection algorithm (AP) for a step size alpha < 1 and a scalar error signal in the weight update. Deterministic recursive equations are derived for the mean weight and for the mean square error (MSE) for a large number of adaptive taps N compared to the order P of the algorithm. Simulations are presented which show good to excellent agreement with the theory in the transient and steady states. The PAP learning behavior is of special interest in applications where tradeoffs are necessary between convergence speed and steady-state misadjustment.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.