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

C. Hess*, M. Wenk, A. Burg, P. Luethi, C. Studer, N. Felber, W. Fichtner

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

40 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationGLSVLSI'07
Subtitle of host publicationProceedings of the 2007 ACM Great Lakes Symposium on VLSI
Pages200-203
Number of pages4
DOIs
Publication statusPublished - 2007
Externally publishedYes
Event17th Great Lakes Symposium on VLSI, GLSVLSI'07 - Stresa-Lago Maggiore, Italy
Duration: 11 Mar 200713 Mar 2007

Publication series

NameProceedings of the ACM Great Lakes Symposium on VLSI, GLSVLSI

Conference

Conference17th Great Lakes Symposium on VLSI, GLSVLSI'07
Country/TerritoryItaly
CityStresa-Lago Maggiore
Period11/03/0713/03/07

Keywords

  • FSD
  • MIMO
  • Sphere decoding
  • VLSI

Fingerprint

Dive into the research topics of 'Reduced-complexity mimo detector with close-to ml error rate performance'. Together they form a unique fingerprint.

Cite this