Adaptive filter theory (3rd ed.)
Adaptive filter theory (3rd ed.)
Adaptive Filtering: Algorithms and Practical Implementation
Adaptive Filtering: Algorithms and Practical Implementation
ICASSP '96 Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03
Novel sparse adaptive algorithm in the Haar transform domain
ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01
Exploiting sparsity in adaptive filters
IEEE Transactions on Signal Processing
LMS estimation via structural detection
IEEE Transactions on Signal Processing
Rapid identification of a sparse impulse response using an adaptive algorithm in the Haar domain
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
Hi-index | 0.00 |
In this paper we present a low power system identification algorithm suitable for echo and crosstalk cancellation in data communications. Crosstalk and echo channels tend to be sparse systems i.e. many taps are negligible with just a few taps significant or active. The proposed adaptive algorithm, called the sparse cross-correlation (SCC) algorithm is designed to exploit the sparsity of crosstalk and echo channels in order to lower the power consumption in the circuit implementation when compared to the normalized least mean squares (NLMS) algorithm.Mathematical analysis of the mean square error suggests that zeroing insignificant taps has a relatively small impact on the algorithm performance. This motivates the SCC algorithm, which uses a cross-correlation to identify the active taps in an unknown system and control circuitry to allocate cancellation hardware at these active tap lags. In the case of sparse systems and signal to noise ratios (SNR) of 10 dB or less, we found that the SCC algorithm can do up to 2 dB better than the NLMS algorithm in terms of the achievable mean square error floor.A detailed hardware implementation of this algorithm is also presented and compared to the benchmark NLMS algorithm in terms of area, critical path and power consumption. Results indicate that a power saving of up to 40% can be achieved at a realistic canceller length of 64 taps while maintaining algorithm performance.