Skip to main content

Table 1 Computational complexity of the MP-SA and MA-SA methods

From: Blind sequential detection for sparse ISI channels

Complexity for channel sparsity detection at each path
  Inner product computations
MP-SA \(\left (\hat {L}^{\text {(MP-SA)}}_{a}+1\right)L_{h}\)
MA-SA \(\left (\hat {L}^{\text {(MA-SA)}}_{a}+1\right)\left (L_{h}-\frac {1}{2}\hat {L}^{\text {(MA-SA)}}_{a}\right)\)
  1. The computational complexity for each method is measured in terms of the number of inner product computations required for channel sparsity detection along each path of the tree