Abstract
Previously, a family of memory proportionate affine projection (MPAP) algorithms has been proposed by taking into account the 'history' of the proportionate factors for sparse system identification. This paper presents a low-complexity implementation of this family of MPAP algorithms. Two most important ideas are used in the derivation of the fast algorithm. The first one is to update the auxiliary coefficient vector rather than the true coefficient vector. The second interesting idea is to calculate the error vector by using a recursive technique. Simulation results demonstrate the effectiveness of the fast algorithms.
| Original language | English |
|---|---|
| Title of host publication | 2015 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2015 - Proceedings |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 3507-3511 |
| Number of pages | 5 |
| ISBN (Electronic) | 9781467369978 |
| DOIs | |
| Publication status | Published - Aug 4 2015 |
| Externally published | Yes |
| Event | 40th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2015 - Brisbane, Australia Duration: Apr 19 2014 → Apr 24 2014 |
Publication series
| Name | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |
|---|---|
| Volume | 2015-August |
| ISSN (Print) | 1520-6149 |
Conference
| Conference | 40th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2015 |
|---|---|
| Country/Territory | Australia |
| City | Brisbane |
| Period | 4/19/14 → 4/24/14 |
Bibliographical note
Publisher Copyright:© 2015 IEEE.
ASJC Scopus Subject Areas
- Software
- Signal Processing
- Electrical and Electronic Engineering
Keywords
- adaptive filtering
- fast implementation
- proportionate affine projection
- sparse impulse response