Random access preamble for non-terrestrial networks

Abstract

The present disclosure relates to a method, system and device for use in a wireless terminal, comprising: transmitting a preamble comprising a plurality of parts to a wireless network node, wherein each of the plurality of parts comprises at least one sub-preamble, and the sub-preambles in the plurality of parts are generated based on a plurality of roots.

Description

TECHNICAL FIELD

[0001] The present disclosure relates generally to wireless communications. BACKGROUND

[0002] Non-terrestrial networks (NTNs) are expected to facilitate the extension of 5G services to non-service areas and upgrade the performance of limited terrestrial network non-service areas at low cost due to their wide service coverage capability and reduced vulnerability to physical attacks and natural disasters compared to terrestrial networks.

[0003] In NTN, low earth orbit (LEO) satellite communications have attracted widespread interest due to their potential to support high bandwidth and low latency. However, the fast-moving LEO satellites bring huge frequency offsets. While user equipment (UE) generally performs coarse frequency offset estimation in downlink synchronization signal detection, the residual frequency offset can still be large, which brings new challenges to the random access procedure of NTN. In addition, the huge time offset caused by propagation delay also exceeds the tolerance of existing PRACH design. Similar challenges also need to be addressed in the case of air-to-ground (ATG) services, in which onboard UEs on aircraft are served by ground stations.

[0004] This document relates to wireless communication methods, systems, and devices for wireless communication, in particular for non-terrestrial networks (NTNs) and ATG wireless communication, and in particular to preambles capable of handling high frequency offsets and huge time offsets in NTN wireless communication. However, it will be clear to the skilled person that this document is not limited to these wireless communications, but is also applicable to other types of wireless communication. SUMMARY

[0005] The present disclosure relates to a wireless communication method performed by a wireless terminal and provided according to embodiments of the present disclosure. The wireless communication method comprises transmitting, to a wireless network node, a preamble comprising a plurality of parts, wherein each of the plurality of parts comprises at least one sub-preamble, and the sub-preambles in the plurality of parts are generated based on a plurality of roots.

[0006] Various embodiments can preferably implement the following features:

[0007] Preferably, the at least one sub-preamble in each of the plurality of parts is generated based on a different root.

[0008] Preferably, the at least one sub-preamble in the same part is generated based on a plurality of cyclic shift lists.

[0009] Preferably, the at least one sub-preamble in the same part is generated based on one of the plurality of cyclic shift lists.

[0010] Preferably, the plurality of cyclic shift lists have the same cyclic shift.

[0011] Preferably, the at least one sub-preamble in the same part are identical to each other.

[0012] Preferably, each of the plurality of parts has a prefix.

[0013] Preferably, the prefix is a cyclic prefix generated based on a tail of each of the plurality of parts.

[0014] Preferably, at least one of the plurality of parts has a suffix.

[0015] Preferably, the suffix comprises data transmitted in a physical uplink shared channel (PUSCH).

[0016] Preferably, the suffix comprises a space.

[0017] Preferably, each of the plurality of parts has no suffix.

[0018] Preferably, the at least one sub-preamble in each of the plurality of parts are connected in time domain.

[0019] Preferably, the plurality of parts are connected in the time domain.

[0020] Preferably, the plurality of parts are transmitted in different frequency points.

[0021] Preferably, the plurality of parts are transmitted in a plurality of random access channel (RACH) occasions.

[0022] Preferably, the wireless communication method further comprises: receiving, from the wireless network node, occasion configuration information indicating the plurality of RACH occasions.

[0023] Preferably, the occasion configuration information indicates at least one index offset among the plurality of RACH occasions.

[0024] Preferably, the occasion configuration information indicates at least one time offset among the plurality of RACH occasions.

[0025] Preferably, the occasion configuration information indicates at least one frequency offset among the plurality of RACH occasions.

[0026] Preferably, the plurality of RACH occasions are predefined as a table, and the occasion configuration information indicates at least one index entry of the table.

[0027] Preferably, the plurality of RACH occasions are divided into a plurality of occasion groups corresponding to the plurality of parts.

[0028] Preferably, the plurality of preambles are transmitted in at least one resource element (RE).

[0029] Preferably, the plurality of preambles simultaneously occupy one RE.

[0030] Preferably, the wireless communication method further comprises receiving, from the wireless network node, preamble configuration information for generating the sub-preambles in the plurality of parts of the preamble; wherein the preamble configuration information indicates at least one of a length of a Zadoff-Chu sequence, the plurality of roots, or a plurality of cyclic shift lists.

[0031] The present disclosure relates to a wireless communication method performed by a wireless network node and provided according to embodiments of the present disclosure. The wireless communication method comprises receiving, from a wireless terminal, a preamble comprising a plurality of parts, wherein each of the plurality of parts comprises at least one sub-preamble, and the sub-preambles in the plurality of parts are generated based on a plurality of roots.

[0032] Various embodiments can preferably implement the following features:

[0033] Preferably, the at least one sub-preamble in each of the plurality of parts is generated based on a different root.

[0034] Preferably, the at least one sub-preamble in a same part is generated based on a plurality of cyclic shift lists.

[0035] Preferably, the at least one sub-preamble in the same part is generated based on one of the plurality of cyclic shift lists.

[0036] Preferably, the plurality of cyclic shift lists have a same cyclic shift.

[0037] Preferably, the at least one sub-preamble in the same part is identical to each other.

[0038] Preferably, each of the plurality of parts has a prefix, and the prefix is a cyclic prefix generated based on a tail of each of the plurality of parts.

[0039] Preferably, at least one of the plurality of parts has a suffix.

[0040] Preferably, the suffix comprises data transmitted in a physical uplink shared channel (PUSCH).

[0041] Preferably, the suffix comprises a space.

[0042] Preferably, each of the plurality of parts has no suffix.

[0043] Preferably, wherein the at least one sub-preamble in each of the plurality of parts are connected in a time domain.

[0044] Preferably, the plurality of parts are connected in the time domain.

[0045] Preferably, the plurality of parts are transmitted at different frequency points.

[0046] Preferably, the plurality of portions are received at multiple random access channel (RACH) times.

[0047] Preferably, the wireless communication method further includes: sending timing configuration information indicating the plurality of RACH timings to the wireless terminal.

[0048] Preferably, the timing configuration information indicates at least one index offset among the plurality of RACH timings.

[0049] Preferably, the timing configuration information indicates at least one time offset among the plurality of RACH timings.

[0050] Preferably, the timing configuration information indicates at least one frequency offset among the plurality of RACH timings.

[0051] Preferably, the plurality of RACH timings are predefined as tables, and the timing configuration information indicates at least one index entry of the table.

[0052] Preferably, the plurality of RACH timings are divided into a plurality of timing groups corresponding to the plurality of parts.

[0053] Preferably, the plurality of preambles are sent in at least one resource element (RE).

[0054] Preferably, the plurality of preambles simultaneously occupy one RE.

[0055] Preferably, the wireless communication method further includes: sending to the wireless terminal preamble configuration information for generating the sub-preamble in the plurality of portions of the preamble; wherein the preamble configuration information indicates the length of the Zadoff-Chu sequence, at least one of the plurality of roots or a plurality of cyclic shift lists.

[0056] This disclosure relates to a wireless communication method used in a wireless terminal. The wireless communication method includes sending a plurality of preambles to a wireless network node, each of the plurality of preambles comprising at least one portion, each of the at least one portion comprising at least one sub-preamble, and the sub-preambles of the plurality of preambles being generated based on a plurality of roots.

[0057] Various embodiments can preferably achieve the following features:

[0058] Preferably, the wireless communication method further comprises generating a plurality of groups, and determining the plurality of preambles according to the plurality of groups, wherein each of the plurality of groups comprises at least one candidate preamble generated based on a same root.

[0059] Preferably, the wireless communication method further comprises determining one of a plurality of candidate root sets, wherein each of the plurality of candidate root sets comprises a plurality of candidate roots, and determining the plurality of preambles according to a group corresponding to the plurality of candidate roots in the determined candidate root set.

[0060] Preferably, the wireless communication method further comprises generating a plurality of candidate preambles based on the plurality of roots, and determining the plurality of preambles according to the plurality of candidate preambles.

[0061] Preferably, a number of the plurality of candidate preambles is greater than a number of the plurality of roots.

[0062] Preferably, the wireless communication method further comprises determining one of a plurality of candidate root sets, wherein each of the plurality of candidate root sets comprises a plurality of candidate roots, and determining a candidate preamble corresponding to the plurality of candidate roots in the determined candidate root set as the plurality of preambles.

[0063] Preferably, at least one of the plurality of candidate roots within each of the plurality of candidate root sets is different from other candidate roots in the same candidate root set.

[0064] Preferably, the at least one part of each of the plurality of preambles is connected in a time domain.

[0065] Preferably, the plurality of preambles are connected in the time domain.

