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

<table>Interpretation of inner product between <svg height="18.799999" id="M63" style="vertical-align:-5.76984pt" version="1.1" viewbox="0 0 15.2375 18.799999" width="15.2375" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.55)"><path d="M534 24v-24h-234v24q25 3 35.5 16.5t10.5 44.5v224q0 54 -11 75.5t-40 21.5q-36 0 -70 -34q-17 -17 -17 -24v-263q0 -31 10 -44t38 -17v-24h-240v24q37 8 44 16q9 9 9 49v502q0 35 -9 44q-8 9 -45 17v24h193v-280q65 77 147 77q59 0 94.5 -37.5t35.5 -98.5v-250
q0 -34 11.5 -48.5t37.5 -14.5z" id="x1D421"></path></g>
<g transform="matrix(.012,-0,0,-.012,9.512,15.638)"><path d="M394 607q0 -25 -15.5 -43t-39.5 -18q-19 0 -32 13t-13 35t16 41.5t40 19.5q20 0 32 -13.5t12 -34.5zM360 349l-57 -283q-38 -188 -122 -263q-72 -64 -114 -64q-16 0 -30 10.5t-14 22.5q0 24 21 45q15 13 26 6q30 -20 54 -20q41 0 65 95q37 147 86 415q6 34 6.5 42.5
t-5.5 11.5q-18 0 -79 -54l-14 25q48 48 96.5 79t71.5 31q29 0 9 -99z" id="x1D457"></path></g>
</svg> and interpretation of resolution of <svg height="18.799999" id="M64" style="vertical-align:-5.76984pt" version="1.1" viewbox="0 0 15.2375 18.799999" width="15.2375" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.55)"><path d="M534 24v-24h-234v24q25 3 35.5 16.5t10.5 44.5v224q0 54 -11 75.5t-40 21.5q-36 0 -70 -34q-17 -17 -17 -24v-263q0 -31 10 -44t38 -17v-24h-240v24q37 8 44 16q9 9 9 49v502q0 35 -9 44q-8 9 -45 17v24h193v-280q65 77 147 77q59 0 94.5 -37.5t35.5 -98.5v-250
q0 -34 11.5 -48.5t37.5 -14.5z" id="x1D421"></path></g>
<g transform="matrix(.012,-0,0,-.012,9.512,15.638)"><path d="M394 607q0 -25 -15.5 -43t-39.5 -18q-19 0 -32 13t-13 35t16 41.5t40 19.5q20 0 32 -13.5t12 -34.5zM360 349l-57 -283q-38 -188 -122 -263q-72 -64 -114 -64q-16 0 -30 10.5t-14 22.5q0 24 21 45q15 13 26 6q30 -20 54 -20q41 0 65 95q37 147 86 415q6 34 6.5 42.5
t-5.5 11.5q-18 0 -79 -54l-14 25q48 48 96.5 79t71.5 31q29 0 9 -99z" id="x1D457"></path></g>
</svg> along <svg height="15.8375" id="M65" style="vertical-align:-3.39066pt" version="1.1" viewbox="0 0 13.45 15.8375" width="13.45" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.55)"><path d="M534 24v-24h-234v24q25 3 35.5 16.5t10.5 44.5v224q0 54 -11 75.5t-40 21.5q-36 0 -70 -34q-17 -17 -17 -24v-263q0 -31 10 -44t38 -17v-24h-240v24q37 8 44 16q9 9 9 49v502q0 35 -9 44q-8 9 -45 17v24h193v-280q65 77 147 77q59 0 94.5 -37.5t35.5 -98.5v-250
q0 -34 11.5 -48.5t37.5 -14.5z" id="x1D421"></path></g>
<g transform="matrix(.012,-0,0,-.012,9.512,15.637)"><path d="M244 607q0 -25 -15.5 -43t-37.5 -18q-19 0 -32 13t-13 35q0 21 15 41t39 20q20 0 32 -14t12 -34zM222 91q-29 -33 -79 -68t-75 -35q-13 0 -19 7.5t-6 31t10 65.5l62 253q5 26 -1 26q-21 0 -72 -43l-13 24q43 40 91 68t71 28q30 0 10 -78l-71 -274q-8 -30 3 -30
q16 0 76 48z" id="x1D456"></path></g>
</svg> and perpendicular to <svg height="15.8375" id="M66" style="vertical-align:-3.39066pt" version="1.1" viewbox="0 0 13.45 15.8375" width="13.45" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.55)"><path d="M534 24v-24h-234v24q25 3 35.5 16.5t10.5 44.5v224q0 54 -11 75.5t-40 21.5q-36 0 -70 -34q-17 -17 -17 -24v-263q0 -31 10 -44t38 -17v-24h-240v24q37 8 44 16q9 9 9 49v502q0 35 -9 44q-8 9 -45 17v24h193v-280q65 77 147 77q59 0 94.5 -37.5t35.5 -98.5v-250
q0 -34 11.5 -48.5t37.5 -14.5z" id="x1D421"></path></g>
<g transform="matrix(.012,-0,0,-.012,9.512,15.637)"><path d="M244 607q0 -25 -15.5 -43t-37.5 -18q-19 0 -32 13t-13 35q0 21 15 41t39 20q20 0 32 -14t12 -34zM222 91q-29 -33 -79 -68t-75 -35q-13 0 -19 7.5t-6 31t10 65.5l62 253q5 26 -1 26q-21 0 -72 -43l-13 24q43 40 91 68t71 28q30 0 10 -78l-71 -274q-8 -30 3 -30
q16 0 76 48z" id="x1D456"></path></g>
</svg>.</table>

International Journal of Antennas and Propagation

fig2

Figure 2

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