QQ客服 官方微博 反馈留言

	Variable partial-update NLMS algorithms with data-selective updating
	ZHU FengChao ; GAO FeiFei ; YAO MinLi ; ZOU HongXing ; ZHU FengChao ; GAO FeiFei ; YAO MinLi ; ZOU HongXing
	2016-03-30 ; 2016-03-30
关键词	adaptive filter NLMS algorithm date-selective partial update set-membership filtering computational complexity TN713
其他题名	Variable partial-update NLMS algorithms with data-selective updating
中文摘要	We note that some existing algorithms are based on the normalized least-mean square(NLMS)algorithm and aim to reduce the computational complexity of NLMS all inherited from the solution of the same optimization problem,but with different constraints.A new constraint is analyzed to substitute an extra searching technique in the set-membership partial-update NLMS algorithm(SM-PU-NLMS)which aims to get a variable number of updating coefficients for a further reduction of computational complexity.We get a closed form expression of the new constraint without extra searching technique to generate a novel set-membership variable-partial-update NLMS(SM-VPU-NLMS)algorithm.Note that the SM-VPU-NLMS algorithm obtains a faster convergence and a smaller mean-squared error(MSE)than the existing SM-PU-NLMS.It is pointed out that the closed form expression can also be applied to the conventional variable-step-size partial-update NLMS(VSS-PU-NLMS)algorithm.The novel variable-step-size variable-partial-update NLMS(VSS-VPU-NLMS)algorithm is also verified to get a further computational complexity reduction.Simulation results verify that our analysis is reasonable and effective.; We note that some existing algorithms are based on the normalized least-mean square(NLMS) algorithm and aim to reduce the computational complexity of NLMS all inherited from the solution of the same optimization problem, but with different constraints. A new constraint is analyzed to substitute an extra searching technique in the set-membership partial-update NLMS algorithm(SM-PU-NLMS) which aims to get a variable number of updating coefficients for a further reduction of computational complexity. We get a closed form expression of the new constraint without extra searching technique to generate a novel set-membership variable-partial-update NLMS(SM-VPU-NLMS) algorithm. Note that the SM-VPU-NLMS algorithm obtains a faster convergence and a smaller mean-squared error(MSE) than the existing SM-PU-NLMS. It is pointed out that the closed form expression can also be applied to the conventional variable-step-size partial-update NLMS(VSS-PU-NLMS) algorithm. The novel variable-step-size variable-partial-update NLMS(VSS-VPU-NLMS) algorithm is also verified to get a further computational complexity reduction. Simulation results verify that our analysis is reasonable and effective.
语种	英语 ; 英语
内容类型	期刊论文
源URL	[http://ir.lib.tsinghua.edu.cn/ir/item.do?handle=123456789/146861]
专题	清华大学
推荐引用方式 GB/T 7714	ZHU FengChao,GAO FeiFei,YAO MinLi,et al. Variable partial-update NLMS algorithms with data-selective updating[J],2016, 2016.
APA	ZHU FengChao.,GAO FeiFei.,YAO MinLi.,ZOU HongXing.,ZHU FengChao.,...&ZOU HongXing.(2016).Variable partial-update NLMS algorithms with data-selective updating..
MLA	ZHU FengChao,et al."Variable partial-update NLMS algorithms with data-selective updating".(2016).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。