Mobility

Packet Delayed Lattice Reduction Algorithm for High Performance MIMO Decoder

Free registration required

Executive Summary

The authors propose a packet delayed lattice reduction aided MIMO detection for 802.11n system. Lattice reduction algorithms are iterative in nature that results in long latency. In high throughput systems like 802.11n, reduction of latency via parallelization causes high hardware complexity. Without parallelization, the receiver needs to buffer the incoming data until the lattice reduction finishes. Depending on the latency of the lattice reduction, this buffering may cause deep memory requirements as well as missed inter-frame space deadline requirement. In this paper, they resolve this problem by foregoing buffering of incoming data for the current packet and use the output of lattice reduction to the next packet after the computation is finished.

  • Format: PDF
  • Size: 497.48 KB