A fast-decodable, quasi-orthogonal space-time block code for 4 × 2 MIMO

Ezio Biglieri, Yi Hong, Emanuele Viterbo

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

3 Citations (Scopus)

Abstract

In this paper we present a new family of full-rate space-time block codes for 4 × 2 MIMO, We show how, by combining algebraic and quasi-orthogonal properties of the code, reduced-complexity maximum-likelihood decoding is made possible. In particular, the sphere decoder search can be reduced from a 16-to a 12-dimensional spacE. Within this family, we found a code that outperforms all previously proposed codes for 4 × 2 MIMO.

Original languageEnglish
Title of host publication45th Annual Allerton Conference on Communication, Control, and Computing 2007
PublisherUniversity of Illinois Press
Pages921-926
Number of pages6
ISBN (Electronic)9781605600864
Publication statusPublished - 1 Jan 2007
Externally publishedYes
EventAnnual Allerton Conference on Communication, Control, and Computing 2007 - Monticello, United States of America
Duration: 26 Sep 200728 Sep 2007
Conference number: 45th

Publication series

Name45th Annual Allerton Conference on Communication, Control, and Computing 2007
Volume2

Conference

ConferenceAnnual Allerton Conference on Communication, Control, and Computing 2007
CountryUnited States of America
CityMonticello
Period26/09/0728/09/07

Cite this