# Understanding Voss-McCartney pink noise generation algorithm

I'm implementing the Voss-McCartney pink noise generation algorithm.

from James McCartney 2 Sep 1999 21:00:30 -0600:

The top end of the spectrum wasn't as good. The cascade of sin(x)/x shapes that I predicted in my other post was quite obvious. Ripple was only about 2dB up to Fs/8 and 4dB up to Fs/5. The response was about 5dB down at Fs/4 (one of the sin(x)/x nulls), and there was a deep null at Fs/2. (These figures are a bit rough. More averaging would have helped.)

You can improve the top octave somewhat by adding a white noise generator at the same amplitude as the others. Which fills in the diagram as follows:

xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
x x x x x x x x x x x x x x x x
x   x   x   x   x   x   x   x
x       x       x       x
x               x
x


It'll still be bumpy up there, but the nulls won't be as deep.

If I understand it well, this algorithm generates pink noise by adding random (white?) noise sources at different frequencies1

However, I don't fully understand the explanation given in the quote above for the extra white noise generator on the "top row". Can someone clarify how/why it improves the algorithm? Does that make it a good algorithm for pink noise generation for audio applications? Especially, shouldn't I discard the first samples until all the "rows" were mixed into the signal (in the ASCII art quoted above, that would mean discarding 15 first samples)?

1 I'm not sure of the wording here. Do not hesitate to correct me if I'm wrong

• There are much simpler & more efficient methods to generate white noise. See for example: ccrma.stanford.edu/~jos/sasp/Example_Synthesis_1_F_Noise.html These are often not as good at very low frequencies but that's actually a good thing in many applications. Huge amount of energy at 0.1 Hz can cause a lot of trouble – Hilmar Dec 3 '19 at 13:08
• @Hilmar Thanks for the comment. You mentioned white noise in your comment. I assume this is a typo for pink noise? – Sylvain Leroux Dec 3 '19 at 13:49
• Oops.Typo. You start with normal distributed white noise and filter it to get pink noise. – Hilmar Dec 3 '19 at 16:31
• That was how I understood it. Thank you for the confirmation @Hilmar. The original question is still valid though ;) – Sylvain Leroux Dec 3 '19 at 16:56
• For making pink noise (and some others), this is what I use: dsp.stackexchange.com/a/56820/41790 . – Ed V Feb 6 at 2:03

So let's look at what the author of the article you linked to says further down; Output samples are on the top row, and are the sum of all the other rows at that time.

Output  /---\/---\/---\/---\/---\/---\/---\/---\/---\/---\/---\/---\/---\/---\/---\/---\/---\/---\
\___/\___/\___/\___/\___/\___/\___/\___/\___/\___/\___/\___/\___/\___/\___/\___/\___/\___/

Row -1  /---\/---\/---\/---\/---\/---\/---\/---\/---\/---\/---\/---\/---\/---\/---\/---\/---\/---\
\___/\___/\___/\___/\___/\___/\___/\___/\___/\___/\___/\___/\___/\___/\___/\___/\___/\___/

Row 0   /--------\/--------\/--------\/--------\/--------\/--------\/--------\/--------\/--------\
\________/\________/\________/\________/\________/\________/\________/\________/\________/

Row 1   --------------\/------------------\/------------------\/------------------\/--------------
______________/\__________________/\__________________/\__________________/\______________

Row 2   ------------------------\/--------------------------------------\/------------------------
________________________/\______________________________________/\________________________

Row 3   --------------------------------------------\/--------------------------------------------
____________________________________________/\____________________________________________

Row 4   ------------------------------------------------------------------------------------\/----
____________________________________________________________________________________/\____


This means that the above diagram has multiple different white sequences, which they only occasionally change – let's formalize that. Start with only the two top rows:

• Row -1 is simply white noise
• Row 0 is white noise, interpolated by a factor of 2 with a 2-sample-boxcar-filter / sample-and-hold. That gives that noise an (aliased) sinc shape, which is essentially a low-pass shape

