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

<table>Communications performance of <svg height="11.075" id="M152" style="vertical-align:-0.3135pt" version="1.1" viewbox="0 0 32.700001 11.075" width="32.700001" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,11.075)">
<g transform="translate(72,-63.14)">
<text transform="matrix(1,0,0,-1,-71.95,63.5)">
<tspan style="font-size: 12.50px; " x="0" y="0">4</tspan>
<tspan style="font-size: 12.50px; " x="9.0271664" y="0">×</tspan>
<tspan style="font-size: 12.50px; " x="19.804752" y="0">4</tspan>
</text>
</g>
</g>
</svg> antennas system, 64-QAM modulation for different MIMO detection algorithms.</table>

VLSI Design

fig4

Figure 4

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