Granted Patent B2

US 12,652,608 · App. 18/374,644 · Granted Jun 9, 2026

Inventors: Qi Hong (Dongguan, CN); Gen Li (Dongguan, CN); Siqi Liu (Dongguan, CN)

Assignee: VIVO MOBILE COMMUNICATION CO., LTD.

H04W48/08H04L5/0051

Abstract

Claims (91)

1 . An information determination method, comprising:

acquiring third information by a terminal; and

determining, by the terminal, an actually sent Synchronization Signal and PBCH Block (SSB) according to the third information,

wherein the third information comprises a second indication field that indicates whether candidate SSB groups are actually sent,

wherein an actually sent candidate SSB index set is: {(i−1)*M, (i−1)*M+1, . . . , i*M−1}, {(i−1)*M+Q*Y, (i−1)*M+1+Q*Y, . . . , i*M−1+Q*Y}, . . . , {(i−1)*M+b*Q*Y, (i−1)*M+1+b*Q*Y, . . . , i−1)*M+1b*Q*Y, . . . , i*M−1+b*Q*Y}, and

wherein each candidate SSB group contains or at most contains M candidate SSBs,

the second indication field has NI bits, NI is an integer greater than or equal to 0,

an i th bit in the N 1 bits is a first numerical value, and the first numerical value is used for indicating that the candidate SSB group indicated by the i th bit is actually sent,

Q is a value of a Quasi Co-Location (QCL) parameter,

a QCL relationship of every Y successive candidate SSBs starting from an initial index is the same,

M is an integer greater than or equal to 1 , b is a maximum integer that meets a condition of i*M−1+b*Q*Y <=L−1,

L is the number of the candidate SSBs, and

i is an integer greater than or equal to 1.

2 . The information determination method according to claim 1 , wherein:

the SSB position indication field further comprises a third indication field that indicates actually sent candidate SSBs in each candidate SSB group,

the second indication field has N 1 bits,

the third indication field has N 2 bits,

the number of the candidate SSB groups is N 3 ,

wherein N 2 is an integer greater than or equal to 0, and N 3 is an integer greater than or equal to 1.

3 . The information determination method according to claim 1 , wherein:

a candidate SSB set indicated by the DBTW configuration comprises all candidate SSBs from a candidate SSB index a to a candidate SSB index a+D, and

a is an integer greater than or equal to 0, and D is an integer greater than or equal to 1.

4 . The information determination method according to claim 2 , wherein effective bits in the N 1 bits are determined according to the value of Q or the DBTW configuration.

5 . The information determination method according to claim 2 , wherein effective bits in the N 1 bits are a plurality of successive bits at preset positions.

6 . The information determination method according to claim 2 , wherein at least one of N 1 , N 2 , N 3 or M is determined according to the value of Q or the DBTW configuration.

7 . The information determination method according to claim 6 , wherein N 1 and N 2 are predefined values, M is calculated according to the value of Q and N 1 , and M values at preset positions in the N 2 bits are effective values.

8 . The information determination method according to claim 7 , wherein M is calculated by adopting any one of following formulas:

M=Q/N 1   formula 1,

M=└Q/N 1 ┘  formula 2, or

M=┌Q/N 1 ┐  formula 3,

wherein / represents a division sign, ┌ ┐ represents an upward rounding symbol, and └ ┘ represents a downward rounding symbol.

9 . The information determination method according to claim 6 , wherein:

N 1 is determined according to the value of Q and at least one of the following:

a predefined corresponding relationship between a value of Q and N 1 ; or

a preset function relationship between a value of Q and N 1 , wherein

when the value of Q is less than or equal to a first threshold, N 1 is equal to a second numerical value, or when the value of Q is greater than the first threshold, N 1 is determined through the predefined corresponding relationship between the value of Q and N 1 , or the preset function relationship between the value of Q and N 1 ;

or

N 2 is determined according to the value of Q and at least one of the following:

a predefined corresponding relationship between a value of Q and N 2 , or

a preset function relationship between a value of Q and N 2 , wherein

when the value of Q is less than or equal to a second threshold, N 2 is equal to a third numerical value, or when the value of Q is greater than the second threshold, N 2 is determined through the predefined corresponding relationship between the value of Q and N 2 , or the preset function relationship between the value of Q and N 2 ,

or

M is determined according to the value of Q and at least one of the following:

a predefined corresponding relationship between a value of Q and M, or

a preset function relationship between a value of Q and M, wherein

when the value of Q is less than or equal to a third threshold, M is equal to a fourth numerical value, o, wherein the value of Q is greater than the third threshold, M is determined through the predefined corresponding relationship between the value of Q and M, or the preset function relationship between the value of Q and M.

