SYSTEMS AND METHODS FOR ASSIGNING PHYSICAL RESOURCE BLOCKS

• US 20090073926A1
• Filed: 09/19/2007
• Published: 03/19/2009
• Est. Priority Date: 09/19/2007
• Status: Active Grant

• Current Assignee: Sharp Kabushiki Kaisha (Hon Hai Precision Industry Co., Ltd.)
• Original Assignee: Sharp Laboratories of America Incorporated (Hon Hai Precision Industry Co., Ltd.)
• Inventors: Xu, Shugong, Lee, Suk-Bok
• Granted Patent: US 7,869,403 B2
• Time in Patent Office: Days
• US Class Current: 370/329
• CPC Class Codes: H04W 72/04 Wireless resource allocation
• CPC Class Codes: H04W 72/535 based on resource usage policies

Abstract

A method for assigning physical resource blocks (PRBs) is described. A first PRB is assigned to a first device from a plurality of devices. The first device maximizes a proportional fair algorithm on the first PRB. A second PRB is assigned to a second device from the plurality of devices. The second device maximizes a proportional fair algorithm on the second PRB. A determination is made whether a higher throughput would occur if the first PRB is assigned to the second device and the second PRB is assigned to the first device. The assignment of the first PRB is exchanged with the assignment of the second PRB if a higher throughput would occur.

Claims

1. A method for assigning physical resource blocks (PRBs), comprising:

assigning a first PRB to a first device from a plurality of devices, wherein the first device maximizes a proportional fair algorithm on the first PRB;

assigning a second PRB to a second device from the plurality of devices, wherein the second device maximizes a proportional fair algorithm on the second PRB;

determining whether a higher throughput would occur if the first PRB is assigned to the second device and the second PRB is assigned to the first device; and

if a higher throughput would occur;

exchanging the assignment of the first PRB with the assignment of the second PRB.

2. The method of claim 1, wherein a base station assigns the physical resource blocks to communication devices.

3. The method of claim 1, further comprising determining whether M PRBs are assigned to N devices.

4. The method of claim 3, further comprising performing iterations until M PRBs are assigned to N devices.

5. The method of claim 1, further comprising assigning a PRB to a certain device according to the queue size of said certain device.

6. The method of claim 1, further comprising maintaining the initial assignments of the PRBs if a higher throughput would not occur by exchanging the assignments of the PRBs.

7. The method of claim 1, further comprising implementing the exchange of PRB assignments in downlink scheduling in Orthogonal Frequency Divisional Multiple Access (OFDM) communication systems.

8. The method of claim 1, further comprising implementing the exchange of PRB assignments in uplink scheduling in OFDM communication systems.

9. The method of claim 1, wherein the proportional fair algorithm is expressed as

$\hat{i}=\arg $



max i 

min 

{ r i , c 

( t ) , Q i c 

( t ) } R i 

( t ) .

10. A base station that is configured to assign physical resource blocks (PRBs), the base station comprising:

a processor;

memory in electronic communication with the processor;

instructions stored in the memory, the instructions being executable to;

assign a first PRB to a first device from a plurality of devices, wherein the first device maximizes a proportional fair algorithm on the first PRB;

assign a second PRB to a second device from the plurality of devices, wherein the second device maximizes a proportional fair algorithm on the second PRB;

determine whether a higher throughput would occur if the first PRB is assigned to the second device and the second PRB is assigned to the first device; and

if a higher throughput would occur;

exchange the assignment of the first PRB with the assignment of the second PRB.

11. The base station of claim 10, wherein the base station is an Evolved NodeB base station.

12. The base station of claim 10, wherein the instructions are further executable to determine whether M PRBs are assigned to N devices.

13. The base station of claim 12, wherein the instructions are further executable to perform iterations until M PRBs are assigned to N devices.

14. The base station of claim 10, wherein the instructions are further executable to assign a PRB to a certain device according to the queue size of said certain device.

15. The base station of claim 10, wherein the instructions are further executable to maintain the initial assignments of the PRBs if a higher throughput would not occur by exchanging the assignments of the PRBs.

16. The base station of claim 10, wherein the instructions are further executable to implement the exchange of PRB assignments in downlink scheduling in Orthogonal Frequency Divisional Multiple Access (OFDM) communication systems.

17. The base station of claim 10, wherein the instructions are further executable to implement the exchange of PRB assignments in uplink scheduling in OFDM communication systems.

18. The base station of claim 10, wherein the proportional fair algorithm is expressed as

$\hat{i}=\arg $



max i 

min 

{ r i , c 

( t ) , Q i c 

( t ) } R i 

( t ) .

19. A computer-readable medium comprising executable instructions for:

assigning a first PRB to a first device from a plurality of devices, wherein the first device maximizes a proportional fair algorithm on the first PRB;

assigning a second PRB to a second device from the plurality of devices, wherein the second device maximizes a proportional fair algorithm on the second PRB;

determining whether a higher throughput would occur if the first PRB is assigned to the second device and the second PRB is assigned to the first device; and

if a higher throughput would occur;

exchanging the assignment of the first PRB with the assignment of the second PRB.

20. The computer-readable medium of claim 19, wherein a base station assigns the physical resource blocks to communication devices.

21. The computer-readable medium of claim 19, wherein the instructions are further executable to determine whether M PRBs are assigned to N devices.

22. The computer-readable medium of claim 21, wherein the instructions are further executable to perform iterations until M PRBs are assigned to N devices.