A Low Complexity Near-Optimal MIMO Antenna Subset Selection Algorithm for Capacity Maximisation

Table 1

Pseudostatements and complexity details of the proposed algorithm.

Sl. no.	Algorithm statements	Complex flops required	Real flops required
1	𝑆𝑅=1,2,3,…,𝑀𝑅	2𝑀𝑅𝑀𝑇−𝑀𝑅	8𝑀𝑅𝑀𝑇−4𝑀𝑅
2	if 𝐿𝑅<𝑀𝑅
3	for 𝑗=1 to 𝑀𝑅
4	𝛾^2𝑗=𝐇𝑗,∶^2
5	end
6	if 𝐿𝑅>1
7	for 𝑝=1 to 𝑀𝑅	(2𝑀𝑇+2)(𝑀^2𝑅−𝑀𝑅)2	(4𝑀𝑇−0.5)(𝑀^2𝑅−𝑀𝑅)
8	for 𝑞=1 to 𝑀𝑅
9	if 𝑝>𝑞
10	𝛼𝑝,𝑞=𝐇𝑝,∶𝐇^𝐻𝑞,∶
11	𝛽𝑝,𝑞=𝛾^2𝑝𝛾^2𝑞−𝛼^2𝑝,𝑞
12	end
13	end
14	end
15	for 𝑛=1 to 𝐿𝑅
16	𝑃,𝑄=argmax𝑝,𝑞∈𝑆𝑅𝛽𝑝,𝑞
17	if 𝐇𝑃,∶^2>𝐇𝑄,∶^2
18	𝑆𝑅=𝑆𝑅−𝑃
19	𝛽𝑃,∶=0
20	else
21	𝑆𝑅=𝑆𝑅−𝑄
22	𝛽𝑄,∶,=0
23	end
24	end
25	else
26	𝐽=argmax𝑗∈𝑆𝑅𝛾^2𝑗
27	𝑆𝑅=𝑆𝑅−𝐽
28	end
29	£𝑅=1,2,,…,𝑀𝑅−𝑆𝑅
30	end