# US 2008/0187062 A1 · Method and apparatus for multiple-input multiple- output feedback generation

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

- Number: US 2008/0187062 A1
- Document ID: US20080187062A1
- Status: Published application
- Kind: A1
- Application number: 12/027,148
- Filed: 2008-02-06
- Published: 2008-08-07
- Earliest claimed: 2007-02-06
- Assignees: InterDigital Technology Corporation
- Inventors: Kyle Jung-Lin Pan; Allan Yingming Tsai
- Web page: https://patentgrep.com/patent/US20080187062A1

## CPC

- H04L 25/03343: {Arrangements at the transmitter end}
- H04B 7/0417: Feedback systems
- H04B 7/0478: {Special codebook structures directed to feedback optimisation}
- H04B 7/063: {Parameters other than those covered in groups H04B7/0623 - H04B7/0634, e.g. channel matrix rank or transmit mode selection}
- H04B 7/0641: {Differential feedback}
- H04L 2025/03426: {transmission using multiple-input and multiple-output channels}
- H04L 2025/03802: {Signalling on the reverse channel}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04B: TRANSMISSION

## Abstract

Disclosed are a method and apparatus for generating feedback in multiple-input/multiple-output (MIMO) communications. Feedback is used to update a precoding matrix

## Claims

### Claim 1

A method of generating feedback in multiple-input/multiple-output (MIMO) communications, comprising:
receiving a first signal transmitted using a precoding matrix;
determining a value of a metric associated with the first signal;
calculating a metric function from the value of a metric;
determining an update to the precoding matrix which optimizes the metric, the update being calculated from the metric function;
updating the precoding matrix using the update; and
receiving a second signal transmitted using the updated precoding matrix.

### Claim 2 (depends on 1)

The method of claim 1, further comprising updating the precoding matrix for more than one frequency band.

### Claim 3 (depends on 1)

The method of claim 1, wherein optimizing the metric comprises at least one of:
maximizing a received power;
maximizing a signal-to-noise-ratio;
maximizing a signal-to-interference-ratio;
maximizing a signal-to-noise-and-interference ratio (SINR);
maximizing a channel capacity;
maximizing a reception rate;
minimizing a received interference level;
minimizing a mean square error (MSE); and
minimizing a bit error rate (BER).

### Claim 4 (depends on 1)

The method of claim 1, wherein determining an update comprises calculating an update q[n] according to the equation [n]=M(H[n]S1[n])−M(H[n]S0[n]), where M( ) is the metric function, H is a channel matrix and S1 and S0 are matrices representing signal flows.

### Claim 5 (depends on 1)

The method of claim 1, wherein determining an update comprises determining a single bit.

### Claim 6 (depends on 1)

The method of claim 1, wherein determining an update comprises determining more than one bit.

### Claim 7 (depends on 5)

The method of claim 5, comprising calculating the single bit using the equation
s[n]=sign{∥H[n+1]T+[n+1]∥F2−∥H[n+1]T−[n+1]∥F2}
where H[n+1] is a channel matrix, T+[n+1] and T−[n+1] are two possible updated precoding matrices, and ∥ ∥F indicates a Frobenius norm.

### Claim 8 (depends on 7)

The method of claim 7, comprising calculating the updated precoding matrices from the equations
T+[n+1]=T[n]+v∥T[n]∥U
and
T−[n+1]=T[n]−v∥T[n]∥U
where T[n] is a precoding matrix not yet updated, U is a random perturbation matrix and v is an update step size.

### Claim 9 (depends on 1)

The method of claim 1, wherein determining an update comprises generating at least one set of set of random matrices.

### Claim 10 (depends on 9)

The method of claim 9, wherein a combination of updated precoding matrix and random matrix to be used is signaled with one or more bits.

### Claim 11 (depends on 1)

The method of claim 1, wherein determining an update comprises:
defining current and updated precoding matrices as points in a Grassmann manifold; and
determining a signal flow in the manifold between the points.

### Claim 12 (depends on 11)

The method of claim 11, comprising computing a feedback sign bit based on a direction that optimizes the metric.

### Claim 13 (depends on 12)

The method of claim 12, wherein computing the feedback sign bit b[n] comprises evaluating equation b[n]=sign (q[n]), where q[n] is an effective channel measurement for the direction that optimizes the metric.

### Claim 14 (depends on 13)

