US Patent 8,520,761 — Method and apparatus for generating pre-coding matrix codebook

Life of the patent

8 dated events

⤢ drag to zoom

ProsecutionTerm & feeshover for detail · click to open

Abstract

This disclosure relates a method and apparatus for generating pre-coding matrix codebook. The method for generating pre-coding matrix codebook, comprising: acquiring a universal set of pre-coding matrixes in a first format; acquiring a universal set of pre-coding matrixes in a second format; selecting a first predetermined number of pre-coding matrixes in the first format from the universal set of pre-coding matrixes in the first format; and selecting a second predetermined number of pre-coding matrixes in the second format from the universal set of pre-coding matrixes in the second format, according to the selected first predetermined number of pre-coding matrixes in the first format.

Claims

8 · 2 independent · depth 3

8 granted claims

›1.independentA method for generating pre-coding matrix codebook, comprising:nacquiring a universal set of pre-coding matrixes in a first format;acquiring a univers…+5

›2.↳ 1The method for generating pre-coding matrix codebook according to claim 1, wherein the selecting the second predetermined number of pre-coding matrixe…d2+1

›4.↳ 2The method for generating pre-coding matrix codebook according to claim 2, wherein the selecting the second predetermined number of pre-coding matrixe…d3

The method for generating pre-coding matrix codebook according to claim 2, wherein the selecting the second predetermined number of pre-coding matrixes in the second format making a maximum contribution to the performance of the communication system is performed by:n1) deleting a row corresponding to the pre-coding matrixes in the second format from the performance parameter matrix of M rows and N columns, so as to obtain a performance parameter matrix of Mâˆ’1 rows and N columns, where M is the number of rows in the current performance parameter matrix, M=K+M2, K is the number of pre-coding matrixes in the first format in the performance parameter matrix, M2 is the number of pre-coding matrixes in the second format in the performance parameter matrix, and N is the number of columns in the performance parameter matrix;2) calculating performance parameters values of the performance parameter matrix of Mâˆ’1 rows and N columns,3) repeating processes 1) and 2) for M2 times, and each time deleting a row corresponding to a different pre-coding matrix in the second format from the performance parameter matrix, so as to obtain M2 performance parameters values,4) taking a performance parameter matrix of Mâˆ’1 rows and N columns, which is corresponding to a maximum one among the M2 performance parameters values, as a new performance parameter matrix,5) judging whether the number of rows in the new performance parameter matrix is the sum of the first and second predetermined numbers,when the number of rows in the new performance parameter matrix is the sum of the first and second predetermined numbers, 6) outputting respective pre-coding matrixes corresponding to the new performance parameter matrix as pre-coding matrix codebook;when the number of rows in the new performance parameter matrix is not the sum of the first and second predetermined numbers, setting the new performance parameter matrix as a current performance parameter matrix, and repeating the processing from 1).

›3.↳ 1The method for generating pre-coding matrix codebook according to claim 1, wherein the selecting the second predetermined number of pre-coding matrixe…d2+1

›6.↳ 3The method for generating pre-coding matrix codebook according to claim 3, wherein the second predetermined number of pre-coding matrixes in the secon…d3

The method for generating pre-coding matrix codebook according to claim 3, wherein the second predetermined number of pre-coding matrixes in the second format making the maximum contribution are selected by:nselecting rows from the performance parameter matrix corresponding to the selected first predetermined number of pre-coding matrixes in the first format, as a selected performance parameter matrix, where assuming the number of selected rows is K; and selecting rows from the performance parameter matrix corresponding to the pre-coding matrixes in the second format, as an candidate performance parameter matrix, where assuming the number of selected rows is M2,1) taking out a row from the candidate performance parameter matrix as a newly added row,2) merging the newly added row with the selected performance parameter matrix, so as to form a matrix of K+1 rows and N columns;3) calculating performance parameters values of the matrix of K+1 rows and N columns;4) repeating steps 1) to 3) for M2 times, and each time taking out one row corresponding to a different pre-coding matrix in the second format from the candidate performance parameter matrix as a newly added row, so as to obtain M2 performance parameters values;5) setting a matrix of K+1 rows and N columns corresponding to a maximum one of the M2 performance parameters values as a new selected performance parameter matrix,6) judging whether the number of rows in the new selected performance parameter matrix is the sum of the first and second predetermined numbers,when the number of rows in the new selected performance parameter matrix is the sum of the first and second predetermined numbers, 7) outputting respective pre-coding matrixes corresponding to respective rows in the new selected performance parameter matrix as pre-coding matrix codebook;when the number of rows is not the sum of the first and second predetermined numbers, deleting an added row corresponding to the maximum one of the M2 performance parameters values from the candidate performance parameter matrix, so as to form a new candidate performance parameter matrix, and repeating the processing from 1) for the new selected performance parameter matrix and the new performance parameter matrix.

›5.↳ 1The method for generating pre-coding matrix codebook according to claim 1, wherein the second predetermined number of pre-coding matrixes in the secon…d2

