In my DSP class a few lectures ago my professor shared a basic algorithm with us for computing wavelet coefficients when the wavelet basis belong to the Haar system. He also shared a circuit with us which looks something like this:
(I made it in tikz rather than having to post a picture of my scribbled notes)
Here is also an example of how the algo works:
Here is a sample input sequence: $$x[n] = 8,2,3,-1,0,4,-2,3$$
Step 1: $$ \underbrace{8 \quad 2}_{\text{Add & divide by 2}} \quad \quad \text{for all four pairs}$$
New Sequence: $$ 5, 1, 2, \frac 12, \color{green} {3,2,-2,-\frac 52}$$
Here the values in green come from subtracting $5$ from $8$, $1$ from $3$ and so on.
Now we repeat step 1 to get:
$$ 3, \frac 54, \color{green} {2, \frac 34}$$
Again values in green come from subtracting $3$ from $5$ and so on.
Now repeat step 1 again:
$$\frac{17}{8}, \color{green} {\frac 78}$$
And now we have our coefficients in order as follows:
$$\textbf{Coefficients} = \{\frac{17}{8}, \frac 78, 2, \frac 34, 3, 2, -2, -\frac 52 \} $$
Now the thing is, I cannot find this circuit or algorithm anywhere. Our course textbook is FSP 2014 by Vetterli but I also use O&S to study. And these topics are not discussed in any of these books. So I was just wondering if anyone had any resource which I could use to get a basic level understanding of wavelets as well as such algorithms and circuits.
Also I was wondering if something similar exists for when our input is continuous-time:
$$x(t) = \sum_{k=-\infty}^{\infty} \sum_{n=-\infty}^{\infty} c_{k,n} \phi_{k,n}$$
where $c_{k,n}$'s are the coefficients and $\phi_{k,n}$'s are the wavelet basis functions (Haar system).
As such I would appreciate if someone could either point to a source or themselves give a basic understanding of why the specific algorithm and circuit work.