首页 | 本学科首页   官方微博 | 高级检索  
     

Analysis and confirmation of fixed points in logistic mapping digital-flow chaos
作者姓名:GuobaoXu  DelingZheng  GengZhao
作者单位:[1]InformationEngineeringSchool,UniversityofScienceandTechnologyBeijing,Beijing100083,China [2]ScienceandResearchCenter,BeijingElectronicScienceandTechnologyInstitute,Beijing100070,China
摘    要:The fixed points in logistic mapping digital-flow chaos strange attractor are studied in detail. When k=n in logistic equation, there exist no more than 2n fixed points, which are deduced and proved theoretically. Three corollaries about the fixed points of logistic mapping are proposed and proved respectively. These theorem and corollaries provide a theoretical basis for choosing parameter of chaotic sequences in chaotic secure communication and chaotic digital watermarking. And they are testified by simulation.

关 键 词:不动点理论  逻辑映射  混沌系统  逻辑方程

Analysis and confirmation of fixed points in logistic mapping digital-flow chaos
GuobaoXu DelingZheng GengZhao.Analysis and confirmation of fixed points in logistic mapping digital-flow chaos[J].Journal of University of Science and Technology Beijing,2003,10(3):62-65.
Authors:Guobao Xu  Deling Zheng  Geng Zhao
Abstract:The fixed points in logistic mapping digital-flow chaos strange attractor are studied in detail. When k=n in logistic equation, there exist no more than 2n fixed points, which are deduced and proved theoretically. Three corollaries about the fixed points of logistic mapping are proposed and proved respectively. These theorem and corollaries provide a theoretical basis for choosing parameter of chaotic sequences in chaotic secure communication and chaotic digital watermarking. And they are testified by simulation.
Keywords:chaos  logistic mapping  fixed point  strange attractor
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号