A Pseudo-random Number Generator for Multi-Sequence Generation with Programmable Statistics
Jianan Wu, Ahmet Yusuf Salim, Eslam Elmitwalli, Sel\c{c}uk K\"ose and, Zeljko Ignjatovic

TL;DR
This paper introduces a compact hardware PRNG capable of generating multiple uncorrelated sequences with customizable statistical properties, suitable for diverse applications requiring controlled randomness.
Contribution
It presents a novel hardware PRNG design that produces multiple uncorrelated sequences with programmable statistics in a small area and low energy consumption.
Findings
Successfully generates multiple uncorrelated sequences
Can tailor statistical distributions for specific needs
Maintains high-quality randomness in simulations
Abstract
Pseudo-random number generators (PRNGs) are essential in a wide range of applications, from cryptography to statistical simulations and optimization algorithms. While uniform randomness is crucial for security-critical areas like cryptography, many domains, such as simulated annealing and CMOS-based Ising Machines, benefit from controlled or non-uniform randomness to enhance solution exploration and optimize performance. This paper presents a hardware PRNG that can simultaneously generate multiple uncorrelated sequences with programmable statistics tailored to specific application needs. Designed in 65nm process, the PRNG occupies an area of approximately 0.0013mm^2 and has an energy consumption of 0.57pJ/bit. Simulations confirm the PRNG's effectiveness in modulating the statistical distribution while demonstrating high-quality randomness properties.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Computational Physics and Python Applications · Chaos-based Image/Signal Encryption
