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

Ezio Biglieri; Yi Hong; Emanuele Viterbo

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 proceeding › Conference Paper › Research › peer-review

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 language	English
Title of host publication	45th Annual Allerton Conference on Communication, Control, and Computing 2007
Publisher	University of Illinois Press
Pages	921-926
Number of pages	6
ISBN (Electronic)	9781605600864
Publication status	Published - 1 Jan 2007
Externally published	Yes
Event	Annual Allerton Conference on Communication, Control and Computing 2007 - Philadelphia, United States of America Duration: 26 Sept 2007 → 28 Sept 2007 Conference number: 45th

Publication series

Name	45th Annual Allerton Conference on Communication, Control, and Computing 2007
Volume	2

Conference

Conference	Annual Allerton Conference on Communication, Control and Computing 2007
Abbreviated title	Allerton 2007
Country/Territory	United States of America
City	Philadelphia
Period	26/09/07 → 28/09/07

Cite this

@inproceedings{2c0058e5016e47f2b7bb181400b535db,

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

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.",

author = "Ezio Biglieri and Yi Hong and Emanuele Viterbo",

year = "2007",

month = jan,

day = "1",

language = "English",

series = "45th Annual Allerton Conference on Communication, Control, and Computing 2007",

publisher = "University of Illinois Press",

pages = "921--926",

booktitle = "45th Annual Allerton Conference on Communication, Control, and Computing 2007",

address = "United States of America",

note = "Annual Allerton Conference on Communication, Control and Computing 2007, Allerton 2007 ; Conference date: 26-09-2007 Through 28-09-2007",

}

Biglieri, E, Hong, Y & Viterbo, E 2007, A fast-decodable, quasi-orthogonal space-time block code for 4 × 2 MIMO. in 45th Annual Allerton Conference on Communication, Control, and Computing 2007. 45th Annual Allerton Conference on Communication, Control, and Computing 2007, vol. 2, University of Illinois Press, pp. 921-926, Annual Allerton Conference on Communication, Control and Computing 2007, Philadelphia, Illinois, United States of America, 26/09/07.

A fast-decodable, quasi-orthogonal space-time block code for 4 × 2 MIMO. / Biglieri, Ezio; Hong, Yi ; Viterbo, Emanuele.
45th Annual Allerton Conference on Communication, Control, and Computing 2007. University of Illinois Press, 2007. p. 921-926 (45th Annual Allerton Conference on Communication, Control, and Computing 2007; Vol. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

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

AU - Biglieri, Ezio

AU - Hong, Yi

AU - Viterbo, Emanuele

N1 - Conference code: 45th

PY - 2007/1/1

Y1 - 2007/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84869643323&partnerID=8YFLogxK

M3 - Conference Paper

AN - SCOPUS:84869643323

T3 - 45th Annual Allerton Conference on Communication, Control, and Computing 2007

SP - 921

EP - 926

BT - 45th Annual Allerton Conference on Communication, Control, and Computing 2007

PB - University of Illinois Press

T2 - Annual Allerton Conference on Communication, Control and Computing 2007

Y2 - 26 September 2007 through 28 September 2007

ER -

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

Abstract

Publication series

Conference

Other files and links

Cite this