US 8,179,990 B2Granted

Coding for large antenna arrays in MIMO networks

AssigneeMitsubishi Electric Research Laboratories, Inc.

InventorsPhilip V. Orlik, Wataru Matsumoto, Andreas F. Molisch, Zhifeng Tao, Jinyun Zhang

Life of this patent

Estimating the term…

Loading patent…

Abstract

A method transmits a sequence of symbols in a multiple-input multiple-output (MIMO) network including a transmitter having a set of transmit antennas and a receiver having a set of receive antennas. The sequence of symbols is represented by a vector S=[S1 S2 S3 S4]T of individual symbols, where T is a transpose operator. The individual symbols are transmitted as a transmit matrix S = [ S 1 - S 2 * S 1 - S 2 * S 2 S 1 * S 2 S 1 * S 3 - S 4 * - S 3 S 4 * S 4 S 3 * - S 4 - S 3 * ] , where * is a complex conjugate, and wherein each column of the matrix S represents the symbols transmitted at each transmission interval, and subscripts index the set of transmit antennas.

A method for transmitting a sequence of symbols Sn in a multiple-input multiple-output (MIMO) network including a transmitter having a set of transmit antennas and a receiver having a set of receive antennas, comprising the steps of:

representing the sequence of symbols by a vector S=[S1 S2 S3 S4]T of individual symbols, where T is a transpose operator;
and
using a coder transmitting the individual symbols as a transmit matrix is
S
=
[
S
1
-
S
2
*
S
1
-
S
2
*
S
2
S
1
*
S
2
S
1
*
S
3
-
S
4
*
-
S
3
S
4
*
S
4
S
3
*
-
S
4
-
S
3
*
]
,
where * is a complex conjugate, and wherein each column of the matrix S represents the symbols transmitted, and subscripts index the set of transmit antennas,
wherein the receiver has a channel matrix
H
=
⁢
[
h
1
,
1
h
1
,
2
h
1
,
3
h
1
,
4
h
2
,
1
h
2
,
2
h
2
,
3
h
2
,
4
h
3
,
1
h
3
,
2
h
3
,
3
h
4
,
4
h
4
,
1
h
4
,
2
h
4
,
3
h
3
,
4
]
,
where elements hi,j are channel coefficients from the jth transmit antenna to the ith receive antenna, wherein a received signal r is
r
=
⁢
HS
+
n
=
⁢
[
h
1
,
1
h
1
,
2
h
1
,
3
h
1
,
4
h
2
,
1
h
2
,
2
h
2
,
3
h
2
,
4
h
3
,
1
h
3
,
2
h
3
,
3
h
3
,
4
h
4
,
1
h
4
,
2
h
4
,
3
h
4
,
4
]
⁢
[
S
1
-
S
2
*
S
1
-
S
2
*
S
2
S
1
*
S
2
S
1
*
S
3
-
S
4
*
-
S
3
S
4
*
S
4
S
3
*
-
S
4
-
S
3
*
]
+
n
,
where noise n is
n
=
[
n
1
,
1
n
1
,
2
n
1
,
3
n
1
,
4
n
2
,
1
n
2
,
2
n
2
,
3
n
2
,
4
n
3
,
1
n
3
,
2
n
3
,
3
n
3
,
4
n
4
,
1
n
4
,
2
n
4
,
3
n
4
,
4
]
.
further comprising:
setting a received signal
r
=
[
r
1
,
1
r
1
,
2
r
1
,
3
r
1
,
4
r
2
,
1
r
2
,
2
r
2
,
3
r
2
,
4
r
3
,
1
r
3
,
2
r
3
,
3
r
3
,
4
r
4
,
1
r
4
,
2
r
4
,
3
r
4
,
4
]
,
and the first symbol S1 is
[
r
1
,
1
⁢
⁢
r
1
,
2
*
⁢
⁢
r
1
,
3
⁢
⁢
r
1
,
4
*
]
⁡
[
h
1
,
1
*
h
1
,
2
h
1
,
1
*
h
1
,
2
]
+
[
r
2
,
1
⁢
⁢
r
2
,
2
*
⁢
⁢
r
2
,
3
⁢
⁢
r
2
,
4
*
]
⁡
[
h
2
,
1
*
h
2
,
2
h
2
,
1
*
h
2
,
2
]
=
2
⁢
(

h
1
,
1

2
+

h
1
,
2

2
+

h
2
,
1

2
+

h
2
,
2

2
)
⁢
S
1
*
+
n
1
′
the second symbol S2 is
[
r
1
,
1
⁢
⁢
r
1
,
2
*
⁢
⁢
r
1
,
3
⁢
⁢
r
1
,
4
*
]
⁡
[
h
1
,
2
*
-
h
1
,
1
h
1
,
2
*
-
h
1
,
1
]
+
[
r
2
,
1
⁢
⁢
r
2
,
2
*
⁢
⁢
r
2
,
3
⁢
⁢
r
2
,
4
*
]
⁡
[
h
2
,
2
*
-
h
2
,
1
h
2
,
2
*
-
h
2
,
1
]
=
2
⁢
(

h
1
,
1

2
+

h
1
,
2

2
+

h
2
,
1

2
+

h
2
,
2

2
)
⁢
S
2
+
n
2
′
the third symbol S3 is
[
r
3
,
1
⁢
⁢
r
3
,
2
*
⁢
⁢
r
3
,
3
⁢
⁢
r
3
,
4
*
]
⁡
[
h
3
,
3
*
h
3
,
4
-
h
3
,
3
*
-
h
3
,
4
]
+
[
r
4
,
1
⁢
⁢
r
4
,
2
*
⁢
⁢
r
4
,
3
⁢
⁢
r
4
,
4
*
]
⁡
[
h
4
,
3
*
h
4
,
4
-
h
4
,
3
*
-
h
4
,
4
]
=
2
⁢
(

h
3
,
3

2
+

h
3
,
4

2
+

h
4
,
3

2
+

h
4
,
4

2
)
⁢
S
3
+
n
3
′
.

818 more elements

Facts

Application

12/212,609Filed 17 Sep 2008 · us provisional application

Priority

16 Jan 2008

Published

US 2009/0262852 A122 Oct 2009

Granted

15 May 2012

Term ends

Not estimatedThe source records don’t support an estimate.

Classification7 codes

H04L 1/1816
Hybrid protocols; Hybrid automatic repeat request [HARQ]: with retransmission of the same, encoded, message
H04L 1/0606
Using space diversity: space-frequency coding
H04L 1/0631
Space-time coding: receiver arrangements
H04L 1/0662
Properties of the code: limited orthogonality systems

Abstract

Claims6