The fixed points in logistic mapping digital-flow chaos strange attractor arestudied in detail. When k=n in logistic equation, there exist no more than 2n fixed points, whichare deduced and proved theoretically. Three...The fixed points in logistic mapping digital-flow chaos strange attractor arestudied in detail. When k=n in logistic equation, there exist no more than 2n fixed points, whichare deduced and proved theoretically. Three corollaries about the fixed points of logistic mappingare proposed and proved respectively. These theorem and corollaries provide a theoretical basis forchoosing parameter of chaotic sequences in chaotic secure communication and chaotic digitalwatermarking. And they are testified by simulation.展开更多
基金This work was financially supported by the National Natural Science Foundation of China(No.69772014).]
文摘The fixed points in logistic mapping digital-flow chaos strange attractor arestudied in detail. When k=n in logistic equation, there exist no more than 2n fixed points, whichare deduced and proved theoretically. Three corollaries about the fixed points of logistic mappingare proposed and proved respectively. These theorem and corollaries provide a theoretical basis forchoosing parameter of chaotic sequences in chaotic secure communication and chaotic digitalwatermarking. And they are testified by simulation.
