Fig. 3.

The binary representation for the ∧− bit integer value I in the range [0,2^∧ − 1]. B_λ ∈ {0, 1} is found iteratively by calculating $\lfloor (I-{\sum }_{l=1}^{\lambda -1}{2}^{\mathrm{\Lambda }-l}{B}_l)/2^{\mathrm{\Lambda }-\lambda }\rfloor$ starting from λ = 1, ⌊ ⌋ is the floor function. The map from the analog to binary for the first three bits is shown schematically here, where each bit divide the interval in half iteratively starting from the most significant bit B₁.