Legal claims defining the scope of protection, as filed with the USPTO.
1. A method comprising: populating a burst frame having an uplink sub-frame and a downlink sub-frame with at least a plurality of block pairs, each block pair including an uplink block and a down link block, populating the burst frame including: identifying a largest block pair, appending one of the uplink block and the downlink block of the largest block pair to a sub-frame string, and appending the other of the uplink block and the downlink block to a diagonally opposed sub-frame string; appending one of an unscheduled uplink block and an unscheduled downlink block of an unscheduled block pair to a shortest sub-frame string; appending the other of the unscheduled uplink block and unscheduled downlink block of the unscheduled block pair to a sub-frame string diagonally opposed to the shortest sub-frame string, and determining if a conflict exists between the unscheduled uplink block and the unscheduled downlink block.
2. The method of claim 1 wherein determining if a conflict exists includes determining if the unscheduled uplink block and the unscheduled downlink block of the unscheduled block pair at least partially overlap in the burst frame.
3. The method of claim 1 , further including, if a conflict exists, resolving the conflict and scheduling a next unscheduled block pair of the plurality of block pairs, wherein resolving the conflict includes inserting a corresponding one of the unscheduled uplink block and the unscheduled downlink block at a beginning of the sub-frame string diagonally opposed to the shortest sub-frame string, with the sub-frame string diagonally opposed to the shortest sub-frame string appended to the inserted corresponding one of the unscheduled uplink block and the unscheduled downlink block, and appending the other of the unscheduled uplink block and the unscheduled downlink block to the shortest sub-frame string.
4. The method of claim 1 , further comprising scheduling an unpaired uplink block or an unpaired downlink block after scheduling the plurality of block pairs.
5. The method of claim 1 , further including determining the combined length of the uplink block and the downlink block of each of the plurality of block pairs.
6. The method of claim 5 , wherein determining the combined length of the uplink block and the downlink block of each of the plurality of block pairs includes arranging the plurality of block pairs according to the combined length.
7. A computer program product residing on a non-transitory computer readable storage medium having a plurality of instructions stored thereon that, when executed by a processor, cause the processor to perform operations comprising: populating a burst frame having an uplink sub-frame and a downlink sub-frame with at least a plurality of block pairs, each block pair including an uplink block and a downlink block, populating the burst frame including: identifying a largest unscheduled block pair, appending one of the uplink block and the downlink block of the identified block pair to a shortest sub-frame string, and appending the other of the uplink block and the downlink block to a diagonally opposed sub-frame string; and determining if a conflict exists between the uplink block and the downlink block for each scheduled block pair.
8. The computer program product of claim 7 , wherein the instructions for determining if a conflict exists include instructions for determining if the uplink block and the downlink block of one of the plurality of block pairs at least partially overlap in the burst frame.
9. The computer program product of claim 7 , further including instructions for, if a conflict exists, resolving the conflict and scheduling a next largest block pair of the plurality block pairs, the instructions for resolving the conflict including instructions for inserting a corresponding one of the uplink block and the downlink block at the beginning of the diagonally opposed sub-frame string, with the diagonally opposed sub-frame string appended thereto, and appending the other of the uplink block and the downlink block to the shortest sub-frame string.
10. The computer program product of claim 7 , further comprising instructions for scheduling an unpaired uplink block or an unpaired downlink block after scheduling the plurality of block pairs.
11. The computer program product of claim 7 , further comprising instructions for determining the combined length of the uplink block and the downlink block of each of a plurality of block pairs.
12. The computer program product of claim 11 , wherein the instructions for determining the combined length of the uplink block and the downlink block of each of the plurality of block pairs includes instructions for arranging the block pairs according to the combined length.
13. A wireless system comprising: a wireless base station and at least one wireless subscriber station, the wireless base station and the at least one wireless subscriber station communicating with one another using a half-duplex frequency division duplex communication scheme; a burst scheduling module for scheduling uplink and downlink bursts, the burst scheduling module configured to: populate a burst frame having an uplink sub-frame and a downlink sub-frame with at least a plurality of block pairs, each block pair including an uplink block and a downlink block, populating the burst frame including: identifying a largest unscheduled block pair, appending one of the uplink block and the downlink block of the identified block pair to a shortest sub-frame string, and appending the other of the uplink block and the downlink block to a diagonally opposed sub-frame string; and determine if a conflict exists between the uplink block and the downlink block for each scheduled block pair.
14. The wireless system of claim 13 , wherein the scheduling module configured to determine if a conflict exists, is further configured to determine if the uplink block and the downlink block of one of the plurality of block pairs at least partially overlap in the burst frame.
15. The wireless system of claim 14 , wherein the scheduling module is further configured to, if a conflict exists, resolve the conflict and schedule a next largest block pair of the plurality of block pairs, wherein, to resolve the conflict, the scheduling module is configured to insert a corresponding one of the uplink block and downlink block at the beginning of the diagonally opposed sub-frame string, with the diagonally opposed sub-frame string appended thereto, and append the other of the uplink block and the downlink block to the shortest sub-frame string.
16. The wireless system of claim 13 , wherein the scheduling module is further configured to schedule an unpaired uplink block or an unpaired downlink block after scheduling the plurality of block pairs.
17. The wireless system of claim 13 , wherein the burst scheduling module is further configured to determine the combined length of the uplink block and the downlink block of each of the plurality of block pairs.
18. The wireless system of claim 17 , wherein the scheduling module configured to determine the combined length of the uplink block and the downlink block of each of the plurality of block pairs is further configured to arrange the plurality of block pairs according to the combined length.
19. The wireless system of claim 13 , wherein the scheduling module is associated with the wireless base station.
20. The wireless system of claim 19 , wherein the scheduling module includes a computer program residing on a computer readable medium associated with the wireless base station.
Unknown
March 23, 2010
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.