Rounding logistic maps over integers and the properties of the generated sequences

Takeru Miyazaki, Shunsuke Araki, Yasuyuki Nogami, Satoshi Uehara

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

Because of its simple structure, many reports on the logistic map have been presented. To implement this map on computers, finite precision is usually used, and therefore rounding is required. There are five major methods to implement rounding, but, to date, no study of rounding applied to the logistic map has been reported. In the present paper, we present experimental results showing that the properties of sequences generated by the logistic map are heavily dependent on the rounding method used and give a theoretical analysis of each method. Then, we describe why using the map with a floor function for rounding generates long aperiodic subsequences.

Original languageEnglish
Pages (from-to)1817-1825
Number of pages9
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE94-A
Issue number9
DOIs
Publication statusPublished - Sep 2011

    Fingerprint

Keywords

  • Link length
  • Logistic maps over integers
  • Period
  • Rounding

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics
  • Signal Processing

Cite this