Name
Abstract | ||
|---|---|---|
Adaptive sparse system identification (ASIDE) techniques have been successfully applied in many applications, such as sparse channel estimation and radar target detection. Normalized least mean fourth (NLMF)-type algorithms are considered as one of the stable ASIDE techniques even at low signal-to-noise ratio (SNR). However, the convergence capability of sparse NLMF algorithms is severely decreased by initial mean square error (MSE) and input variance in the high SNR regimes. To improve the convergence speed of the sparse NLMF algorithms in all SNR regions, in this paper, we propose a kind of non-constraint fast sparse NLMF-type algorithms for applying in ASIDE. Unlike the conventional methods, the proposed algorithms provides an alternative way to get rid of the restriction of SNR-dependent initial MSE and input variance. The proposed fast sparse NLMF-type algorithms are validated via computer simulations. |
Year | Venue | Keywords |
|---|---|---|
2015 | Asia-Pacific Signal and Information Processing Association Annual Summit and Conference | Normalized least mean fourth (NLMF),adaptive sparse system identification (ASIDE),fast convergence speed,sparse constraints |
Field | DocType | ISSN |
Radar,Convergence (routing),Approximation algorithm,Computer science,Adaptive system,Sparse approximation,Signal-to-noise ratio,Algorithm,Mean squared error,System identification | Conference | 2309-9402 |
Citations | PageRank | References |
1 | 0.36 | 10 |
Authors | ||
4 | ||