# US 2021/0345299 A1 · Signaling of quasi-co-location information in wireless systems

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

- Number: US 2021/0345299 A1
- Document ID: US20210345299A1
- Status: Published application
- Kind: A1
- Application number: 17/372,937
- Filed: 2021-07-12
- Published: 2021-11-04
- Earliest claimed: 2019-01-10
- Assignees: Zte Corporation
- Applicants: ZTE Corporation
- Inventors: Bo GAO; Zhaohua LU; Yu Ngok LI; Yijian CHEN; Chuangxin JIANG; Hao WU
- Web page: https://patentgrep.com/patent/US20210345299A1

## CPC

- H04B 7/06968: {using quasi-colocation [QCL] between signals}
- H04L 5/0048: {Allocation of pilot signals, i.e. of signals known to the receiver (allocation of control signalling H04L5/0053; use of control signalling H04L5/0091)}
- H04W 16/28: using beam steering
- H04W 72/02: Selection of wireless resources by user or terminal
- H04W 72/046: {the resource being in the space domain, e.g. beams}
- H04W 80/02: Data link layer protocols
- Y02D 30/70: in wireless communication networks
- H04B: TRANSMISSION
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- Y02D: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE

## Abstract

Methods, systems, and devices for signaling quasi-co-location information in mobile communication technology are described. An exemplary method for wireless communication includes transmitting, from a first communication node and to a second communication node, a signal according to a beam set that comprises a first subset of B beams selected from a pool of beams, wherein B is positive integer. In an example, a beam of the beam set comprises one or more channel property assumptions, one or more reference signals (RSs), one or more RS sets, one or more spatial relation states, one or more quasi-co-location (QCL) states, one or more transmission configuration indicator (TCI) state, one or more spatial domain filters or one or more pre-coding filters.

## Claims

### Claim 1

A method for wireless communication, comprising:
transmitting, from a first communication node and to a second communication node, a signal according to a beam set,
wherein the beam set comprises a first subset of B beams, wherein each of the first subset is selected from a pool of beams, and wherein B is positive integer.

### Claim 2

A method for wireless communication, comprising:
receiving, by a first communication node and from a second communication node, a signal according to a beam set,
wherein the beam set comprises a first subset of B beams, wherein each of the first subset is selected from a pool of beams, and wherein B is positive integer.

### Claim 3 (depends on 1, 2)

The method of claim 1 or 2, wherein a beam of the beam set comprises one or more channel property assumptions, one or more reference signals (RSs), one or more RS sets, one or more spatial relation states, one or more quasi-co-location (QCL) states, one or more transmission configuration indicator (TCI) states, one or more spatial domain filters or one or more pre-coding filters.

### Claim 4 (depends on 1, 2)

The method of claim 1 or 2, further comprising:
selecting, based on a bitmap, a second subset of beams from the pool of beams; and
combining one or more of the second subset of beams to generate the first subset of B beams.

### Claim 5 (depends on 1, 2)

The method of claim 1 or 2, further comprising:
selecting, based on a bitmap, a second subset of beams from the pool of beams; and
combining the one or more of the second subset of beams and the first subset of B beams to generate the beam set.

### Claim 6 (depends on 4, 5)

The method of claim 4 or 5, further comprising:
determining a QCL assumption of a CSI-RS resource for tracking according to the one or more beams from the second subset of beams.

### Claim 7 (depends on 4, 5)

The method of claim 4 or 5, wherein the selecting and combining are based on a medium access control (MAC) control element (CE) command.

### Claim 8 (depends on 7)

The method of claim 7, wherein one or more fields related to the combining are determined based on values of flag fields in the MAC CE command.

### Claim 9 (depends on 4, 5)

The method of claim 4 or 5, wherein the selecting is based on a first medium access control (MAC) control element (CE) command, wherein the combining is based on a second MAC CE command different from the first MAC CE command, and wherein the second MAC CE command is based on the one or more of the second subset of beams selected by the first MAC CE command.

### Claim 10 (depends on 4)

The method of claim 4, wherein one codepoint of a command related to the combining is reserved as blank or not associated with any one beam of the one or more of the second subset of beams.

