Loop-Reduction LLL Algorithm and Architecture for Lattice-Reduction-Aided MIMO Detection

<table class="table-group" id="tab3"><tr><td><table class="table"><tr><td class="thead-hr" colspan="6"><hr/></td></tr><tr class="thead"><td align="left">  Algorithm</td><td align="center"> Addition</td><td align="center"> Multiplication</td><td align="center"> Division</td><td align="center"> Givens Rotation</td><td align="center"> Total</td></tr><tr><td class="thead-hr" colspan="6"><hr/></td></tr><tr><td align="left"> LLL</td><td align="center"> 204.6/49.4</td><td align="center"> 238.5/83.4</td><td align="center">64.45/64.45</td><td align="center">67.34/10.43</td><td align="center"> 575/208.4</td></tr><tr><td align="left"> LR-LLL</td><td align="center"> 202.79/47.5</td><td align="center"> 234.81/79.5</td><td align="center"> 46.43 (72%)/46.43</td><td align="center"> 67.83/10.43</td><td align="center"> 551.88 (96%)/184 (88.2%)</td></tr><tr class="table-tr"><td colspan="6"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Average computational complexity and latency of lattice-reduction Algorithms for <svg height="11.075" id="M150" 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> MIMO detection. 

Journal of Electrical and Computer Engineering

tab3

Table 3

Table 3: Loop-Reduction LLL Algorithm and Architecture for Lattice-Reduction-Aided MIMO Detection 