Skip to main content

Table 1 Comparison of computational complexity and latency

From: Compressive sensing based random access for machine type communications considering tradeoff between link performance and latency

Algorithm Computational complexity Latency
GOMP β(MKv2 + 2MKpav2 + 2MK2pa2v3 + K3pa3v3 + Kv + K2pa2v2) NcTs + T0 + vTs
GOMP-LS β(MKv2 + 3MKpav2 + 4MK2pa2v3 + 2K3pa3v3 + Kv + K2pa2v2) 2NcTs + T1
WIGOMP β(MKv2 + 2MKpav2 + 2MK2pa2v3 + K3pa3v3 + Kv + K2pa2v2 + Kpav2) NcTs + T2 + vTs
WIGOMP-ICF β(MKv2 + MKpav2 + K2pa2v2 + NcK + 2Kpav2 + Kv + Kpav) NcTs + T3 + vTs