[0066] Preferably, the plurality of preambles are transmitted in different frequency points.

[0067] Preferably, the plurality of preambles are transmitted in a plurality of random access channel (RACH) occasions.

[0068] Preferably, the wireless communication method further comprises receiving, from the wireless network node, occasion configuration information indicating the plurality of RACH occasions.

[0069] Preferably, the occasion configuration information indicates at least one index offset among the plurality of RACH occasions.

[0070] Preferably, the occasion configuration information indicates at least one time offset among the plurality of RACH occasions.

[0071] Preferably, the occasion configuration information indicates at least one frequency offset among the plurality of RACH occasions.

[0072] Preferably, the multiple RACH occasions are predefined as a table, and the occasion configuration information indicates at least one index entry of the table.

[0073] Preferably, the multiple RACH occasions are divided into multiple groups of occasions corresponding to the multiple preambles.

[0074] Preferably, the multiple preambles are transmitted in at least one resource element, RE.

[0075] Preferably, the multiple preambles simultaneously occupy one RE.

[0076] Preferably, the wireless communication method further comprises receiving, from the wireless network node, preamble configuration information for generating the multiple preambles; wherein the preamble configuration information indicates at least one of a length of a Zadoff-Chu sequence, a multiple of roots or a multiple of cyclic shift list, or a number of the multiple preambles.

[0077] The present disclosure relates to a wireless communication method used in a wireless network node. The wireless communication method comprises receiving, from a wireless terminal, multiple preambles, wherein each of the multiple preambles comprises at least one part, each of the at least one part comprises at least one sub-preamble and a sub-preamble in the multiple preambles is generated based on a multiple of roots.

[0078] Various embodiments can preferably implement the following features:

[0079] Preferably, the wireless communication method further comprises indicating, to the wireless terminal, multiple candidate root sets, wherein each of the multiple candidate root sets comprises multiple candidate roots for generating the multiple preambles.

[0080] Preferably, the multiple candidate root sets are indicated via at least one of radio resource control signaling, a system information block, or a master information block.

[0081] Preferably, the at least one part of each of the multiple preambles is connected in a time domain.

[0082] Preferably, the multiple preambles are connected in the time domain.

[0083] Preferably, the multiple preambles are received in different frequency points.

[0084] Preferably, the multiple preambles are received in multiple random access channel (RACH) occasions.

[0085] Preferably, the occasion configuration information indicates at least one index offset among the multiple RACH occasions.

[0086] Preferably, the occasion configuration information indicates at least one time offset among the multiple RACH occasions.

[0087] Preferably, the occasion configuration information indicates at least one frequency offset among the plurality of RACH occasions.

[0088] Preferably, the plurality of RACH occasions are predefined as a table, and the occasion configuration information indicates at least one index entry of the table.

[0089] Preferably, the plurality of RACH occasions are divided into a plurality of occasion groups corresponding to the plurality of preambles.

[0090] Preferably, the plurality of preambles are transmitted in at least one resource element (RE).

[0091] Preferably, the plurality of preambles simultaneously occupy one RE.

[0092] Preferably, the wireless communication method further comprises transmitting, to the wireless terminal, preamble configuration information for generating the plurality of preambles, wherein the preamble configuration information indicates at least one of a length of a Zadoff-Chu sequence, a plurality of roots or a plurality of cyclic shift lists, a number of the plurality of preambles, or a number of the plurality of preambles.

[0093] The present disclosure relates to a wireless terminal and is provided in accordance with embodiments of the present disclosure. The wireless terminal comprises a communication unit configured to transmit, to a wireless network node, a preamble comprising a plurality of parts, wherein each of the plurality of parts comprises at least one sub-preamble, and the sub-preambles in the plurality of parts are generated based on a plurality of roots.

[0094] Various embodiments can preferably implement the following features:

[0095] Preferably, the wireless terminal further comprises a processor configured to perform any of the above method steps.

[0096] The present disclosure relates to a wireless network node and is provided in accordance with embodiments of the present disclosure. The wireless network node comprises a communication unit configured to receive, from a wireless terminal, a preamble comprising a plurality of parts, wherein each of the plurality of parts comprises at least one sub-preamble, and the sub-preambles in the plurality of parts are generated based on a plurality of roots.

[0097] Various embodiments can preferably implement the following features:

[0098] Preferably, the wireless network node further comprises a processor configured to perform any of the above method steps.

[0099] The present disclosure relates to a wireless terminal comprising a communication unit configured to transmit a plurality of preambles to a wireless network node, wherein each of the plurality of preambles comprises at least one part, each of the at least one part comprises at least one sub-preamble, and the sub-preambles of the plurality of preambles are generated based on a plurality of roots.

[0100] The various embodiments can preferably implement the following features:

[0101] Preferably, the wireless terminal further comprises a processor configured to perform any of the above method steps.

[0102] The present disclosure relates to a wireless network node comprising a communication unit configured to receive a plurality of preambles from a wireless terminal, wherein each of the plurality of preambles comprises at least one part, each of the at least one part comprises at least one sub-preamble, and the sub-preambles of the plurality of preambles are generated based on a plurality of roots.

[0103] The various embodiments can preferably implement the following features:

[0104] Preferably, the wireless network node further comprises a processor configured to perform any of the above method steps.

[0105] The present disclosure also relates to a computer readable program medium code stored above, disclosed according to embodiments of the present disclosure, which when executed by a processor, causes the processor to implement the method recited in any of the above methods. BRIEF DESCRIPTION OF DRAWINGS

[0106] The above and other aspects and implementations are described in more detail in the following detailed description and in conjunction with the following figures.

[0107] Figure 1 An example of a schematic diagram of a wireless terminal according to embodiments of the present disclosure is shown.

[0108] Figure 2 An example of a schematic diagram of a wireless network node according to embodiments of the present disclosure is shown.

[0109] Figure 3 A schematic diagram of a preamble according to embodiments of the present disclosure is shown.

[0110] Figure 4 A table showing an exemplary list of cyclic shifts pool according to embodiments of the present disclosure is shown.

[0111] Figure 5 A schematic diagram of a preamble according to embodiments of the present disclosure is shown.

[0112] Figure 6A schematic diagram of a preamble is shown in accordance with an embodiment of the disclosure.

[0113] Figure 7 A schematic diagram of a preamble is shown in accordance with an embodiment of the disclosure.

[0114] Figure 8 A schematic diagram of a preamble is shown in accordance with an embodiment of the disclosure.

[0115] Figure 9 A schematic diagram of a preamble is shown in accordance with an embodiment of the disclosure.

[0116] Figure 10 A schematic diagram of a preamble is shown in accordance with an embodiment of the disclosure.

[0117] Figure 11 A schematic diagram of a preamble is shown in accordance with an embodiment of the disclosure.

[0118] Figure 12 A schematic diagram of a preamble is shown in accordance with an embodiment of the disclosure.

[0119] Figure 13 A schematic diagram of a preamble is shown in accordance with an embodiment of the disclosure.

[0120] Figure 14 A schematic diagram of a preamble is shown in accordance with an embodiment of the disclosure.

[0121] Figure 15 A schematic diagram of a preamble is shown in accordance with an embodiment of the disclosure.

[0122] Figure 16 A schematic diagram of a process is shown in accordance with an embodiment of the disclosure.

[0123] Figure 17 A schematic diagram of a table positioning RACH occasions of a transmission part is shown in accordance with an embodiment of the disclosure.

[0124] Figure 18 A schematic diagram of a table positioning RACH occasions of a transmission part is shown in accordance with an embodiment of the disclosure.

[0125] Figure 19 A schematic diagram of a preamble is shown in accordance with an embodiment of the disclosure.

[0126] Figure 20 A schematic diagram of a preamble is shown in accordance with an embodiment of the disclosure.

[0127] Figure 21 A schematic diagram of a preamble is shown in accordance with an embodiment of the disclosure.

[0128] Figure 22 A schematic diagram of a preamble is shown in accordance with an embodiment of the disclosure.

[0129] Figure 23 A schematic diagram illustrating a preamble according to an embodiment of the disclosure is shown.

[0130] Figure 24 A flowchart illustrating a process according to an embodiment of the disclosure is shown.

[0131] Figure 25 A flowchart illustrating a process according to an embodiment of the disclosure is shown.

[0132] Figure 26 A flowchart illustrating a process according to an embodiment of the disclosure is shown.

[0133] Figure 27 A flowchart illustrating a process according to an embodiment of the disclosure is shown. DETAILED DESCRIPTION

