Abstract
The patterns of formation of pseudo-random sequences by discrete chaotic algorithms with a delay of the Fibonacci type are studied. The algorithms are defined on a closed interval of integers; the generated numbers are returned to a given interval, which provides an effective mechanism for mixing in the phase space. For various values of the parameters, the spectra of periods of sequences are determined for an arbitrary set of initial values that uniquely determine the state of the system in its phase space. Relationships are obtained that make it possible to reduce the search time for the maximum period of a pseudo-random sequence formed by a recurrent chaotic Fibonacci-type algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Radioelectronics. Nanosystems. Information Technologies.
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
