Paper
16 May 2005 Generation of quasi-normal variables using discrete chaotic maps
Author Affiliations +
Abstract
We evaluated two random number generator algorithms using first-order and second-order chaotic maps. The first algorithm, which is based on the central limit theorem, allows us to approximate a Gaussian random variable as the sum of a given chaotic sequence. We considered two first-order maps (Bernoulli, Tent) and two second-order maps (Logistic, and Quadratic). In each instance, we verified that the sequence of random numbers had kurtosis of 3. In the case of the Bernoulli map, we determined that the statistical independence of samples is dependent on the map parameter B. The second algorithm, which is based on Von Neumann's Method, allowed us to reject samples from a chaotic sequence with uniform distribution to obtain a Gaussian distribution within a specific range (U, V). For the first-order maps, we estimated their probability density function in this range and computed deviations from the theoretical Gaussian density. In summary, we determined that samples generated via these two algorithms satisfied statistical tests for normal distributions, thus demonstrating that chaotic maps can be effectively to generate Gaussian samples.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Benjamin C. Flores, Berenice Verdin, Gabriel Thomas, and Ali Ashtari "Generation of quasi-normal variables using discrete chaotic maps", Proc. SPIE 5788, Radar Sensor Technology IX, (16 May 2005); https://doi.org/10.1117/12.603962
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Statistical analysis

Algorithms

Error analysis

Electroluminescence

Alternate lighting of surfaces

Convolution

Radar

Back to Top