A fast clipped-data LMS algorithm

A fast implementation of the clipped-data LMS algorithm is described. Carried out partly in the time domain and partly in the frequency domain, this implementation requires, for filter lengths exceeding 64, less computation than the conventional implementation of the clipped-data LMS algorithm.

Saved in:
Bibliographic Details
Published inIEEE transactions on acoustics, speech, and signal processing Vol. 30; no. 4; pp. 648 - 649
Main Author Deivasigamani, L.
Format Journal Article
LanguageEnglish
Published IEEE 01.08.1982
Subjects
Adaptive filters
Bandwidth
Computational complexity
Fast Fourier transforms
Fluctuations
Frequency domain analysis
Least squares approximation
Limiting
Signal processing
Signal processing algorithms
Online AccessGet full text
ISSN0096-3518
DOI10.1109/TASSP.1982.1163922

Cover

More Information
Summary:A fast implementation of the clipped-data LMS algorithm is described. Carried out partly in the time domain and partly in the frequency domain, this implementation requires, for filter lengths exceeding 64, less computation than the conventional implementation of the clipped-data LMS algorithm.
ISSN:0096-3518
DOI:10.1109/TASSP.1982.1163922