Analysis of the hierarchical LMS algorithm

We analyze the hierarchical least mean-square (HLMS) algorithm, providing expressions for its steady-state mean-square error (MSE). We find conditions for the hierarchical structure to be equivalent to the optimal (full-length) Wiener solution. When these conditions are not satisfied, we show that H...

Full description

Saved in:
Bibliographic Details
Published inIEEE signal processing letters Vol. 10; no. 3; pp. 78 - 81
Main Author Nascimento, V.H.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.03.2003
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text
ISSN1070-9908
1558-2361
DOI10.1109/LSP.2002.807863

Cover

More Information
Summary:We analyze the hierarchical least mean-square (HLMS) algorithm, providing expressions for its steady-state mean-square error (MSE). We find conditions for the hierarchical structure to be equivalent to the optimal (full-length) Wiener solution. When these conditions are not satisfied, we show that HLMS will compute biased estimates. Our analysis also shows that even when these conditions hold, the MSE obtained using HLMS may be much larger than that obtained using LMS, since the potentially large MSEs at the subfilters in the first hierarchical level directly affect the output MSE.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2002.807863