Row 1…N do the same, with the sincs becomming narrower by factors of 2.

Thinking about the discrete PSD of this:

• Row -1 has a constant discrete PSD
• Row 0 adds sinc(2f)²-shaped power to that
• Row 1 adds sinc(4f)²-shaped power to that
• and so on

All in all, I don't have a proof that this becomes perfectly pink at hand, it probably doesn't within finite observation, but it's kind of intuitive to think that close to 0 Hz, all the main lobes of these sinc²s add up, and with every doubling of frequency, you get closer to the zeros of more sinc²s.

The proposed algorithm really doesn't seem so elegant – generating good (discrete) white (pseuderandom) noise is actually surprisingly hard for longer observational windows (which is what you need if you want to assess the quality of something), and hence, having a pseudorandom generator¹ run at asymptotically twice the sampling rate seems more effort then letting it run at the sampling rate and then using an appropriate low-pass filter that approximates the desired spectral shape (in this case, $$\lvert H(f)\rvert \propto \frac1f$$); at least on modern CPUs, which have excellent SIMD instructions (i.e. highly optimized for running filters, not so much for running pseudo-random noise generators), the difference between holding and adding up many noise values and doing a FIR is that the FIR requires multiplication of held values with constants (the filter taps) – and since that can typically done in a fused multiply-accumulate operation.

Now, on an ASIC or FPGA, things might look different; if the amplitude distribution of the noise doesn't matter (i.e. there's no need to add up anything but uniformly drawn, uncorrelated samples), then you can actually save on complexity by doing the "simpler" thing, i.e. logical operations needed to generate e.g. XOROSHIRO128** would very likely be clocked much higher than the multipliers needed for a nice FIR filter.

¹you don't need multiple generators – you just ask that one white one more often; white samples are uncorrelated in every subsampling!

• Thanks for the answer @Marcus. "All in all, I don't have a proof that this becomes perfectly pink at hand, it probably doesn't within finite observation" I worked on that this afternoon, and, barring implementation errors, it does seem such a good pink noise generator. I suspect that's because for each additional "row" to kick in, you have to read twice as many samples. Something that quickly becomes prohibitive. Or am I wrong? – Sylvain Leroux Dec 3 '19 at 21:54
• Kind of. The more I think about this: this process is not weak-sense stationary. But without being WSS, it can't have a properly defined power spectral density. Without PSD, I can't say it's pink... – Marcus Müller Dec 3 '19 at 22:10
• ah wait, this might actually be WSS; the autocorrelation function actually seems to be definable without taking absolute times into consideration. – Marcus Müller Dec 3 '19 at 22:26
• I must confess this is beyond my understanding @Marcus. WSS? – Sylvain Leroux Dec 3 '19 at 22:31
• WSS=weak-sense (or wide-sense) stationary, i.e. you can compare, by finding the expectation of the product of these to values, the value of the noise at time $t_1$ to the value at time $t_2$, and then that comparison only depends on the difference $t_2-t_1=:\tau$. The power spectral density, "the spectrum", is the Fourier transform of the function of the above expectation for all $\tau$. – Marcus Müller Dec 3 '19 at 22:46

First, let’s separate the Voss part from the McCartney. The first generates a 1/f distribution of random numbers, with power inversely proportional to frequency—pink noise. McCartney proposed a change that gives a more flat computational load.

A brief overview of Voss:

Start with random number generators, one for each bit in a binary counter. Let’s consider a simple case of three:

000
001
010
011
100
101
110
111
(and continuing with rollover back to 000)


The counter increments by 1 for each new output sample. There are three random number generators, one for each column. When the digit in a column changes, its corresponding generator produces a new random number. Otherwise, the generator maintains its previous value.

As the final step, for each cycle, all generators are summed to produce the output of the process.

The computational load is uneven. Every other cycle has only a single generator change, while every fourth time all three change (011 -> 100, and 111 -> 000). Practical pink source need more generators, so the worst case gets worse.

McCartney’s method reworks the process for an even load.