Compressive Multispectral Spectrum Sensing for Spectrum Cartography

. 2018 Jan 29;18(2):387. doi: 10.3390/s18020387

Algorithm 1 The general process for building the data cube with the IM

Require: There are J sensors in the area. There are L spectral bands. There are

M \times N

geographic points.

1:
The SB requires L IMs (one for each spectral band).
2:
for $k \leftarrow 1, S$ do
3:
The SB defines the samples to request from the ${Sensor}_{k}$ using a binary pattern.
4:
The SB request the samples from the ${Sensor}_{k}$
5:
end for
6:
The SB builds the model of the Equation (9).
7:
The SB solves the optimization problem of the Equation (10).