# US 2008/0279301 A1 · Multiple antennas transmit diversity scheme

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2008/0279301 A1
- Document ID: US20080279301A1
- Status: Published application
- Kind: A1
- Application number: 11/896,114
- Filed: 2007-08-29
- Published: 2008-11-13
- Earliest claimed: 2007-05-08
- Assignees: Samsung Electronics Co., Ltd.
- Inventors: Farooq Khan; Jianzhong Zhang; Jiann-an Tsai
- Web page: https://patentgrep.com/patent/US20080279301A1

## CPC

- H04L 1/04: using frequency diversity
- H04B 7/0669: {using different channel coding between antennas (space-time coding H04L1/0618)}
- H04B 7/068: {using space frequency diversity (space-frequency coding H04L1/0606)}
- H04J 13/00: Code division multiplex systems (for frequency hopping H04B1/713)
- H04L 1/0606: {Space-frequency coding}
- H04L 1/0625: {Transmitter arrangements}
- H04L 1/0668: {Orthogonal systems, e.g. using Alamouti codes}
- H04L 1/08: by repeating transmission, e.g. Verdan system {(H04L1/1858 and H04L1/189 take precedence)}
- H04L 5/0044: {Allocation of payload; Allocation of data channels, e.g. PDSCH or PUSCH}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04B: TRANSMISSION
- H04J: MULTIPLEX COMMUNICATION (transmission in general H04B; peculiar to transmission of digital information H04L5/00; systems for the simultaneous or sequential transmission of more than one television signal H04N7/08; in exchanges H04Q11/00; stereophonic systems H04S)

## Abstract

A method from transmitting data via multiple antennas. The method contemplates modulating data to be transmitted into a plurality of modulated symbols, encoding each pair of modulated symbols from among said plurality of symbols in accordance with a transmission diversity scheme to result in a plurality of 2 by 2 matrices, with each 2 by 2 matrix corresponding to each pair of modulated symbols, orthogonally spreading the plurality of 2 by 2 matrices to generate an output matrix, and transmitting the symbols in the output matrix via a plurality of antennas by using either a space time transmission diversity scheme, a space frequency transmission diversity scheme, or a combination of a space time transmission diversity scheme and a space frequency transmission diversity scheme.

## Claims

### Claim 1

A method for data transmission, the method comprising the steps of:
modulating data to be transmitted into a plurality of modulated symbols;
dividing the plurality of modulated symbols into a plurality of subsets of modulated symbols, with each subset having N modulated symbols, and N being an integer no smaller than 2;
encoding each subset of modulated symbols in accordance with a transmission diversity scheme to produce a plurality of N by N matrices, with each N by N matrix corresponding to each pair of modulated symbols;
orthogonally spreading the plurality of N by N matrices to generate an output matrix; and
transmitting the symbols in the output matrix via a plurality of antennas.

### Claim 2 (depends on 1)

The method of claim 1, with the transmission diversity scheme being an Alamouti diversity scheme, and each of the N by N matrices being established by:
A
=
1
2

[
S
1
S
2
-
S
2
*
S
1
*
]
where N=2, and S1 and S2 are one pair of the modulated symbols.

### Claim 3 (depends on 1)

The method of claim 1, with the orthogonal spreading of the plurality of N by N matrices being performed according to an orthogonally spreading matrix selected from a group comprising a Fourier matrix, a Hadamard matrix and a Zadoff-Chu sequence.

### Claim 4 (depends on 1)

The method of claim 1, with the orthogonal spreading of the plurality of N by N matrices being performed according to a Fourier matrix, and each element of the Fourier matrix being established by:
P
mn
=

j2π

m
N

(
n
+
2
G
)
,
where m, n=0, 1, . . . (N−1), G is the total number of matrices generated, m is the row number of the matrix, n is the column number of the matrix, and g is selected to be any number between 0 and G−1.

### Claim 5 (depends on 1)

The method of claim 1, with the orthogonal spreading of the plurality of N by N matrices being performed according to a Zadoff-Chu sequence, and an n-th entry ck(n) of a k-th Zadoff-Chu sequence being established by:
c
k

(
n
)
=

j2π


