Efficient Transmit Antenna Subset Selection for Multiuser Space–Time Line Code Systems

. 2021 Apr 11;21(8):2690. doi: 10.3390/s21082690

Algorithm 1 SINR-greedy-based TAS selection algorithm.

\begin{array}{l} Inputs : H, Q_{2 K}^{}, N_{T}, N_{S}, K, σ_{x}^{2}, σ_{z}^{2} \\ 1 : C_{n} = {‖ H (:, n) ‖}_{F}^{}, n = 1, 2, \dots, N_{T} \\ 2 : [V, u] = \max {C_{1}, C_{2}, \dots, C_{N_{T}}} \\ 3 : H_{S} = H (:, u) \\ 4 : {\bar{H}}_{0} = H (:, [1 : (u - 1) (u + 1) : end]) \\ 5 : for k = 1, 2, \dots, N_{S} - 1 \\ 6 : for q = 1, 2, \dots, (N_{T} - k) \\ 7 : H_{t e m p} = [H_{S} (:, 1 : k) {\bar{H}}_{k - 1} (:, q)] \\ 8 : {\tilde{H}}_{t e m p} = [H_{t e m p} Q_{2 K}^{T} H_{t e m p}^{*}] \\ 9 : {\tilde{V}}_{k, q} = {({\tilde{H}}_{t e m p}^{} {\tilde{H}}_{t e m p}^{H} + \frac{2 K σ_{z}^{2}}{σ_{x}^{2}} I_{2 K})}^{- 1} \\ 10 : λ_{k, q} = T r [{\tilde{V}}_{k, q}] \\ 11 : end \\ 12 : \hat{q} = \underset{q}{\arg \min} λ_{k, q} \\ 13 : H_{S} (:, k + 1) = {\bar{H}}_{k - 1} (:, \hat{q}) \\ 14 : {\bar{H}}_{k} = {\bar{H}}_{k - 1} (:, [1 : (\hat{q} - 1) (\hat{q} + 1) : end]) \\ 15 : end \\ Output : H_{S} \end{array}