Reduced-complexity mimo detector with close-to ml error rate performance

  • Authors:
  • C. Hess;M. Wenk;A. Burg;P. Luethi;C. Studer;N. Felber;W. Fichtner

  • Affiliations:
  • Integrated Systems Laboratory: ETH Zurich, Zurich, Switzerland;Integrated Systems Laboratory: ETH Zurich, Zurich, Switzerland;Integrated Systems Laboratory: ETH Zurich, Zurich, Switzerland;Integrated Systems Laboratory: ETH Zurich, Zurich, Switzerland;Integrated Systems Laboratory: ETH Zurich, Zurich, Switzerland;Integrated Systems Laboratory: ETH Zurich, Zurich, Switzerland;Integrated Systems Laboratory: ETH Zurich, Zurich, Switzerland

  • Venue:
  • Proceedings of the 17th ACM Great Lakes symposium on VLSI
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Maximum likelihood (ML) detection provides optimum error rate performance for uncoded multiple-input multiple-output (MIMO) systems. However, circuit complexity of a straightforward implementation of ML detection is uneconomic for high-rate systems. This paper addresses the VLSI implementation trade-offs of a MIMO detection algorithm that achieves close-to ML error rate performance with reduced computational complexity. The described implementations in a 0.25 μm CMOS technology for 4-4 MIMO systems feature a simple data-path, achieve high throughput, and use small silicon area. Important contributing factors to these results are efficient enumeration strategies and the application of simplified norms and sophisticated scheduling techniques together with a new low-complexity preprocessing scheme.