The method of claim 13, comprising determining q[n] from the equation q[n]=M(H[n]S1[n])−M(H[n]S0[n]), where
H[n] is a channel matrix;
M(•) is a metric function;
S1[n]=U[n−1]exp(F[n])Y;
S0[n]=U[n−1]exp(−F[n])Y;
U is a unitary matrix;
Y
=
[
I
N
s
0
(
N
t
-
N
s
)
×
N
s
]
;
INs is an identity matrix;
0(Nt−Ns)×Ns is a matrix containing only zeros;
F

[
n
]
=
[
0
-
G
H

[
n
]
G

[
n
]
0
]
;

and
G is a random matrix.

### Claim 15 (depends on 14)

The method of claim 14, wherein the metric function is calculated using one of the equations
M
=
(
H
~
)
=
-
trace
(
(
H
~
H

H
~
+
1
SNR

I
)
-
1
)
and
M

(
H
~
)
=
log
2

det

(
H
~
H

H
~
+
1
ρ

I
)
.

### Claim 16 (depends on 14)

The method of claim 14, comprising generating the random matrix using independent and identical distribution (i.i.d.) complex Gaussian distributions of zero mean and a variance.

### Claim 17 (depends on 14)

The method of claim 14, comprising generating the random matrix using a uniform distribution of random number between −1 and 1.

### Claim 18 (depends on 17)

The method of claim 17, comprising:
normalizing the random numbers to have norm equal to 1; and
scaling the normalized numbers by a scalar.

### Claim 19 (depends on 18)

The method of claim 18, wherein the scalar is static.

### Claim 20 (depends on 18)

The method of claim 18, comprising adjusting the scalar dynamically.

### Claim 21 (depends on 14)

The method of claim 14, comprising adjusting the random matrix based on at least one of:
a speed; and
a Doppler shift.

### Claim 22 (depends on 9)

The method of claim 9 comprising synchronously generating the at least one set of random matrices at a transmitter and at a receiver.

### Claim 23 (depends on 9)

The method of claim 9 comprising receiving the at least one set of random matrices multiplexed with data.

### Claim 24 (depends on 9)

The method of claim 9 comprising preconfiguring the at least one set of random matrices and storing the at least one set of matrices in memory in a transmitter and in a receiver.

### Claim 25 (depends on 1)

The method of claim 1, wherein updating the precoding matrix T[n] comprises:
creating a matrix U[n] by concatenating the precoding matrix and a matrix which contains columns as an orthonormal basis of an orthogonal complement of the matrix, thereby making U[n] unitary; and
calculating an updated precoding matrix T[n+1] using the equation T[n+1]=U[n]exp(b[n+1]F[n+1])Y, where
b[n+1] is a feedback sign bit;
Y
=
[
I
N
s
0
(
N
t
-
N
s
)
×
N
s
]
;
INs is an identity matrix;
0(Nt−Ns)×Ns is a matrix containing only zeros;
F

[
n
]
=
[
0
-
G
H

[
n
]
G

[
n
]
0
]
;

and
G is a random matrix.

### Claim 26 (depends on 1)

The method of claim 1, wherein updating the precoding matrix T[n] comprises:
decomposing a known random matrix G according to the equation G[n+1]=V2ΘV1H, where Θ is a diagonal matrix comprising Ns elements θ1, θ2, . . . , θNs, Ns being the dimensionality of a subspace of the channel matrix;
defining diagonal matrix C as C=diag(cos θ1, cos θ2, . . . , cos θNs);
defining diagonal matrix S as S=diag(sin θ1, sin θ2, . . . , sin θNs);
creating a unitary matrix U[n] by concatenating the precoding matrix and a matrix which contains columns as an orthonormal basis of an orthogonal complement of the precoding matrix; and
calculating an updated precoding matrix T[n+1] using the equation
T

[
n
+
1
]
=
U

[
n
]

[
V
1

C
V
2

S
]
.

### Claim 27

A wireless transmit/receive unit (WTRU) configured for providing feedback in multiple-input/multiple-output (MIMO) communications comprising:
a transmitter;
a receiver; and
a processor;
the receiver configured to
receive a first signal transmitted using a precoding matrix, and
receive a second signal transmitted using an updated precoding matrix;
the processor configured to:
determine a value of a metric associated with the first signal,
calculate a metric function from the value of the metric;
determine, using the metric function, an update to the precoding matrix which optimizes the metric;
the transmitter configured to transmit the optimizing update.

