Algorithm2 CH Node Data Compressed Algorithm

1: Require:$X_m\in {ℝ}^{\tilde{N}\times 1}$, $x_{mi}$, ${\mathrm{Y}}_m\in {ℝ}^{\tilde{M}\times 1}$, $y_{mj}$, ${\mathsf{\Phi }}_m\in {ℝ}^{\tilde{M}\times \tilde{N}}$, ${\varphi }_{mji}$, ${\sigma }_{mj}$, ${\mathsf{\Theta }}_m\in {ℝ}^{\tilde{N}\times 1}$, ${\theta }_{mi}$, ${\mathsf{\Psi }}_m\in {ℝ}^{\tilde{N}\times \tilde{N}}$, ${\psi }_{mii}$ 2: Ensure:${\mathrm{Y}}_m$ 3:  While $1\le m\le M$ do 4:    For $j=1$ to $\tilde{M}$ do 5:     For $i=1$ to $\tilde{N}$ do 4:      $X_m={\displaystyle \sum _{i=1}^{\tilde{N}}{\psi }_{mii}}{\theta }_{mi}$ 6:     End for 7:  $y_{mj}=\langle X_m,{\varphi }_{mji}\rangle +{\sigma }_{mj}$ 8:    End for 9:   CH node sends ${\mathrm{Y}}_m$ to the sink node 10: Endwhile