2012
DOI: 10.1049/el.2012.2403
|View full text |Cite
|
Sign up to set email alerts
|

Memory improved proportionate affine projection sign algorithm

Abstract: A new proportionate affine projection sign algorithm is proposed for network echo cancellation. It uses a recursive procedure and takes into account the previously computed proportionate coefficients. It is shown that the proposed algorithm can obtain a lower steady-state misalignment than other affine projection sign algorithms for different echo paths, impulsive interferences and step sizes.Introduction: The family of affine projection algorithms (APAs) is known to provide a better convergence performance in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
24
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 40 publications
(24 citation statements)
references
References 5 publications
(15 reference statements)
0
24
0
Order By: Relevance
“…Simulation results demonstrated that, the new BS-PNLMS algorithm outperforms the NLMS, PNLMS and IPNLMS algorithms for the block-sparse system, and the new BS-IPNLMS algorithm is more preferred for the dispersive system. This block-sparse proportionate idea proposed in this paper could be further extended to many other proportionate algorithms, including proportionate affine projection algorithm (PAPA) [23], proportionate affine projection sign algorithm (PAPSA) [24], and their corresponding low complexity implementations [25]- [26] etc. The proof of convergence for the proposed BS-PNLMS and BS-IPNLMS algorithms can also be part of the future work.…”
Section: Discussionmentioning
confidence: 99%
“…Simulation results demonstrated that, the new BS-PNLMS algorithm outperforms the NLMS, PNLMS and IPNLMS algorithms for the block-sparse system, and the new BS-IPNLMS algorithm is more preferred for the dispersive system. This block-sparse proportionate idea proposed in this paper could be further extended to many other proportionate algorithms, including proportionate affine projection algorithm (PAPA) [23], proportionate affine projection sign algorithm (PAPSA) [24], and their corresponding low complexity implementations [25]- [26] etc. The proof of convergence for the proposed BS-PNLMS and BS-IPNLMS algorithms can also be part of the future work.…”
Section: Discussionmentioning
confidence: 99%
“…MIP−APSA [9] Normalized LHTAF with K=200 [10] Normalized LHTAF with K=50 [10] Normalized LVHTAF with K min =50 [10] IP−MCC [Proposed] Fig. 3.…”
Section: Msd (Db)mentioning
confidence: 99%
“…Clearly, different strategies to calculate G(k) can lead to different proportionate-type APSAs, as shown in [14]- [15], and simulation results has shown that these algorithms converge faster than the APSA for sparse impulse responses. Particularly, the APSA is obtained when G(k) is equal to the identity matrix, i.e., all the filter weight coefficients are assigned the same step-size.…”
Section: A Proportionate Framementioning
confidence: 99%
“…In [14], the proportionate ideas of the PAPA and IPAPA (or the PNLMS and IPNLMS) are directly extended to the APSA, respectively, and the resulting proportionate APSA (RP-APSA) and improved RP-APSA (RIP-APSA) achieve faster convergence rate than the APSA in sparse system. Afterwards, a memory RIP-APSA (MIP-APSA) [15] was proposed which obtains a lower steadystate misalignment than the RIP-APSA.…”
Section: Introductionmentioning
confidence: 99%