k

n

(
n
+
1
)
/
2
+
qn
L
where


L



is


a


positive


odd


integer
c
k

(
n
)
=

j2π


k

n
2
/
2
+
qn
L
where


L


is


a


positive


even


integer
where k is an integer which is relatively prime with L, and q is an integer.

### Claim 6 (depends on 1)

The method of claim 1, with the orthogonal spreading of the plurality of N by N matrices being performed according to a Hadamard matrix, and a Hadamard matrix of order n being established by:
HnHnT=nIn (20)
where In is an n×n identity matrix.

### Claim 7 (depends on 1)

The method of claim 1, with the orthogonal spreading of the plurality of N by N matrices being performed according to an orthogonally spreading matrix, and comprising the steps of:
generating an M by M code matrix C comprising the plurality of the N by N matrices A1 through Ax as the elements of the code matrix, with M corresponding to the number of the antennas, and the code matrix C being established by:
C
=
[
A
1
A
1
…
A
1
A
2
A
2
…
A
2
⋮
⋮
⋰
⋮
A
x
A
x
…
A
x
]
where x is an integer between 1 and X, X is the number of the plurality of N by N matrices, and M=N×X;
generating an M by M spreading matrix which is a Kronecker product of an N by N orthogonally spreading matrix and an X by X matrix with all elements being 1; and
orthogonally spreading the M by M code matrix C by an element-wise multiplication of the M by M code matrix C and the M by M spreading matrix to generating the N by N output matrix.

### Claim 8 (depends on 1)

The method of claim 1, further comprising exchanging at least one selected pair of rows in the output matrix.

### Claim 9 (depends on 8)

The method of claim 8, comprised of indices of the selected pair of rows exchanged being known by a receiver before receiving data from a transmitter.

### Claim 10 (depends on 1)

The method of claim 1, further comprising exchanging at least one selected pair of columns in the output matrix.

### Claim 11 (depends on 10)

The method of claim 10, comprised of indices of the selected pair of columns exchanged being known by a receiver before receiving data from a transmitter.

### Claim 12 (depends on 1)

The method of claim 1, comprised of transmitting the symbols in the output matrix via the plurality of antennas by using a space time transmission diversity scheme, with the symbols in each row of the output matrix being transmitted via a corresponding antenna on a certain frequency subcarrier in multiple time slots, and the symbols in each column of the output matrix being transmitted via different corresponding antennas in a corresponding time slot.

### Claim 13 (depends on 1)

The method of claim 1, comprised of transmitting the symbols in the output matrix via the plurality of antennas by using a space frequency transmission diversity scheme, with the symbols in each row of the output matrix being transmitted via a corresponding antennas simultaneously in a certain time slot on multiple frequency subcarriers, and the symbols in each column of the output matrix being transmitted via different corresponding antennas on a corresponding frequency subcarrier.

### Claim 14 (depends on 1)

The method of claim 1, comprised of transmitting the symbols in the output matrix via the plurality of antennas by using combination of a space frequency transmission diversity scheme and a space time transmission diversity scheme, with the symbols in each row of the output matrix being transmitted via a corresponding antennas on multiple frequency subcarriers and in multiple time slots, and the symbols in each column of the output matrix being transmitted via different corresponding antennas either on a corresponding frequency subcarrier, or in a corresponding time slot.

### Claim 15

A transmitter for transmitting data, comprising:
a modulator modulating data to be transmitted into a plurality of modulated symbols;
a precoding unit encoding each pair of modulated symbols from among said plurality of symbols in accordance with a transmission diversity scheme to result in a plurality of 2 by 2 matrices, with each 2 by 2 matrix corresponding to each pair of modulated symbols;
a spreading unit orthogonally spreading the plurality of 2 by 2 matrices to generate an output matrix; and
a plurality of antennas for transmitter transmitting the symbols in the output matrix.

### Claim 16 (depends on 15)

The transmitter of claim 15, comprised of the spreading unit exchanging at least one selected pair of rows in the output matrix.

### Claim 17 (depends on 15)

The transmitter of claim 15, comprised of the spreading unit exchanging at least one selected pair of columns in the output matrix.

