Algorithm 3 Initialize the array of the predicted offsets.

Require:M // the number of bits for ADPCM encoder. Require: $c_k$ // the array of the initial values for C[N/4]. Ensure: C // the array used for the predicted offset amount.  // When M=N/2  for $j=0$ to $2^{N/2-1}$ do    $C[N/2]\left[j\right]\leftarrow c_k$  end for  // When M<N/2  for $i=N/2-1$ downto 1 do   for$j=1$ to $2^{i-1}$ do     $C\left[i\right][j-1]\leftarrow \left(C\right[i+1\left]\right[j\times 2-2]+C[i+1\left]\right[j\times 2-1\left]\right)/2$   end for  end for  // When M>N/2  for $i=N/2+1$ to N do    $C\left[i\right]\left[0\right]\leftarrow C[i-1]\left[0\right]$    $j\leftarrow 2$   while $j<2^{i-1}$ do     $C\left[i\right][j-1]\leftarrow C[i-1][j/2-1]$     $C\left[i\right]\left[j\right]\leftarrow \left(C\right[i-1\left]\right[j/2-1]+C[i-1\left]\right[j/2\left]\right)/2$     $j\leftarrow j+2$   end while    $C\left[i\right][2^{i-1}-1]\leftarrow C[i-1][j/2-1]$  end for