# US 2006/0155534 A1 · Codebook generation system and associated methods

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

- Number: US 2006/0155534 A1
- Document ID: US20060155534A1
- Status: Published application
- Kind: A1
- Application number: 11/059,963
- Filed: 2005-02-16
- Published: 2006-07-13
- Earliest claimed: 2005-01-13
- Assignees: Intel Corporation
- Inventors: Xintian Lin; Qinghua Li
- Web page: https://patentgrep.com/patent/US20060155534A1

## CPC

- 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 7/0663: {using vector or matrix manipulations}
- H04B: TRANSMISSION

## Abstract

A codebook generation system and associated methods are generally described herein.

## Claims

### Claim 1

A method comprising:
processing each codeword matrix associated with a codebook to generate a modified codebook with an improved peak to average power ratio (PAR) as compared to the codebook.

### Claim 2 (depends on 1)

A method according to claim 1, the element of processing comprising:
applying at least one of two unitary transformations QC and PC to a given codebook according to {tilde over (V)}=QC V PC, where V is the codeword matrix in codebook C of dimension Nt by Ns, QC and PC are complex unitary matrices of dimensions Nt by Nt and Ns by Ns respectively and are constant for an entirety of codebook C.

### Claim 3 (depends on 2)

A method according to claim 2, wherein one or more of QC and PC are derived according to at least one of
{
Q
C
,
P
C
}
=
argmin
Q
,
P
⁢
⁢
max
V
∈
C
,
i
⁢
(
∑
j
=
1
N
s
⁢

v
∼
i
,
j

)
2
⁢
⁢
and
{
Q
C
,
P
C
}
=
argmin
Q
,
P
⁢
⁢
max
V
∈
C
,
i
⁢
∑
j
=
1
N
s
⁢

v
∼
i
,
j

2
.

### Claim 4 (depends on 1)

A transceiver comprising:
a memory including data representing one or more codebook(s) of one or more codeword matrix(es); and
a codebook generation agent, coupled to the memory, to implement a method according to claim 1.

### Claim 5

A receiver comprising:
a codebook generation agent, to process each codeword matrix associated with a codebook to generate a modified codebook with an improved peak to average power ratio (PAR) as compared to the original codebook.

### Claim 6 (depends on 5)

A receiver according to claim 5, wherein the codebook generation agent selectively applies at least one of two unitary transformations QC and PC to a given codebook according to {tilde over (V)}=QC V PC, where V is the codeword matrix in codebook C of dimension Nt by Ns, QC and PC are complex unitary matrices of dimensions Nt by Nt and Ns by Ns respectively and are constant for an entirety of codebook C.

### Claim 7 (depends on 6)

A receiver according to claim 6, wherein the codebook generation agent selectively derives at least one of QC and PC according to at least one of
{
Q
C
,
P
C
}
=
argmin
Q
,
P
⁢
⁢
max
V
∈
C
,
i
⁢
(
∑
j
=
1
N
s
⁢

v
∼
i
,
j

)
2
⁢
⁢
and
{
Q
C
,
P
C
}
=
argmin
Q
,
P
⁢
⁢
max
V
∈
C
,
i
⁢
∑
j
=
1
N
s
⁢

v
∼
i
,
j

2
.

### Claim 8

A storage medium comprising a modified codebook, the modified codebook generated through a process applying at least one complex unitary transform to a select codeword matrix from the codebook.

### Claim 9 (depends on 8)

A storage medium according to claim 8, wherein the modified codebook is derived by applying each codeword matrix of an original codebook to one or more of complex unitary matrices QC and PC, which generate the modified codebook with a same distance structure as the original codebook and improved PAR characteristics.
