Scheduling multi-user MIMO transmissions in fixed wireless access systems

US11489559B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-11489559-B2
Application numberUS-201916979020-A
CountryUS
Kind codeB2
Filing dateMar 8, 2019
Priority dateMar 8, 2018
Publication dateNov 1, 2022
Grant dateNov 1, 2022

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Described are devices, systems and methods for scheduling multi-user (MU) multiple input multiple output (MIMO) transmissions in a fixed wireless access (FWA) system. One method for scheduling a large number of user devices in a wireless communication system includes a preselection process to pare down the number of user devices to be simultaneously scheduled, and then scheduling that subset of users. In an example, and assuming each user device communicates over a corresponding wireless channel, the preselection process includes determining a number of sets based on a first characteristic of the wireless channels, where each set includes at least one user device, and then determining a subset of user devices by selecting at most one user device from each of the sets. The scheduling of the selected subset of users is based on a scheduling algorithm and a second characteristic of the wireless channels.

First claim

Opening claim text (preview).

What is claimed are techniques and structures as described and shown, including: 1. A method for scheduling a plurality of user devices in a fixed wireless access (FWA) system characterized by a temporal Rice factor being greater than a threshold, each of the plurality of user devices communicating over a corresponding channel of a plurality of wireless channels, the method comprising: determining a plurality of sets based on a first characteristic of the plurality of wireless channels, wherein each of the plurality of sets comprises at least one of the plurality of user devices, and wherein the first characteristic comprises a time-invariant part of each of the plurality of wireless channels; determining a subset of user devices by selecting at most one user device from each of the plurality of sets; and scheduling simultaneous transmissions by each of the subset of user devices based on a scheduling algorithm and a second characteristic of the plurality of wireless channels, wherein the second characteristic comprises both the time-invariant part and a time-varying part of the plurality of wireless channels, and wherein the temporal Rice factor is based on a ratio of the time-invariant part of the corresponding channel to the time-varying part of the corresponding channel. 2. The method of claim 1 , further comprising: assigning a modulation and coding scheme to each of the subset of user devices based on the second characteristic. 3. The method of claim 1 , wherein each of the plurality of wireless channels is characterized by a corresponding one of a plurality of capacities, and wherein the scheduling algorithm comprises: determining a utility function based on a sum of a plurality of products, wherein each of the plurality of products is a result of a multiplication of one of a plurality of weights and a corresponding one of the plurality of capacities; and maximizing the utility function based on an optimization algorithm. 4. The method of claim 3 , wherein the optimization algorithm is a greedy scheduling algorithm with zero-forcing dirty paper coding. 5. The method of claim 3 , wherein the optimization algorithm is an iterative water-filling algorithm. 6. The method of claim 3 , wherein each of the plurality of weights is based on a backlog and deadlines of packets that are scheduled by the corresponding one of the plurality of user devices. 7. The method of claim 1 , wherein the threshold is 20 dB. 8. A device for scheduling a plurality of user devices in a fixed wireless access (FWA) system characterized by a temporal Rice factor being greater than a threshold, each of the plurality of user devices communicating over a corresponding channel of a plurality of wireless channels, the device comprising: a processor configured to: determine a plurality of sets based on a first characteristic of the plurality of wireless channels, wherein each of the plurality of sets comprises at least one of the plurality of user devices, and wherein the first characteristic comprises a time-invariant part of each of the plurality of wireless channels; determine a subset of user devices by selecting at most one user device from each of the plurality of sets; and schedule simultaneous transmissions by each of the subset of user devices based on a scheduling algorithm and a second characteristic of the plurality of wireless channels, wherein the second characteristic comprises both a time-invariant and a time-varying part of the plurality of wireless channels, and wherein the temporal Rice factor is based on a ratio of the time-invariant part of the corresponding channel to the time-varying part of the corresponding channel. 9. The device of claim 8 , wherein the processor is further configured to: assign a modulation and coding scheme to each of the subset of user devices based on the second characteristic. 10. The device of claim 8 , wherein each of the plurality of wireless channels is characterized by a corresponding one of a plurality of capacities, and wherein the processor is further configured, as part of the scheduling algorithm, to: determine a utility function based on a sum of a plurality of products, wherein each of the plurality of products is a result of a multiplication of one of a plurality of weights and a corresponding one of the plurality of capacities; and maximize the utility function based on an optimization algorithm. 11. The device of claim 10 , wherein the optimization algorithm is a greedy scheduling algorithm with zero-forcing dirty paper coding. 12. The device of claim 10 , wherein the optimization algorithm is an iterative water-filling algorithm. 13. The device of claim 10 , wherein each of the plurality of weights is based on a backlog and deadlines of packets that are scheduled by the corresponding one of the plurality of user devices. 14. The device of claim 8 , wherein the threshold is 20 dB. 15. A device for scheduling a plurality of user devices in a fixed wireless access (FWA) system characterized by a temporal Rice factor being greater than a threshold, each of the plurality of user devices communicating over a corresponding channel of a plurality of wireless channels, the device comprising: a processor configured to: determine a plurality of sets based on a time-invariant part of the plurality of wireless channels, wherein each of the plurality of sets comprises at least one of the plurality of user devices; determine a subset of user devices by selecting at most one user device from each of the plurality of sets; and schedule simultaneous multiple input multiple output (MIMO) transmissions by each of the subset of user devices based on a scheduling algorithm and both the time-invariant part and a time-varying part of the plurality of wireless channels, wherein the temporal Rice factor is based on a ratio of the time-invariant part of the corresponding channel to the time-varying part of the corresponding channel. 16. The device of claim 15 , wherein each of the plurality of wireless channels is characterized by a corresponding one of a plurality of capacities, and wherein the processor is further configured, as part of the scheduling algorithm, to: determine a utility function based on a sum of a plurality of products, wherein each of the plurality of products is a result of a multiplication of one of a plurality of weights and a corresponding one of the plurality of capacities; and maximize the utility function based on an optimization algorithm. 17. The device of claim 16 , wherein the optimization algorithm is a greedy scheduling algorithm with zero-forcing dirty paper coding or an iterative water-filling algorithm. 18. The device of claim 16 , wherein each of the plurality of weights is based on a backlog and deadlines of packets that are scheduled by the corresponding one of the plurality of user devices. 19. The device of claim 15 , wherein the threshold is 20 dB.

Assignees

Inventors

Classifications

  • Avoidance of ingress interference, e.g. ham radio channels · CPC title

  • Allocation criteria · CPC title

  • utilizing "waterfilling" technique · CPC title

  • for beam forming · CPC title

  • Quality of the received signal, e.g. BER, SNR, water filling · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US11489559B2 cover?
Described are devices, systems and methods for scheduling multi-user (MU) multiple input multiple output (MIMO) transmissions in a fixed wireless access (FWA) system. One method for scheduling a large number of user devices in a wireless communication system includes a preselection process to pare down the number of user devices to be simultaneously scheduled, and then scheduling that subset of…
Who is the assignee on this patent?
Cohere Tech Inc
What technology area does this patent fall under?
Primary CPC classification H04B7/0452. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue Nov 01 2022 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 12 related publications on this page (citations in our corpus or others sharing the same primary CPC).