Table 1 shows a term-by-term comparison of the computational complexity of Kronecker-OMP and T-LARS given in equations 4.2 and 4.3, respectively.

Table 1:
Term-by-Term Comparison of the Computational Complexity of Kronecker-OMP and T-LARS Given in Equations 4.2 and 4.3.
Kronecker-OMPT-LARS
First term $2INJ1-JIN1-JIK$ $2INJ1-JIN1-JI$
Second term $2INK+7∑k=1Kk2N$ $INK+4∑k=1Kk2$
Third term $2NJ+N+4∑k=1KkN$ $2NI∑k=1Kk$
Fourth term $N(N-1)+3KJN$ $2KJN$
Kronecker-OMPT-LARS
First term $2INJ1-JIN1-JIK$ $2INJ1-JIN1-JI$
Second term $2INK+7∑k=1Kk2N$ $INK+4∑k=1Kk2$
Third term $2NJ+N+4∑k=1KkN$ $2NI∑k=1Kk$
Fourth term $N(N-1)+3KJN$ $2KJN$

Close Modal