Papers › Generating long streams of 1/fᵃlpha noise
Generating long streams of 1/fᵃlpha noise
S. Plaszczynski
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We review existing methods for generating long streams of 1/f^alpha noise (0<α≤2) focusing on the digital filtering of white noise. We detail the formalism to conceive an efficient random number generator (white outside some bounds) in order to generate very long streams of noise without an exhaustive computer memory load. For α=2 it is shown why the process is equivalent to a random-walk and can be obtained simply by a first order filtering of white noise. As soon as α<2 the problem becomes non linear and we show why the exact digital filtering method becomes inefficient. Instead, we work out the formalism of using several 1/f^2 filters spaced logarithmically, to approximate the spectrum at the percent level. Finally, from work on logistic maps, we give hints on how to design generators with α>2. The software is available from http://planck.lal.in2p3.fr/article.php3?id_article=8
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections