Skip to main content

Table 2 Computational cost of compared algorithms

From: Using tensor contractions to derive the structure of slice-wise multiplications of tensors with applications to space–time Khatri–Rao coding for MIMO-OFDM systems

Algorithm

Computational complexity \({\mathcal {O}}\left\{ \cdot \right\}\)

ZF

\({\mathcal {O}}\left\{ N(M_{T})^3\right\}\)

ILSP

\({\mathcal {O}}\left\{ 2NI_{\text {max}}M_{T}^3\right\}\)

RLSP

\({\mathcal {O}}\left\{ 2NKM_{T}^3\right\}\)

KR

\({\mathcal {O}}\left\{ NM_T(KM_R(K + M_R))\right\}\)

KR+LS

\({\mathcal {O}}\left\{ NM_T(KM_R(K + M_R)) + (NM_T)^3 \right\}\)

CC-KR

\({\mathcal {O}}\left\{ N M_{T}(KQ(K + Q)) \right\}\)

CC-KR+ALS

\({\mathcal {O}}\left\{ N M_{T}(KQ(K + Q)) + I_{\text {max}}(K^3 + Q^3)\right\}\)