US2025393075A1PendingUtilityA1
Preamble sequence sending and receiving methods, apparatuses and storage medium
Assignee: Datang mobile communications equipment co ltdPriority: Aug 3, 2022Filed: Jul 19, 2023Published: Dec 25, 2025
Est. expiryAug 3, 2042(~16 yrs left)· nominal 20-yr term from priority
H04B 17/328H04W 74/0833H04L 5/0048H04W 56/001H04W 74/08H04W 74/004H04L 5/00H04W 56/00H04W 72/0453H04W 72/0446H04W 74/00
55
PatentIndex Score
0
Cited by
0
References
0
Claims
Abstract
The present disclosure provides preamble sequence sending and receiving methods and apparatuses and a storage medium. The method includes: determining M random access channel occasions (ROs) based on detected synchronization signal blocks (SSBs), where M is an integer greater than 1; and sending preamble sequences on the M ROs, where the preamble sequences carry additional bits generated based on informational bits, thereby improving the performance of preamble sequences.
Claims
exact text as granted — not AI-modified1 . A preamble sequence sending method, comprising:
determining M random access channel occasions (ROs) based on detected synchronization signal blocks (SSBs), wherein M is an integer greater than 1; and sending preamble sequences on the M ROs, wherein the preamble sequences carry additional bits generated based on information bits.
2 . The method according to claim 1 , wherein the determining the M random access channel occasions (ROs) based on the detected synchronization signal blocks (SSBs) comprises:
selecting X SSBs from the detected SSBs at least based on synchronization signal-reference signal received powers (SS-RSRPs) of the detected SSBs, wherein X is an integer greater than or equal to 1, and X is preset, or configured by a network device, or agreed upon by a protocol, or determined by a terminal; and determining the M ROs based on the X SSB and a mapping relationship between SSBs and ROs, wherein M is preset, or configured by a network device, or agreed upon by a protocol, or determined by a terminal.
3 . The method according to claim 2 , wherein in a case that a number of ROs mapped by each SSB is 1/N, wherein N is less than 1, then the M ROs represent X/N ROs corresponding to the X SSBs; or,
in a case that a number of ROs mapped by each SSB is 1/N, wherein Nis less than 1, then X is equivalent to M divided by 1/N and rounded up to a nearest integer, and the M ROs represent M ROs in X/N ROs corresponding to the X SSBs; wherein the X SSBs represent X SSBs with highest SS-RSRPs among all SSBs, or the X SSBs represent X SSBs whose SS-RSRPs exceed a preset threshold.
4 - 5 . (canceled)
6 . The method according to claim 2 , wherein in a case that a number of ROs mapped by each SSB is 1 and a number of SSBs mapped by each RO is N, wherein N is greater than or equal to 1, then X is 1, and the X SSBs represent one SSB with a highest SS-RSRP among all SSBs, or the X SSBs represent one SSB whose SS-RSRP exceeds a preset threshold;
wherein the determining the M ROs based on the X SSBs and the mapping relationship between the SSBs and the ROs comprises: determining a first RO corresponding to the X SSBs based on the mapping relationship between the SSBs and the ROs; and selecting consecutive M ROs starting from the first RO; or, in a case that a number of ROs mapped by each SSB is 1 and a number of SSBs mapped by each RO is N, wherein N is greater than or equal to 1, then X is equal to M, and the X SSBs represent M SSBs corresponding to M highest SS-RSRPs among all SSBs, or the X SSBs represent M SSBs whose SS-RSRPs exceed a preset threshold; wherein the determining the M ROs based on the X SSBs and the mapping relationship between the SSBs and the ROs comprises: determining K ROs corresponding to the X SSBs based on the mapping relationship between the SSBs and the ROs, and in a case that K is equal to M, determining the K ROs as the MROs.
7 . (canceled)
8 . The method according to claim 6 , in the case that X is equal to M, the method further comprising:
in a case that K is less than M, continuing to select an RO corresponding to an SSB with a highest SS-RSRP among other SSBs than the X SSBs until the M ROs are determined; or, in a case that K is less than M, selecting consecutive M-K ROs after the K ROs to obtain the M ROs.
9 . The method according to claim 1 , wherein the preamble sequences on the M ROs are the same, and the preamble sequences carry all information of the additional bits; or,
the preamble sequences on the M ROs are not completely the same, and each preamble sequence carries part of information of the additional bits.
10 . (canceled)
11 . The method according to claim 9 , in a case that the preamble sequences on the M ROs are not completely the same, wherein the sending the preamble sequences on the M ROs comprises:
sending L preamble sequences on the M ROs, wherein L is a number of segments of the additional bits, and L is less than or equal to M, each preamble sequence in the L preamble sequences carries a segment of the additional bits, wherein L is preset, or configured by a network device, or agreed upon by a protocol, or determined by a terminal; wherein L is calculated based on M, or M is calculated based on L.
12 - 13 . (canceled)
14 . A preamble sequence receiving method, comprising:
determining one or more random access channel occasion (RO) combinations, wherein the RO combination comprises M ROs, wherein M is an integer greater than 1; and performing reception processing of preamble sequences on each RO combination, wherein the preamble sequences carry additional bits generated based on information bits.
15 . The method according to claim 14 , wherein the determining the one or more RO combinations comprises:
determining one or more synchronization signal block (SSB) combinations, wherein the SSB combination comprises X SSBs, wherein X is an integer greater than or equal to 1; and determining the RO combination based on the X SSBs and a mapping relationship between SSBs and ROs.
16 . The method according to claim 15 , wherein
in a case that a number of ROs mapped by each SSB is 1/N, wherein Nis less than 1, then the M ROs represent X/N ROs corresponding to the X SSBs; or, in a case that a number of ROs mapped by each SSB is 1/N, wherein N is less than 1, then X is equivalent to M divided by 1/N and rounded up to a nearest integer, and the M ROs represent M ROs in X/N ROs corresponding to the X SSBs; or, in a case that a number of ROs mapped by each SSB is 1 and a number of SSBs mapped by each RO is N, in a case that N is greater than or equal to 1, then X is 1; wherein the determining the RO combination based on the X SSBs and the mapping relationship between the SSBs and the ROs comprises: determining a first RO corresponding to the X SSBs based on the mapping relationship between the SSBs and the ROs; and selecting consecutive M ROs starting from the first RO; or, in a case that a number of ROs mapped by each SSB is 1 and a number of SSBs mapped by each RO is N, wherein N is greater than or equal to 1, then X is equal to M; wherein the determining the RO combination based on the X SSBs and the mapping relationship between the SSBs and the ROs comprises: determining K ROs corresponding to the X SSBs based on the mapping relationship between the SSBs and the ROs, and in a case that K is equal to M, determining the K ROs as the M ROs.
17 - 19 . (canceled)
20 . The method according to claim 16 , in the case that the number of ROs mapped by each SSB is 1 and the number of SSBs mapped by each RO is N, wherein N is greater than or equal to 1, X is equal to M, the method further comprising:
in a case that K is less than M, continuing to select an RO corresponding to other SSB than the X SSBs, until the M ROs are determined; or, in a case that K is less than M, selecting consecutive M-K ROs after the K ROs to obtain the M ROs.
21 . The method according to claim 15 , further comprises at least one of the following:
sending the number M of ROs to a terminal, wherein M is used to indicate sending the preamble sequences on M ROs; sending the number X of SSBs to a terminal, wherein X is used to indicate determining M ROs for sending the preamble sequences based on X SSBs; sending a number L of segments of the additional bits to a terminal, wherein L is an integer greater than 1, and L is used to indicate that each preamble sequence carries 1 /L of the additional bits; wherein L is calculated based on M, or M is calculated based on L; or, solving for the additional bits carried by the preamble sequences after receiving the preamble sequences.
22 - 26 . (canceled)
27 . A preamble sequence sending apparatus, comprising: a memory, a transceiver and a processor, wherein
the memory is configured to store a computer program; the transceiver is configured to send and receive data under control of the processor; the processor is configured to read the computer program stored in the memory and execute the following operations: determining M random access channel occasions (ROs) based on detected synchronization signal blocks (SSBs), wherein M is an integer greater than 1; and sending preamble sequences on the M ROs, wherein the preamble sequences carry additional bits generated based on information bits.
28 . The apparatus according to claim 27 , wherein the processor is further configured to execute the following operations:
selecting X SSBs from the detected SSBs at least based on synchronization signal-reference signal received powers (SS-RSRPs) of the detected SSBs, wherein X is an integer greater than or equal to 1, and X is preset, or configured by a network device, or agreed upon by a protocol, or determined by a terminal; and determining the M ROs based on the X SSBs and a mapping relationship between SSBs and ROs, wherein M is preset, or configured by a network device, or agreed upon by a protocol, or determined by a terminal.
29 . The apparatus according to claim 28 , wherein in a case that a number of ROs mapped by each SSB is 1/N, wherein N is less than 1, then the M ROs represent X/N ROs corresponding to the X SSBs; or,
in a case that a number of ROs mapped by each SSB is 1/N, wherein N is less than 1, then X is equivalent to M divided by 1/N and rounded up to a nearest integer, and the M ROs represent M ROs in X/N ROs corresponding to the X SSBs wherein the X SSBs represent X SSBs with highest SS-RSRPs among all SSBs, or the X SSBs represent X SSBs whose SS-RSRPs exceed a preset threshold.
30 - 31 . (canceled)
32 . The apparatus according to claim 28 , wherein in a case that a number of ROs mapped by each SSB is 1 and a number of SSBs mapped by each RO is N, wherein N is greater than or equal to 1, then X is 1, and the X SSBs represent one SSB with a highest SS-RSRP among all SSBs, or the X SSBs represent one SSB whose SS-RSRP exceeds a preset threshold;
wherein the processor is further configured to execute the following operations: determining a first RO corresponding to the X SSBs based on the mapping relationship between the SSBs and the ROs; and selecting consecutive M ROs starting from the first RO; or, in a case that a number of ROs mapped by each SSB is 1 and a number of SSBs mapped by each RO is N, wherein N is greater than or equal to 1, then X is equal to M, and the X SSBs represent M SSBs corresponding to M highest SS-RSRPs among all SSBs, or the X SSBs represent M SSBs whose SS-RSRPs exceed a preset threshold; wherein the processor is further configured to execute the following operation: determining K ROs corresponding to the X SSBs based on the mapping relationship between the SSBs and the ROs, and in a case that K is equal to M, determining the K ROs as the M ROs.
33 . (canceled)
34 . The apparatus according to claim 32 , wherein in the case that X is equal to M, the processor is further configured to execute the following operations:
in a case that K is less than M, continuing to select an RO corresponding to an SSB with a highest SS-RSRP among the other SSBs than the X SSBs until the M ROs are determined; or, in a case that K is less than M, selecting consecutive M-K ROs after the K ROs to obtain the M ROs.
35 . The apparatus according to claim 27 , wherein the preamble sequences on the M ROs are the same, and the preamble sequences carry all information of the additional bits; or,
the preamble sequences on the M ROs are not completely the same, and each preamble sequence carries part of information of the additional bits.
36 . (canceled)
37 . The apparatus according to claim 35 , wherein the processor is further configured to execute the following operation:
sending L preamble sequences on the M ROs, wherein L is a number of segments of the additional bits, and L is less than or equal to M, each preamble sequence in the L preamble sequences carries a segment of the additional bits, wherein L is preset, or configured by a network device, or agreed upon by a protocol, or determined by a terminal; wherein L is calculated based on M, or M is calculated based on L.
38 - 39 . (canceled)
40 . A preamble sequence receiving apparatus, comprising: a memory, a transceiver and a processor, wherein
the memory is configured to store a computer program; the transceiver is configured to send and receive data under control of the processor; the processor is configured to read the computer program stored in the memory and execute the method according to claim 14 .
41 - 79 . (canceled)Join the waitlist — get patent alerts
Track US2025393075A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.