for the SMV and MMV cases respectively, where black \(\hat{ \mathbf {x}}_{k}~ (\hat{ \mathbf {x}}_{k}^{(l)})\)  is the estimate of  \({\mathbf {x}}_{k}~({ \mathbf {x}}_{k}^{(l)})\) , and \({black}{K}\)  is the number of trials. Since different algorithms have different computational complexity per iteration and they require a different number of iterations to converge, as in [1]}, we measure the runtime of the algorithms to indicate their relative computational complexity. blackIt is noted that the time consumed by the SVD in UAMP-SBL is counted blackfor the runtime.
<FIGURE><FIGURE>