### Claim 11 (depends on 5)

The method of claim 5, wherein one codepoint of a command related to the combining is reserved as blank or not associated with any one beam of the one or more of the second subset of beams or any one beam of the pool of beams.

### Claim 12 (depends on 1, 2)

The method of claim 1 or 2, wherein each beam of the beam set is selected from a pool of beams based on an explicit identification of the each beam.

### Claim 13 (depends on 1, 2)

The method of claim 1 or 2, wherein the beam set comprises M beams, wherein one beam of the beam set is associated with E respective resource elements of the signal in order, wherein the signal comprises E×M resource elements, and wherein E and M are positive integers.

### Claim 14 (depends on 1, 2)

The method of claim 1 or 2, wherein the beam set comprises M beams, wherein resource elements of the signal are grouped into S sets that are associated with the beam set, and wherein S and M are positive integers.

### Claim 15 (depends on 14)

The method of claim 14, wherein one or more beams associated with a j-th set of the S sets are determined according to at least one or more of j, M and S.

### Claim 16 (depends on 15)

The method of claim 15, wherein the j-th set of the S sets is associated with a floor(j/N×M)-th beam of the beam set, and wherein floor(x) is a function that returns a greatest integer that is less than a real number x.

### Claim 17 (depends on 15)

The method of claim 15, wherein the j-th set of the S sets is associated with a (j % M)-th beam of the beam set, and wherein % is a modulo function.

### Claim 18 (depends on 14)

The method of claim 14, wherein one beam of the beam set is associated with E respective sets of the S sets in order, wherein the S is equal to E×M, and wherein E is positive integer.

### Claim 19 (depends on 1, 2)

The method of claim 1 or 2, wherein the beam set comprises M beams, wherein the beam set is associated with N resource elements of the signal, and wherein M and N are positive integers.

### Claim 20 (depends on 19)

The method of claim 19, wherein one or more beams associated with a j-th resource element of the N resource elements are determined according to at least one or more of j, M and N.

### Claim 21 (depends on 19)

The method of claim 19, wherein the j-th resource element of the N resource elements is associated with a floor(j/N×M)-th beam of the beam set, and wherein floor(x) is a function that returns a greatest integer that is less than a real number x.

### Claim 22 (depends on 19)

The method of claim 19, wherein the j-th resource element of the N resource elements is associated with a (j % M)-th beam of the beam set, and wherein % is a modulo function.

### Claim 23 (depends on 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22)

The method of any of claims 1 to 22, wherein the signal is a control resource set (CORESET), a physical downlink shared channel (PDSCH), a physical downlink control channel (PDCCH), a physical uplink shared channel (PUSCH) or a physical uplink control channel (PUCCH).

### Claim 24 (depends on 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22)

The method of any of claims 1 to 22, wherein a resource element of the signal is a transmission occasion, a reference signal (RS) port, an RS port group, an RS resource, an RS resource set, a search space, a time unit, or a frequency resource.

### Claim 25 (depends on 1, 2)

The method of claim 1 or 2, wherein the beam set is determined based on a physical downlink control channel (PDCCH) scheduling the signal, a control resource set (CORESET) scheduling the signal, an index of at least one time unit of the signal, an index of at least one resource element of the signal, or an index of demodulation reference signal (DMRS) port group.

### Claim 26 (depends on 2)

The method of claim 2, further comprising:
performing a recovery or monitoring process according to one or more CORESETs, wherein each of the one or more CORESETs is associated with its corresponding beam set.

### Claim 27 (depends on 26)

The method of claim 26, wherein performing the recovery or monitoring process comprises:
measuring a radio link quality according to one beam of the beam set, wherein the one beam comprises a highest index or the one beam comprises a lowest index or the one beam is a primary entry of the beam set.

### Claim 28 (depends on 26)

The method of claim 26, wherein performing the recovery or monitoring process comprises:
measuring a radio link quality according to each beam of one or more beam sets of the one or more CORESETs.

### Claim 29 (depends on 26)