[0134] Figure 1 A schematic diagram of a wireless terminal 10 according to an embodiment of the disclosure is shown. The wireless terminal 10 can be a user equipment (UE), a handset, a notebook computer, a tablet computer, an e-book, or a portable computer system, without limitation. The wireless terminal 10 can include a processor 100, such as a microprocessor or an application specific integrated circuit (ASIC), a storage unit 110, and a communication unit 120. The storage unit 110 can be any data storage device that stores program code 112 accessed and executed by the processor 100. Embodiments of the storage unit 112 include, but are not limited to, a subscriber identity module (SIM), a read only memory (ROM), a flash memory, a random access memory (RAM), a hard disk, and an optical data storage device. The communication unit 120 can be a transceiver that transmits and receives signals (e.g., messages or packets) according to the processing results of the processor 100. In one embodiment, the communication unit 120 transmits and receives signals through an antenna 122, as shown. Figure 1

[0135] In one embodiment, the storage unit 110 and the program code 112 can be omitted, and the processor 100 can include a storage unit having stored program code.

[0136] The processor 100 can implement any of the steps in the exemplary embodiments on the wireless terminal 10.

[0137] The communication unit 120 can be a transceiver. The communication unit 120 can alternatively or additionally combine a transmission unit and a reception unit configured to respectively transmit and receive signals to and from a wireless network node (e.g., a base station).

[0138] Figure 2 ​A schematic diagram of a wireless network node 20 according to an embodiment of the present disclosure. The wireless network node 20 can be a base station (BS), a network entity, a mobility management entity (MME), a serving gateway (S-GW), a packet data network (PDN) gateway (P-GW), or a radio network controller (RNC), without limitation. The wireless network node 20 can include a processor 200 such as a microprocessor or an ASIC, a storage unit 210, and a communication unit 220. The storage unit 210 can be any data storage device that stores program codes 212 accessed and executed by the processor 200. Examples of the storage unit 212 include, but are not limited to, a SIM, a ROM, a flash memory, a RAM, a hard disk, and an optical data storage device. The communication unit 220 can be a transceiver that transmits and receives signals (e.g., messages or packets) according to the processing result of the processor 200. In one example, the communication unit 220 transmits and receives signals through an antenna 222, as shown in Figure 2

[0139] In one embodiment, the storage unit 210 and the program codes 212 can be omitted. The processor 200 can include a storage unit having stored program codes.

[0140] The processor 200 can implement any of the steps described in the exemplary embodiments on the wireless network node 20.

[0141] The communication unit 220 can be a transceiver. The communication unit 220 can alternatively or additionally combine a transmission unit and a reception unit configured to respectively transmit and receive signals to and from a wireless terminal (e.g., a user equipment).

[0142] In the existing communication system, a physical random access channel (PRACH) is used to transmit an access request of a wireless network terminal to a wireless network node (e.g., a BS). The wireless network node detects the wireless network terminal and its time delay according to a PRACH preamble, and provides time advance (TA) information to the wireless network terminal accordingly. The preamble can be constructed based on a Zadoff-Chu (ZC) sequence (e.g., length 139 or 839) and a cyclic shift. For a given cell, 64 different random access sequences can be provided to all wireless network terminals. A corresponding root pool and a cyclic shift pool are broadcast to all wireless network terminals, and each wireless network terminal randomly selects a root and a cyclic shift from the corresponding root pool and the cyclic shift pool to generate its random access signal.

[0143] ​Generally, the preamble is detected by correlation peak at the receiver (e.g., wireless network node) side. Note that the existing preamble cannot support the scenario with frequency offset larger than half of the subcarrier spacing, because the correlation peak shifted according to the frequency offset can fall into the detection window of another user. This is the reason why larger cyclic shift interval is used in high speed scenario where high frequency offset is expected. Meanwhile, the time offset also needs to be smaller than the length of cyclic prefix (CP). Since the CP in each preamble format in the existing communication system can be smaller than 1 ms, the preamble format in the existing communication system also cannot support NTN or air-to-ground (ATG) wireless communication with huge time offset.

[0144] In one embodiment, the present disclosure proposes a preamble, in particular for NTN characterized by large time offset and high frequency offset. The proposed preamble comprises multiple parts, and each of the multiple parts comprises at least one sub-preamble. For example, the proposed preamble can have N parts, and the number of sub-preambles in the N parts is N SP (where N≥2 and N SP ≥2), where each of the N SP sub-preambles is generated by using a ZC sequence characterized by a root u and a cyclic shift v.

[0145] In one embodiment, the sub-preambles in each of the multiple parts are connected in time domain.

[0146] In one embodiment, each of the multiple parts has a prefix. For example, the prefix can be a cyclic prefix.

[0147] In one embodiment, at least one of the multiple parts has a suffix. In one example, the suffix comprises data and / or space.

[0148] In one embodiment, the proposed preamble can have only one part, and the part comprises at least one sub-preamble. That is, the proposed preamble can comprise at least one part, each of the at least one part comprises at least one sub-preamble connected in time domain, and each of the at least one part can have a prefix and / or a suffix.

[0149] In one embodiment, the proposed preamble generates the sub-preambles in the multiple parts with N u different roots, where N u ≥2. Further, at least one sub-preamble corresponding to each root is generated based on a corresponding list of cyclic shifts. For example, the preamble can be represented as:

[0150]

[0151] In this example, N SP sub-preambles are based on roots and cyclic shifts are generated, wherein More specifically, the preamble includes a sub-preamble generated based on a ZC sequence characterized by a root u1 and a list of cyclic shifts with cyclic shifts , a sub-preamble generated based on a ZC sequence characterized by a root u2 and a list of cyclic shifts

[0152] In one embodiment, the list of cyclic shifts corresponding to different roots can share the same cyclic shift. In other words, different lists of cyclic shifts can include the same cyclic shift. In one embodiment, the lists of cyclic shifts can partially overlap with each other (i.e., two lists of cyclic shifts can share at least one cyclic shift). In one embodiment, a sub-preamble can be generated based on different roots and the same cyclic shift (e.g., based on a ZC sequence characterized by different roots and the same cyclic shift).

[0153] As mentioned above, an exemplary NTN is characterized by high frequency offset and huge time offset. In this case, the correlation peak corresponding to the wireless network terminal preamble can be shifted to another user’s detection window, resulting in a false detection result. To address the issue caused by high frequency offset, the proposed preamble employs different roots to facilitate high frequency offset estimation. In addition, at least one sub-preamble in each part of the proposed preamble is concatenated in time domain to cope with huge time offset. Furthermore, the combination of correlation peaks (e.g., the interval between cyclic shifts in a list of cyclic shifts) can be used to identify a particular user.

[0154] In the following, various embodiments of the proposed preamble are illustrated to illustrate more details of the proposed preamble.

[0155] Figure 3 A schematic diagram of a preamble according to an embodiment of the disclosure is shown. As Figure 3 shown, two roots u1 and u2 are used, and the list of cyclic shifts corresponding to the roots u1 and u2 are (v 11 , v 12 ,..., v 1n ) and (v 21 , v 22 ,..., v 2m ), respectively. In this embodiment, the sub-preamble is divided into two parts P1 and P2, where part P1 has a prefix CP1 and includes sub-preambles generated based on a ZC sequence characterized by a root u1 and a list of cyclic shifts (v 11 , v 12 ,..., v 1n ), part P2 has a prefix CP2 and includes sub-preambles generated based on a ZC sequence characterized by a root u2 and a list of cyclic shifts (v21 , v 22 ,..., v 2m ) are sub-preambles generated from ZC sequences characterized by (v 11 , v 12 ,..., v 1n ) and / or (v 21 , v 22 ,..., v 2m ). In this example, not only the sub-preambles in each of the parts P1 and P2 are connected in time domain, but also the parts P1 and P2 are connected in time domain to form a preamble.

