The Voss algorithm on 1D grid is based on an iterative partitioning of the initial segment into smaller subsegments by linear interpolation of additional points.
At each iteration, all values of the fractal Brownian function get normal pseudorandom additions with zero mean and standard deviation, which depends on the iteration index i.
In the classical version of the Voss algorithm a standard deviation is exponentially distributed by iteration: s[i] <- s0*r^(i*H), where the initial value s0 <- H*log(1/r).