Loading [MathJax]/extensions/MathZoom.js
On computational complexity in adaptive digital filters | IEEE Conference Publication | IEEE Xplore

On computational complexity in adaptive digital filters


Abstract:

The field of applications of adaptive digital filters is growing and, as for fixed coefficient filters, system designers and project engineers need simple means for compu...Show More

Abstract:

The field of applications of adaptive digital filters is growing and, as for fixed coefficient filters, system designers and project engineers need simple means for computational complexity assessment. An attempt is made in the present paper to derive simplified expressions for coefficient and internal data wordlengths as a function of specified parameters. Only the gradient technique in direct and cascade forms is considered.
Date of Conference: 14-16 April 1983
Date Added to IEEE Xplore: 29 January 2003
Conference Location: Boston, MA, USA

Contact IEEE to Subscribe

References

References is not available for this document.