### Claim 28 (depends on 27)

The WTRU of claim 27, wherein the processor is configured to optimize the metric by performing at least one of:
maximizing a received power;
maximizing a signal-to-noise-ratio;
maximizing a signal-to-interference-ratio;
maximizing a signal-to-noise-and-interference ratio (SINR);
maximizing a channel capacity;
maximizing a reception rate;
minimizing a received interference level;
minimizing a mean square error (MSE); and
minimizing a bit error rate (BER).

### Claim 29 (depends on 27)

The WTRU of claim 27, wherein the transmitter is configured to determine the update by calculating an update q[n] according to the equation q[n]=M(H[n]S1[n])−M(H[n]S0[n]), where MO is the metric function, n represents a time instance, H is a channel matrix and S1 and S0 are matrices representing signal flows.

### Claim 30 (depends on 27)

The WTRU of claim 27, wherein the processor is configured for determining the update by determining a single bit.

### Claim 31 (depends on 30)

The WTRU of claim 30, wherein the processor is configured to calculate the single bit using the equation
s[n]=sign{∥H[n+1]T+[n+1]∥F2−∥H[n+1]T−[n+1]∥F2}
where H[n+1] is a channel matrix, T+[n+1] and T−[n+1] are two possible updated precoding matrices; and ∥ ∥F indicates a Frobenius norm.

### Claim 32 (depends on 31)

The WTRU of claim 31, wherein the processor is configured to calculate the updated precoding matrices T+[n+1] and T−[n+1] from the equations
T+[n+1]=T[n]+v∥T[n]∥U
and
T−[n+1]=T[n]−v∥T[n]∥U
where T[n] is a precoding matrix not yet updated, U is a random perturbation matrix and v is an update step size.

### Claim 33 (depends on 27)

The WTRU of claim 27, wherein the processor is configured to determine the update using a random matrix.

### Claim 34 (depends on 27)

The WTRU of claim 27, wherein the processor is configured to determine the update by determining a signal flow between points representing current and updated precoding matrices in a Grassmann manifold

### Claim 35 (depends on 34)

The WTRU of claim 34 wherein the processor is configured to compute a feedback sign bit based on a direction that optimizes the metric.

### Claim 36 (depends on 35)

The WTRU of claim 35 wherein the processor is configured to compute the feedback sign bit b[n] by evaluating the equation b[n]=sign (q[n]), where q[n] is an effective channel measurement for the direction that optimizes the metric.

### Claim 37 (depends on 36)

The WTRU of claim 36 wherein the processor is configured to determine q[n] from the equation q[n]=M(H[n]S1[n])−M(H[n]S0[n]), where
H[n] is the channel matrix at time instance n;
M is a metric function;
S1[n]=U[n−1]exp(F[n])Y;
S0[n]=U[n−1]exp(−F[n])Y;
U is a unitary matrix;
Y
=
[
I
N
s
0
(
N
t
-
N
s
)
×
N
s
]
;
INs is an identity matrix;
0(Nt−Ns)×Ns is a matrix containing only zeros;
F

[
n
]
=
[
0
-
G
H

[
n
]
G

[
n
]
0
]
;

and
G is a random matrix.

### Claim 38 (depends on 37)

The WTRU of claim 37, wherein the processor is configured to calculate the metric function using one of the equations
M
=
(
H
~
)
=
-
trace


(
(
H
~
H

H
~
+
1
SNR

I
)
-
1
)
and
M

(
H
~
)
=
log
2

det

(
H
~
H

H
~
+
1
ρ

I
)
.

### Claim 39 (depends on 37)

The WTRU of claim 37, wherein the processor is configured to determine q[n] when the random matrix is generated with independent and identical distribution (i.i.d.) complex Gaussian distributions of zero mean and a variance.

### Claim 40 (depends on 37)

The WTRU of claim 37, wherein the processor is configured to determine q[n] when the random matrix is generated using a uniform distribution of random numbers between −1 and 1.

### Claim 41 (depends on 33)

The WTRU of claim 33 wherein the receiver is configured to receive the random matrix multiplexed with data and the processor is configured to determine q[n] from the random matrix when so received.

### Claim 42 (depends on 33)

The WTRU of claim 33 comprising circuitry for generating the random matrix synchronously with another generator.

### Claim 43 (depends on 33)

