# US 2021/0083793 A1 · Message and rate based user grouping in non-orthogonal multiple access (noma) networks

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2021/0083793 A1
- Document ID: US20210083793A1
- Status: Published application
- Kind: A1
- Application number: 16/066,491
- Filed: 2018-04-06
- Published: 2021-03-18
- Earliest claimed: 2018-04-06
- Assignees: Telefonaktiebolaget LM Ericsson (publ)
- Applicants: Telefonaktiebolaget LM Ericsson (publ)
- Inventors: Behrooz MAKKI; Ali BEHRAVAN; Mona HASHEMI
- Web page: https://patentgrep.com/patent/US20210083793A1

## CPC

- H04J 11/0023: {Interference mitigation or co-ordination (direct sequence spread spectrum [DSSS] systems H04B1/7097; frequency hopping H04B1/713; allocation criteria for ingress interference avoidance H04L5/0062; frequency allocation criteria for requirements on out-of-channel emissions H04L5/0066; arrangements for removing intersymbol interference or baseband equalisers H04L25/03006; peak power aspects in multicarrier modulation H04L27/2614; power management H04W52/00; traffic scheduling H04W72/54, H04W72/541)}
- H04J 99/00: Subject matter not provided for in other groups of this subclass
- H04B 17/309: Measuring or estimating channel quality parameters
- H04W 72/542: using measured or perceived quality
- H04J: MULTIPLEX COMMUNICATION (transmission in general H04B; peculiar to transmission of digital information H04L5/00; systems for the simultaneous or sequential transmission of more than one television signal H04N7/08; in exchanges H04Q11/00; stereophonic systems H04S)
- H04B: TRANSMISSION
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

A message and rate based UE grouping system for dense downlink NOMA systems. For example, a network node (e.g., an access point, such as a base station) determines whether a first UE and a second UE should be grouped based on a determination of whether there is overlap between a first message for the first UE and a second message for the second UE.

## Claims

### Claim 1

A method performed by a network node for scheduling at least a first user equipment, UE, and a second UE also served by the network node, the method comprising:
determining that the first UE and the second UE are candidates to be grouped together, wherein the determining comprises determining whether there is an overlap between a first message for the first UE and a second message for the second UE;
as a result of determining that the first UE and the second UE are candidates to be grouped together, estimating 1) a first channel quality of a first channel between the first UE and the network node and 2) a second channel quality of a second channel between the second UE and the network node; and
after estimating the channel qualities, determining, based on the estimated channel qualities, to use the same time and frequency resources to transmit downlink data to the first UE and the second UE.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
transmitting an indication indicating the same time and frequency resources to the first UE and the second UE; and
transmitting an index indicating the overlap between the first message and the second message to the first UE and the second UE.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
allocating a first power for transmitting downlink data to the first UE; and
allocating a second power for transmitting downlink data to the second UE.

### Claim 4 (depends on 1)

The method of claim 1, wherein determining that the first UE and the second UE are candidates to be grouped together further comprises:
calculating a probability value; and
determining whether the calculated probability value is not less than a probability threshold.

### Claim 5 (depends on 4)

The method of claim 4, wherein the first UE has a first rate demand and the second UE has a second rate demand, and wherein the probability value indicates a probability that a first achievable rate is not less than the first rate demand and a second achievable rate is not less than the second rate demand.

### Claim 6 (depends on 1)

The method of claim 1, wherein
estimating the first channel quality comprises: requesting the first UE to transmit a pilot signal and estimating the first channel quality based on the pilot signal transmitted by the first UE, and
estimating the second channel quality comprises: requesting the second UE to transmit a pilot signal and estimating the second channel quality based on the pilot signal transmitted by the second UE.

### Claim 7 (depends on 1)

The method of claim 1, wherein the step of determining, based on the estimated channel qualities, to use the same time and frequency resources to transmit downlink data to the first UE and the second UE comprises:
obtaining information indicating the first rate demand;
obtaining information indicating the second rate demand;
based on the estimated first channel quality, determining a first channel gain for the first UE;
based on the estimated second channel quality, determining a second channel gain for the second UE; and
using the first rate demand, the second rate demand, the first channel gain, and the second channel gain to determine whether to use the same time and frequency resources to transmit downlink data to the first UE and the second UE.

### Claim 8 (depends on 1)

The method of claim 1, wherein the step of determining, based on the estimated channel qualities, to use the same time and frequency resources to transmit downlink data to the first UE and the second UE comprises:
for a first decoding scheme, obtaining a first set of data points, each data point included in the first set of data points identifying a maximum achievable rate for the first UE and a maximum achievable rate for the second UE;
obtaining information indicating the first rate demand;
obtaining information indicating the second rate demand; and
using the first set of data points, the first rate demand, and the second rate demand to determine whether to use the same time and frequency resources to transmit downlink data to the first UE and the second UE.

### Claim 9 (depends on 8)

The method of claim 8, wherein using the set of data points, the first rate demand, and the second rate demand to determine whether to use the same time and frequency resources to transmit downlink data to the first UE and the second UE comprises:
selecting a data point from the set of data points, wherein selected data points identifies a maximum achievable rate for the first UE that is equal to the rate demand for the first UE; and
determining whether the maximum achievable rate for the second UE identified by the selected data point is greater than or equal to the rate demand for the second UE.

