# US 2012/0250779 A1 · Method for Transmitting an Information Sequence

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

- Number: US 2012/0250779 A1
- Document ID: US20120250779A1
- Status: Published application
- Kind: A1
- Application number: 13/524,258
- Filed: 2012-06-15
- Published: 2012-10-04
- Earliest claimed: 2006-08-22
- Assignees: NEC Laboratories America, Inc.
- Inventors: Mohammad A. Khojastepour
- Web page: https://patentgrep.com/patent/US20120250779A1

## CPC

- H04B 7/0632: {Channel quality parameters, e.g. channel quality indicator [CQI]}
- H04B 7/043: {using best eigenmode, e.g. beam forming or beam steering}
- H04B 7/0456: Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting
- H04B 7/0478: {Special codebook structures directed to feedback optimisation}
- H04B 7/0617: {for beam forming}
- H04B 7/0639: {Using selective indices, e.g. of a codebook, e.g. pre-distortion matrix index [PMI] or for beam selection}
- H04B: TRANSMISSION

## Abstract

Methods and apparatus are disclosed for applying successive multi-rank beamforming strategies (e.g., successive precoding strategies) for the design of precoders over a set of parallel channels. Successive beamforming is applied to a narrow band channel model and is also applied for finer quantization of a single beamforming vector (e.g., recursive beamforming). A first embodiment provides the optimal approach with high complexity. An alternative embodiment provides successive beamforming for near optimal precoding selection with medium complexity. A low complexity method for precoder selection is also provided wherein a channel representative matrix for the set of parallel channels is determined and successive beamforming on the calculated channel representative is applied.

## Claims

### Claim 1

A method implemented in a user equipment used in a wireless communications system, comprising:
precoding data using a precoding matrix based on a codebook which includes entries that are expressed as
A

(
v
1
,
v
2
,
v
3
,
…
)
=
[
v
1
,
HH

(
v
1
-
e
1
M
)

[
0
v
2
]
,
HH

(
v
1
-
e
1
M
)

[
0
HH

(
v
2
-
e
1
M
-
1
)

[
0
v
3
]
]
,
…
]
,
where the transmitter has M antennas, e1N=[1,0, . . . ,0]TεCN (N=M, M−1, . . . ), CN being N-dimensional complex space, va denotes a column vector, and HH(vk−e1l) is a rotation matrix that transforms vector vk to the unit vector e1l; and
transmitting the precoded data to a base station.

### Claim 2 (depends on 1)

The method as in claim 1, wherein va is selected from a set Va where V1={vu1εCM}i=1N1, V2={e1M−1}, V3={e1M−2}, . . . .

### Claim 3 (depends on 1)

The method as in claim 1, wherein the number of transmit antennas is 2.

### Claim 4 (depends on 1)

The method as in claim 1, wherein the number of transmit antennas is 4.

### Claim 5 (depends on 1)

The method as in claim 1, wherein the precoding matrix is formed by selecting one or more columns of matrix A.

### Claim 6 (depends on 5)

The method as in claim 5, wherein the number of selected columns to form the precoding matrix is less than the number of transmit antennas.

### Claim 7 (depends on 1)

The method as in claim 1, wherein
HH

(
w
)
=
{
I
-
2

ww
H
||
w

||
2
if


w
≠
0
I
if


w
=
0
the house-holder transformation.

### Claim 8

A method implemented in a base station used in a wireless communications system, comprising:
receiving from a user equipment data precoded with a precoding matrix based on a codebook which includes entries that are expressed as
A

(
v
1
,
v
2
,
v
3
,
…
)
=
[
v
1
,
HH

(
v
1
-
e
1
M
)

[
0
v
2
]
,
HH

(
v
1
-
e
1
M
)

[
0
HH

(
v
2
-
e
1
M
-
1
)

[
0
v
3
]
]
,
…
]
,
where the transmitter has M antennas, e1N=[1,0, . . . ,0]TεCN (N=M, M−1, . . . ), CN being N-dimensional complex space, va denotes a column vector, and HH(vk−e1l) is a rotation matrix that transforms vector vk to the unit vector e1l.

### Claim 9 (depends on 8)

The method as in claim 8, wherein va is selected from a set Va where V1={vi1εCM}i=1N1, V2={e1M−1}, V3={e1M−2}, . . . .

### Claim 10 (depends on 8)

The method as in claim 8, wherein the number of transmit antennas is 2.

### Claim 11 (depends on 8)

The method as in claim 8, wherein the number of transmit antennas is 4.

### Claim 12 (depends on 8)

The method as in claim 8, wherein the precoding matrix is formed by selecting one or more columns of matrix A.

### Claim 13 (depends on 12)

The method as in claim 12, wherein the number of selected columns to form the precoding matrix is less than the number of transmit antennas.

### Claim 14 (depends on 8)

The method as in claim 8, wherein
HH

(
w
)
=
{
I
-
2

ww
H
||
w

||
2
if


w
≠
0
I
if


w
=
0
the house-holder transformation.

### Claim 15

A method implemented in a base station used in a wireless communications system, comprising:
providing feedback information for transmission in order for a transmitter to select a precoding matrix from a codebook comprising a matrix that is expressed as
A

(
v
1
,
v
2
,
v
3
,
…
)
=
[
v
1
,
HH

(
v
1
-
e
1
M
)

[
0
v
2
]
,
HH

(
v
1
-
e
1
M
)

[
0
HH

(
v
2
-
e
1
M
-
1
)

[
0
v
3
]
]
,
…
]
,
where the transmitter has M antennas, e1N=[1,0, . . . ,0]TεCN (N=M, M−1, . . . ) CN being N-dimensional complex space, va denotes a column vector, and HH(vk−e1l) is a rotation matrix that transforms vector vk to the unit vector e1l.

### Claim 16 (depends on 15)

The method as in claim 15, wherein va is selected from a set Va where V1={vi1εCM}i=1N1, V2={e1M−1}, V3={e1M−2}, . . . .

### Claim 17 (depends on 15)

The method as in claim 15, wherein the number of transmit antennas is 2.

### Claim 18 (depends on 15)

The method as in claim 15, wherein the number of transmit antennas is 4.

### Claim 19 (depends on 15)

The method as in claim 15, wherein the precoding matrix is formed by selecting one or more columns of matrix A.

### Claim 20 (depends on 19)

The method as in claim 19, wherein the number of selected columns to form the precoding matrix is less than the number of transmit antennas.

### Claim 21 (depends on 15)

The method as in claim 15, wherein
HH

(
w
)
=
{
I
-
2

ww
H
||
w

||
2
if


w
≠
0
I
if


w
=
0
is the house-holder transformation.
