A Pseudo-random Number Generator for Multi-Sequence Generation with Programmable Statistics
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 nonuniform 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<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> 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.
Authors
- Zeljko Ignjatovic (ORCID: https://orcid.org/0000-0002-2070-3868)
- Eslam Elmitwalli (ORCID: https://orcid.org/0000-0003-4396-2683)
- Jianan Wu (ORCID: https://orcid.org/0000-0001-7136-8492)
- Selçuk Köse (ORCID: https://orcid.org/0000-0001-8095-6691)
- Ahmad Jamal Salim
Institutions
- University of Rochester (US)
Publication Details
- Published
- 2025-05-25
- DOI
- https://doi.org/10.1109/iscas56072.2025.11044009
- Primary Topic
- Algorithms and Data Compression
- Type
- article
- Field-Weighted Citation Impact
- 0.00