### Claim 18

A method for data transmission, the method comprising the steps of:
modulating data to be transmitted into a plurality of modulated symbols;
dividing the plurality of modulated symbols into a plurality of subsets of modulated symbols, with each subset having N modulated symbols, and N being an integer no smaller than 2;
encoding each subset of modulated symbols in accordance with a transmission diversity scheme to result in a plurality of N by N matrices, with each N by N matrix corresponding to each subset of modulated symbols;
generating an output matrix with the plurality of the N by N matrices as the elements of the output matrix;
exchanging at least one pair of rows of the output matrix; and
transmitting the symbols in the output matrix via a plurality of antennas by using a space frequency transmission diversity scheme, with the symbols in each row of the output matrix being transmitted via a corresponding antennas simultaneously in a certain time slot on multiple frequency subcarriers, and the symbols in each column of the output matrix being transmitted via different corresponding antennas on a corresponding frequency subcarrier.

### Claim 19 (depends on 18)

The method of claim 18, comprised of the output matrix being established by:
[
S
1
S
2
0
0
0
0
S
3
S
4
-
S
2
*
S
1
*
0
0
0
0
-
S
4
*
S
3
*
]
where S1, S2, S3 and S4 are the modulated symbols to be transmitted via four antennas.

### Claim 20

A method for data transmission, the method comprising the steps of:
modulating data to be transmitted into a plurality of modulated symbols;
dividing the plurality of modulated symbols into a plurality of subsets of modulated symbols, with each subset having N modulated symbols, and N being an integer no smaller than 2;
encoding each subset of modulated symbols in accordance with a transmission diversity scheme to result in a plurality of N by N matrices, with each N by N matrix corresponding to each subset of modulated symbols;
generating an output matrix with the plurality of the N by N matrices as the elements of the output matrix;
exchanging at least one pair of columns of the output matrix; and
transmitting the symbols in the output matrix via a plurality of antennas by using a space frequency transmission diversity scheme, with the symbols in each row of the output matrix being transmitted via a corresponding antennas simultaneously in a certain time slot on multiple frequency subcarriers, and the symbols in each column of the output matrix being transmitted via different corresponding antennas on a corresponding frequency subcarrier.

### Claim 21

A method for data transmission, the method comprising the steps of:
modulating data to be transmitted into four modulated symbols;
generating an output matrix, the output matrix being established by:
[
y
(
0
)

(
4


)
y
(
1
)

(
4


)
y
(
2
)

(
4


)
y
(
3
)

(
4


)
y
(
0
)

(
4


+
1
)
y
(
1
)

(
4



+
1
)
y
(
2
)

(
4



+
1
)
y
(
3
)

(
4



+
1
)
y
(
0
)

(
4



+
2
)
y
(
1
)

(
4



+
2
)
y
(
2
)

(
4



+
2
)
y
(
3
)

(
4



+
2
)
y
(
0
)

(
4



+
3
)
y
(
1
)

(
4



+
3
)
y
(
2
)

(
4



+
3
)
y
(
3
)

(
4



+
3
)
]
=
[
1
0
0
0
j
0
0
0
0
0
0
0
0
0
0
0
0
-
1
0
0
0
j
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
j
0
0
0
0
0
0
0
0
0
0
1
0
0
0
-
j
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
j
0
0
0
0
0
0
0
0
0
0
0
0
-
1
0
0
0
j
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
j
0
0
0
0
0
0
0
0
0
0
1
0
0
0
-
j
0
]

[
Re

(
S
1

(

)
)
Re

(
S
2

(

)
)
Re

(
S
3

(

)
)
Re

(
S
4

(

)
)
Im

(
S
1

(

)
)
Im

(
S
2

(

)
)
Im

(
S
3

(

)
)
Im

(
S
4

(

)
)
]
where S1(i), S2(i), S3(i) and S4(i) are the four modulated symbols transmitted on the subcarriers 4i, 4i+1, 4i+2 and 4i+3; and
transmitting the symbols in the output matrix via four antennas on four frequency subcarriers, with y(n)(m) in the output matrix being transmitted via an (n+1)-th antenna and an (m+1)-th subcarrier.
