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

<table>Plots showing the variation of cumulative probability density versus instantaneous capacity for <svg height="15.25" id="M359" style="vertical-align:-3.276pt" version="1.1" viewbox="0 0 61.762501 15.25" width="61.762501" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.112)"><path d="M998 650l-8 -28q-71 -4 -86 -16t-22 -69l-50 -397q-3 -28 -4.5 -44t2 -29t6.5 -18.5t17 -10.5t24.5 -6.5t37.5 -3.5l-8 -28h-271l7 28q63 6 78 22t25 90l60 415h-2l-353 -552h-23l-130 536h-2l-70 -254q-44 -158 -47 -188q-5 -38 9 -51t71 -18l-6 -28h-241l8 28
q45 4 67 18.5t35 45.5q16 38 74 233l52 173q24 79 11.5 98t-89.5 26l6 28h177l136 -508l337 508h172z" id="x1D440"></path></g>
<g transform="matrix(.012,-0,0,-.012,17.412,15.187)"><path d="M649 676l-22 -187l-33 -2q3 56 -12 94q-8 20 -31.5 26.5t-86.5 6.5h-74l-90 -491q-4 -23 -6 -36.5t1 -25t7 -16.5t18 -9t27 -5t41 -3l-6 -28h-286l4 28q68 5 84 18.5t28 76.5l94 491h-55q-74 0 -100.5 -6t-41.5 -23q-24 -29 -54 -98l-32 1q32 98 53 188h22q7 -18 15 -22
t37 -4h417q23 0 33.5 5t25.5 21h23z" id="x1D447"></path></g>
<g transform="matrix(.017,-0,0,-.017,30.687,11.112)"><path d="M535 323h-483v50h483v-50zM535 138h-483v50h483v-50z" id="x3D"></path></g><g transform="matrix(.017,-0,0,-.017,45.374,11.112)"><path d="M384 0h-275v27q67 5 81.5 18.5t14.5 68.5v385q0 38 -7.5 47.5t-40.5 10.5l-48 2v24q85 15 178 52v-521q0 -55 14.5 -68.5t82.5 -18.5v-27z" id="x31"></path></g><g transform="matrix(.017,-0,0,-.017,53.534,11.112)"><path d="M137 343l67 33q37 17 63 17q79 0 129.5 -53t50.5 -131q0 -92 -58 -156.5t-147 -64.5t-147 68t-58 182q0 63 17 119t43 95.5t61.5 72t69 52t67.5 31.5q62 22 128 33l6 -32q-56 -11 -108 -35q-149 -71 -184 -231zM227 337q-47 0 -95 -27q-6 -23 -6 -70q0 -93 36 -155.5
t96 -62.5q53 0 78 45.5t25 105.5q0 68 -35 116t-99 48z" id="x36"></path></g>
</svg> and <svg height="15.35" id="M360" style="vertical-align:-3.35245pt" version="1.1" viewbox="0 0 61.512501 15.35" width="61.512501" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.112)"><path d="M998 650l-8 -28q-71 -4 -86 -16t-22 -69l-50 -397q-3 -28 -4.5 -44t2 -29t6.5 -18.5t17 -10.5t24.5 -6.5t37.5 -3.5l-8 -28h-271l7 28q63 6 78 22t25 90l60 415h-2l-353 -552h-23l-130 536h-2l-70 -254q-44 -158 -47 -188q-5 -38 9 -51t71 -18l-6 -28h-241l8 28
q45 4 67 18.5t35 45.5q16 38 74 233l52 173q24 79 11.5 98t-89.5 26l6 28h177l136 -508l337 508h172z" id="x1D440"></path></g>
<g transform="matrix(.012,-0,0,-.012,17.412,15.187)"><path d="M627 18l-10 -26q-79 6 -116 27t-69 76q-41 71 -71 138q-13 29 -27.5 39t-42.5 10h-46l-27 -145q-13 -74 -2.5 -88.5t78.5 -20.5l-6 -28h-271l5 28q66 6 82.5 21.5t30.5 87.5l71 387q12 66 2 78.5t-77 19.5l8 28h233q102 0 147 -29q65 -43 65 -129q0 -69 -45.5 -117
t-115.5 -72q40 -86 66 -133q39 -68 65 -101q28 -37 73 -51zM491 483q0 67 -33.5 101t-91.5 34q-35 0 -51 -10q-13 -8 -20 -48l-45 -245h49q71 0 113 28q79 52 79 140z" id="x1D445"></path></g>
<g transform="matrix(.017,-0,0,-.017,30.425,11.112)"><path d="M535 323h-483v50h483v-50zM535 138h-483v50h483v-50z" id="x3D"></path></g><g transform="matrix(.017,-0,0,-.017,45.112,11.112)"><path d="M384 0h-275v27q67 5 81.5 18.5t14.5 68.5v385q0 38 -7.5 47.5t-40.5 10.5l-48 2v24q85 15 178 52v-521q0 -55 14.5 -68.5t82.5 -18.5v-27z" id="x31"></path></g><g transform="matrix(.017,-0,0,-.017,53.271,11.112)"><path d="M137 343l67 33q37 17 63 17q79 0 129.5 -53t50.5 -131q0 -92 -58 -156.5t-147 -64.5t-147 68t-58 182q0 63 17 119t43 95.5t61.5 72t69 52t67.5 31.5q62 22 128 33l6 -32q-56 -11 -108 -35q-149 -71 -184 -231zM227 337q-47 0 -95 -27q-6 -23 -6 -70q0 -93 36 -155.5
t96 -62.5q53 0 78 45.5t25 105.5q0 68 -35 116t-99 48z" id="x36"></path></g>
</svg> for <svg height="15.35" id="M361" style="vertical-align:-3.35245pt" version="1.1" viewbox="0 0 45.700001 15.35" width="45.700001" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.112)"><path d="M559 163q-23 -66 -68 -163h-474l6 26q62 4 79.5 19.5t28.5 75.5l78 409q7 35 8.5 49t-8 25t-24 13t-51.5 5l5 28h266l-6 -28q-65 -5 -79.5 -18t-25.5 -74l-76 -406q-10 -57 14 -75q12 -13 96 -13q93 0 126 29q41 40 76 109z" id="x1D43F"></path></g>
<g transform="matrix(.012,-0,0,-.012,9.763,15.187)"><path d="M627 18l-10 -26q-79 6 -116 27t-69 76q-41 71 -71 138q-13 29 -27.5 39t-42.5 10h-46l-27 -145q-13 -74 -2.5 -88.5t78.5 -20.5l-6 -28h-271l5 28q66 6 82.5 21.5t30.5 87.5l71 387q12 66 2 78.5t-77 19.5l8 28h233q102 0 147 -29q65 -43 65 -129q0 -69 -45.5 -117
t-115.5 -72q40 -86 66 -133q39 -68 65 -101q28 -37 73 -51zM491 483q0 67 -33.5 101t-91.5 34q-35 0 -51 -10q-13 -8 -20 -48l-45 -245h49q71 0 113 28q79 52 79 140z" id="x1D445"></path></g>
<g transform="matrix(.017,-0,0,-.017,22.775,11.112)"><path d="M535 323h-483v50h483v-50zM535 138h-483v50h483v-50z" id="x3D"></path></g><g transform="matrix(.017,-0,0,-.017,37.462,11.112)"><path d="M137 343l67 33q37 17 63 17q79 0 129.5 -53t50.5 -131q0 -92 -58 -156.5t-147 -64.5t-147 68t-58 182q0 63 17 119t43 95.5t61.5 72t69 52t67.5 31.5q62 22 128 33l6 -32q-56 -11 -108 -35q-149 -71 -184 -231zM227 337q-47 0 -95 -27q-6 -23 -6 -70q0 -93 36 -155.5
t96 -62.5q53 0 78 45.5t25 105.5q0 68 -35 116t-99 48z" id="x36"></path></g>
</svg> and 8 under i.i.d. channel condition.</table>

International Journal of Antennas and Propagation

fig5

Figure 5

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