A new nonrecursive pseudorandom number generator based on chaos mappings
Hirotake Yaguchi, Izumi Kubo
Abstract
Open-access reader
Hirotake Yaguchi, Izumi Kubo
Abstract
Open-access reader
We introduce a new pseudorandom number generator SSR (the Simplified Shift-Real random number generator) which generates the k -th random number nonrecursively (directly) based on chaos mappings on the interval [1, 2). We investigate properties of SSR random numbers and give the theoretical background of generation of random numbers. A practical integral (all-integer) version SSI of SSR, which is suitable for parallel computation, is also provided.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We introduce a new pseudorandom number generator SSR (the Simplified Shift-Real random number generator) which generates the k -th random number nonrecursively (directly) based on chaos mappings on the interval [1, 2). We investigate properties of SSR random numbers and give the theoretical background of generation of random numbers. A practical integral (all-integer) version SSI of SSR, which is suitable for parallel computation, is also provided.
Key concepts: Pseudorandom number generator, Random number generation, Random seed, Generator (circuit theory), CHAOS (operating system), Pseudorandom generator theorem, Mathematics, Computation