Research Article
Compressive Sensing Based Channel Estimation for Massive MIMO Communication Systems
Table 1
Major steps involved in CoSaMP and SUCoSaMP.
| ā | CoSaMP | SUCoSaMP |
| 1. Classification. | The algorithm creates a replacement of the residual from the existing samples and places the biggest components of the replacement. | Follows the same step of CoSaMP. |
| 2. Support union. | The set of recently recognized components is joined with the set of components that emerge in the present approximation. | Follows the same step of CoSaMP. |
| 3. Estimation. | The algorithm finds the solution of a least-squares problem to estimate the objective signal on the combined set of components. | Follows the same step of CoSaMP. |
| 4. Pruning. | The algorithm generates a fresh estimation by keeping only the biggest entries in this least-squares approximation of signal. | Follows the same step of CoSaMP. |
| 5. Sample Update. | Finally, the algorithm updates the samples such that they reflect the residual, the un-approximated elements of the signal. | Follows the same step of CoSaMP. |
| 6. Stopping Criterion | Until stopping criterion is true. | Until first stopping criterion is true. |
| 7. Sparsity level Update | None | The algorithm updates the sparsity level |
| 8. Stopping Criterion | None | Until second stopping criterion is true. |
|
|