Algorithm 1 Pseudocode of optimized beamformer.

Input: Initialized value of beamformer vector

Output: Optimized beamformer value

1.    Initialize $\mathbf{w}$, set threshold level ($\zeta$), precision, number of iteration, and time index (i)

2.    Repeat

3.      Compute ${\mathcal{O}}_{\mathrm{B}}$ as in (21)

4.      $i=i+1$

5.      Compute ${\left({\mathcal{O}}_{\mathrm{B}}\right)}^{i+1},{\left({\mathcal{O}}_{\mathrm{A}}\right)}^{i+1}{\left({\mathcal{O}}_{\mathrm{Eve}}\right)}^{i+1}$ as in (21)

6.      If $\{{\left({\mathcal{O}}_{\mathrm{A}}\right)}^{i+1}\le {\left({\mathcal{O}}_{\mathrm{A}}\right)}^i\}$ and $\{{\left({\mathcal{O}}_{\mathrm{Eve}}\right)}^{i+1}\ge {\left({\mathcal{O}}_{\mathrm{Eve}}\right)}^i\}$

7.       Store beamformer value, ${\mathcal{O}}_{\mathrm{A}}$, and ${\mathcal{O}}_{\mathrm{Eve}}$ then perform recursion

8.       Else

9.       Return optimized beamformer value, ${\mathcal{O}}_{\mathrm{A}}$, and ${\mathcal{O}}_{\mathrm{Eve}}$

10.      Stop algorithm = true

11.     End if

12.   Until (Stop algorithm = true)