### Claim 10 (depends on 8)

The method of claim 8, wherein using the set of data points, the first rate demand, and the second rate demand to determine whether to use the same time and frequency resources to transmit downlink data to the first UE and the second UE comprises:
selecting a data point from the set of data points, wherein selected data points identifies a maximum achievable rate for the second UE that is equal to the rate demand for the second UE; and
determining whether the maximum achievable rate for the first UE identified by the selected data point is greater than or equal to the rate demand for the first UE.

### Claim 11

A network node, the network node being adapted to:
determine that a first UE and a second UE are candidates to be grouped together, wherein the determining comprises determining whether there is an overlap between a first message for the first UE and a second message for the second UE;
as a result of determining that the first UE and the second UE are candidates to be grouped together, estimate 1) a first channel quality of a first channel between the first UE and the network node and 2) a second channel quality of a second channel between the second UE and the network node; and
after estimating the channel qualities, determine, based on the estimated channel qualities, to use the same time and frequency resources to transmit downlink data to the first UE and the second UE.

### Claim 12 (depends on 11)

The network node of claim 11, the network node being further adapted to:
transmit an indication indicating the same time and frequency resources to the first UE and the second UE; and
transmit an index indicating the overlap between the first message and the second message to the first UE and the second UE.

### Claim 13 (depends on 11)

The network node of claim 11, the network node being further adapted to:
allocate a first power for transmitting downlink data to the first UE; and
allocate a second power for transmitting downlink data to the second UE.

### Claim 14 (depends on 11)

The network node of claim 11, the network node being further adapted to:
calculate a probability value; and
determine whether the calculated probability value is not less than a probability threshold.

### Claim 15 (depends on 14)

The network node of claim 14, wherein the first UE has a first rate demand and the second UE has a second rate demand, and wherein the probability value indicates a probability that a first achievable rate is not less than the first rate demand and a second achievable rate is not less than the second rate demand.

### Claim 16 (depends on 11)

The network node of claim 11, wherein
estimating the first channel quality comprises: the network node being further adapted to request the first UE to transmit a pilot signal and estimating the first channel quality based on the pilot signal transmitted by the first UE, and
estimating the second channel quality comprises: the network node being further adapted to request the second UE to transmit a pilot signal and estimating the second channel quality based on the pilot signal transmitted by the second UE.

### Claim 17 (depends on 11)

The network node of claim 11, wherein the step of determining, based on the estimated channel qualities, to use the same time and frequency resources to transmit downlink data to the first UE and the second UE comprises the network node being further adapted to:
obtain information indicating the first rate demand;
obtain information indicating the second rate demand;
based on the estimated first channel quality, determine a first channel gain for the first UE;
based on the estimated second channel quality, determine a second channel gain for the second UE; and
use the first rate demand, the second rate demand, the first channel gain, and the second channel gain to determine whether to use the same time and frequency resources to transmit downlink data to the first UE and the second UE.

### Claim 18 (depends on 11)

The network node of claim 11, wherein the step of determining, based on the estimated channel qualities, to use the same time and frequency resources to transmit downlink data to the first UE and the second UE comprises the network node being further adapted to:
for a first decoding scheme, obtain a first set of data points, each data point included in the first set of data points identifying a maximum achievable rate for the first UE and a maximum achievable rate for the second UE;
obtain information indicating the first rate demand;
obtain information indicating the second rate demand; and
use the first set of data points, the first rate demand, and the second rate demand to determine whether to use the same time and frequency resources to transmit downlink data to the first UE and the second UE.

### Claim 19 (depends on 18)

The network node of claim 18, wherein using the set of data points, the first rate demand, and the second rate demand to determine whether to use the same time and frequency resources to transmit downlink data to the first UE and the second UE comprises the network node being further adapted to:
select a data point from the set of data points, wherein selected data points identifies a maximum achievable rate for the first UE that is equal to the rate demand for the first UE; and
determine whether the maximum achievable rate for the second UE identified by the selected data point is greater than or equal to the rate demand for the second UE.

### Claim 20 (depends on 18)

The network node of claim 18, wherein using the set of data points, the first rate demand, and the second rate demand to determine whether to use the same time and frequency resources to transmit downlink data to the first UE and the second UE comprises the network node being further adapted to:
select a data point from the set of data points, wherein selected data points identifies a maximum achievable rate for the second UE that is equal to the rate demand for the second UE; and
determine whether the maximum achievable rate for the first UE identified by the selected data point is greater than or equal to the rate demand for the first UE.

### Claim 21

A network node, the network node comprising:
a first determination unit for determining that the first UE and the second UE are candidates to be grouped together, wherein the determining comprises determining whether there is an overlap between a first message for the first UE and a second message for the second UE;
an estimation unit for, as a result of determining that the first UE and the second UE are candidates to be grouped together, estimating 1) a first channel quality of a first channel between the first UE and the network node and 2) a second channel quality of a second channel between the second UE and the network node; and
a second determination unit for, after estimating the channel qualities, determining, based on the estimated channel qualities, to use the same time and frequency resources to transmit downlink data to the first UE and the second UE.

### Claim 22 (depends on 1)

A computer program product comprising a non-transitory computer readable medium storing a computer program comprising instructions which, when executed by processing circuity, causes the processing circuitry to carry out the method of claim 1.

### Claim 23

(canceled)
