How Homogenize Chaos-Based Pseudo-random Sequences

This letter presents a universally valid algorithm designed for homogenizing chaos-based pseudo-random number generators (PRNGs). The algorithm bases on shifting-bit operations represented by floating-point numbers on computers, without aiming at material chaotic systems. Set Logistic map, Henon map and Lorenz system as examples to test the algorithm, respectively, showing that it is viable. We can reasonably expect that this algorithm become the standardized modular of design of chaotic PRNGs in hardware implementation.