A New Formula to Compute the NLMS Algorithm at a Computational Complexity of <i>O</i>(2<i>N</i>)

A New Formula to Compute the NLMS Algorithm at a Computational Complexity of <i>O</i>(2<i>N</i>)
复制标题

计算复杂度为<i>O</i>(2<i>N</i>)的NLMS算法的新计算公式

DOI:
10.1587/transfun.e102.a.1545
复制
发表时间:
2019
期刊:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
影响因子:
--
通讯作者:
HIRUMA Nobuhiko
HIRUMA Nobuhiko
中科院分区:
--
文献类型:
--
作者:
NISHIYAMA Kiyoshi;SUNOHARA Masahiro;HIRUMA Nobuhiko

文献摘要

相似文献