I am wondering, can we use Radix 2 based computational-complexity calculation for any matrix multiplication whose size is $N$ x $N$ ?? where $N$ = $2^K$ and $K > 1$ is an integer ?? Or it can only used for FFT matrix?
and if I have a unitary complex matrix whose size $2$x$2$ multiplied with a real vector $2$x$1$; in that case the complexity is 6, can I use the radix-2 to recalculate that complexity with less required operations?