On computational complexity in adaptive digital filters

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.