A System View on Iterative MIMO Detection: Dynamic Sphere Detection versus Fixed Effort List Detection

<table>Detection problem represented by a tree for the modulation alphabet <svg height="13.575" id="M135" style="vertical-align:-2.26974pt" version="1.1" viewbox="0 0 63.887501 13.575" width="63.887501" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,13.575)">
<g transform="translate(72,-61.14)">
<text transform="matrix(1,0,0,-1,-71.95,63.45)">
<tspan style="font-size: 12.50px; " x="0" y="0">{</tspan>
<tspan style="font-size: 12.50px; " x="6.00144" y="0">−</tspan>
<tspan style="font-size: 12.50px; " x="14.565995" y="0">1</tspan>
<tspan style="font-size: 12.50px; " x="20.817495" y="0">,</tspan>
<tspan style="font-size: 12.50px; " x="30.182241" y="0">+</tspan>
<tspan style="font-size: 12.50px; " x="38.746796" y="0">1</tspan>
<tspan style="font-size: 12.50px; " x="44.998299" y="0">}</tspan>
</text>
</g>
</g>
</svg> (BPSK) and <svg height="14.2375" id="M136" style="vertical-align:-3.13504pt" version="1.1" viewbox="0 0 24.225 14.2375" width="24.225" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,14.2375)">
<g transform="translate(72,-60.61)">
<text transform="matrix(1,0,0,-1,-71.95,63.79)">
<tspan style="font-size: 12.50px; " x="0" y="0">𝑀</tspan>
</text>
<text transform="matrix(1,0,0,-1,-59.38,60.66)">
<tspan style="font-size: 8.75px; " x="0" y="0">𝑇</tspan>
</text>
</g>
</g>
</svg> antennas.</table>

VLSI Design

fig2

Figure 2

Figure 2: A System View on Iterative MIMO Detection: Dynamic Sphere Detection versus Fixed Effort List Detection 