The WTRU of claim 33 comprising a memory configured for storing a set of preconfigured random matrices.

### Claim 44

A processor for updating a precoding matrix, comprising:
a unitary module configured to generate a unitary matrix;
a randomizing module configured to generate a random matrix; and
a precoding module configured to receive the unitary matrix and random matrix and generate therefrom an updated precoding matrix.

### Claim 45 (depends on 44)

The processor of claim 44, wherein the precoding module is configured to generate the updated precoding matrix using the equation T[n+1]=U[n]exp(b[n+1]F[n+1])Y where
b[n+1] is a feedback sign bit,
Y
=
[
I
N
s
0
(
N
t
-
N
s
)
×
N
s
]
,
INs an identity matrix;
0(Nt−Ns)×Ns a matrix containing only zeros;
F

[
n
]
=
[
0
-
G
H

[
n
]
G

[
n
]
0
]
;
U[n] is a unitary matrix at time interval n generated by the unitary module; and
G[n] is a random matrix.

### Claim 46 (depends on 45)

The processor of claim 45, wherein the precoding module is configured to update the precoding matrix by
decomposing the random matrix G according to the equation G[n+1]=V2ΘV1H, where Θ is a diagonal matrix comprising Ns elements θ1, θ2, . . . , θNs, Ns being Ns being the dimensionality of a subspace of the channel matrix;
generating diagonal matrix C as C=diag(cos θ1, cos θ2, . . . , cos θNs);
generating diagonal matrix S as S=diag(sin θ1, sin θ2, . . . , sin θNs); and
calculating an updated precoding matrix T[n+1] using the equation
T

[
n
+
1
]
=
U

[
n
]

[
V
1

C
V
2

S
]
.

### Claim 47 (depends on 44)

The processor of claim 44, wherein the unitary module is configured to generate the unitary matrix by concatenating a current precoding matrix and a matrix which contains columns as an orthonormal basis of an orthogonal complement of the current precoding matrix.

### Claim 48 (depends on 44)

The processor of claim 44, wherein the randomizing module is configured for generating the random matrix using independent and identical distribution (i.i.d.) complex Gaussian distributions of zero mean and a variance.

### Claim 49 (depends on 44)

The processor of claim 44, wherein the randomizing module is configured for generating the random matrix using a uniform distribution of random numbers between −1 and 1.

### Claim 50 (depends on 49)

The processor of claim 49, wherein the randomizing module is configured for normalizing the random numbers to have norm equal to 1 and scaling the normalized numbers by a scalar.

### Claim 51 (depends on 50)

The processor of claim 50, wherein the randomizing module is configured to use a static scalar.

### Claim 52 (depends on 50)

The processor of claim 50 wherein the randomizing module is configured to use a scalar which is dynamically adjusted.

### Claim 53 (depends on 52)

The processor of claim 52, wherein the scalar is dynamically adjusted according to a speed or a Doppler shift associated with a moving unit.

### Claim 54 (depends on 44)

The processor of claim 44, wherein the randomizing module is configured for synchronously generating the random matrix with another generator.

### Claim 55 (depends on 44)

The processor of claim 44 further comprising a multiplexer configured for multiplexing the random matrix with data.

### Claim 56 (depends on 44)

The processor of claim 44, further comprising rank adaptation circuitry configured to receive rank adaptation information and convey the information to the precoding module, to be used in the updating of the precoding matrix.

### Claim 57 (depends on 53)

The processor of claim 53 further comprising Doppler adjustment circuitry configured for receiving information on the speed or Doppler shift and conveying the information to the randomizing module, for use in generating the random matrix.

### Claim 58 (depends on 25)

The method of claim 25, wherein determining an update comprises generating at least one set of random matrices.

### Claim 59 (depends on 58)

The method of claim 58 wherein a combination of an updated precoding matrix and a random matrix to be used is signaled with one or more bits.

### Claim 60 (depends on 4)

The method of claim 4 wherein n indicates a time interval, a frequency interval, a subcarrier, a frequency band, a resource block, or a resource block group in any combination.

### Claim 61 (depends on 14)

The method of claim 14 wherein n indicates a time interval, a frequency interval, a subcarrier, a frequency band, a resource block, or a resource block group in any combination.

### Claim 62 (depends on 25)

The method of claim 25 wherein n indicates a time interval, a frequency interval, a subcarrier, a frequency band, a resource block, or a resource block group in any combination.