The method of claim 26, wherein performing the recovery or monitoring process comprises:
measuring a radio link quality according to one or more beams of beam sets of the one or more CORESETs and maximum number of beams to be measured.

### Claim 30

The method of 29, wherein, per CORESET, only one beam with a lowest or highest beam ID is selected for determining a radio link quality, wherein the lowest or highest beam ID is a local ID in the associated CORESET or an ID in the pool of beams.

### Claim 31 (depends on 29)

The method of claim 29, wherein one CORESET with a lower or higher CORESET ID has higher priority.

### Claim 32 (depends on 29)

The method of claim 29, wherein one CORESET with a search space with a shorter periodicity has higher priority.

### Claim 33 (depends on 2)

The method of claim 2, wherein performing a PDSCH reception with a scheduling offset less than a threshold is according to at least one beam of one CORESET with a configured TCI state with a monitored search space set in a latest slot.

### Claim 34 (depends on 2)

The method of claim 2, wherein performing a PDSCH reception with a scheduling offset less than a threshold is according to at least one beam of one CORESET configured with a common search space to be monitored in a latest slot.

### Claim 35 (depends on 2)

The method of claim 2, wherein performing a PDSCH reception with a scheduling offset less than a threshold is according to at least one beam of one CORESET configured with a UE specific search space to be monitored in a latest slot.

### Claim 36 (depends on 2)

The method of claim 2, wherein performing a PDSCH reception with a scheduling offset less than a threshold is according to at least one beam of one CORESET, and wherein the performing is determined based on at least one of the following rules:
(i) a CORESET with a TCI state is prioritized over another CORESET without a configured TCI state,
(ii) a CORESET excluding CORESET #0 is prioritized over CORESET #0,
(iii) a CORESET with a common search space set is prioritized over another CORESET with a UE specific search space, or
(iv) a CORESET with a UE specific search space set is prioritized over another CORESET with a common search space.

### Claim 37 (depends on 1)

The method of claim 1, wherein performing a PUSCH transmission is according to one or more beams of the beam set of a PUCCH resource.

### Claim 38 (depends on 37)

The method of claim 37, wherein the PUCCH resource comprises a lowest or a highest resource ID within a bandwidth part (BWP) or a cell.

### Claim 39 (depends on 38)

The method of claim 38, wherein the PUCCH resource is from a PUCCH resource set that is associated with one CORESET group or one resource element group.

### Claim 40 (depends on 37)

The method of claim 37, wherein the PUSCH transmission is scheduled by one DCI format 1_0.

### Claim 41 (depends on 40)

The method of claim 40, wherein the PUCCH resource is associated with the DCI format 1_0 or associated with one search space or CORESET of the DCI format 1_0.

### Claim 42 (depends on 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33)

The method of any of claims 1 to 33, wherein the pool of beams is configured using radio resource control (RRC) messages.

### Claim 43 (depends on 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33)

The method of any of claims 1 to 33, wherein the pool of beams is based on one or more resource signal (RS) resources or RS resource sets.

### Claim 44 (depends on 43)

The method of claim 43, wherein the one or more RS resource sets comprises a sounding reference signal (SRS) resource set.

### Claim 45 (depends on 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44)

The method of any of claims 1 to 44, wherein the first communication node is a wireless device, and wherein the second communication node is a network node.

### Claim 46 (depends on 2)

The method of claim 2, wherein performing a PDSCH transmission with a scheduling offset less than a threshold is according to at least one beam of one CORESET with a configured TCI state with a monitored search space set in a latest slot.

### Claim 47 (depends on 1, 2, 3, 4, 13, 46)

The method of any of claim 1, 2, 3, 4, 13 or 46, wherein the first communication node is a network node, and wherein the second communication node is a wireless device.

### Claim 48 (depends on 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47)

A wireless communications apparatus comprising a processor and a memory, wherein the processor is configured to read code from the memory and implement a method recited in any of claims 1 to 47.

### Claim 49 (depends on 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47)

A computer program product comprising a computer-readable program medium code stored thereupon, the code, when executed by a processor, causing the processor to implement a method recited in any of claims 1 to 47.
