.png){kind=icon}
Return
The NLMS algorithm in block floating-point format
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2003.822891.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a novel scheme to implement the normalized least mean square algorithm in block floating-point (BFP) format, which permits processing of data over a wide dynamic range, at a cost significantly less than that of a floating-point processor. Appropriate BFP formats for both the data and the filter coefficients are adopted. Care is taken so that the chosen formats remain invariant to interblock transition and weight-updating operation, respectively. Care is also taken to prevent overflow during filtering, as well as weight-updating processes, by using a dynamic scaling of the data and a slightly reduced range for the step size control parameter, with the latter having negligible effect on convergence speed.
Keywords:
adaptive filters
block floating-point (BFP) arithmetic
normalized least mean square (NLMS) methods
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
No organization information available
Cited Papers
ShareSaveFurther Studies on the Abnormal Factor X (Factor X Friuli) Coagulation Disorder: A Report of Another Family.png)
Blood
OAAI
BloodIF0
OAAIShareSave no more
no more