Can “swap nybble” and “byte mask” tricks do multi byte logical shift by 4 much faster than the naive method of using bit shift chains

Question

I\'m writing a fixed-point (16Q16) algo that does division using the Newton–Raphson method outlined on Wikipedia. (Relates SE question HERE.)

The first step requires logi