10 . A terminal, comprising a processor; a memory having a computer program or an instruction stored thereon, wherein the computer program or the instruction, when executed by the processor, causes the processor to implement operations, comprising:

acquiring third information; and

determining an actually sent Synchronization Signal and PBCH Block (SSB) according to the third information,

wherein the third information comprises a second indication field that indicates whether candidate SSB groups are actually sent,

wherein an actually sent candidate SSB index set is: {(i−1)*M, (i−1)*M+1, . . . , i*M−1}, {(i−1)*M+Q*Y, (i−1)*M+1+Q*Y, . . . , i*M−1+Q*Y}, . . . , {(i−1)*M+b*Q*Y, (i−1)*M+1+b*Q*Y, . . . , i−1)*M+1b*Q*Y, . . . , i*M−1+b*Q*Y},

wherein each candidate SSB group contains or at most contains M candidate SSBs,

the second indication field has N 1 bits, N 1 is an integer greater than or equal to 0,

an i th bit in the N 1 bits is a first numerical value, and the first numerical value is used for indicating that the candidate SSB group indicated by the i th bit is actually sent,

Q is a value of a Quasi Co-Location (QCL) parameter,

a QCL relationship of every Y successive candidate SSBs starting from an initial index is the same,

M is an integer greater than or equal to 1 , b is a maximum integer that meets a condition of i*M−1+b*Q*Y<=L−1,

L is the number of the candidate SSBs, and

i is an integer greater than or equal to 1.

11 . The terminal according to claim 10 , wherein:

the SSB position indication field further comprises a third indication field that indicates actually sent candidate SSBs in each candidate SSB group,

the second indication field has N 1 bits,

the third indication field has N 2 bits,

the number of the candidate SSB groups is N 3 , and

wherein N 2 is an integer greater than or equal to 0, and N 3 is an integer greater than or equal to 1.

12 . The terminal according to claim 10 , wherein:

a candidate SSB set indicated by the DBTW configuration comprises all candidate SSBs from a candidate SSB index a to a candidate SSB index a+D, and

a is an integer greater than or equal to 0 , and D is an integer greater than or equal to 1.

13 . The terminal according to claim 11 , wherein effective bits in the N 1 bits are determined according to the value of Q or the DBTW configuration.

14 . The terminal according to claim 11 , wherein effective bits in the N 1 bits are a plurality of successive bits at preset positions.

15 . The terminal according to claim 11 , wherein

at least one of N 1 , N 2 , N 3 or M is determined according to the value of Q or the DBTW configuration.

16 . The terminal according to claim 15 , wherein N 1 and N 2 are predefined values, M is calculated according to the value of Q and N 1 , and M values at preset positions in the N 2 bits are effective values.

17 . The terminal according to claim 16 , wherein M is calculated by adopting any one of following formulas:

M=Q/N 1   formula 1,

M=└Q/N 1 ┘  formula 2, or

M=┌Q/N 1 ┐  formula 3,

wherein / represents a division sign, ┌ ┐ represents an upward rounding symbol, and └ ┘ represents a downward rounding symbol.

18 . A non-transitory computer readable storage medium, storing a computer program or an instruction that, when executed by a processor, causes the processor to implement operations, comprising:

acquiring third information; and

determining an actually sent Synchronization Signal and PBCH Block (SSB) according to the third information,

wherein the third information comprises a value of a Quasi Co-Location (QCL) parameter Q, and a second indication field that indicates whether candidate SSB groups are actually sent,

wherein an actually sent candidate SSB index set is: {(i−1)*M, (i−1)*M+1, . . . , i*M−1}, {(i−1)*M+Q*Y, (i−1)*M+1+Q*Y, . . . , i*M−1+Q*Y}, . . . , {(i−1)*M+b*Q*Y, (i−1)*M+1+b*Q*Y, . . . , i−1)*M+1b*Q*Y, . . . , i*M−1+b*Q*Y},

wherein each candidate SSB group contains or at most contains M candidate SSBs,

the second indication field has N 1 bits, N 1 is an integer greater than or equal to 0,

Q is a value of a Quasi Co-Location (QCL) parameter,

an i th bit in the N 1 bits is a first numerical value, and the first numerical value is used for indicating that the candidate SSB group indicated by the i th bit is actually sent,

a QCL relationship of every Y successive candidate SSBs starting from an initial index is the same,

M is an integer greater than or equal to 1, b is a maximum integer that meets a condition of i*M−1+b*Q*Y< 32 L−1,

L is the number of the candidate SSBs, and

i is an integer greater than or equal to 1.

Assignments (1)

Priority Claims (1)

Continuity (2)

References Cited (23)