58 research outputs found
Adaptive filters for sparse system identification
Sparse system identification has attracted much attention in the field of adaptive algorithms, and the adaptive filters for sparse system identification are studied. Firstly, a new family of proportionate normalized least mean square (PNLMS) adaptive algorithms that improve the performance of identifying block-sparse systems is proposed. The main proposed algorithm, called block-sparse PNLMS (BS-PNLMS), is based on the optimization of a mixed â„“2,1 norm of the adaptive filter\u27s coefficients. A block-sparse improved PNLMS (BS-IPNLMS) is also derived for both sparse and dispersive impulse responses. Meanwhile, the proposed block-sparse proportionate idea has been extended to both the proportionate affine projection algorithm (PAPA) and the proportionate affine projection sign algorithm (PAPSA).
Secondly, a generalized scheme for a family of proportionate algorithms is also presented based on convex optimization. Then a novel low-complexity reweighted PAPA is derived from this generalized scheme which could achieve both better performance and lower complexity than previous ones. The sparseness of the channel is taken into account to improve the performance for dispersive system identification. Meanwhile, the memory of the filter\u27s coefficients is combined with row action projections (RAP) to significantly reduce the computational complexity.
Finally, two variable step-size zero-point attracting projection (VSS-ZAP) algorithms for sparse system identification are proposed. The proposed VSS-ZAPs are based on the approximations of the difference between the sparseness measure of current filter coefficients and the real channel, which could gain lower steady-state misalignment and also track the change in the sparse system --Abstract, page iv
Sparseness-controlled adaptive algorithms for supervised and unsupervised system identification
In single-channel hands-free telephony, the acoustic coupling between the loudspeaker and
the microphone can be strong and this generates echoes that can degrade user experience.
Therefore, effective acoustic echo cancellation (AEC) is necessary to maintain a stable
system and hence improve the perceived voice quality of a call. Traditionally, adaptive
filters have been deployed in acoustic echo cancellers to estimate the acoustic impulse
responses (AIRs) using adaptive algorithms. The performances of a range of well-known
algorithms are studied in the context of both AEC and network echo cancellation (NEC).
It presents insights into their tracking performances under both time-invariant and time-varying
system conditions.
In the context of AEC, the level of sparseness in AIRs can vary greatly in a mobile
environment. When the response is strongly sparse, convergence of conventional
approaches is poor. Drawing on techniques originally developed for NEC, a class of time-domain
and a frequency-domain AEC algorithms are proposed that can not only work
well in both sparse and dispersive circumstances, but also adapt dynamically to the level
of sparseness using a new sparseness-controlled approach.
As it will be shown later that the early part of the acoustic echo path is sparse
while the late reverberant part of the acoustic path is dispersive, a novel approach to
an adaptive filter structure that consists of two time-domain partition blocks is proposed
such that different adaptive algorithms can be used for each part. By properly controlling
the mixing parameter for the partitioned blocks separately, where the block lengths are
controlled adaptively, the proposed partitioned block algorithm works well in both sparse
and dispersive time-varying circumstances.
A new insight into an analysis on the tracking performance of improved proportionate
NLMS (IPNLMS) is presented by deriving the expression for the mean-square error.
By employing the framework for both sparse and dispersive time-varying echo paths, this
work validates the analytic results in practical simulations for AEC.
The time-domain second-order statistic based blind SIMO identification algorithms,
which exploit the cross relation method, are investigated and then a technique with proportionate
step-size control for both sparse and dispersive system identification is also
developed
- …