An Algorithm with Randomly Varying Truncation for Adaptive Beam-Formers

Article Contents

Article Navigation > Applied Mathematics and Mechanics > 1986 > 7(5): 435-442

Zhu Yun-min. An Algorithm with Randomly Varying Truncation for Adaptive Beam-Formers[J]. Applied Mathematics and Mechanics, 1986, 7(5): 435-442.

Citation:

Zhu Yun-min. An Algorithm with Randomly Varying Truncation for Adaptive Beam-Formers[J]. Applied Mathematics and Mechanics, 1986, 7(5): 435-442.

Citation:

Zhu Yun-min. An Algorithm with Randomly Varying Truncation for Adaptive Beam-Formers[J]. Applied Mathematics and Mechanics, 1986, 7(5): 435-442.

Abstract

A rewxrsive algorithm with randomly varying truncation for adaptive Bram-Formers is proposed.Simple conditions are obtained to guarantee for this algorithm the global convergence almost everywhere.

[1]	Chang,J,H,and F,B,Tuteur,LASA 49(1971),636-649.
[2]	Widrow,B.,P,E,Mantey,L,J Griffiths,and B.B.Goode,Proc.[3] IFEE,55(1967),2143-2158.
[3]	Frost,O.L.,III.Proc,IEEF.,60,8(1972),926-935
[4]	狄吊照,自适应波束形成算法的收敛性,应用数学学报,5.2(1982),136-144.
[5]	陈翰馥,自适应屯皮束形成器中的递推算法,科学通报.6(1981),326-328.
[6]	狄昂照,具有非平稳相关输入的自适应阵算法,系统科学与数学,3.1(1983),28-40.
[7]	陈翰热、朱允民,随机截尾的随机逼近算法,(待发表).
[8]	Kushner,H,J,and D,S,Clark,Stochastic Approximation Methods for Constrained and Unconstrained Systems,Springer(1978).