• Title/Summary/Keyword: 텐트 맵 혼돈

Search Result 5, Processing Time 0.02 seconds

Design of Discretized Tent Map (이산화된 텐트맵의 설계)

  • Baek, Seung-Jae;Park, Jin-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.4
    • /
    • pp.86-91
    • /
    • 2008
  • To present the design procedure of discretized 8-bit tent map executing the transformation of tent function which is one of the chaotic functions, first, the truth table of discretized tent map was written, and then according to the simplified Boolean algebra equations obtained from the truth table, the discretized map is implemented with the exclusive logic gate as a real hardware. The discretized tent map circuit which provides the feedback circuit for generating the period-8 states relevant to the 8-bit finite precision is also designed and presented in this paper. Furthermore, it might be used stream cipher system with a new key-stream circuit for generate of chaotic binary sequence.

The composition state machine using the chaotic maps (혼돈맵들을 사용하는 합성 상태머신)

  • Park, Kwang-Hyeon;Seo, Yong-Won;Mustafa, Khalifa Eltayeb Kh
    • Proceedings of the KIEE Conference
    • /
    • 2009.07a
    • /
    • pp.1935_1936
    • /
    • 2009
  • 기울기 S=2인 톱니맵 $S_2$(x) 와 텐트맵 $S_2$(x), 두 혼돈맵들을 차례로 연결시킨 합성맵을 사용하여 합성상태머신을 설계하였다. 혼돈맵의 합성논리를 이용하여 설계한 합성상태머신에서 발생하는 난수적인 상태들을 그래프적으로 보였으며, 난수적인 상태들의 주기는 정밀도와 이산화된 진리표에 따른 길이를 발생시켰다.

  • PDF

Design of the composition state machine based on the chaotic maps (혼돈맵들에 기반한 합성 상태머신의 설계)

  • Seo, Yong-Won;Park, Jin-Soo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.12
    • /
    • pp.3688-3693
    • /
    • 2009
  • In this paper the design methode of a separated composition state machine based on the compositive map with connecting two chaotic maps together - sawtooth map $S_2(x)$ and tent map $T_2(x)$ and the result of that is proposed. this paper gives a graph of the chaotic states generated by the composition state machine using the compositive logic of two different chaotic maps - sawtooth map and tent map and also shows that the period of pseudo-random states has the length according to the precision of the discreet truth table.

The Design of Chaotic Binary Tream Generator (혼돈 2진 스트림 발생기 설계)

  • Seo, Yong-Won;Park, Jin-Soo
    • Journal of Advanced Navigation Technology
    • /
    • v.17 no.3
    • /
    • pp.292-297
    • /
    • 2013
  • In this paper, The design of digital circuits for chaotic composition function which is used for the key-stream generator is studied in this work. The overall design concept and procedure due to the mathematical model of chaotic key-stream generator is to be the explained in detail, and also the discretized truth table of chaotic composition function is presented in this paper. consequently, a composition state machine based on the compositive map with connecting two types of one dimensional and two dimensional chaotic maps together is designed and presented.

Research on Multi-Vehicle and Multi-Task Route Planning for Autonomous Delivery Robots in Parks (공원 내 자율 배달 로봇을 위한 다중 차량 및 다중 작업 경로 계획 연구)

  • Lu Ke;Byung-Won Min
    • Journal of Internet of Things and Convergence
    • /
    • v.10 no.5
    • /
    • pp.27-37
    • /
    • 2024
  • In the context of multi-vehicle and multi-task logistics distribution within a park, traditional algorithms are often hindered by high computational complexity and slow convergence rates. Particle Swarm Optimization (PSO) has gained popularity in path planning for autonomous delivery vehicles due to its straightforward algorithmic principles, broad applicability, and comprehensive search capabilities. However, the conventional PSO is susceptible to premature convergence, leading to local optima. To address this, this study incorporates the Tent map into the PSO to enhance the algorithm's global search ability and prevent premature convergence. Benchmark function tests demonstrate that the improved Particle Swarm Optimization algorithm (TPSO), as proposed in this study, exhibits faster convergence and greater accuracy.In the instance verification section, X Park was selected as an example to construct a multi-vehicle and multi-task model for the logistics distribution within the park. The TPSO algorithm proposed in this paper was used to solve the model, and finally, the superiority of the TPSO algorithm was verified through comparative simulation.