A CHARACTERIZATION OF A CLASS OF DISCRETE NONLINEAR FEEDBACK SYSTEMS.pdfVIP

下载本文档

1
0
约 6页
2017-04-06 发布于江苏
举报
版权申诉

A CHARACTERIZATION OF A CLASS OF DISCRETE NONLINEAR FEEDBACK SYSTEMS.pdf

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

A CHARACTERIZATION OF A CLASS OF DISCRETE NONLINEAR FEEDBACK SYSTEMS

COMMUNICATIONS IN INFORMATION AND SYSTEMS c? 2005 International Press Vol. 5, No. 3, pp. 305-310, 2005 002 A CHARACTERIZATION OF A CLASS OF DISCRETE NONLINEAR FEEDBACK SYSTEMS DOROTHY I. WALLACE?, CLYDE F. MARTIN? , AND MARK STAMP? Abstract. A class of discrete dynamical systems with nonlinear feedback is considered. These systems generalize various maps arising in connection with chaotic dynamical systems, topological dynamics, and linear systems theory. We give a complete characterization of this class of systems. 1. Introduction. Let F be the finite field {0, 1} and let Bn be the collection of binary n-tuples. In this paper we consider the discrete dynamical system with control (1) ~xk+1 = f(~xk) + ukg(~xk) yk = h(~xk) + uk as well as the more general system (2) ~xk+1 = f(~xk) + ukg(~xk) yk = h(~xk) + ukp(~xk) , where ~xk ∈ B n, uk ∈ F, and f, g : B n → Bn, and h, p : Bn → F. The functions f , g, h and p are necessarily polynomials [2, Theorem 19.1] so that, for example, f is of the form f(x1, x2, . . . , xn) = ? ??? f1(x1, x2, . . . , xn) ... fn(x1, x2, . . . , xn) ? ??? , with each xk ∈ F and the fi’s are polynomials from B n into F. We refer to the systems (1) and (2) as nonlinear feedback systems. These systems arise in various contexts. For example, taking uk = 0 for all k we have ~xk+1 = f(~xk) yk = h(~xk). This particular system appears in [3] and [4] where it is used to analyze pseudo-random binary sequence generators. ? Mathematics and Computer Science, Dartmouth College, Hanover, NH 03755. E-mail: Dorothy.Wallace@dartmouth.edu ? Department of Mathematics, Texas Tech University, Lubbock, TX 79409. E-mail: clyde.f.martin@ttu.edu ? Department of Computer Science, San Jose? State University, San Jose?, CA 95192. E-mail: stamp@cs.sjsu.edu 305 306 DOROTHY I. WALLACE, CLYDE F. MARTIN, AND MARK STAMP Let B∞ be the collection of infinite sequences over F. In [5] the system (3) ~xk+1 = σ(~xk) yk = h(~xk) is considered, where σ is the left-shift, i.e., σ(x1, x2, x