IP Library › Granted Patent US 10,212,723
Granted Patent B2
US 10,212,723 · App. 14/524,447 · Granted Feb 19, 2019

User pairing method, device and system for realizing user scheduling

Inventors: Wei Jiang (Shenzhen, CN); Yi Wang (Shenzhen, CN)
Assignee: Huawei Technologies Co., Ltd.
H04W72/1226H04B7/0452H04J11/0079H04L5/0005H04L5/0037H04N21/6131H04W48/12
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,212,723
App. No.
14/524,447
Granted
Feb 19, 2019
Kind
B2
Abstract

Embodiments of the present invention disclose a user pairing method, a device and a system for realizing user scheduling. The method comprises: determining a first user of a time-frequency resource according to a preset resource allocation criterion; searching a preset pairing table according to a downlink channel state quantization code of the first user; and obtaining a paired downlink channel state quantization code which is paired with the downlink channel state quantization code of the first user, wherein the preset pairing table includes a pairing relationship among the downlink channel state quantization codes obtained by pre-calculating; identifying a paired user of the first user from users to be paired, wherein a downlink channel state quantization code of the paired user is the same as the paired downlink channel state quantization code. Through adopting of the present invention, complexity of real-time calculation of pairing during user scheduling can be lowered.

Claims (67)

1. A user pairing method for realizing user scheduling, the method comprising:

determining according to a preset resource allocation criterion, a first user of a time-frequency resource;

obtaining downlink channel state information of both of the first user and one or more other users to be paired, wherein the downlink channel state information (a) is received from terminals or directly obtained by estimating user channel reciprocity and (b) is a downlink space vector used for representing a state of a downlink channel;

searching, according to a preset quantization criterion, quantization codes matching the downlink channel state information from a table of preset quantization codes obtained by sampling the downlink channel state information, the searching including;

a) sequentially calculating according to a first quantization formula

ρ

k

=

w

H

⁢

c

k

w

⁢

c

k

,

 a correlation between the downlink space vector and each quantization code in the table and

b) identifying a quantization code with a highest correlation as a downlink channel state quantization code corresponding to a downlink space vector, wherein ρ k represents a correlation between the downlink space vector and a k th quantization code in the table, w represents the downlink space vector, w H represents a conjugate transpose of w, and c k represents the k th quantization code in the table;

identifying the matched quantization codes as downlink channel state quantization codes corresponding to the downlink channel state information;

searching, according to a downlink channel state quantization code of the first user, a preset pairing table to obtain a paired downlink channel state quantization code which is paired with the downlink channel state quantization code of the first user, wherein the preset pairing table includes a pairing relationship among downlink channel state quantization codes obtained by pre-calculating; and

determining a paired user of the first user from at least one user to be paired, wherein a downlink channel state quantization code of the paired user is the same as the paired downlink channel state quantization code, wherein the downlink channel state quantization code is a quantization code obtained by searching the table of preset quantization codes according to a preset quantization criterion.

2. The method of claim 1 , wherein determining the paired user from the at least one user to be paired comprises:

selecting pairable users from the users to be paired, wherein downlink channel state quantization codes of the pairable users are the same as the paired downlink channel state quantization code; and

identifying a pairable user with a highest priority as the paired user.

3. A user pairing device for realizing user scheduling, the device comprising:

a non-transitory storage medium configured to store program instructions;

a processor configured to execute the program instructions, so as to provide the following:

determine, according to a preset resource allocation criterion, a first user of a time-frequency resource;

search, according to a downlink channel state quantization code of the first user, a preset pairing table to obtain a paired downlink channel state quantization code which is paired with the downlink channel state quantization code of the first user, wherein the preset pairing table includes a pairing relationship among downlink channel state quantization codes obtained by pre-calculating;

determine a paired user of the first user from at least one user to be paired, wherein a downlink channel state quantization code of the paired user is the same as the paired downlink channel state quantization code;

obtain downlink channel state information of both of the first user and the at least one other user to be paired,

wherein the downlink channel state information (a) is received from terminals or directly obtained by estimating using channel reciprocity and (b) is a downlink space vector used for representing a downlink channel state;

search, according to the preset quantization criterion, quantization codes matching the downlink channel state information from the table;

identify the matched quantization codes as the downlink channel state quantization codes corresponding to the downlink channel state information;

sequentially calculate, according to a first quantization formula

ρ

k

=

w

H

⁢

c

k

w

⁢

c

k

,

 a correlation between the downlink space vector and each quantization code in the table, wherein ρ k represents a correlation between the downlink space vector and a k th quantization code in table, w represents the downlink space vector, w H represents a conjugate transpose of w, and c k represents the k th quantization code in the table; and

identify a quantization code with a highest correlation as the downlink channel state quantization code corresponding to the downlink space vector.

4. The device of claim 3 , wherein the processor is further configured to:

select pairable users from the users to be paired, wherein downlink channel state quantization codes of the pairable users are the same as the paired downlink channel state quantization codes; and

identify a pairable user with the highest priority as the paired user.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 1, 2015
From: JIANG, WEI; WANG, YI
To: HUAWEI TECHNOLOGIES CO., LTD.
Reel/Frame 035316/0101 →
Priority Claims (1)
CN 2012 1 0129072 · Apr 27, 2012 · national
Continuity (2)
Continuation PCTCN2012085235 · Nov 26, 2012
Related Publication 20150043525A1 · Feb 12, 2015
Cited By (1)
US 12,556,041