[0156] In one example, the cyclic shift lists (v 11 , v 12 ,..., v 1n ) and / or (v 21 , v 22 ,..., v 2m ) are unique signatures for identifying a preamble transmitted from a specific user in a random access procedure. The difference between the cyclic shift lists is the interval (e.g. gap) between each two cyclic shifts in the cyclic shift list (e.g. the interval between each two adjacent cyclic shifts (i.e. v 12 -v 11 , v 13 -v 12 ,..., v 1n -v 1(n-1) ). When two cyclic shift lists are considered to be the same, the two cyclic shift lists should overlap each other with respect to the cyclic shift s over the length L (i.e. the interval between cyclic shifts in one cyclic shift list is the same as the corresponding interval between cyclic shifts in the other cyclic shift list).

[0157] In one embodiment,

[0158] Figure 4 A table showing an exemplary cyclic shift list pool according to an embodiment of the disclosure is shown. In this embodiment, the cyclic shift list includes two cyclic shifts v 11 and v 12 , and the length L (of the ZC sequence) is 839. In Example 1 shown in Figure 4 , the two cyclic shift lists are different from each other because the intervals between the cyclic shifts v 11 and v 12 are 24 and 88 respectively, which are obviously different. Unlike Example 1, the two cyclic shift lists in Example 2 are considered to be the same because the intervals between the adjacent cyclic shifts v 11 and v 12 in the two cyclic shift lists are both 24. Therefore, the cyclic shift list pool of Example 2 is an incorrect example because the two cyclic shift lists overlap each other. Similarly to Example 2, Figure 4Example 3 shown is also an incorrect example because the cyclic shift list (830, 14) overlaps with the cyclic shift list (0, 23) in length L ((830, 14) = {[(0, 23) + 830] mod 839}, where "mod" is the modulo function that returns the remainder of a number divided by another number).

[0159] In one embodiment, the mapping between the cyclic shift lists on any two different roots must be a one-to-one mapping. In other words, once the cyclic shift list is determined for one of the multiple roots, the cyclic shift list corresponding to the remaining roots is also determined. For example, in the embodiment of Figure 3 the cyclic shift lists (v 11 , v 12 ,..., v 1n ) and (v 21 , v 22 ,..., v 2m ) used in the embodiment can also be selected (by the wireless network terminal or the wireless network node) from two same or different cyclic shift list pools. Since there is a one-to-one mapping relationship between the cyclic shift lists (v 11 , v 12 ,..., v 1n ) and (v 21 , v 22 ,..., v 2m ), when the cyclic shift list (v 21 , v 22 ,..., v 2m ) is selected, the cyclic shift list (v 11 , v 12 ,..., v 1n ) is also determined, and vice versa.

[0160] In one example, Figure 3 The prefixes CP1 and CP2 shown can be spaces or generated based on the tail of the corresponding part.

[0161] In the embodiment shown, Figure 3 each part of the preamble does not have a suffix.

[0162] Figure 5 A schematic diagram of a preamble is shown according to an embodiment of the present disclosure. In this embodiment, the preamble includes a sub-preamble generated based on a root u1 and a cyclic shift list (v 11 , v 12 ) and a sub-preamble generated based on a root u2 and a cyclic shift list (v 21 , v 22) generated sub-preamble. Furthermore, the sub-preamble is divided into two parts P1 and P2, where part P1 has prefix CP1 and part P2 has prefix CP2. In one example, the period of each of the prefixes CP1 and CP2 is larger than the maximum time offset. For example, the maximum time offset can be the maximum differential round trip delay in a low earth orbit (LEO) beam (e.g., 1.5 ms). In one example, prefix CP1 is generated from concatenated sub-preambles based on root u1 and a list of cyclic shifts (v 11 , v 12 ) generated sub-preamble. Furthermore, the sub-preamble is divided into two parts P1 and P2, where part P1 has prefix CP1 and part P2 has prefix CP2. In one example, the period of each of the prefixes CP1 and CP2 is larger than the maximum time offset. For example, the maximum time offset can be the maximum differential round trip delay in a low earth orbit (LEO) beam (e.g., 1.5 ms). In one example, prefix CP1 is generated from concatenated sub-preambles based on root u1 and a list of cyclic shifts (v 21 , v 22 ) generated sub-preamble. Furthermore, the sub-preamble is divided into two parts P1 and P2, where part P1 has prefix CP1 and part P2 has prefix CP2. In one example, the period of each of the prefixes CP1 and CP2 is larger than the maximum time offset. For example, the maximum time offset can be the maximum differential round trip delay in a low earth orbit (LEO) beam (e.g., 1.5 ms). In one example, prefix CP1 is generated from concatenated sub-preambles based on root u1 and a list of cyclic shifts (v 11 and v 12 and / or cyclic shifts v 21 and v 22 ) identifies different users.

[0163] Figure 6 A schematic diagram of a preamble is shown in accordance with an embodiment of the disclosure. Similar to the preamble shown in Figure 5 , the preamble of Figure 6 includes sub-preambles generated based on root u1 and a list of cyclic shifts (v 11 , v 12 ) and sub-preambles generated based on root u2 and a list of cyclic shifts (v 21 , v 22 ), and the sub-preambles are divided into parts P1 and P2, which have prefixes CP1 and CP2, respectively. In 6, part P1 includes sub-preambles generated based on root u1 and cyclic shifts v 11 and sub-preambles generated based on root u2 and cyclic shifts v 21 ; and part P2 includes sub-preambles generated based on root u2 and cyclic shifts v 12 and sub-preambles generated based on root u2 and cyclic shifts v 22 . That is, sub-preambles in the same part of the preamble can be generated based on different roots.

[0164] Figure 7 A schematic diagram of a preamble is shown in accordance with an embodiment of the disclosure. Figure 7 The embodiment shown is similar to the embodiment shown in Figure 5 , so functionally similar components use the same reference numerals. In one embodiment, each part of the preamble can have a suffix. In Figure 7 , part P2 includes prefix CP2 and sub-preambles generated based on root u2 and a list of cyclic shifts (v 21 , v 22The generated sub-preamble portion P2 has a suffix SU. In one example, the suffix SU includes, for example, data transmitted on the Physical Uplink Shared Channel (PUSCH). Furthermore, there is a space between the sub-preamble and the suffix SU. The space can also be considered part of the suffix SU. In other words, the suffix SU can be (e.g., including) a mixture of spaces and data.

[0165] Figure 8 A schematic diagram of the preamble according to an embodiment of this disclosure is shown. Similar to... Figure 5 The leading element shown, Figure 8 The preamble includes sub-preambles generated based on roots u1 and u2, and each sub-preamble is divided into two parts, P1 and P2, with prefixes CP1 and CP2 respectively. In this embodiment, the cyclic shift lists corresponding to roots u1 and u2 are (v1, v1) and (v2, v2). In other words, each root has only one corresponding cyclic shift. In such a case, every two different preambles in a cell (e.g., preambles of two different users) must have different roots to be distinguishable from each other. The total number of preambles in a single cell may be greatly reduced, which may increase the associated noise on the receiver (e.g., wireless network node) side. Note that... Figure 8 The leading edge shown can still withstand high-frequency offsets and large time offsets.

[0166] according to Figure 8 As shown in the leader, in one embodiment, the sub-leaders in each part of the leader may be the same.

[0167] Figure 9 A schematic diagram of the preamble according to an embodiment of this disclosure is shown. Similar to... Figure 5 The leading element shown, Figure 9 The leading elements shown include those based on root u1 and a circular shift list (v) 11 v 12 The generated subleader and the list based on root u2 and cyclic shift (v) 21 v 22 The generated sub-preamble. In this embodiment, the sub-preamble is divided into four parts P1, P2, P3 and P4, which have prefixes CP1, CP2, CP3 and CP4 respectively. Figure 9 The preamble shown is used when the frequency offset is large and the time offset is less than the length of one Orthogonal Frequency Division Multiplexing (OFDM) symbol. When receiving... Figure 9 As shown in the diagram, the receiver (e.g., a wireless network node) independently detects the location of the relevant peaks in each sub-preamble, and the detected locations can be used to estimate time and frequency offsets.

[0168] Figure 10 A schematic diagram of the preamble according to an embodiment of the present disclosure is shown. (As shown) Figure 5As shown, each root can have more than one cyclic shift to expand the total number of preambles in a single cell. At the receiving side, the correlation peaks of different cyclic shifts are mixed and need to be distinguished according to the distance between the correlation peaks (e.g., corresponding to the interval between cyclic shifts). In one example, the peaks resulting from different cyclic shifts can be separated by a prefix. With this in mind, the preambles in Figure 10 The sub-preambles in the preambles shown are divided into four parts P1, P2, P3, and P4 and each part P1, P2, P3, and P4 has a prefix. Thus, the parts P1, P2, P3, and P4 can be independently correlated and the four correlation peaks detected do not affect each other.

[0169] Figure 11 A schematic diagram of a preamble according to an embodiment of the disclosure is shown. In this embodiment, a suffix is used as PUSCH to transmit some data together with the PRACH preamble. In Figure 11 The preamble includes a sub-preamble generated based on root u1 and cyclic shift v1 and a sub-preamble generated based on root u2 and cyclic shift v2. The sub-preambles are divided into two parts P1 and P2, which have prefixes CP1 and CP2, respectively. In this embodiment, the parts P1 and P2 have suffixes SU1 and SU2, respectively, which are used to transmit data together with the preamble of PRACH. In one example, the data is transmitted in PUSCH and the location of the PUSCH is determined by the location of the corresponding sub-preamble.

[0170] Figure 12 A schematic diagram of a preamble according to an embodiment of the disclosure is shown. Figure 12 The embodiment shown is similar to Figure 11 As shown, functionally similar components use the same symbols. Unlike Figure 11 The preamble shown, Figure 12 The preamble shown has 2 spaces between the sub-preamble and the suffix. In one example, the spaces can be considered as part of the suffix. In other words, the suffixes SU1 and SU2 are a mix of spaces and data, or the suffixes SU1 and SU2 include spaces and data. In another example, the suffixes SU1 and SU2 include spaces only.

[0171] In one embodiment, the spaces between the sub-preamble and the suffix are predefined in the preamble structure.

[0172] In one embodiment, the spaces between the sub-preamble and the suffix exist due to the limitation of predefined rules of wireless communication. For example, the spaces can be a set of resources where, for example, the predefined rules do not allow the wireless network terminal to transmit the suffix (i.e., data of PUSCH).

[0173] In one embodiment, the sub-preambles in different parts can not be connected in the time domain.

[0174] Figure 13 A schematic diagram of a preamble according to an embodiment of the disclosure is shown. In this embodiment, the preamble comprises sub-preambles generated based on a root u1 and a list of cyclic shifts (v 11 , v 12 ) and sub-preambles generated based on a root u2 and a list of cyclic shifts (v 21 , v 22 ). Furthermore, the sub-preambles are divided into two parts, one of which has a prefix CP1 and the other has a prefix CP2. As shown in Figure 13 , the sub-preambles corresponding to the same part are concatenated in time domain and the parts are distributed on different frequency points. Note that in Figure 13 , the frequency points distributed to the parts are adjacent. In one embodiment, the frequency points distributed to the parts can be separated. That is, the parts can be distributed separately on the same time point but on different frequency points.

[0175] Figure 14 A schematic diagram of a preamble according to an embodiment of the disclosure is shown. In the scenario of Internet of Things (loT), the signal needs to be transmitted in a narrow band. Since the proposed preamble is able to resist high frequency offset due to the adoption of multiple roots, the frequency band required by the proposed preamble can be very small even if the communication channel has high frequency offset. As shown in Figure 14 , the preamble comprises sub-preambles generated based on a root u1 and a list of cyclic shifts (v 11 , v 12 ) and sub-preambles generated based on a root u2 and a list of cyclic shifts (v 21 , v 22 ). The preamble comprises two parts, each of which is transmitted by resource elements (REs) with different indices. In this embodiment, the preamble occupies only one RE at the same time. That is, the parts of the preamble can be transmitted on at least one RE. In one embodiment, the proposed preamble can occupy several REs or several subcarriers at the same time.

[0176] Figure 15 A schematic diagram of a preamble according to an embodiment of the disclosure is shown. Similar to the embodiment shown in Figure 13 , the preamble comprises sub-preambles generated based on a root u1 and a list of cyclic shifts (v 11 , v 12 ) and sub-preambles generated based on a root u2 and a list of cyclic shifts (v 21 , v 22 ), the sub-preambles are divided into two parts, one of which has a prefix CP1 and the other has a prefix CP2. In this embodiment, the sub-preambles corresponding to the same part are concatenated in time domain and the parts are distributed on different random access channel (RACH) occasions (ROs). As shown in Figure 13as shown, including a prefix CP1 and a part of the preamble generated based on a root u1 and a list of cyclic shifts (v 11 , v 12 ) is distributed (e.g., transmitted) at a RACH occasion RO1, and including a prefix CP2 and a part of the preamble generated based on a root u2 and a list of cyclic shifts (v 21 , v 22 ) is distributed at a RACH occasion RO2.

[0177] In one embodiment, the RACH occasions at which the parts of the preamble are distributed are indicated by the receiver (e.g., a wireless network node). For example, the receiver can transmit (e.g., broadcast) occasion configuration information (e.g., signaling) to the wireless network terminal to indicate the RACH occasions at which the parts of the preamble are distributed. For example, the receiver can transmit the occasion configuration information in a system information block (SIB).

[0178] In one example, the occasion configuration information is configured to indicate at least one index offset between two adjacent RACH occasions among a plurality of RACH occasions, and the wireless network terminal is able to determine the plurality of RACH occasions based on a first RACH occasion at which the first part is transmitted and the at least one index offset. More specifically, there can be a plurality of RACH occasion candidates marked by respective numerical indices. After receiving the RACH occasion configuration indicating at least one index offset among the indices of the plurality of RACH occasion candidates, the wireless network terminal determines a first RACH occasion at which the first part among the plurality of parts is transmitted, and determines the remaining RACH occasions at which the remaining parts are transmitted based on the first RACH occasion and the at least one index offset.

[0179] In one example, the preamble is divided into two parts and each part includes at least one sub-preamble. In this example, the occasion configuration information received from the receiver can indicate one index offset Δindex. Based on the indicated index offset Δindex and the RACH occasion at which one part of the preamble is transmitted, the wireless network terminal is able to determine the RACH occasion at which the other part of the preamble is transmitted.

[0180] In one example, the preamble is divided into three parts and each part includes at least one sub-preamble. In this example, the occasion configuration information received from the receiver can indicate two index offsets Δindex1 and Δindex2. Based on the indicated index offsets Δindex1 and Δindex2 and the RACH occasion at which one part of the preamble is transmitted, the wireless network terminal is able to determine the RACH occasions at which the remaining two parts of the preamble are transmitted.

[0181] In one example, the timing configuration information indicates at least one time offset and / or at least one frequency offset. In this example, the wireless network terminal is able to determine the plurality of RACH occasions based on the RACH occasion of transmitting the first part, the at least one time offset and / or the at least one frequency offset.

[0182] In one example, the preamble is divided into two parts and each part includes at least one sub-preamble. In this example, the timing configuration information received from the receiver indicates one time offset At and one frequency offset Af. Based on the indicated time offset At, frequency offset Af and the RACH occasion of transmitting one part of the preamble, the wireless network terminal is able to determine the RACH occasion of transmitting the other part of the preamble.

[0183] Figure 16 A schematic diagram showing a procedure according to an embodiment of the disclosure is shown. In this embodiment, the preamble transmitted by the wireless network terminal to the wireless network node (e.g. the receiver) includes two parts SPG1 and SPG2 (e.g. as shown in Figure 15 As shown, the part including the prefix CP1 and the sub-preambles generated based on the list of cyclic shifts (v 21 , v 22 ) and the part including the prefix CP2 and the sub-preambles generated based on the list of cyclic shifts (v 21 , v 22 ) are shown. As shown, the wireless network node broadcasts the RACH occasion configuration information to the wireless network terminal. After receiving the RACH occasion configuration information, the wireless network terminal is able to determine the first RACH occasion of transmitting one of the parts SPG1 and SPG2 and determine the second RACH occasion of transmitting the other of the parts SPG1 and SPG2 based on the first RACH and the RACH occasion configuration information. Thus, the wireless network terminal can transmit the parts SPG1 and SPG2 at the first RACH occasion and the second RACH occasion respectively. Figure 16

[0184] Figure 17 A schematic diagram showing a table of positioning the RACH occasions of transmitting the parts according to an embodiment of the disclosure is shown. In this embodiment, the number of RACH occasions at one time stamp in the frequency domain is 2 (e.g. set the parameter msg1-FDM to 2), the RACH occasions at one frequency point are marked with odd indices, and the RACH occasions at another frequency point are marked with even indices. In addition, the preamble transmitted by the wireless network terminal to the receiver includes two parts SPG1 and SPG2. As shown, Figure 17 the RACH occasions marked with odd indices are allocated to the part SPG1, and the RACH occasions marked with even indices are allocated to the part SPG2.

[0185] Figure 18 ​A diagram showing a table of RACH occasions in which a preamble is transmitted is shown. In this embodiment, the number of RACH occasions located in one time stamp in the frequency domain is 1, and the RACH occasions are marked with an index starting from 0. In addition, the preamble transmitted by the wireless network terminal to the receiver includes two parts, SPG1 and SPG2. As shown in Figure 18 , the RACH occasions marked with even indices are allocated to the part SPG1, and the RACH occasions marked with odd indices are allocated to the part SPG2. That is, the allocation of the RACH occasions corresponding to the parts SPG1 and SPG2 is interleaved in the time domain.

[0186] In one embodiment, Figure 17 or the table shown in 18 is predefined in the wireless network terminal. In this case, the wireless network terminal can receive an indication (e.g., Figure 16 , the occasion configuration information) indicating at least one index item of the table, and determine the RACH occasions in which different parts of the preamble are transmitted.

[0187] In one embodiment, an RO (RACH occasion) is defined as a set of time-frequency resources in which a preamble is transmitted. The minimum unit of the time-frequency resources in the frequency domain can be a resource block (RB), a physical RB (PRB), or an RE or a subcarrier. While the minimum unit of the time-frequency resources in the time domain can be a symbol, a slot, a subframe, or a frame.

[0188] Figure 19 A diagram showing a preamble according to an embodiment of the present disclosure is shown. In this embodiment, the preamble includes sub-preambles generated based on a root u1 and a cyclic shift list (v 11 , v 12 , v 13 , v 14 ) and sub-preambles generated based on a root u2 and a cyclic shift list (v 21 , v 22 , v 23 , v 24 ), and the sub-preambles are divided into two parts, where the sub-preambles in each part are connected in the time domain. Note that Figure 19 , the part shown in has no prefix. Alternatively, Figure 19 , the part shown in has a prefix of 0. In this case, the cyclic shifts v 11 , v 12 , v 13 , v 14 , v 21 , v 22 , v 23 , v 24 should be specially designed for time and frequency offsets. In one example, the cyclic shifts v 11 , v 12 , v13 , v 14 , v 21 , v 22 , v 23 , v 24 are designed to satisfy v 11 = v 12 = v 13 = v 14 and v 21 = v 22 = v 23 = v 24 , and the receiver is able to estimate time and frequency offsets based on the preamble.

[0189] Figure 20 A schematic diagram of a preamble is shown in accordance with an embodiment of the disclosure. Similar to the embodiment shown in Figure 11 , the preamble includes sub-preambles generated based on root u1 and cyclic shift list (v 11 , v 12 ) and sub-preambles generated based on root u2 and cyclic shift list (v 21 , v 22 ). The sub-preambles are divided into two parts, one part with prefix CP1 and suffix SU1, and the other part with prefix CP2 and suffix SU2. In this embodiment, sub-preambles corresponding to the same part are concatenated with the corresponding prefix and suffix in time domain, and these parts are distributed in different RACH occasions. In one example, there can be a space between the suffix and the last sub-preamble of the part, or the suffix is a mix of space and data (e.g., the embodiment shown in Figure 12 .

[0190] Figure 21 A schematic diagram of a preamble is shown in accordance with an embodiment of the disclosure. Figure 21 The embodiment shown is similar to Figure 20 , functionally similar components use the same symbols. Unlike the preamble shown in Figure 20 , Figure 21 the preamble shown does not have prefixes CP1 and CP2 (e.g., the embodiment shown in Figure 19 adds suffixes SU1 and SU2, respectively).

[0191] According to one embodiment, the preamble proposed by the present disclosure can at least include the following features:

[0192] (1) The proposed preamble includes at least one part;

[0193] (2) Each of the at least one part includes at least one sub-preamble concatenated in time domain.

[0194] (3) Each sub-preamble is generated based on a ZC sequence having a length L and characterized by a root u and a cyclic shift v.

[0195] (4) The sub-preamble is generated based on a plurality of roots.

[0196] (5) Each of the at least one portion can have a prefix, wherein the prefix is obtained from a tail of each of the at least one portion.

[0197] (6) At least one of the at least one portion can have a suffix, wherein the suffix can include a space and / or data (e.g., PUSCH data).

[0198] (7) The at least one portion can be distributed in time domain and / or frequency domain. A time point and a frequency point of one of the at least one portion can be used to determine a time point and a frequency point of another of the at least one portion.

[0199] (8) The preamble can be represented as:

[0200]

[0201] wherein the preamble is generated based on a root and a list of cyclic shifts .

[0202] (9) The list of cyclic shifts used to generate the sub-preamble can be a unique signature used to distinguish a particular wireless network terminal in a random access procedure. In one example, the uniqueness of a single list of cyclic shifts lies in the spacing between adjacent cyclic shifts in the list of cyclic shifts. That is, when two lists of cyclic shifts are completely overlapped with each other (e.g., having a cyclic shift S over a length L), they are considered to be identical.

[0203] (10) The rule described in item (9) applies to each list of cyclic shifts for all the plurality of roots.

[0204] (11) The mapping between the lists of cyclic shifts over any two different roots can be a one-to-one mapping. In other words, when a list of cyclic shifts is selected for one of the plurality of roots, if the mapping between the lists of cyclic shifts over any two different roots is designed to be a one-to-one mapping, then all the lists of cyclic shifts for the remaining roots are determined.

[0205] Note that the number of portions included in the preamble can be at least two. In other words, the preamble can include a plurality of portions.

[0206] The proposed preamble is able to solve the problems caused by high frequency offset and large time offset. More specifically, the receiver (e.g., a wireless network node) is able to estimate the frequency offset because multiple roots are used to generate the sub-preambles included in the preamble. Moreover, since at least one sub-preamble in the same part of the preamble is connected in the time domain, the tolerable time offset of the wireless communication between the wireless network terminal and the receiver is effectively extended. In addition, if the signatures of each cyclic shift list are used to distinguish the wireless network terminals, the capacity of the signature pool is easily extended (depending on the length of each cyclic shift list). Therefore, the proposed preamble is suitable for NTN applications.

[0207] In one embodiment, each part in the proposed preamble shown in the above embodiments can be regarded as a single preamble. In another embodiment, multiple parts in the proposed preamble shown in the above embodiments can be regarded as a single preamble. In other words, in one embodiment, the wireless network terminal can send multiple preambles to the wireless network node to perform the random access procedure. According to Figures 3 to 21 In the illustrated embodiment, each of the multiple preambles includes at least one part, each of the at least one part includes at least one sub-preamble, and the sub-preambles in the multiple preambles are generated based on multiple roots.

[0208] In one embodiment, the sub-preambles in each of the multiple preambles are generated based on the same root (i.e., the ZC sequence used by each of the multiple preambles is characterized by the same root).

[0209] In one embodiment, each of the at least one part can have a prefix. For example, the prefix is a cyclic prefix generated based on the tail of the corresponding part.

[0210] In one embodiment, each of the at least one part can have a suffix. In one example, the suffix includes at least one data or space.

[0211] In one embodiment, the wireless network terminal can be configured by, for example, a wireless network node to send multiple preambles to perform the random access procedure. For example, the wireless network terminal can be configured by radio resource control (RRC) signaling, a system information block (SIB), and / or a master information block (MIB).

[0212] As Figures 13 to 21 illustrated, the multiple preambles can be sent at different frequency points and / or at different time points. Moreover, at least one preamble can be sent at different RACH occasions or different REs.

[0213] Figure 22A schematic diagram of a preamble according to an embodiment of the present disclosure is shown. In this embodiment, a wireless network terminal sends two preambles, PRE1 and PRE2, to a wireless network node to perform a random access procedure. Preamble PRE1 includes a root u1 and a cyclic shift list (v 11 v 12 The generated sub-preamble, Preamble PRE2, includes sub-preambles based on root u2 and cyclic shift list (v 21 v 22 The generated sub-leader. Figure 22 In this example, the leading PRE1 and PRE2 are connected in the time domain. In this embodiment, each of the leading PRE1 and PRE2 has only one part, which is not labeled for simplicity.

[0214] Figure 23 A schematic diagram of the preamble according to an embodiment of the present disclosure is shown. Figure 23 In the illustrated embodiment, the wireless network terminal sends two preambles, PRE1 and PRE2, to the wireless network node to perform (e.g., initiate) a random access procedure. Preamble PRE1 comprises two parts, P1 and P2, wherein part P1 of preamble PRE1 includes a root u1 and a cyclic shift v. 11 The two generated sub-precursors, part P2 of precursor PRE1, includes a component based on root u1 and cyclic shift v. 12 Two sub-preambles are generated. Similarly, preamble PRE2 comprises two parts P1 and P2, wherein part P1 of preamble PRE2 comprises parts based on root u2 and cyclic shift v. 21 The two generated sub-precursors, part P2 of precursor PRE2, includes a component based on root u2 and cyclic shift v. 22 Two sub-leaders are generated. Note that the number of sections and / or the number of sub-leaders in each section may vary depending on the leader.

[0215] In one embodiment, a wireless network terminal can generate multiple groups, each of which includes at least one candidate preamble, and at least one candidate preamble in each of the multiple groups is generated based on multiple roots. In one example, at least one candidate preamble in each of the multiple groups is generated based on the same root. That is, sub-preambles belonging to the same group are generated based on the same root (i.e., based on ZC sequences characterized by the same root). Note that at least one candidate preamble in each of the multiple groups can be generated based on different cyclic shifts. That is, at least one candidate preamble in each of the multiple groups can be generated based on the same root but different cyclic shifts.

[0216] In embodiments where a wireless network terminal generates multiple groups, the wireless network terminal can select (e.g., determine) multiple preambles from multiple groups as multiple preambles to be sent to the wireless network node to perform a random access procedure. For example, the wireless network terminal can generate NL a number of N M selected groups, select one preamble from each of the selected N M groups, and transmit the selected N M preambles to the wireless network node to perform the random access procedure, where N L ≥ N M ≥ 2.

[0217] In one embodiment, the number of selected preambles (i.e., N M ) is configured, for example, by the wireless network node via at least one of RRC signaling, SIB, and / or MIB.

[0218] In one embodiment, the selected N M groups can be selected (e.g., determined) based on roots corresponding to each of the N L groups (e.g., used by them). For example, there can be multiple candidate root sets, and each candidate root set includes multiple candidate roots. Note that at least one of the multiple candidate roots in each candidate root set is different from the other candidate roots in the same candidate root set. In this example, the wireless network terminal selects one of the multiple candidate root sets, selects groups corresponding to the multiple candidate roots in the selected candidate root set, and selects one candidate preamble from each of the selected groups as one of the multiple preambles transmitted to the wireless network node to perform the random access procedure.

[0219] In one embodiment, the multiple candidate root sets are predefined in the wireless network terminal.

[0220] In one embodiment, the multiple candidate root sets are indicated by the wireless network node, for example, via at least one of RRC signaling, SIB, or MIB.

[0221] In one embodiment, the number of selected preambles (i.e., N M ) is determined based on the number of roots in the selected candidate root set.

[0222] In one embodiment, the frequency point, time point, RO, and / or RE at which the selected N M preambles are transmitted is determined in a manner similar to the embodiment shown in Figures 13 to 21 .

[0223] In one embodiment, the frequency point, time point, RO, and / or RE at which the selected N M preambles are transmitted is predefined. For example, the selected N M preambles can be transmitted at adjacent frequency points, time points, ROs, and / or REs.

[0224] In one embodiment, a wireless network terminal may generate multiple candidate preambles based on multiple roots, and select (e.g., determine) multiple preambles from the multiple candidate preambles as multiple preambles to be sent to the wireless network node to perform a random access procedure. Note that the number of multiple candidate preambles may be greater than the number of multiple roots, and the selected multiple preambles may be generated based on different roots. For example, the wireless network terminal may be based on N... K (N H ≥N K ≥2) roots generate N H One leading element, select N. M N leading (N) M ≥2) and select N M A preamble is sent to the wireless network node to perform the random access procedure, wherein the selected N M Each leader is generated based on a different root.

[0225] In one embodiment, the number of selected leaders (i.e., N) M For example, it can be configured by a wireless network node via RRC signaling, SIB, and / or MIB.

[0226] In one embodiment, the number of selected leaders (i.e., N) M The number of roots in the selected candidate root set is determined.

[0227] In one embodiment, multiple candidate root sets may exist, and each candidate root set may include multiple candidate roots. In this example, the wireless network terminal selects one of the multiple candidate root sets, and selects N based on the multiple candidate roots in the selected candidate root set. M A leading figure.

[0228] In one embodiment, multiple candidate root sets are predefined in the wireless network terminal.

[0229] In one embodiment, multiple candidate root sets are indicated by a wireless network node, for example, via at least one of RRC signaling, SIB, or MIB.

[0230] In one embodiment, similar to Figures 13 to 21 The illustrated embodiment determines the method for sending the selected N. M The frequency, time, RO and / or RE of the preamble.

[0231] In one embodiment, send the selected N M The frequency, time, RO, and / or RE of each preamble are predefined. For example, the selected N... M A preamble can be transmitted at adjacent frequency points, time points, ROs, and / or REs.

[0232] In one embodiment, the configuration of the plurality of preambles is configured, e.g., by the wireless network node, via RRC signaling, SIB, and / or MIB.

[0233] Figure 24 A flowchart of a process according to an embodiment of the disclosure is shown. Figure 24 The illustrated process can be performed by the wireless terminal 10 to perform a random access procedure with a wireless network node, e.g., of an NTN. Figure 24 The illustrated process can be compiled into program code including the following steps:

[0234] Step 2400: Transmitting a preamble comprising at least one part, wherein each of the at least one part comprises at least one sub-preamble, and the sub-preambles are generated based on a plurality of roots.

[0235] Based on Figure 24 The illustrated process, the wireless terminal transmits a preamble to a wireless network node to perform a random access procedure with the wireless network node. The preamble comprises at least one part, and each of the at least one part comprises at least one sub-preamble. In one example, the preamble comprises a plurality of parts. Note that the sub-preambles in the preamble are generated based on a plurality of roots (e.g., roots used to characterize ZC sequences that generate each sub-preamble). Thus, the wireless network node is able to estimate a frequency offset in wireless communication with the wireless terminal and is able to detect the preamble accordingly even if there is a high frequency offset. Detailed configurations of the preamble can be referred to Figures 3 to 21 and corresponding explanations are not described here for brevity. After the wireless network node receives and detects the preamble, the wireless network node can perform further operations to complete the random access procedure and / or perform wireless communication with the wireless network terminal.

[0236] Figure 25 A flowchart of a process according to an embodiment of the disclosure is shown. Figure 25 The illustrated process can be performed by the wireless network node 20 to perform a random access procedure with a wireless network terminal. The wireless network node can be in an NTN. Figure 25 The illustrated process can be compiled into program code including the following steps:

[0237] Step 2500: Receiving a preamble comprising at least one part, wherein each of the at least one part comprises at least one sub-preamble, and the sub-preambles in the plurality of parts are generated based on a plurality of roots.

[0238] Based on Figure 25The illustrated process can be performed by a wireless terminal 10 to perform a random access procedure with a wireless network node, e.g., of an NTN. Figures 3 to 21 The detailed configuration of the preamble can be referred to The illustrated process can be performed by a wireless terminal 10 to perform a random access procedure with a wireless network node, e.g., of an NTN.

[0239] The illustrated process can be performed by a wireless terminal 10 to perform a random access procedure with a wireless network node, e.g., of an NTN. Figure 26 A flowchart of a process according to an embodiment of the disclosure is shown. Figure 26 The illustrated process can be performed by a wireless terminal 10 to perform a random access procedure with a wireless network node, e.g., of an NTN. Figure 26 The illustrated process can be compiled into program code including the following steps: The illustrated process can be performed by a wireless terminal 10 to perform a random access procedure with a wireless network node, e.g., of an NTN.

[0240] Step 2600: transmitting a plurality of preambles, wherein each of the plurality of preambles comprises at least one part, each of the at least one part comprises at least one sub-preamble, and the sub-preambles in the plurality of preambles are generated based on a plurality of roots. The illustrated process can be performed by a wireless terminal 10 to perform a random access procedure with a wireless network node, e.g., of an NTN.

[0241] The detailed configuration of the preamble can be referred to Figure 26 The illustrated process can be performed by a wireless terminal 10 to perform a random access procedure with a wireless network node, e.g., of an NTN. Figures 3 to 23 The detailed configuration of the preamble can be referred to The illustrated process can be performed by a wireless terminal 10 to perform a random access procedure with a wireless network node, e.g., of an NTN.

[0242] The illustrated process can be performed by a wireless terminal 10 to perform a random access procedure with a wireless network node, e.g., of an NTN. Figure 27 A flowchart of a process according to an embodiment of the disclosure is shown. Figure 27 The illustrated process can be performed by a wireless terminal 10 to perform a random access procedure with a wireless network node, e.g., of an NTN.Figure 27 The illustrated process can be compiled into program code, including the following steps:

[0243] Step 2700: receiving a plurality of preambles, wherein each of the plurality of preambles includes at least one portion, each of the at least one portion includes at least one sub-preamble, and the sub-preambles in the plurality of preambles are generated based on a plurality of roots.

[0244] Based on Figure 27 The illustrated process, a wireless network node receives a plurality of preambles from a wireless network terminal, wherein each of the plurality of preambles includes at least one portion, each of the at least one portion includes at least one sub-preamble, and the sub-preambles in the plurality of preambles are generated based on a plurality of roots. In one example, the number of portions in the preamble can be more than one. Because the sub-preambles in the plurality of preambles are generated based on the plurality of roots, the wireless network node is able to estimate a frequency offset in a wireless communication with the wireless terminal, and the wireless network node is able to estimate the frequency offset in the wireless communication with the wireless terminal and detect the plurality of preambles accordingly even if there is a high frequency offset. The detailed configuration of the preamble can be referred to Figures 3 to 23 and the corresponding explanation is not described herein for brevity. After receiving and detecting the preambles, the wireless network node can perform further operations to complete a random access procedure and / or perform a wireless communication with the wireless network terminal.

[0245] While various embodiments of the present disclosure have been described above, it should be understood that they have been presented by way of example only, and not limitation. Likewise, the various figures can depict example architectures or configurations, which provide illustration of the various features and functionality described herein. It should be apparent, however, that the present disclosure is not limited to the architectures or configurations depicted, but rather, can be implemented using a variety of alternative architectures and configurations. Additionally, it is contemplated that one or more features of one embodiment can be combined with one or more features of another embodiment. Accordingly, the breadth and scope of the present disclosure should not be limited by any of the above-described example embodiments.

[0246] It should also be understood that any reference to an element herein using a designation such as "first," "second," and so forth does not limit the quantity or order of those elements. Rather, these designations can be used herein as a convenient method of distinguishing between two or more elements or instances of an element. Thus, a reference to first and second elements does not mean that only two elements can be employed, or that the first element must precede the second element.

[0247] Moreover, those skilled in the art will appreciate that the information and signals described above can be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, and symbols, which can be referenced throughout the above description can be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.

[0248] Those skilled in the art will further appreciate that any of the various illustrative logical blocks, units, processors, devices, circuits, methods and functions described in connection with the aspects disclosed herein can be implemented by electronic hardware (e.g., a digital implementation, an analog implementation, or a combination of the two), firmware, various forms of program or design code incorporating instructions (which can be referred to herein, for convenience, as "software" or a "software unit"), or any combination thereof.

[0249] To clearly illustrate this interchangeability of hardware, firmware and software, various illustrative components, blocks, units, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware, firmware or software, or combinations thereof, depends upon the particular application and design constraints imposed on the overall system. Skilled artisans can implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure. In accordance with various embodiments, a processor, device, component, circuit, structure, machine, unit, etc. can be configured to perform one or more of the functions described herein. As used herein, the terminology "configured to", "configured for" or "adapted to" refers to a processor, device, component, circuit, structure, machine, unit, etc. that is physically constructed, programmed and / or arranged as to perform a specified operation or function.

[0250] Further, those skilled in the art will appreciate that the various illustrative logical blocks, units, devices, components and circuits described herein can be implemented within or performed by an integrated circuit (IC) that includes a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, or a combination of these or any other suitable components. The logical blocks, units, and circuits can further include antennas and / or transceivers to communicate with various components within a network or within a device. The general purpose processor can be a microprocessor, but in the alternative, the processor can be any conventional processor, controller, or state machine. The processor can also be implemented as a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.

[0251] If implemented in software, the functions can be stored or transmitted over as one or more instructions or code on a computer-readable medium. Therefore, the steps of a method or algorithm disclosed herein can be implemented as software stored on a computer-readable medium. Computer- readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media can be any available media that can be accessed by a computer. By way of example, and not limitation, such computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer.

[0252] In this document, the term "unit" as used herein, refers to a software, firmware, hardware, and any combination of these elements for performing the related function descibed herein. Additionally, for the purposes of discussion, the various units are described as discrete units. However, it is apparent to those skilled in the art that two or more units can be combined to form a single unit that performs the associated functions according to the embodiments of the present disclosure.

[0253] In addition, in the embodiments of the present disclosure, a memory or other storage device and communication components can be employed. It will be appreciated that, for clarity, the above description has described the embodiments of the present disclosure with reference to different functional units and processors. However, it will be apparent that any appropriate functionality can be implemented in one or more of these functional units, processing logic elements, or domains without departing from the present disclosure. For example, functionality illustrated as being performed by separate processing logic elements or controllers can be performed by the same processing logic element or controller. Accordingly, references to particular functional units are only to that which is appropriate and are made to refer to suitable means for providing the described function rather than indicative of a strict logical or physical structure or organization.

[0254] Various modifications to the implementations described in this disclosure will be readily apparent to those skilled in the art, and the generic principles defined herein can be applied to other implementations without departing from the scope of this disclosure. Thus, the present disclosure is not intended to be limited to the implementations shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein and made apparent to others skilled in the art by the teachings herein.

Claims

1. A wireless communication method used in a wireless terminal, applied to non-terrestrial network (NTN) wireless communication, comprising: Send a preamble consisting of multiple parts to the wireless network node. Each of the plurality of parts includes a cyclic prefix and a plurality of sub-prefixes, the sub-prefixes in the plurality of parts being generated based on a plurality of roots, and the roots used to generate the sub-prefixes being different among the plurality of parts. The sub-leaders in the plurality of parts are generated based on different cyclic shift lists. The plurality of sub-preambles in each of the plurality of portions are connected in the time domain. The plurality of components are transmitted at the times of the plurality of random access channels (RACH).

2. The wireless communication method according to claim 1, wherein the plurality of sub-preambles in each of the plurality of portions are generated based on different roots.

3. The wireless communication method according to claim 1 or 2, wherein each of the plurality of parts does not have a suffix.

4. The wireless communication method according to claim 1 or 2, wherein the plurality of parts are connected in the time domain.

5. The wireless communication method according to claim 1 or 2, wherein the plurality of parts are transmitted at different frequency points.

6. The wireless communication method according to claim 1, further comprising: Receive timing configuration information indicating the multiple RACH timings from the wireless network node.

7. The wireless communication method of claim 6, wherein the timing configuration information indicates at least one index offset among the plurality of RACH timings.

8. The wireless communication method of claim 6, wherein the timing configuration information indicates at least one time offset among the plurality of RACH timings.

9. The wireless communication method of claim 6, wherein the timing configuration information indicates at least one frequency offset among the plurality of RACH timings.

10. The wireless communication method of claim 6, wherein the plurality of RACH timings are predefined as a table, and the timing configuration information indicates at least one index entry of the table.

11. The wireless communication method of claim 6, wherein the plurality of RACH timings are divided into a plurality of timing groups corresponding to the plurality of portions.

12. The wireless communication method according to any one of claims 1 to 2, 6 to 11, further comprising: Receive from the wireless network node preamble configuration information for generating the sub-preamble in the plurality of parts of the preamble; The preceding configuration information indicates the length of the Zadoff-Chu sequence and at least one of the plurality of roots or the plurality of cyclic shift lists.

13. A wireless communication method used in a wireless network node, applied to non-terrestrial network (NTN) wireless communication, comprising: Receive a preamble consisting of multiple parts from the wireless terminal. Each of the plurality of parts includes a cyclic prefix and a plurality of sub-prefixes, the sub-prefixes in the plurality of parts being generated based on a plurality of roots, and the roots used to generate the sub-prefixes being different among the plurality of parts. The sub-leaders in the plurality of parts are generated based on different cyclic shift lists. The plurality of sub-preambles in each of the plurality of portions are connected in the time domain. The plurality of portions are received at the times of the plurality of random access channels (RACH).

14. The wireless communication method of claim 13, wherein the plurality of sub-preambles in each of the plurality of portions are generated based on different roots.

15. The wireless communication method according to claim 13 or 14, wherein each of the plurality of parts does not have a suffix.

16. The wireless communication method according to claim 13 or 14, wherein the plurality of parts are connected in the time domain.

17. The wireless communication method according to claim 13 or 14, wherein the plurality of parts are received at different frequency points.

18. The wireless communication method according to claim 13, further comprising: Timing configuration information indicating the multiple RACH timings is sent to the wireless terminal.

19. The wireless communication method of claim 18, wherein the timing configuration information indicates at least one index offset among the plurality of RACH timings.

20. The wireless communication method of claim 18, wherein the timing configuration information indicates at least one time offset among the plurality of RACH timings.

21. The wireless communication method of claim 18, wherein the timing configuration information indicates at least one frequency offset among the plurality of RACH timings.

22. The wireless communication method of claim 18, wherein the plurality of RACH timings are predefined as a table, and the timing configuration information indicates at least one index entry of the table.

23. The wireless communication method of claim 18, wherein the plurality of RACH timings are divided into a plurality of timing groups corresponding to the plurality of portions.

24. The wireless communication method according to any one of claims 13 to 14, 18 to 23, further comprising: Send to the wireless terminal preamble configuration information for generating the sub-preamble in the plurality of parts of the preamble; The preceding configuration information indicates the length of the Zadoff-Chu sequence and at least one of the plurality of roots or the plurality of cyclic shift lists.

25. A wireless terminal for use in non-terrestrial network (NTN) wireless communication, comprising: The communication unit is configured to send a preamble consisting of multiple parts to the wireless network node. Each of the plurality of parts includes a cyclic prefix and a plurality of sub-prefixes, the sub-prefixes in the plurality of parts being generated based on a plurality of roots, and the roots used to generate the sub-prefixes being different among the plurality of parts. The sub-leaders in the plurality of parts are generated based on different cyclic shift lists. The plurality of sub-preambles in each of the plurality of portions are connected in the time domain. The plurality of components are transmitted at the times of the plurality of random access channels (RACH).

26. A wireless terminal, including a processor configured to perform the wireless communication method as claimed in any one of claims 2 to 12.

27. A wireless network node for use in non-terrestrial network (NTN) wireless communication, comprising: The communication unit is configured to receive a preamble comprising multiple parts from a wireless terminal. Each of the plurality of parts includes a cyclic prefix and a plurality of sub-prefixes, the sub-prefixes in the plurality of parts being generated based on a plurality of roots, and the roots used to generate the sub-prefixes being different among the plurality of parts. The sub-leaders in the plurality of parts are generated based on different cyclic shift lists. The plurality of sub-preambles in each of the plurality of portions are connected in the time domain. The plurality of portions are received at the times of the plurality of random access channels (RACH).

28. A wireless network node comprising a processor configured to perform a wireless communication method according to any one of claims 14 to 24.

29. A computer program product comprising computer-readable program medium code stored thereon, which, when executed by a processor, causes the processor to implement the method according to any one of claims 1 to 24.

Images