By Topic

Efficient implementation of a variable projection order affine projection algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Albu, F. ; Fac. of Electron., Telecommun., & Inf. Technol., Univ. Politeh. of Bucharest, Bucharest, Romania ; Paleologu, C. ; Benesty, J.

Many fast affine projection (FAP) algorithms have been proposed in the last two decades. These algorithms offer a good tradeoff between convergence rate and computational complexity. Most of the existing FAP algorithms use a constant projection order. Recently, the evolutionary APA (E-APA) with a variable projection order has been proposed. In this paper, an efficient implementation of the E-APA based on dichotomous coordinate descent (DCD) method is proposed and investigated. It is shown that the proposed algorithm obtains both fast convergence speed and small steady-state error.

Published in:

Wireless Communication Systems (ISWCS), 2010 7th International Symposium on

Date of Conference:

19-22 Sept. 2010