The method for generating pre-coding matrix codebook according to claim 1, wherein the second predetermined number of pre-coding matrixes in the second format are selected from the universal set of pre-coding matrixes in the second format by:nsetting the selected first predetermined number of pre-coding matrixes in the first format as a currently selected set of pre-coding matrixes, and setting the second universal set of pre-coding matrixes as a currently candidate set of pre-coding matrixes;1) taking out one pre-coding matrix in the second format from the currently candidate set of pre-coding matrixes, as an added pre-coding matrix,2) combining the taken out pre-coding matrix in the second format with the currently selected set of pre-coding matrixes, so as to form a combined set of pre-coding matrixes,3) forming a performance parameter matrix according to the combined set of pre-coding matrixes and the set of channel matrixes, each row of the performance parameter matrix represents performance parameter values related to the same pre-coding matrix, and each column represents performance parameter values related to the same channel matrix,4) calculating performance parameters values of the performance parameter matrix,5) repeating processes 1) to 4) for M2 times, and each time taking out one different pre-coding matrix in the second format, so as to obtain M2 performance parameters values, where M2 is the number of pre-coding matrixes in the currently candidate set of pre-coding matrixes,6) setting a combined set of pre-coding matrixes, which is corresponding to a performance parameter matrix that corresponds to a maximum one among the M2 performance parameters values, as a currently selected set of pre-coding matrixes,7) judging whether the number of pre-coding matrixes in the currently selected set of pre-coding matrixes is the sum of the first and second predetermined numbers,when the number of pre-coding matrixes in the currently selected set of pre-coding matrixes is the sum of the first and second predetermined numbers, 8) outputting pre-coding matrixes in the currently selected set of pre-coding matrixes as pre-coding matrix codebook;when the number of pre-coding matrixes in the currently selected set of pre-coding matrixes is not the sum of the first and second predetermined numbers, deleting an added pre-coding matrix corresponding to a maximum one of the M2 performance parameters values from the currently candidate set of pre-coding matrixes to obtain a new currently candidate set of pre-coding matrixes, and repeating the processing from 1) for the currently selected set of pre-coding matrixes and the new currently candidate set of pre-coding matrixes.

›7.independentAn apparatus for generating pre-coding matrix codebook, comprising:na universal set of first pre-coding matrixes acquiring unit configured to acquire …+1

An apparatus for generating pre-coding matrix codebook, comprising:na universal set of first pre-coding matrixes acquiring unit configured to acquire a universal set of pre-coding matrixes in a first format;a universal set of second pre-coding matrixes acquiring unit configured to acquire a universal set of pre-coding matrixes in a second format;a first pre-coding matrix selecting unit configured to select a first predetermined number of pre-coding matrixes in the first format from the universal set of pre-coding matrixes in the first format; anda second pre-coding matrix selecting unit configured to select a second predetermined number of pre-coding matrixes in the second format from the universal set of pre-coding matrixes in the second format, according to the selected first predetermined number of pre-coding matrixes in the first format;wherein the second pre-coding matrix selecting unit comprises:a combined set of pre-coding matrixes generating sub-unit configured to merge the selected first predetermined number of pre-coding matrixes in the first format with the universal set of pre-coding matrixes in the second format, so as to form a combined set of pre-coding matrixes;a channel matrixes set acquiring sub-unit configured to form a set of channel matrixes of a communication system to which the pre-coding matrixes are applied, and each of the channel matrixes is corresponding to one channel example;a performance parameter matrix generating sub-unit configured to form a performance parameter matrix according to the combined set of pre-coding matrixes and the set of channel matrixes, each row of the performance parameter matrix represents performance parameter values related to the same pre-coding matrix, and each column represents performance parameter values related to the same channel matrix; anda pre-coding matrixes in second format selecting sub-unit configured to select the second predetermined number of pre-coding matrixes in the second format making a maximum contribution to the performance of the communication system, by using the performance parameter matrix and according to contributions to the performance of the communication system made by the respective pre-coding matrixes in the second format,wherein the universal set of first pre-coding matrixes acquiring unit, the universal set of second pre-coding matrixes acquiring unit, the first pre-coding matrix selecting unit, and the second pre-coding matrix selecting unit comprise hardware.

Classifications

11 codes

IPC · International Patent Classification

Section H — Electricity

H04L1/02
H04B7/02

USPC · US Patent Classification

375/267375/260375/316375/265375/296375/285375/227375/295375/262

Claim changes

Soon

Coming soonHow the claims changed between publication and grant

See which claims were amended, added or cancelled during examination, with every added and removed word marked.

AmendedAddedCancelledUnchanged

The published claims of this patent are not paired with the granted ones in what we hold.

File wrapper

⤢ drag to zoom

USPTOApplicanthover for detail · click to open

Pendency

1.5 y

543 days filing → grant

Office actions

1

non-final + final

Responses

1

no RCE

Interviews

1

examiner interview summaries

Examiner

Fabricio R Murillo Garcia

art unit —

Law firm

Law firm · Log in to unlock

Citations: 16 back · 0 forward

See the full prosecution history — every USPTO and applicant action on this file, in order.

Log in to unlock

Term & fees

See the term timeline — pendency span, in-force span, the maintenance fees paid and both computed expiry dates.

Log in to unlock

Priority chain

1 priority documents

›Priority documents — 1

Type	Document	Date
related publication	US 20120163496 A1	28 Jun 2012

Validity challenges

See the validity challenges on record — reexaminations, IPRs and PGRs, with their institution decisions and outcomes.

Log in to unlock

Citations

See every patent this one cites and every patent that cites it back — publication, assignee, and how each one was found.

Log in to unlock