Pilot sequence generation method, communication apparatus, storage medium, and program product

Abstract

A pilot sequence generation method, a communication apparatus, a storage medium, and a program product. The method is applied to a first communication node, and comprises: on the basis of predefined information, determining at least one first pilot sequence from a pilot sequence set; mapping the at least one first pilot sequence to a physical resource to generate a pilot signal; and sending the pilot signal to a second communication node.

Description

Pilot sequence generation method, communication device, storage medium and program product

[0001] This disclosure claims priority to Chinese patent application No. 202510124959.4, filed on January 24, 2025, the entire contents of which are incorporated herein by reference. Technical Field

[0002] This disclosure relates to the field of communication technology, and in particular to a pilot sequence generation method, communication device, storage medium, and program product. Background Technology

[0003] In wireless communication, pilot signals are known signals. When transmitting data, the sender embeds pilot signals. These pilot signals are mainly used to identify the start position of the data and to help the receiver perform channel estimation, interference estimation, or sample frequency offset (SFO) estimation. Summary of the Invention

[0004] On the one hand, a pilot sequence generation method is provided, which is applied to a first communication node, including: determining at least one first pilot sequence from a set of pilot sequences based on predefined information; mapping the at least one first pilot sequence onto physical resources to generate a pilot signal; and sending the pilot signal to a second communication node.

[0005] On the other hand, a pilot sequence generation method is provided, which is applied to a second communication node, including: receiving a pilot signal from a first communication node on a physical resource, wherein the pilot signal is generated by mapping at least one first pilot sequence onto the physical resource, and the at least one first pilot sequence is determined from a set of pilot sequences based on predefined information.

[0006] On another front, a communication device is provided, applied to a first communication node. The device includes a processing module and a transmitting module. The processing module is used to determine at least one first pilot sequence from a set of pilot sequences based on predefined information. The processing module is also used to map the at least one first pilot sequence onto physical resources to generate a pilot signal. The transmitting module is used to transmit the pilot signal to a second communication node.

[0007] In another aspect, a communication device is provided for use in a second communication node, the device comprising: a receiving module. The receiving module is configured to receive pilot signals from a first communication node on physical resources, the pilot signals being generated by mapping at least one first pilot sequence onto the physical resources, the at least one first pilot sequence being determined from a set of pilot sequences based on predefined information.

[0008] In another aspect, a communication device is provided, comprising: a memory and a processor. The memory and the processor are coupled. The memory is used to store a computer program. When the processor executes the computer program, it implements the pilot sequence generation method described above.

[0009] In another aspect, a computer-readable storage medium is provided, on which computer program instructions are stored, which, when executed by a processor, implement the above-described pilot sequence generation method.

[0010] On the other hand, a computer program product is provided, which includes computer program instructions that, when executed, implement the pilot sequence generation method described above. Attached Figure Description

[0011] To more clearly illustrate the technical solutions in this disclosure, the accompanying drawings used in some embodiments of this disclosure will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of this disclosure. For those skilled in the art, other drawings can be obtained based on these drawings.

[0012] Figure 1 is a schematic diagram of a pilot sequence generation system according to some embodiments of the present disclosure.

[0013] Figure 2 is a flowchart illustrating a pilot sequence generation method according to some embodiments of the present disclosure.

[0014] Figure 3 is a flowchart illustrating another pilot sequence generation method according to some embodiments of the present disclosure.

[0015] Figure 4 is a schematic diagram of a sliding window operation according to some embodiments of the present disclosure.

[0016] Figure 5 is a schematic diagram of an information transmission block partitioning scheme according to some embodiments of the present disclosure.

[0017] Figure 6 is a schematic diagram of a pilot sequence partitioning scheme according to some embodiments of the present disclosure.

[0018] Figure 7 is a schematic diagram of a pilot sequence position according to some embodiments of the present disclosure.

[0019] Figure 8 is a flowchart illustrating another pilot sequence generation method according to some embodiments of the present disclosure.

[0020] Figure 9 is a flowchart illustrating another pilot sequence generation method according to some embodiments of the present disclosure.

[0021] Figure 10 is a block diagram of a communication device according to some embodiments of the present disclosure.

[0022] Figure 11 is a block diagram of another communication device according to some embodiments of the present disclosure.

[0023] Figure 12 is a block diagram of another communication device according to some embodiments of the present disclosure. Detailed Implementation

[0024] The technical solutions of this disclosure will now be clearly and completely described with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this disclosure, and not all embodiments. Based on the embodiments of this disclosure, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this disclosure.

[0025] It should be noted that, in this disclosure, the words "exemplarily" or "for example" are used to indicate examples, illustrations, or explanations. Any embodiment or design described as "exemplarily" or "for example" in this disclosure should not be construed as being more preferred or advantageous than other embodiments or designs. Specifically, the use of the words "exemplarily" or "for example" is intended to present the relevant concepts in a specific manner.

[0026] Hereinafter, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature.

[0027] In the description of this disclosure, unless otherwise stated, " / " means "or," for example, A / B can mean A or B. "And / or" in this document is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, and B alone. Furthermore, "at least one" means one or more, and "more than one" means two or more.

[0028] Passive Internet of Things (A-IoT) communication devices have energy storage and signal transmission capabilities, and can be divided into the following three types:

[0029] Device Type 1: Passive, no energy storage device, peak power consumption of approximately 1 microwatt (μW), with energy storage capability. The device has neither uplink (UL) nor downlink (DL) amplification. Signals are transmitted via backscattering, meaning the device's UL transmission is backscattered onto an externally provided carrier wave.

[0030] Device type 2a: Semi-active, with a small number of energy storage devices, peak power consumption of approximately several hundred microwatts, and energy storage capability. The device has DL and / or UL amplification capabilities. Signals are transmitted from the device to the reader in a backscattered manner (device-to-reader, D2R), meaning the device's UL transmission is backscattered on an externally provided carrier wave.

[0031] Device Type 2b: Active, with energy storage devices, peak power consumption of approximately several hundred microwatts, and energy storage capability. The device features DL and / or UL amplification. It autonomously generates and transmits D2R signals, meaning the device's UL transmission is generated internally.

[0032] With the development of passive IoT technology, the types of passive IoT communication devices may increase. For example, a device type 3 may be added, which has energy storage and signal generation functions, and its transmission power and / or power consumption are greater than that of device type 2b, reaching the megawatt (mW) level.

[0033] When a device needs charging, it receives a carrier wave for energy harvesting (CW for EH) sent by a reader to obtain the energy required for receiving and transmitting signals. Here, "reader" can also refer to a node or intermediate (forwarding) terminal (user equipment, UE). In passive IoT technology, due to the limited energy harvesting, the corresponding tag devices are very simple. When the device transmits signals in a backscattered manner, it needs to use a carrier wave for backscattering (CW for backscattering) sent by the reader to modulate the information to be transmitted onto the carrier wave for transmission.

[0034] Pilot signals mainly include the preamble, midamble, and postamble. In new radio (NR), the preamble is primarily used in the random access procedure and has the following main functions:

[0035] 1. Achieve uplink synchronization: Help the UE establish uplink synchronization with the base station (the next generation Node B, gNB) to ensure that the signals sent by the UE can be correctly received and understood by the base station.

[0036] 2. Identifying UE identity: The pilot signal itself does not contain explicit UE identity information, but it plays a role in identifying the UE during random access, enabling the base station to recognize that a UE is attempting to access the network.

[0037] 3. Selection of auxiliary resources: Based on the time and frequency location of the received pilot signal and the index of the pilot signal, the gNB determines the location and related situation of the UE, and then performs subsequent resource allocation and processing.

[0038] 4. Adaptable to different coverage scenarios: NR defines various pilot signal formats, including long formats (e.g., 0 / 1 / 2 / 3) and short formats (e.g., a1 / a2 / a3 / b1 / b2 / b3 / c0 / c2). Different pilot signals have different cyclic prefix lengths, preamble sequence lengths, guard interval lengths, and repetition counts, making them applicable to different coverage scenarios.

[0039] In radio frequency identification (RFID), a preamble typically refers to a specific code or sequence located at the beginning of a data packet. Its main functions include synchronization, helping the receiving device (e.g., a reader) and the transmitting tag device (e.g., a passive IoT communication device or terminal) to synchronize, ensuring the accuracy and timing consistency of data transmission. The preamble also identifies the beginning of a data packet, allowing the receiver to recognize the starting position of a new data packet. Additionally, the preamble can be used for channel estimation, interference estimation, and SFO estimation. The preamble has other names, such as prefix, preamble code, and preamble code sequence, which are not limited in this disclosure.

[0040] A midamble is characterized by information bits at the beginning and end of a sequence. It is typically located in the middle of a data packet (also called a data transmission block or information transmission block) and is used for further channel estimation, interference estimation, and SFO estimation. This helps the receiver to more accurately understand channel variations, thereby more effectively combating interference and noise in the channel. Midambles have other names, such as infix, intermediate cipher code, and intermediate cipher code sequence, and this disclosure is not limiting in this regard.

[0041] A postamble is a sequence of information bits preceding the data packet. It is typically located at the end of a data packet (also called a data transmission block or information transmission block) and is used to identify the end of the data. This helps the receiver accurately identify the boundaries of the data packet, thus correctly ending the reception and processing of data. Besides identifying the end of the data, postambles can also be used for other purposes, such as channel estimation, interference estimation, SFO estimation, verifying the integrity of data packets, and performing synchronization adjustments. These functions help improve the reliability and stability of communication systems. Postambles have other names, such as suffix, postamble code, postamble code sequence, etc., and this disclosure is not limiting in this regard.

[0042] However, pilot signals need to be generated based on pilot sequences, and the method for generating pilot sequences has not yet been determined. How to generate pilot sequences is an urgent problem to be solved.

[0043] This disclosure provides a pilot sequence generation method. Based on predefined information, at least one first pilot sequence is determined from a set of pilot sequences. Further, the at least one first pilot sequence is mapped onto physical resources to generate a pilot signal, which is then sent to a second communication node. That is, the predefined information can represent the requirements for pilot sequences under different coverage scenarios; different predefined information results in different pilot sequences determined from the set of pilot sequences. Therefore, if the pilot sequence determined from the set of pilot sequences according to the predefined information meets the requirements of the corresponding coverage scenario, then the pilot signal generated from the pilot sequence also meets the requirements of the corresponding coverage scenario. This achieves the generation of pilot sequences for different coverage scenarios.

[0044] As exemplarily shown in FIG1, a pilot sequence generation system according to an embodiment of the present disclosure may include a first communication node 101 and a second communication node 102. The first communication node 101 and the second communication node 102 may be one or more, and the number is not limited.

[0045] The first communication node 101 is connected to the second communication node 102. The first communication node 101 and the second communication node 102 are connected by wired or wireless means, which is not limited in this disclosure.

[0046] The first communication node 101 can, based on predefined information, determine at least one first pilot sequence from a set of pilot sequences, map the at least one first pilot sequence onto physical resources, generate pilot signals, and send pilot signals to the second communication node, thereby realizing the generation of pilot sequences and the transmission of pilot signals. The second communication node 102 is used to receive the pilot signals sent by the first communication node 101 on physical resources, thereby realizing the reception of pilot signals.

[0047] The first communication node 101 can also be called a tag side or a transmitting device. The second communication node 102 can also be called a receiving device.

[0048] In this embodiment, the first communication node 101 can be an A-IoT device or terminal. The second communication node 102 can be a reader. A terminal can be a device with wireless transceiver capabilities. Terminals can be mobile phones, tablets, computers with wireless transceiver capabilities, virtual reality (VR) terminals, augmented reality (AR) terminals, wireless terminals in industrial control, wireless terminals in self-driving, wireless terminals in remote medical care, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, wireless terminals in smart homes, etc. This embodiment does not limit the application scenarios. A terminal can sometimes also be referred to as a user, user equipment, access terminal, UE unit, UE station, mobile station, mobile station, remote station, transmitter, remote terminal, mobile device, UE terminal, wireless communication device, UE agent, or UE device, etc., and this embodiment does not limit these terms.

[0049] It should be noted that Figure 1 is only an exemplary framework diagram, and the number of devices included in Figure 1 and the names of each device are not limited.

[0050] The application scenarios of the embodiments disclosed herein are not limited. The system architecture and business scenarios described in the embodiments of this disclosure are for the purpose of more clearly illustrating the technical solutions of the embodiments of this disclosure, and do not constitute a limitation on the technical solutions provided by the embodiments of this disclosure. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided by the embodiments of this disclosure are also applicable to similar technical problems.

[0051] Figure 2 shows a flowchart of a pilot sequence generation method. As shown in Figure 2, this pilot sequence generation method is applied to the first communication node and includes steps S201-S203:

[0052] S201. Based on predefined information, determine at least one first pilot sequence from the set of pilot sequences.

[0053] The first message is used to request permission for the base station to directly forward data between the first terminal and the second terminal.

[0054] In some embodiments, different predefined information results in different determined first pilot sequences. The number of pilot sequence sets can be one or more. Each pilot sequence set can include at least one second pilot sequence. The pilot sequence sets can be obtained by the first communication node through signaling or predefined methods. The first communication node can obtain predefined information and, based on the predefined information, determine at least one first pilot sequence from the second pilot sequences included in one or more pilot sequence sets.

[0055] In other words, the predefined information can represent the pilot sequence requirements under different coverage scenarios. Different predefined information will result in different pilot sequences determined from the pilot sequence set. Therefore, based on the predefined information, the pilot sequences determined from the pilot sequence set meet the requirements of the corresponding coverage scenario. This enables the generation of pilot sequences for different coverage scenarios.

[0056] For example, the number of pilot sequence sets is one, which includes eight second pilot sequences. This set can be represented as {-1 -1 -1 1 1 -1 1 -1; -1 -1 1 1 1 1 -1 1; -1 1 -1 -1 1 1 1 1; -1 1 1 -1 1 -1 -1 -1; 1 -1 -1 1 -1 1 1 1; 1 -1 1 1 -1 -1 -1 -1; 1 1 -1 -1 -1 -1 -1 1 -1; 1 1 1 -1 -1 -1 1 -1 1}. At least one first pilot sequence determined from this set based on predefined information can be {-1 -1 -1 1 1 -1 1 -1} or {-1 -1 -1 1 1 -1 1 -1; -1 -1 1 1 1 1 -1}. 1} and other pilot sequences.

[0057] In this embodiment of the disclosure, the first pilot sequence and the second pilot sequence may be the same or different.

[0058] In some embodiments, the pilot sequence set includes at least one subset. The subset includes at least one second pilot sequence. Predefined information includes at least one of the following: pilot sequence type, pilot sequence repetition count, pilot sequence length, number of first pilot sequences, number of second pilot sequences, subset indication information, and pilot sequence indication information.

[0059] In some embodiments, a set of pilot sequences may include at least one subset. A subset includes at least one second pilot sequence. For example, the pilot sequence set {-1 -1 -1 1 1 -1 1 -1; -1 -1 1 1 1 1 -1 1; -1 1 -1 -1 1 1 1 1; -1 1 1 -1 1 -1 -1 -1; 1 -1 -1 1 -1 1 1 1; 1 -1 1 1 -1 -1 -1 -1; 1 1 -1 -1 -1 -1 -1 1 -1; 1 1 1 -1 -1 -1 1 -1 1} includes three subsets: subset 1 {-1 -1 -1 1 1 -1 1 -1; -1 -1 1 1 1 1 -1 1}, subset 2 {-1 1 -1 -1 1 1 1 1; -1 1 1 -1 1 -1 -1 -1}, and subset 3 {1 -1 -1 1 -1 1 1 1; 1 -1 1 1 -1 -1 -1 -1;1 1 -1 -1 -1 -1 1 -1;1 1 1 -1 -1 -1 1 -1 1}.

[0060] The pilot sequence type can include at least one of prefix, infix, and suffix. The pilot sequence type indicates the type of the first pilot sequence to be obtained. For example, a pilot sequence type of prefix indicates that a prefix pilot sequence is required. A pilot sequence type including both prefix and infix indicates that both prefix and infix pilot sequences are required. This allows obtaining the desired type of pilot sequence.

[0061] The number of pilot sequence repetitions can be the number of times the pilot sequence is repeated. The pilot sequence length can be the length of the desired first pilot sequence, including at least one of the following: the length of the desired prefix pilot sequence, the length of the desired infix pilot sequence, and the length of the desired suffix pilot sequence. For example, if the pilot sequence length is 16, then the desired first pilot sequence length is 16. This allows obtaining a pilot sequence of the required length.

[0062] The number of first pilot sequences can represent the number of second pilot sequences required to obtain at least one first pilot sequence. The number of second pilot sequences can represent the number of first pilot sequences required to obtain at least one first pilot sequence. In this way, the required number of pilot sequences can be obtained.

[0063] The number of second pilot sequences can include at least one of the following: the total number of first pilot sequences to be obtained, the number of prefix pilot sequences to be obtained, the number of infix pilot sequences to be obtained, and the number of suffix pilot sequences to be obtained. The number of prefix pilot sequences and the number of suffix pilot sequences are usually set to 1 by default.

[0064] The subset indication information can be the subset containing the second pilot sequence required to obtain at least one first pilot sequence. For example, if at least one first pilot sequence is obtained based on the pilot sequences in subset 3, then the subset indication information can be subset 3. By indicating subsets, pilot sequences can be generated more accurately and quickly.

[0065] The pilot sequence indication information can be other indication information such as the type of pilot sequence, the number of first pilot sequences, etc.

[0066] In some embodiments, the predefined information may further include at least one of the following: protection bit information of the pilot sequence, pilot sequence position, pilot sequence interval, pilot sequence start position, and pilot sequence position offset value.

[0067] In some embodiments, the pilot sequence set includes at least one of the following: the Barker sequence set, the Golay sequence set, and the M sequence set.

[0068] The Barker sequence set indicates that the pilot sequences included in this set are encoded using the Barker coding technique. The Golay sequence set indicates that the pilot sequences included in this set are encoded using the Golay coding technique. The M sequence set indicates that the pilot sequences included in this set can be binary code sequences generated by a linear feedback shift register (LFSR).

[0069] In some embodiments, predefined information is obtained through signaling or a predefined method.

[0070] For example, before the first communication node determines at least one first pilot sequence from the set of pilot sequences based on predefined information, the first communication node may receive signaling that includes the predefined information. Alternatively, the predefined information may be pre-configured or stored on the first communication node. This facilitates the subsequent generation of the required pilot sequence based on the predefined information.

[0071] S202. Map at least one first pilot sequence onto a physical resource to generate a pilot signal.

[0072] In some embodiments, the physical resources can be transmission resources such as time-domain resources or frequency-domain resources. The first communication node can perform operations such as encoding, repeating, or modulating on each of the at least one first pilot sequence, and map the operated pilot sequence onto the physical resources to generate pilot signals.

[0073] In other words, since the pilot sequences determined from the pilot sequence set meet the requirements of the corresponding coverage scenario, the pilot signals generated based on the pilot sequences also meet the requirements of the corresponding coverage scenario.

[0074] S203, Send pilot signal to the second communication node.

[0075] In some embodiments, the first communication node may send a pilot signal to the second communication node. The transmission method may be active transmission or backscatter transmission, etc.

[0076] In some embodiments, the predefined information includes pilot sequence type and number of first pilot sequences, and may include at least one of the following:

[0077] When the number of first pilot sequences is 1 and the pilot sequence type includes prefix and infix, at least one first pilot sequence includes one prefix pilot sequence and at least one infix pilot sequence, and at least one first pilot sequence is the same pilot sequence in the same subset.

[0078] The first pilot sequence has a quantity of 1 and the pilot sequence type includes prefix and infix, indicating that the first communication node obtains a second pilot sequence from the pilot sequence set and generates a prefix pilot sequence and at least one infix pilot sequence based on this second pilot sequence. This prefix pilot sequence and the at least one infix pilot sequence can be the same pilot sequence in the same subset (i.e., this second pilot sequence).

[0079] This disclosure can generate the required pilot sequence based on predefined information, including pilot sequence type and number of first pilot sequences. The following embodiments illustrate how to generate the required pilot sequence based on pilot sequence type and number of first pilot sequences.

[0080] Alternatively, if the number of first pilot sequences is 1 and the pilot sequence type includes prefix and suffix, at least one first pilot sequence includes one prefix pilot sequence and one suffix pilot sequence, and at least one first pilot sequence is the same pilot sequence in the same subset.

[0081] The first pilot sequence has a quantity of 1 and the pilot sequence type includes a prefix and a suffix, indicating that the first communication node obtains a second pilot sequence from the pilot sequence set and generates a prefix pilot sequence and a suffix pilot sequence based on this second pilot sequence. This prefix pilot sequence and this suffix pilot sequence can be the same pilot sequence in the same subset (i.e., this second pilot sequence).

[0082] Alternatively, if the number of first pilot sequences is 1 and the pilot sequence types include prefix, infix, and suffix, at least one first pilot sequence includes one prefix pilot sequence, at least one infix pilot sequence, and one suffix pilot sequence, and at least one first pilot sequence is the same pilot sequence in the same subset.

[0083] The first pilot sequence has one quantity and includes prefix, infix, and suffix types. This indicates that the first communication node obtains a second pilot sequence from the pilot sequence set and generates a prefix pilot sequence, at least one infix pilot sequence, and a suffix pilot sequence based on this second pilot sequence. This prefix pilot sequence, at least one infix pilot sequence, and suffix pilot sequence can be the same pilot sequence (i.e., this second pilot sequence) in the same subset.

[0084] Alternatively, if the number of first pilot sequences is greater than 1 and the pilot sequence type includes prefix and infix, at least one first pilot sequence includes a prefix pilot sequence and at least one infix pilot sequence, and at least one first pilot sequence is a different pilot sequence in the same subset.

[0085] Wherein, the number of first pilot sequences is greater than 1 and the pilot sequence type includes prefix and infix, indicating that the first communication node obtains multiple second pilot sequences from the pilot sequence set, and generates a prefix pilot sequence and at least one infix pilot sequence based on these multiple second pilot sequences. This prefix pilot sequence and this at least one infix pilot sequence can be different pilot sequences in the same subset (i.e., different pilot sequences among these multiple second pilot sequences).

[0086] For example, the number of first pilot sequences is 2. These two second pilot sequences are located in the same subset. These two second pilot sequences can be represented as {-1 -1 -1 1 1 -1 1 -1; -1 -1 1 1 1 1 1 -1 1}. Based on these two second pilot sequences, a prefix pilot sequence and an infix pilot sequence are generated. The prefix pilot sequence can be [-1 -1 -1 1 1 -1 1 -1], and the infix pilot sequence can be [-1 -1 1 1 1 1 -1 1].

[0087] Alternatively, if the number of first pilot sequences is greater than 1 and the pilot sequence type includes prefix and suffix, at least one first pilot sequence includes a prefix pilot sequence and a suffix pilot sequence, and at least one first pilot sequence is a different pilot sequence in the same subset.

[0088] Wherein, the number of first pilot sequences is greater than 1 and the pilot sequence type includes prefix and suffix, indicating that the first communication node obtains multiple second pilot sequences from the pilot sequence set, and generates a prefix pilot sequence and a suffix pilot sequence based on these multiple second pilot sequences. This prefix pilot sequence and this suffix pilot sequence can be different pilot sequences from the same subset.

[0089] For example, the number of first pilot sequences is 2. These two second pilot sequences are located in the same subset. These two second pilot sequences can be represented as {-1 -1 -1 1 1 -1 1 -1; -1 -1 1 1 1 1 -1 1}. Based on these two second pilot sequences, a prefix pilot sequence and a suffix pilot sequence are generated. The prefix pilot sequence can be [-1 -1 -1 1 1 -1 1 -1], and the suffix pilot sequence can be [-1 -1 1 1 1 1 -1 1].

[0090] Alternatively, if the number of first pilot sequences is greater than 1 and the pilot sequence type includes prefix and infix, at least one first pilot sequence includes a prefix pilot sequence and at least one infix pilot sequence, and at least one first pilot sequence is a different pilot sequence in a different subset.

[0091] Wherein, the number of first pilot sequences is greater than 1 and the pilot sequence type includes prefix and infix, indicating that the first communication node obtains multiple second pilot sequences from the pilot sequence set, and generates a prefix pilot sequence and at least one infix pilot sequence based on these multiple second pilot sequences. This prefix pilot sequence and the at least one infix pilot sequence can be different pilot sequences from different subsets.

[0092] For example, if the number of first pilot sequences is 2, these two second pilot sequences can be represented as {-1 -1 -1 1 1 -1 1 -1; -1 -1 1 1 1 1 1 -1 1}. These two second pilot sequences are located in different subsets; for example, [-1 -1 -1 1 1 1 -1 1 -1] is located in subset 1, and [-1 -1 1 1 1 1 1 -1 1] is located in subset 2. Based on these two second pilot sequences, a prefix pilot sequence and an infix pilot sequence are generated. The prefix pilot sequence can be [-1 -1 -1 1 1 1 -1 1 -1], and the infix pilot sequence can be [-1 -1 1 1 1 1 -1 1].

[0093] Alternatively, if the number of first pilot sequences is greater than 1 and the pilot sequence type includes prefix and suffix, at least one first pilot sequence includes a prefix pilot sequence and a suffix pilot sequence, and at least one first pilot sequence is a different pilot sequence in a different subset.

[0094] Wherein, the number of first pilot sequences is greater than 1 and the pilot sequence type includes prefix and suffix, indicating that the first communication node obtains multiple second pilot sequences from the pilot sequence set, and generates a prefix pilot sequence and a suffix pilot sequence based on these multiple second pilot sequences. This prefix pilot sequence and this suffix pilot sequence can be different pilot sequences from different subsets.

[0095] For example, if the number of first pilot sequences is 2, these two second pilot sequences can be represented as {-1 -1 -1 1 1 -1 1 -1; -1 -1 1 1 1 1 1 -1 1}. These two second pilot sequences are located in different subsets; for example, [-1 -1 -1 1 1 1 -1 1 -1] is located in subset 1, and [-1 -1 1 1 1 1 1 -1 1] is located in subset 2. Based on these two second pilot sequences, a prefix pilot sequence and a suffix pilot sequence are generated. The prefix pilot sequence can be [-1 -1 -1 1 1 1 -1 1 -1], and the suffix pilot sequence can be [-1 -1 1 1 1 1 -1 1].

[0096] Alternatively, if the number of first pilot sequences is greater than 1 and the pilot sequence types include prefix, infix and suffix, at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence and a suffix pilot sequence, and at least one first pilot sequence is a different pilot sequence in the same subset.

[0097] Wherein, the number of first pilot sequences is greater than 1 and the pilot sequence types include prefix, infix, and suffix, it indicates that the first communication node obtains multiple second pilot sequences from the pilot sequence set, and generates a prefix pilot sequence, at least one infix pilot sequence, and a suffix pilot sequence based on these multiple second pilot sequences. This prefix pilot sequence, this at least one infix pilot sequence, and this suffix pilot sequence can be different pilot sequences from the same subset.

[0098] For example, the number of first pilot sequences is 3. These three second pilot sequences are located in the same subset. These three second pilot sequences can be represented as {-1 -1 -1 1 1 -1 1 -1; -1 -1 1 1 1 1 1 -1 1; -1 -1 1 1 1 1 1 -1 -1}. Based on these three second pilot sequences, a prefix pilot sequence, an infix pilot sequence, and a suffix pilot sequence are generated. The prefix pilot sequence can be [-1 -1 -1 1 1 -1 1 -1], the infix pilot sequence can be [-1 -1 1 1 1 1 -1 -1], and the suffix pilot sequence can be [-1 -1 1 1 1 1 -1 1].

[0099] Alternatively, if the number of first pilot sequences is greater than 1 and the pilot sequence types include prefix, infix, and suffix, at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence, and one suffix pilot sequence. A prefix pilot sequence and at least one infix pilot sequence are the same pilot sequence in the first subset, and a suffix pilot sequence is a pilot sequence in a subset different from the first subset. A prefix pilot sequence or at least one infix pilot sequence is different from a suffix pilot sequence.

[0100] Wherein, the number of first pilot sequences is greater than one and the pilot sequence types include prefix, infix, and suffix, indicating that the first communication node obtains multiple second pilot sequences from the pilot sequence set and generates a prefix pilot sequence, at least one infix pilot sequence, and a suffix pilot sequence based on these multiple second pilot sequences. This prefix pilot sequence and the at least one infix pilot sequence are the same pilot sequence in the first subset. This suffix pilot sequence is a pilot sequence in a subset different from the first subset. This prefix pilot sequence or the at least one infix pilot sequence is different from this suffix pilot sequence.

[0101] For example, if the number of first pilot sequences is 3, these three second pilot sequences can be represented as {-1 -1 -1 1 1 -1 1 -1; -1 -1 1 1 1 1 -1 1; -1 -1 1 1 1 1 1 -1 -1}. {-1 -1 -1 1 1 1 -1 1 -1; -1 -1 1 1 1 1 1 -1 1} is located in subset 1 (i.e., the first subset in this disclosure), and [-1 -1 1 1 1 1 1 -1 -1] is located in subset 2 (i.e., the subset in this disclosure that is different from the first subset). Based on these three second pilot sequences, a prefix pilot sequence, an infix pilot sequence, and a suffix pilot sequence are generated. The prefix pilot sequence can be [-1 -1 -1 1 1 -1 1 -1], the infix pilot sequence can be [-1 -1 -1 1 1 -1 1 -1], and the suffix pilot sequence can be [-1 -1 1 1 1 1 -1 -1].

[0102] Alternatively, if the number of first pilot sequences is greater than 1 and the pilot sequence types include prefix, infix, and suffix, at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence, and one suffix pilot sequence. A prefix pilot sequence and a suffix pilot sequence are the same pilot sequence in the second subset, at least one infix pilot sequence is a pilot sequence in a subset different from the second subset, and a prefix pilot sequence or a suffix pilot sequence is different from at least one infix pilot sequence.

[0103] Wherein, the number of first pilot sequences is greater than one and the pilot sequence types include prefix, infix, and suffix, indicating that the first communication node obtains multiple second pilot sequences from the pilot sequence set and generates a prefix pilot sequence, at least one infix pilot sequence, and a suffix pilot sequence based on these multiple second pilot sequences. The prefix pilot sequence and the suffix pilot sequence are the same pilot sequence in the first subset. The at least one infix pilot sequence is a pilot sequence in a subset different from the first subset. The prefix pilot sequence or the suffix pilot sequence is different from the at least one infix pilot sequence.

[0104] For example, if the number of first pilot sequences is 3, these three second pilot sequences can be represented as {-1 -1 -1 1 1 -1 1 -1; -1 -1 1 1 1 1 1 -1 1; -1 -1 1 1 1 1 1 -1 -1}. {-1 -1 -1 1 1 1 -1 1 -1; -1 -1 1 1 1 1 1 -1 1} is located in subset 1 (i.e., the second subset in this disclosure), and [-1 -1 1 1 1 1 1 -1 -1] is located in subset 2 (i.e., the subset in this disclosure that is different from the second subset). Based on these three second pilot sequences, a prefix pilot sequence, an infix pilot sequence, and a suffix pilot sequence are generated. The prefix pilot sequence can be [-1 -1 -1 1 1 -1 1 -1], the infix pilot sequence can be [-1 -1 1 1 1 1 -1 -1], and the suffix pilot sequence can be [-1 -1 -1 1 1 -1 1 -1].

[0105] When the number of first pilot sequences is greater than 1 and the pilot sequence types include prefix, infix, and suffix, at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence, and one suffix pilot sequence. At least one infix pilot sequence and one suffix pilot sequence are the same pilot sequence in the third subset. One prefix pilot sequence is a pilot sequence in a subset different from the third subset. At least one infix pilot sequence or one suffix pilot sequence is different from one prefix pilot sequence.

[0106] Wherein, the number of first pilot sequences is greater than one and the pilot sequence types include prefix, infix, and suffix, indicating that the first communication node obtains multiple second pilot sequences from the pilot sequence set and generates a prefix pilot sequence, at least one infix pilot sequence, and one suffix pilot sequence based on these multiple second pilot sequences. The at least one infix pilot sequence and the suffix pilot sequence are the same pilot sequence in the first subset. The prefix pilot sequence is a pilot sequence in a subset different from the first subset. The at least one infix pilot sequence or the suffix pilot sequence is different from the prefix pilot sequence.

[0107] For example, if the number of first pilot sequences is 3, these three second pilot sequences can be represented as {-1 -1 -1 1 1 -1 1 -1; -1 -1 1 1 1 1 1 -1 1; -1 -1 1 1 1 1 1 -1 -1}. {-1 -1 -1 1 1 1 -1 1 -1; -1 -1 1 1 1 1 1 -1 1} is located in subset 1 (i.e., the third subset in this disclosure), and [-1 -1 1 1 1 1 1 -1 -1] is located in subset 2 (i.e., the subset in this disclosure that is different from the third subset). Based on these three second pilot sequences, a prefix pilot sequence, an infix pilot sequence, and a suffix pilot sequence are generated. The prefix pilot sequence can be [-1 -1 1 1 1 1 -1 -1], the infix pilot sequence can be [-1 -1 -1 1 1 -1 1 -1], and the suffix pilot sequence can be [-1 -1 -1 1 1 -1 1 -1].

[0108] This disclosure can generate the required pilot sequence based on predefined information, including pilot sequence type and number of first pilot sequences, to meet the pilot sequence requirements of different coverage scenarios.

[0109] In the above embodiments, the first subset, the second subset, and the third subset can be the same subset or different subsets.

[0110] This disclosure can generate the required pilot sequence based on predefined information, including pilot sequence type and subset indication information. The following embodiments illustrate how to generate the required pilot sequence based on pilot sequence type and subset indication information.

[0111] In some embodiments, the predefined information includes pilot sequence type and subset indication information, and may include at least one of the following:

[0112] When the pilot sequence type is prefix, at least one first pilot sequence includes one prefix pilot sequence, and one prefix pilot sequence is any pilot sequence in the subset.

[0113] For example, if the subset indicator information is subset 1, this prefix pilot sequence can be [-1 -1 1 1 1 -1 1 -1; -1 -1 1 1 1 1 -1 1] in subset 1 {-1 -1 -1 -1 1 1 1 1 1 -1 1}.

[0114] Alternatively, in the case where the pilot sequence type includes prefix and infix, at least one first pilot sequence includes a prefix pilot sequence and at least one infix pilot sequence, and at least one first pilot sequence is the same pilot sequence in a subset.

[0115] For example, the subset indication information is subset 1, and at least one first pilot sequence includes a prefix pilot sequence and an infix pilot sequence. This prefix pilot sequence and this infix pilot sequence can both be [-1 -1 1 1 1 1 -1 1 -1; -1 -1 1 1 1 1 -1 1] in subset 1 {-1 -1 -1 -1 1 1 1 1 -1 1}.

[0116] Alternatively, in the case where the pilot sequence type includes prefix and infix, at least one first pilot sequence includes a prefix pilot sequence and at least one infix pilot sequence, and at least one first pilot sequence is a different pilot sequence in the subset.

[0117] For example, the subset indication information is subset 1, and at least one first pilot sequence includes a prefix pilot sequence and an infix pilot sequence. The prefix pilot sequence can be [-1 -1 1 1 1 1 -1 1 -1; -1 -1 1 1 1 1 1 -1 1] in subset 1 {-1 -1 -1 -1 1 1 1 -1 1; -1 -1 1 1 1 1 1 -1 1}, and the infix pilot sequence can be [-1 -1 -1 1 1 1 -1 1 -1; -1 -1 1 1 1 1 1 -1 1] in subset 1 {-1 -1 -1 -1 1 1 -1 1; -1 -1 1 1 1 1 1 -1 1}.

[0118] Alternatively, in cases where the pilot sequence type includes a prefix and a suffix, at least one first pilot sequence includes a prefix pilot sequence and a suffix pilot sequence, and at least one first pilot sequence is the same pilot sequence in a subset.

[0119] For example, the subset indication information is subset 1, and at least one first pilot sequence includes a prefix pilot sequence and a suffix pilot sequence. This prefix pilot sequence and this suffix pilot sequence can both be [-1 -1 -1 1 1 -1 1 -1; -1 -1 1 1 1 1 -1 1] in subset 1 {-1 -1 -1 -1 1 1 -1 1; -1 -1 1 1 1 1 1 -1 1}.

[0120] Alternatively, in cases where the pilot sequence type includes a prefix and a suffix, at least one first pilot sequence includes a prefix pilot sequence and a suffix pilot sequence, and at least one first pilot sequence is a different pilot sequence in the subset.

[0121] For example, the subset indication information is subset 1, and at least one first pilot sequence includes a prefix pilot sequence and a suffix pilot sequence. Both the prefix pilot sequence and the suffix pilot sequence are [-1 -1 -1 1 1 -1 1 -1; -1 -1 1 1 1 1 -1 1] in subset 1 {-1 -1 -1 1 1 1 -1 1; -1 -1 1 1 1 1 1 -1 1}. The suffix pilot sequence can be [-1 -1 1 1 1 1 -1 1; -1 -1 1 1 1 1 1 -1 1] in subset 1 {-1 -1 -1 1 1 1 -1 1; -1 -1 1 1 1 1 1 -1 1}.

[0122] Alternatively, when the pilot sequence type includes prefix, infix and suffix, at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence and a suffix pilot sequence, and at least one first pilot sequence is the same pilot sequence in the subset.

[0123] For example, the subset indication information is subset 1, and at least one first pilot sequence includes a prefix pilot sequence, an infix pilot sequence, and a suffix pilot sequence. This prefix pilot sequence, this infix pilot sequence, and this suffix pilot sequence can all be [-1 -1 -1 1 1 -1 1 -1; -1 -1 1 1 1 1 -1 1; -1 -1 1 1 1 1 1 -1 -1] in subset 1 {-1 -1 -1 -1 1 1 -1 1; -1 -1 1 1 1 1 -1 -1}.

[0124] Alternatively, in the case where the pilot sequence type includes prefix, infix and suffix, at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence and a suffix pilot sequence, and at least one first pilot sequence is a different pilot sequence in the subset.

[0125] For example, the subset indication information is subset 1, and at least one first pilot sequence includes a prefix pilot sequence, an infix pilot sequence, and a suffix pilot sequence. The prefix pilot sequence can be [-1 -1 -1 1 1 -1 1 -1; -1 -1 1 1 1 1 1 -1 1; -1 -1 1 1 1 1 1 -1 -1] from subset 1 {-1 -1 -1 -1 1 1 -1 1; -1 -1 1 1 1 1 1 -1 -1}. The infix pilot sequence can be [-1 -1 1 1 1 1 -1 1] from subset 1 {-1 -1 -1 -1 1 1 -1 1; -1 -1 1 1 1 1 1 -1 1; -1 -1 1 1 1 1 -1 -1}. The suffix pilot sequence can be [-1 -1 -1 1 1 1 1 -1 1] from subset 1 {-1 -1 1 1 1 1 1 -1 1; -1 -1 1 1 1 1 1 -1 1] from subset 1 {-1 -1 1 1 1 1 -1 1; -1 -1 1 1 1 1 1 -1 1; -1 -1 1 1 1 1 -1 1] from subset 1.

[0126] -1 1 1 -1 1 -1;-1 -1 1 1 1 1 1 -1 1;-1 -1 1 1 1 1 1 -1 -1} in [-1 -1 1 1 1 1 1 -1 -1].

[0127] This disclosure can generate the required pilot sequence based on predefined information, including pilot sequence type and subset indication information, to meet the pilot sequence requirements of different coverage scenarios.

[0128] This disclosure can generate the required pilot sequence based on predefined information, including pilot sequence type and pilot sequence length. The following embodiments illustrate how to generate the required pilot sequence based on the pilot sequence type and pilot sequence length.

[0129] In some embodiments, the predefined information includes pilot sequence type and pilot sequence length, and may include at least one of the following:

[0130] In the case where the pilot sequence type includes prefix and infix, at least one first pilot sequence includes a prefix pilot sequence and at least one infix pilot sequence, and at least one first pilot sequence has the same length.

[0131] For example, the length of each pilot sequence in this prefix pilot sequence and this at least one infix pilot sequence is 16.

[0132] Alternatively, in the case where the pilot sequence type includes prefix and infix, at least one first pilot sequence includes a prefix pilot sequence and at least one infix pilot sequence, wherein the length of a prefix pilot sequence is N1 times the length of at least one infix pilot sequence, and N1 is a positive integer greater than or equal to 1.

[0133] For example, N1 is 2, and at least one first pilot sequence includes a prefix pilot sequence and an infix pilot sequence. The length of the prefix pilot sequence is 32, and the length of the infix pilot sequence is 16.

[0134] Alternatively, when the pilot sequence type includes prefix, infix, and suffix, at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence, and one suffix pilot sequence, and at least one first pilot sequence has the same length.

[0135] For example, the length of each pilot sequence in a prefix pilot sequence, at least one infix pilot sequence, and a suffix pilot sequence is 32.

[0136] Alternatively, when the pilot sequence type includes prefix, infix, and suffix, at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence, and one suffix pilot sequence, wherein the length of a prefix pilot sequence and a suffix pilot sequence are the same, and the length of a prefix pilot sequence or a suffix pilot sequence is greater than the length of at least one infix pilot sequence.

[0137] For example, at least one first pilot sequence includes a prefix pilot sequence, an infix pilot sequence, and a suffix pilot sequence. The length of the prefix pilot sequence and the length of the suffix pilot sequence are both 32. The length of the infix pilot sequence can be a positive integer less than or equal to 32.

[0138] Alternatively, when the pilot sequence type includes prefix, infix, and suffix, at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence, and one suffix pilot sequence, wherein at least one infix pilot sequence and one suffix pilot sequence have the same length, and the length of one prefix pilot sequence is greater than the length of at least one infix pilot sequence or one suffix pilot sequence.

[0139] For example, at least one first pilot sequence includes a prefix pilot sequence, an infix pilot sequence, and a suffix pilot sequence. The length of the infix pilot sequence and the length of the suffix pilot sequence are both 32. The length of the prefix pilot sequence can be a positive integer greater than 32.

[0140] Alternatively, when the pilot sequence type includes prefix, infix, and suffix, at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence, and a suffix pilot sequence. The length of a prefix pilot sequence and a suffix pilot sequence are the same, and the length of a prefix pilot sequence or a suffix pilot sequence is N2 times the length of at least one infix pilot sequence, where N2 is a positive integer greater than or equal to 1.

[0141] For example, N2 is 3, and at least one first pilot sequence includes a prefix pilot sequence, an infix pilot sequence, and a suffix pilot sequence. The length of the prefix pilot sequence and the suffix pilot sequence is 48, and the length of the infix pilot sequence is 16.

[0142] Alternatively, when the pilot sequence type includes prefix, infix, and suffix, at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence, and one suffix pilot sequence, wherein at least one infix pilot sequence and one suffix pilot sequence have the same length, and a prefix pilot sequence is N3 times the length of at least one infix pilot sequence or one suffix pilot sequence, where N3 is a positive integer greater than or equal to 1.

[0143] For example, N3 is 3, and at least one first pilot sequence includes a prefix pilot sequence, an infix pilot sequence, and a suffix pilot sequence. The length of the infix pilot sequence and the suffix pilot sequence is 16, and the length of the prefix pilot sequence is 48.

[0144] Alternatively, in the case where the pilot sequence type includes a prefix and a suffix, at least one first pilot sequence includes a prefix pilot sequence and a suffix pilot sequence, and at least one first pilot sequence has the same length.

[0145] For example, the length of both the prefix pilot sequence and the suffix pilot sequence is 16.

[0146] Alternatively, in the case where the pilot sequence type includes a prefix and a suffix, at least one first pilot sequence includes a prefix pilot sequence and a suffix pilot sequence, wherein the length of the prefix pilot sequence is greater than the length of the suffix pilot sequence.

[0147] For example, the length of this prefix pilot sequence is 32, and the length of this suffix pilot sequence is 16.

[0148] This disclosure can generate the required pilot sequence based on predefined information, including pilot sequence type and pilot sequence length, to meet the pilot sequence requirements of different coverage scenarios.

[0149] The pilot sequence length and pilot sequence type included in the predefined information in this disclosure are related. The following embodiments illustrate the relationship between the pilot sequence length and the pilot sequence type.

[0150] In some embodiments, the predefined information includes pilot sequence type and pilot sequence length; the pilot sequence length includes at least one of the following: a first length set, a second length set, a third length set, a fourth length set, a fifth length set, a sixth length set, a seventh length set, and an eighth length set.

[0151] When the pilot sequence type is prefix, at least one first pilot sequence includes a prefix pilot sequence, and the length of a prefix pilot sequence is any of the multiple lengths included in the first length set.

[0152] For example, if the first length set is {128, 64, 48, 32}, the length of this prefix pilot sequence can be 64.

[0153] Alternatively, in the case where the pilot sequence type includes prefix and infix, at least one first pilot sequence includes a prefix pilot sequence and at least one infix pilot sequence, the length of a prefix pilot sequence is any length among the multiple lengths included in the second length set, the length of at least one infix pilot sequence is any length among the multiple lengths included in the third length set; the length of a prefix pilot sequence is greater than or equal to the length of at least one infix pilot sequence.

[0154] For example, at least one first pilot sequence includes a prefix pilot sequence and an infix pilot sequence. The second length set is {128, 96, 64, 48, 32}, and the third length set is {64, 48, 32, 16}. The length of this prefix pilot sequence can be 96, and the length of this infix pilot sequence can be 48.

[0155] Alternatively, in the case where the pilot sequence type includes a prefix and a suffix, at least one first pilot sequence includes a prefix pilot sequence and a suffix pilot sequence, the length of a prefix pilot sequence is any length among the multiple lengths included in the fourth length set, and the length of a suffix pilot sequence is any length among the multiple lengths included in the fifth length set; the length of a prefix pilot sequence is greater than or equal to the length of a suffix pilot sequence.

[0156] For example, the fourth length set is {128, 96, 64, 48, 32}, and the fifth length set is {128, 64, 48, 32, 16}. The length of this prefix pilot sequence can be 96, and the length of this infix pilot sequence can be 48.

[0157] Alternatively, when the pilot sequence type includes prefix, infix, and suffix, at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence, and one suffix pilot sequence. The length of a prefix pilot sequence is any length among the multiple lengths included in the sixth length set, the length of at least one infix pilot sequence is any length among the multiple lengths included in the seventh length set, and the length of a suffix pilot sequence is any length among the multiple lengths included in the eighth length set. The length of a prefix pilot sequence is greater than or equal to the length of a suffix pilot sequence, and the length of a suffix pilot sequence is greater than or equal to the length of at least one infix pilot sequence.

[0158] For example, at least one first pilot sequence includes a prefix pilot sequence, an infix pilot sequence, and a suffix pilot sequence. The sixth length set is {128, 96, 64, 48, 32}, the seventh length set is {64, 48, 32, 16}, and the eighth length set is {128, 64, 48, 32, 16}.

[0159] This disclosure can select and generate the required pilot sequence from a set of pilot sequence lengths corresponding to the pilot sequence type based on predefined information, including pilot sequence type and pilot sequence length, to meet the pilot sequence requirements of different coverage scenarios.

[0160] In some embodiments, the first pilot sequence is obtained by repeating the second pilot sequence, and the length of the first pilot sequence is greater than that of the second pilot sequence.

[0161] For example, the second pilot sequence is [-1 -1 -1 1 1 -1 1 -1]. Repeating this second pilot sequence once yields the first pilot sequence [-1 -1 -1 1 1 -1 1 -1]. Repeating this second pilot sequence twice yields the first pilot sequence [-1 -1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1]. In other words, this disclosure can generate new pilot sequences by repeating pilot sequences.

[0162] The predefined information in this disclosure includes a correlation between the number of second pilot sequences and the pilot sequence type. The following embodiments illustrate the correlation between the number of second pilot sequences and the pilot sequence type.

[0163] In some embodiments, the predefined information includes pilot sequence type and second pilot sequence quantity; the second pilot sequence quantity is any one of the following: 1. a first quantity set and a second quantity set.

[0164] When the pilot sequence type is prefix, the number of second pilot sequences is 1.

[0165] Alternatively, if the pilot sequence type includes prefix and infix and the number of second pilot sequences is greater than 1, the number of prefix pilot sequences included in at least one first pilot sequence is 1, and the number of infix pilot sequences included in at least one first pilot sequence is the difference between the number of second pilot sequences in the first quantity set and 1.

[0166] For example, the first set of quantities is {2, 3, 4}. Here, 2 indicates that the number of prefix pilot sequences is 1 and the number of infix pilot sequences is 1. 3 indicates that the number of prefix pilot sequences is 1 and the number of infix pilot sequences is 2. 4 indicates that the number of prefix pilot sequences is 1 and the number of infix pilot sequences is 3.

[0167] Alternatively, if the pilot sequence type includes prefix, infix, and suffix, and the number of second pilot sequences is greater than 2, at least one first pilot sequence includes a prefix pilot sequence of 1, at least one first pilot sequence includes a suffix pilot sequence of 1, and at least one first pilot sequence includes an infix pilot sequence of the difference between the number of second pilot sequences in the second set and 2.

[0168] For example, the second set of quantities is {3, 4, 5}. Here, 3 represents a prefix pilot sequence of 1, an infix pilot sequence of 1, and a suffix pilot sequence of 1. 4 represents a prefix pilot sequence of 1, an infix pilot sequence of 2, and a suffix pilot sequence of 1. 5 represents a prefix pilot sequence of 1, an infix pilot sequence of 3, and a suffix pilot sequence of 1.

[0169] This disclosure can generate an appropriate number of pilot sequences based on predefined information, including pilot sequence types and the quantity or set of quantities corresponding to the pilot sequence types, to meet the pilot sequence requirements of different coverage scenarios.

[0170] This disclosure allows various operations to be performed on a set of pilot sequences to generate the desired pilot sequences. The following embodiments illustrate how to perform various operations on a set of pilot sequences.

[0171] Figure 3 shows a flowchart of another pilot sequence generation method. As shown in Figure 3, the method in step S201 above specifically includes S301:

[0172] S301. Based on predefined information, perform operations on the set of pilot sequences to obtain at least one first pilot sequence.

[0173] The operation includes at least one of the following: direct selection operation, repetition operation, cyclic shift operation, recursive operation, sliding window operation, and protection bit information addition operation.

[0174] In some embodiments, based on predefined information, the first communication node can perform a direct selection operation on the set of pilot sequences to obtain at least one first pilot sequence.

[0175] For example, if the pilot sequence type in the predefined information is a prefix, the first communication node can select from a Barker sequence set of length 8: {-1 -1 -1 1 1 -1 1 -1; -1 -1 1 1 1 1 -1 1; -1 1 -1 -1 1 1 1 1; -1 1 1 -1 1 -1 -1 -1; 1 -1 -1 1 -1 1 1 1; 1 -1 1 1 -1 -1 -1 -1}

[0176] Choose a pilot sequence from the given list, for example, [-1 -1 -1 1 1 -1 1 -1 1 -1 1; 1 1 1 -1 -1 1 -1 1]. If the pilot sequence length in the predefined information is 8, then perform a direct selection operation, directly mapping the 8-length Barker sequence [-1 -1 -1 1 1 -1 1 -1] onto the physical resource, generating a pilot signal, and sending this pilot signal to the second communication node (i.e., performing a direct selection operation).

[0177] If the pilot sequence length in the predefined information is 32, and the pilot sequence selected from the pilot sequence set is a Golay sequence of length 32 [1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 1], or an M sequence of length 32 [1 1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 1 1 -1 -1 -1 -1], then a direct selection operation is performed. The Golay sequence of length 32 or the M sequence of length 32 is directly mapped onto the physical resource to generate a pilot signal, and the pilot signal is sent to the second communication node.

[0178] If the pilot sequence length in the predefined information is 64, the pilot sequence selected from the pilot sequence set is either a Golay sequence of length 64 [1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 -1 -1 -1 1 1 1 1 1 -1 -1 -1 1 1 1 1 1 -1 -1 1 1 1 1 1 1 -1 -1], or an M sequence of length 64 [1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 1 -1 -1 ... If the sequence is 64-bit, a direct selection operation is performed, which maps the 64-bit Golay sequence or the 64-bit M sequence directly onto the physical resource, generates a pilot signal, and sends the pilot signal to the second communication node.

[0179] In some embodiments, based on predefined information, the first communication node can perform repeated operations on the set of pilot sequences to obtain at least one first pilot sequence.

[0180] For example, if the pilot sequence type in the predefined information is a prefix, the first communication node can select from a Barker sequence set of length 8: {-1 -1 -1 1 1 -1 1 -1; -1 -1 1 1 1 1 -1 1; -1 1 -1 -1 1 1 1 1; -1 1 1 -1 1 -1 -1 -1; 1 -1 -1 1 -1 1 1 1; 1 -1 1 1 -1 -1 -1 -1}

[0181] Select the first sequence [-1 -1 -1 1 1 -1 1 -1 1 -1; 1 1 1 -1 -1 1 -1 1] from the list. If the pilot sequence length in the predefined information is 16, then perform the repetition operation, repeating the Barker sequence [-1 -1 -1 1 1 -1 1 -1] of length 8 twice to obtain the sequence [-1 -1 -1 1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 -1] of length 16.

[0182] If the pilot sequence length in the predefined information is 32, then the repetition operation is performed, repeating the Barker sequence [-1 -1 -1 1 1 -1 1 -1] of length 8 four times to obtain the sequence [-1 -1 -1 1 1 - ...

[0183] If the pilot sequence length in the predefined information is 64, then the repetition operation is performed, repeating the Barker sequence [-1 -1 -1 1 1 -1 1 -1] of length 8 8 times to obtain the sequence [-1 -1 -1 1 1 - ...

[0184] For example, in the predefined information, the pilot sequence type is prefix, and one of the Golay sequence sets with a length of 8 is [-1 1 1 1 -1 -1 -1 1]. If the pilot sequence in the predefined information is 16 in length, then a repetition operation is performed, repeating the 8-length Golay sequence twice to obtain a 16-length sequence [-1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 -1 1].

[0185] If the pilot sequence in the predefined information is 32 in length, then the repetition operation is performed, repeating the Golay sequence of length 8 four times to obtain a sequence of length 32: [-1 1 1 1 -1 -1 -1 ...

[0186] For example, the predefined information includes prefix and infix pilot sequence types. The number of infix pilot sequences is 1, the length of the prefix pilot sequence is 64, and the length of the infix pilot sequence is 32. The pilot sequences selected for both the prefix and infix pilot sequences are the same sequence of length 8. Assuming this sequence is a Barker sequence of length 8 [-1 -1 -1 1 1 -1 1 -1], then a repetition operation is performed, repeating the Barker sequence of length 8 times to obtain a prefix pilot sequence of length 64 [-1 -1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 - ...

[0187] -1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1 1

[0188] -1]. Furthermore, repeating the 8-length Barker sequence 4 times yields a 32-length infix pilot sequence [-1 -1 -1 1 1 -1 1 -1 -1].

[0189] -1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1.

[0190] For example, the predefined information includes pilot sequence types including prefix and infix. The number of infix pilot sequences is 1, the length of the prefix pilot sequence is 64, and the length of the infix pilot sequence is 32. The pilot sequences selected for the prefix and infix pilot sequences are different sequences of the same type with a length of 8. Assume that the sequence selected for the prefix pilot sequence is a Barker sequence of length 8 [-1 -1 -1 1 1 -1 1 -1], and the sequence selected for the infix pilot sequence is a Barker sequence of length 8 [-1 -1 1 1 1 1 -1 1]. Then, the repetition operation is performed, repeating the Barker sequence [-1 -1 -1 1 1 -1 1 -1] of length 8 8 times to obtain the prefix pilot sequence [-1 -1 -1 1 1 - ... Furthermore, repeating the Barker sequence [-1 -1 1 1 1 1 -1 1] of length 8 four times yields the infix pilot sequence [-1 -1 1 1 1 1 - ...

[0191] For example, the predefined information includes pilot sequence types including prefix and infix. The number of infix pilot sequences is 1, the length of the prefix pilot sequence is 64, and the length of the infix pilot sequence is 32. The pilot sequences selected for the prefix and infix pilot sequences are different types of sequences with a length of 8. Assume that the sequence selected for the prefix pilot sequence is a Barker sequence of length 8 [-1 -1 -1 1 1 -1 1 -1], and the sequence selected for the infix pilot sequence is a Golay code sequence of length 8 [-1 1 1 1 -1 -1 -1 1]. Then, the repetition operation is performed, repeating the Barker sequence [-1 -1 -1 1 1 -1 1 -1] of length 8 8 times to obtain the prefix pilot sequence [-1 -1 -1 1 1 - ... Furthermore, repeating the 8-length Golay sequence [-1 1 1 1 -1 -1 -1 1] four times yields a 32-length infix pilot sequence [-1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 1].

[0192] For example, the predefined information includes pilot sequence types such as prefix and suffix. The prefix pilot sequence has a length of 64, and the suffix pilot sequence has a length of 32. The pilot sequence selected for both the prefix and suffix pilot sequences is the same sequence with a length of 8. Assuming the sequence is a Barker sequence of length 8 [-1 -1 -1 1 1 -1 1 -1], then the repetition operation is performed, repeating the Barker sequence of length 8 times to obtain a prefix pilot sequence of length 64 [1 -1 -1 1 1 - ... Additionally, repeating the Barker sequence of length 8 four times yields a suffix pilot sequence of length 32: [1 -1 -1 1 1 - ...

[0193] For example, the pilot sequence types in the predefined information include prefix and suffix. The prefix pilot sequence has a length of 64, and the suffix pilot sequence has a length of 32. The pilot sequences selected for the prefix and suffix pilot sequences are different sequences of the same type with a length of 8. Assume that the sequence selected for the prefix pilot sequence is a Barker sequence of length 8 [-1 -1 -1 1 1 -1 1 -1], and the sequence selected for the suffix pilot sequence is a Barker code sequence of length 8 [-1 -1 1 1 1 1 -1 1]. Then, the repetition operation is performed, repeating the Barker sequence [-1 -1 -1 1 1 -1 1 -1] of length 8 8 times to obtain the prefix pilot sequence [-1 -1 -1 1 1 - ... Furthermore, the Barker sequence [-1 -1 1 1 1 1 -1 1] of length 8 is repeated 4 times to obtain the suffix pilot sequence [-1 -1 1 1 1 1 -1 1 -1 -1 1 1 1 1 -1 1 -1 -1 1 1 1 1 -1 1 -1 -1 1 1 1 1 -1 1 -1 -1 1 1 1 1 -1 1 1 1 -1 1 1 1 -1 1 1 1 1 -1 1].

[0194] For example, the pilot sequence types in the predefined information include prefix and suffix. The prefix pilot sequence has a length of 64, and the suffix pilot sequence has a length of 32. The pilot sequences selected for the prefix and suffix pilot sequences are different sequences of the same type with a length of 8. Assume that the sequence selected for the prefix pilot sequence is a Barker sequence of length 8 [-1 -1 -1 1 1 -1 1 -1], and the sequence selected for the suffix pilot sequence is a Barker code sequence of length 8 [-1 -1 1 1 1 1 -1 1]. The Barker sequence of length 8 [-1 -1 -1 1 1 -1 1 -1] chosen as the prefix pilot sequence and the Barker code sequence of length 8 [-1 -1 1 1 1 1 -1 1] chosen as the suffix pilot sequence are combined to form a sequence of length 16 [-1 -1 -1 1 1 -1 1 -1 1 -1 -1 -1 1 1 1 1 -1 1]. This combined sequence is repeated 4 times to obtain a prefix pilot sequence of length 64 [-1 -1 -1 1 1 -1 1 -1 -1 -1 ... 1 1 -1 1].

[0195] For example, the predefined information includes pilot sequence types including prefix and suffix. The prefix pilot sequence has a length of 64, and the suffix pilot sequence has a length of 32. The pilot sequences selected for the prefix and suffix pilot sequences are different types of sequences with a length of 8. Assume that the sequence selected for the prefix pilot sequence is a Barker sequence of length 8 [-1 -1 -1 1 1 -1 1 -1], and the sequence selected for the suffix pilot sequence is a Golay code sequence of length 8 [-1 1 1 1 -1 -1 -1 1]. Then, the repetition operation is performed, repeating the Barker sequence [-1 -1 -1 1 1 -1 1 -1] of length 8 8 times to obtain the prefix pilot sequence [-1 -1 -1 1 1 - ... Furthermore, repeating the 8-length Golay sequence [-1 1 1 1 -1 -1 -1 1] four times yields a 32-length suffix pilot sequence [-1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 1].

[0196] For example, the predefined information may include pilot sequence types such as prefix, infix, and suffix. There are two infix pilot sequences, and the lengths of the prefix, infix, and suffix pilot sequences are all 64. The prefix, infix, and suffix pilot sequences may each have different lengths. For instance, the prefix pilot sequence might be 4 units long, the infix pilot sequence 8 units long, and the suffix pilot sequence 16 units long. Assume the prefix pilot sequence of length 4 is [-1 -1 -1 1], the infix pilot sequence of length 8 is [-1 -1 -1 1 1 -1 1 -1], and the suffix pilot sequence of length 16 is [-1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1]. To reduce the complexity of blind detection for the reader (i.e., the second communication node), predefined rules can be used. For example, the sequence with the minimum number of repetitions is used as the base sequence. Let the prefix pilot sequence, infix pilot sequence, and suffix pilot sequence all be sequences of length 16 [-1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 1 1 -1]. Repeat this sequence of length 16 four times to obtain the prefix pilot sequence, infix pilot sequence, and suffix pilot sequence of length 64, which is [-1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 ...

[0197] For example, the predefined information includes pilot sequence types such as prefix, infix, and suffix. The number of infix pilot sequences is 2, the length of the prefix pilot sequence is 64, the length of the infix pilot sequence is 32, and the length of the suffix pilot sequence is 32. The pilot sequences selected for the prefix, infix, and suffix pilot sequences are the same sequence of the same type with a length of 8. Assume that the selected sequences for the prefix, infix, and suffix pilot sequences are all Barker sequences of length 8 [-1 -1 -1 1 1 -1 1 -1]. Then, the repetition operation is performed, repeating the Barker sequence [-1 -1 -1 1 1 -1 1 -1] of length 8 8 times to obtain the prefix pilot sequence [-1 -1 -1 1 1 - ... Furthermore, repeating the sequence [-1 -1 -1 1 1 -1 1 -1] of length 8 four times yields an infix pilot sequence and a suffix pilot sequence of length 32: [-1 -1 -1 1 1 - ...

[0198] For example, the predefined information includes pilot sequence types such as prefix, infix, and suffix. The number of infix pilot sequences is 2, the length of the prefix pilot sequence is 64, the length of the infix pilot sequence is 32, and the length of the suffix pilot sequence is 32. The pilot sequences selected for the prefix, infix, and suffix pilot sequences are different sequences of the same type with a length of 8. Assume that the selected sequence for the prefix pilot sequence is a Barker sequence of length 8 [-1 -1 -1 1 1 -1 1 -1], the selected sequence for the infix pilot sequence is a Barker code sequence of length 8 [-1 -1 1 1 1 1 -1 1], and the selected sequence for the suffix pilot sequence is a Barker code sequence of length 8 [-1 1 -1 -1 1 1 1 1]. Then, the repetition operation is performed, repeating the Barker sequence [-1 -1 -1 1 1 -1 1 -1] of length 8 8 times to obtain the prefix pilot sequence [-1 -1 -1 1 1 - ... And, repeating the Barker sequence of length 8 [-1 -1 1 1 1 1 -1 1] 4 times yields the infix pilot sequence of length 32 [-1 -1 1 1 1 1 -1 1 -1 -1 1 1 1 1 -1 1 -1 -1 1 1 1 1 -1 1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 1 1 1 1 -1 1]. And, repeating the Barker sequence of length 8 [-1 1 -1 -1 1 1 1 1] 4 times yields the suffix pilot sequence of length 32 [-1 1 -1 -1 1 1 1 1 -1 1 -1 -1 1 1 1 1 -1 1 1 1 -1 1 1 1 -1 1 1 1 -1 1 1 1 1 -1 1 1 1 1].

[0199] For example, the predefined information includes pilot sequence types such as prefix, infix, and suffix. The number of infix pilot sequences is 2, the length of the prefix pilot sequence is 64, the length of the infix pilot sequence is 32, and the length of the suffix pilot sequence is 32. The pilot sequences selected for the prefix, infix, and suffix pilot sequences are different types of sequences with a length of 8. Assume that the selected sequence for the prefix pilot sequence is a Barker sequence of length 8 [-1 -1 -1 1 1 -1 1 -1], and the selected sequences for the infix and suffix pilot sequences are Golay code sequences of length 8 [-1 1 1 1 -1 -1 -1 1]. Then, the repetition operation is performed, repeating the Barker sequence [-1 -1 -1 1 1 -1 1 -1] of length 8 8 times to obtain the prefix pilot sequence [-1 -1 -1 1 1 - ... Additionally, repeating the 8-length Golay sequence [-1 1 1 1 -1 -1 -1 1] four times yields an infix pilot sequence and a suffix pilot sequence [-1 1 1 1 -1 -1 -1 1 -1 1 1 1 - ...

[0200] For example, considering the complexity of hardware implementation, generating a long sequence from a short sequence using repetitive operations might be more complex than using a linear feedback shift register. Therefore, for M-sequences, the linear feedback shift register extension method is used. For instance, the M-sequence is determined by a primitive polynomial. For an M-sequence of length 15, it can be generated by a 4-stage linear feedback shift register, with the corresponding primitive polynomial being x. 4 +x+1 determines its initial state. Through shift and feedback operations, an M-sequence of length 15 is obtained. Then, through zero-padding, a sequence of length 16 is obtained. For an M-sequence of length 31, a 5-stage linear feedback shift register is required, with the corresponding primitive polynomial being x. 5 +x 2 +1 to determine its initial state. Through shift and feedback operations, a sequence M of length 31 is obtained. Then, through zero-padding, a sequence of length 32 is obtained.

[0201] In some embodiments, based on predefined information, the first communication node can perform a recursive operation on the set of pilot sequences to obtain at least one first pilot sequence.

[0202] For example, the pilot sequence selected from the pilot sequence set is a Golay sequence of length 16, which is [1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 1 1 -1 -1]. In this sequence, 1 represents 1, and -1 becomes 0, denoted as [1 1 0 0 0 0 1 1 0 0 1 1 1 1 0 0], and denoted as [g1,g2,...,g 16 According to the recursion rule, assume g n =f(g n-1 ,g n-2 ,...,g n-k ), where f represents a certain functional relationship. For example, summing all elements and performing a modulo-2 operation, k is the recursion order, k=16, calculating the 17th value by summing all elements of the existing 16-length Golay sequence and performing a modulo-2 operation, g 17 =f(g1,g2,...,g 16 ) = 0, g 18 =f(g2,g3,...,g 17 ) = 1. And so on, we get g. 18 ,...,g 32 The value is changed from 0 to -1, resulting in a sequence of length 32: [1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1].

[0203] In some embodiments, based on predefined information, the first communication node can perform a sliding window operation on the set of pilot sequences to obtain at least one first pilot sequence.

[0204] For example, as shown in Figure 4, the predefined information includes prefix and suffix pilot sequence types. The prefix pilot sequence has a length of 32, and the suffix pilot sequence has a length of 16. A pilot sequence of length 64 is selected from the pilot sequence set as the parent sequence. From this parent sequence, the required prefix pilot sequence of length 32 and suffix pilot sequence of length 16 are obtained. Assuming a window size of 16 and a step size of 16, a sliding window operation is performed, sliding along the parent sequence of length 64 from left to right. After two slides, the value within the window is 32 in length, and this 32-length pilot sequence is used as the prefix pilot sequence. A third slide is performed, and the value within the third sliding window is used as the suffix pilot sequence.

[0205] For example, padding a 63-bit M-sequence with zeros (zeros become -1s) yields a 64-bit M-sequence [1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 1 -1 1 1 1 1 -1 1 1 1 1 -1 1 1 1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1]. Performing a sliding window operation, the first 32 bits of the M-sequence are used as a prefix pilot sequence [1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 [1], the sequence from bit 33 to bit 48 in the M sequence is used as the suffix pilot sequence [1 1 -1 1 1 1 -1 1 -1 1 1 -1 1 -1 1 -1 1].

[0206] For example, take a Golay sequence of length 64 [1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 1 1 -1 1 1 1 1 -1 1 1 1 1 -1 1 1 1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 -1], and perform a sliding window operation, using the first 32 bits of the Golay sequence as a prefix pilot sequence [1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 [1], the sequence from bit 33 to bit 48 in the Golay sequence is used as the suffix pilot sequence [1 1 -1 1 1 1 -1 1 -1 1 1 -1 1 -1 -1 1].

[0207] In some embodiments, based on predefined information, the first communication node can perform a cyclic shift operation on the set of pilot sequences to obtain at least one first pilot sequence.

[0208] For example, the pilot sequence types in the predefined information include prefix and suffix. The length of the prefix pilot sequence is 32, and the length of the suffix pilot sequence is 16. A pilot sequence of length 64 is selected from the pilot sequence set as the parent sequence. From this parent sequence, we need to obtain the required prefix pilot sequence of length 32 and the suffix pilot sequence of length 16. We can pad the M-sequence of length 63 with zeros (zeros become -1) to obtain the M-sequence of length 64: [1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 1 -1 -1 ... Perform a circular shift operation, shifting the 64-bit M sequence 3 positions to the left, resulting in [-1 -1 -1 -1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 1 -1 1 1 1 1 -1 1 1 1 -1 1 1 1 -1 1 1 -1 1 1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 ... The first 32 bits are used as the prefix pilot sequence [-1 -1 -1 -1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1 1 1 -1], and bits 33 to 48 are used as the suffix pilot sequence [1 1 1 -1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1].

[0209] For example, the pilot sequence types in the predefined information include prefix, infix, and suffix. The length of the prefix pilot sequence is 32, the length of the infix pilot sequence is 16, and the length of the suffix pilot sequence is 32. A pilot sequence of length 64 is selected from the pilot sequence set as the parent sequence. The required prefix pilot sequence of length 32, infix pilot sequence of length 16, and suffix pilot sequence of length 32 need to be obtained from the parent sequence of length 64. The M-sequence of length 63 can be padded with zeros (zeros become -1s) to obtain the M-sequence of length 64: [1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 1 1 1 - ... The first 32 bits of the 64-bit M-sequence are used as the prefix pilot sequence [1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 1 1], and bits 33 to 48 are used as the infix pilot sequence [1 1 -1 1 1 1 -1 1 -1 1 1 -1 1 -1 1 -1 1 1]. Perform a circular shift operation to right-shift the 64-bit M-sequence by 16 bits, resulting in the sequence [1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 1 1 1 1 - ...

[0210] In some embodiments, based on predefined information, the first communication node can perform repetitive operations and cyclic shift operations on the set of pilot sequences to obtain at least one first pilot sequence.

[0211] For example, the pilot sequence types in the predefined information include prefix and suffix. The length of the prefix pilot sequence is 32, and the length of the suffix pilot sequence is 16. A Barker code sequence of length 8 [-1 -1 -1 1 1 -1 1 -1] is selected from the pilot sequence set. The repetition operation is performed, repeating the Barker sequence of length 8 [-1 -1 -1 1 1 -1 1 -1] 4 times to obtain a prefix pilot sequence of length 32 [-1 -1 -1 1 1 - ... Then, a cyclic shift operation is performed, cyclically shifting the 8-length Barker sequence [-1 -1 -1 1 1 -1 1 -1] cyclically to the right by 4 to obtain the sequence [1 -1 1 -1 -1 -1 -1 1]. This sequence is then combined with the original sequence to obtain a sequence of length 16, which is [-1 -1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1] as the suffix pilot sequence.

[0212] In some examples, as shown in Figure 5, the pilot sequence types in the predefined information include prefix, infix, and suffix. The number of infix pilot sequences is 3, the length of the prefix pilot sequence is 32, the length of the infix pilot sequence is 16, and the length of the suffix pilot sequence is 32. Assuming a physical resource of 400 bits for information transmission, the information transmission block can be divided into 4 sub-data transmission blocks based on the number of infix pilot sequences. The first three sub-data transmission blocks are 150 bits in size, and the last sub-data block is 50 bits in size.

[0213] As shown in Figure 6, if different pilot sequences are used for each infix pilot sequence, the total length of the pilot sequences is 32*2 + 16*3 = 112. The 112-length pilot sequence selected from the pilot sequence set is divided into three parts: the first 32 bits are used as the prefix pilot sequence, the last 32 bits as the suffix pilot sequence, and the remaining bits are divided into three equal parts to form the three infix pilot sequences.

[0214] If the same pilot sequence is selected for each infix, the total length of the pilot sequence is 32*2+16=80. From the set of pilot sequences, an 80-bit pilot sequence is selected. The first 32 bits of the pilot sequence are used as the prefix pilot sequence, the last 32 bits as the suffix pilot sequence, and the remaining 16 bits are used as the three infix pilot sequences.

[0215] Figure 7 shows the relative positions of the prefix pilot sequence, infix pilot sequence, and suffix pilot sequence with each sub-data transmission block.

[0216] In some embodiments, based on predefined information, the first communication node can perform a protection bit information addition operation on the pilot sequence set to obtain at least one first pilot sequence. The following embodiments describe how to add protection bit information.

[0217] For example, the protection bit information may include N bits, where N is a positive integer greater than or equal to 0 and less than or equal to 5. N may also be a positive integer greater than or equal to 0 other than 5. This disclosure does not limit the value of N.

[0218] In some embodiments, when the pilot sequence type is prefix, at least one first pilot sequence includes a prefix pilot sequence, and the guard bit information addition operation is used to characterize adding guard bit information to the front of a prefix pilot sequence.

[0219] For example, the pilot sequence type in the predefined information is prefix, from the Barke sequence set of length 16: {-1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 -1; -1 -1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1; -1 -1 1 1 1 1 1 1 1 1 -1 1 1 1 -1 1 1 -1 -1; -1 1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1; -1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1; -1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1; 1 -1 -1 1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 1;1 -1 -1 1 1 -1 1 -1 1 1 1 1 1 -1 -1;1 -1 -1 1 1 1 1 1 1 -1 1 1 1 -1 1 1 -1 -1;1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 -1;1 1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 -1 1;1 1 -1 -1 1 1 1 1 1 1 1 1 - ... If the pilot sequence length in the predefined information is 16 and the pilot protection bit information bits are 4, perform the protection bit information addition operation to add protection bits to the Barker code sequence [-1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1] of length 16, and get the sequence [0 0 0 0 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1] of length 20.

[0220] If the pilot sequence length in the predefined information is 32 bits and the pilot protection bit information bits are 4 bits, repeat the 16-bit Barker code sequence [-1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1] twice and add the protection bit to obtain the 36-bit sequence [0 0 0 0-1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 ...

[0221] If the pilot sequence length in the predefined information is 64 bits and the pilot protection bit information bits are 4 bits, repeat the 16-bit Barker code sequence [-1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1] 4 times and add the protection bit to obtain a 68-bit sequence [0 0 0 0-1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 ...

[0222] In some embodiments, when the pilot sequence type is infix, at least one first pilot sequence includes at least one infix pilot sequence, and the guard bit information addition operation is used to characterize adding guard bit information before and after at least one infix pilot sequence.

[0223] In some embodiments, when the pilot sequence type is a suffix, at least one first pilot sequence includes a suffix pilot sequence, and the protection bit information addition operation is used to characterize adding protection bit information to the end of a suffix pilot sequence.

[0224] For example, the pilot sequence type in the predefined information includes prefixes and suffixes, from a set of Barke code sequences of length 16: {-1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1; -1 -1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1; -1 -1 1 1 1 1 1 1 1 -1 1 1 -1 1 1 -1 -1; -1 1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1; -1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1; -1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1; 1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 1} 1 -1 -1 1 1; 1 -1 -1 1 1 -1 1 -1 1 1 1 1 1 -1 -1; 1 -1 -1 1 1 1 1 1 1 -1 1 1 1 -1 1 1 -1 -1; 1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1; 1 1 -1 -1 1 -1 1 -1 1 1 1 1 1 -1 -1 1; 1 1 -1 -1 1 1 1 1 1 1 1 -1 1 -1 1 -1 1 -1 1} select the first sequence [-1 -1 1 1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 1 1 -1]. If the length of the prefix pilot sequence in the predefined information is 16, the length of the suffix pilot sequence is 16, and the pilot protection bit information is 4 bits, a protection bit addition operation is performed. Protection bits are added to the 16-bit Barker code sequence [-1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1], resulting in a 20-bit prefix pilot sequence [0 0 0 0 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1]. Similarly, protection bits are added to the 16-bit Barker code sequence [-1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1], resulting in a 20-bit suffix pilot sequence [-1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 1 0 0 0 0].

[0225] If the predefined information has a prefix pilot sequence length of 32, a suffix pilot sequence length of 32, and 4 pilot protection bits, repeating the 16-bit Barker code sequence [-1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1] twice and adding protection bits results in a 36-bit prefix pilot sequence [0 0 0 0 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1] twice and adding protection bits results in a 36-bit suffix pilot sequence [-1 -1 1 1] -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 1 -1 0 0 0 0).

[0226] If the length of the prefix pilot sequence and suffix pilot sequence in the predefined information is 64, and the pilot protection bit information bits are 4, repeating the 16-bit Barker code sequence [-1 -1 1 1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1] 4 times and adding the protection bit, we get a 68-bit prefix pilot sequence [0 0 0 0 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 -1 -1 ... Repeating -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1] four times and adding protection bits, we get a suffix pilot sequence of length 68: [-1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 0 0 0 0].

[0227] For example, the pilot sequence types in the predefined information include prefix, infix, and suffix, from the set of Barke code sequences of length 16: {-1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1; -1 -1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1; -1 -1 1 1 1 1 1 1 1 -1 1 1 -1 1 1 -1 1 -1 -1; -1 1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1; -1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1; -1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1; 1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 -1 1 1;1 -1 -1 1 1 -1 1 -1 1 1 1 1 1 -1 -1;1 -1 -1 1 1 1 1 1 1 1 -1 1 1 1 -1 -1 1 1 -1 -1;1 1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1 1 1 -1;1 1 -1 -1 1 -1 1 -1 1 -1 1 1 1 1 -1 1 -1 -1 1;1 1 -1 -1 1 1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 1} Select the first sequence [-1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 1 -1] and the second sequence [-1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1] in the ... -1 -1 -1 -1] in the sequence [-1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1] in the sequence [-1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1] in the sequence [-1 -1 1 1 -1 1 -1 1 -1 -1 -1 -1] in the sequence [-1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 -1] in the sequence [-1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 -1] in the sequence [-1 -1 1 [1 1 -1] and the third sequence [-1 -1 1 1 1 1 1 1 -1 1 -1 1 1 -1 -1 -1].

[0228] If the predefined information contains a prefix pilot sequence of length 16, an infix pilot sequence of length 16, a suffix pilot sequence of length 16, and a pilot protection bit information of 4 bits, adding protection bits to the 16-bit Barker code sequence [-1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1] yields a prefix pilot sequence of length 20 [0 0 0 0 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1]. Adding protection bits to the 16-bit Barker code sequence [-1 -1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1] yields an infix pilot sequence of length 24 [0 0 0 0 -1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 1 1 -1 0]. [0 0 0], add guard bits to the 16-length Barker code sequence [-1 -1 1 1 1 1 1 1 -1 1 -1 1 1 -1 -1] to obtain a 20-length suffix pilot sequence [-1 -1 1 1 1 1 1 1 -1 1 -1 1 1 -1 0 0 0 0].

[0229] If the length of the prefix pilot sequence in the pilot-related information is 32, the suffix length is 32, and the pilot protection bit information is 4 bits, repeating the 16-bit Barker code sequence [-1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1] twice and adding the protection bit results in a 36-bit prefix pilot sequence [0 0 0 0 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1] twice and adding the protection bit results in a 40-bit infix pilot sequence [0 0 0 0……0 0] [0 0], repeat the 16-length Barker code sequence [-1 -1 1 1 1 1 1 1 -1 1 -1 1 1 -1 -1] twice and add protection bits to obtain a 36-length suffix pilot sequence [-1 -1 1 1 1 1 1 1 -1 1 -1 1 1 -1 -1 -1 -1 1 1 1 1 1 1 -1 1 1 -1 1 1 -1 0 0 0 0].

[0230] If the lengths of the prefix and suffix pilot sequences in the pilot-related information are 64, and the pilot protection bits are 4, repeating the 16-bit Barker code sequence [-1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1] four times and adding protection bits results in a 68-bit prefix pilot sequence [0 0 0 0 -1 -1 1 1 -1 -1 -1 -1 ... Repeating the sequence [-1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 1 1 -1] four times and adding protection bits, we obtain an infix pilot sequence of length 72 [0 0 0 0 -1 -1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 0 0 0 0], we then convert this sequence into a Barker code of length 16 [-1 -1 1 1 1 1 1 1 1 - ... Repeating -1] 4 times and adding protection bits, we get a suffix pilot sequence of length 68: [-1 -1 1 1 1 1 1 1 -1 1 -1 1 1 -1 -1 -1 -1 1 1 1 1 1 -1 1 -1 -1 -1 -1 -1 1 1 1 1 1 1 -1 1 1 1 1 1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 1 1 1 1 1 -1 1 1 1 -1 1 1 1 -1 0 0 0 0].

[0231] In this disclosure, if the pilot sequence in the pilot sequence set contains pilot protection information bits, when performing pilot operations, only the pilot information bits excluding the pilot protection bits are operated on. For example, if the number of valid pilot sequences in the pilot sequence set is 16, the 16 valid pilot sequences plus 4 pilot protection bits result in a total pilot sequence of 20 bits, which is [0 0 0 0 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1] or [-1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 1 -1 0 0 0 0]. Adding 4 pilot protection bits to a 16-bit effective long pilot sequence, plus another 4 pilot protection bits, yields a total of 24 pilot sequences [0 0 0 0 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 1 -1 0 0 0 0].

[0232] If the pilot sequence type in the predefined information includes a prefix and a suffix, the length of the prefix pilot sequence is 64, the length of the suffix pilot sequence is 32, and the effective pilot sequences selected from the pilot sequence set are sequences of length 16, the prefix pilot sequence is [0 0 0 0 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 1 1 -1], and the suffix pilot sequence is -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 -1 0 0 0 0]. Repeating [-1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 1 -1] in the prefix pilot sequence four times yields a prefix pilot sequence of effective length 64: [0 0 0 0 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 1 1 -1]. Repeat the suffix pilot sequence [-1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 1 -1] 4 times to obtain a suffix pilot sequence with an effective length of 64: [-1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 -1 0 0 0 0].

[0233] This disclosure prevents pilot sequence deviation by adding protection bits to the pilot sequence.

[0234] Figure 8 shows a flowchart of another pilot sequence generation method. As shown in Figure 8, this pilot sequence generation method is applied to the second communication node, including S401:

[0235] S401, Receive pilot signals from the first communication node on physical resources.

[0236] The pilot signal is generated by mapping at least one first pilot sequence onto physical resources, and the at least one first pilot sequence is determined from a set of pilot sequences based on predefined information.

[0237] In some embodiments, the second communication node may receive pilot signals from the first communication node on physical resources to perform channel estimation, interference estimation, or sampling frequency offset estimation based on the pilot signals.

[0238] In this disclosure, the pilot signal received by the second communication node is generated and sent by the first communication node. For details on how the first communication node generates and sends the pilot signal, please refer to the relevant descriptions in the above embodiments, which will not be repeated here.

[0239] In some embodiments, the pilot sequence set includes at least one subset; the subset includes at least one second pilot sequence; the predefined information includes at least one of the following: pilot sequence type, number of pilot sequence repetitions, pilot sequence length, number of first pilot sequences, number of second pilot sequences, subset indication information, and pilot sequence indication information.

[0240] In some embodiments, the pilot sequence set includes at least one of the following: the Barker sequence set, the Golay sequence set, and the M sequence set.

[0241] In some embodiments, predefined information is obtained through signaling or a predefined method.

[0242] In some embodiments, the predefined information includes pilot sequence type and number of first pilot sequences, including at least one of the following:

[0243] When the number of first pilot sequences is 1 and the pilot sequence type includes prefix and infix, at least one first pilot sequence includes one prefix pilot sequence and at least one infix pilot sequence, and at least one first pilot sequence is the same pilot sequence in the same subset;

[0244] When the number of first pilot sequences is 1 and the pilot sequence type includes prefix and suffix, at least one first pilot sequence includes one prefix pilot sequence and one suffix pilot sequence, and at least one first pilot sequence is the same pilot sequence in the same subset;

[0245] When the number of first pilot sequences is 1 and the pilot sequence types include prefix, infix and suffix, at least one first pilot sequence includes one prefix pilot sequence, at least one infix pilot sequence and one suffix pilot sequence, and at least one first pilot sequence is the same pilot sequence in the same subset;

[0246] When the number of first pilot sequences is greater than 1 and the pilot sequence type includes prefix and infix, at least one first pilot sequence includes one prefix pilot sequence and at least one infix pilot sequence, and at least one first pilot sequence is a different pilot sequence in the same subset;

[0247] When the number of first pilot sequences is greater than 1 and the pilot sequence type includes prefix and suffix, at least one first pilot sequence includes one prefix pilot sequence and one suffix pilot sequence, and at least one first pilot sequence is a different pilot sequence in the same subset;

[0248] When the number of first pilot sequences is greater than 1 and the pilot sequence type includes prefix and infix, at least one first pilot sequence includes one prefix pilot sequence and at least one infix pilot sequence, and at least one first pilot sequence is a different pilot sequence in a different subset;

[0249] When the number of first pilot sequences is greater than 1 and the pilot sequence type includes prefix and suffix, at least one first pilot sequence includes one prefix pilot sequence and one suffix pilot sequence, and at least one first pilot sequence is a different pilot sequence in a different subset;

[0250] When the number of first pilot sequences is greater than 1 and the pilot sequence types include prefix, infix and suffix, at least one first pilot sequence includes one prefix pilot sequence, at least one infix pilot sequence and one suffix pilot sequence, and at least one first pilot sequence is different pilot sequences in the same subset;

[0251] When the number of first pilot sequences is greater than 1 and the pilot sequence types include prefix, infix, and suffix, at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence, and one suffix pilot sequence. A prefix pilot sequence and at least one infix pilot sequence are the same pilot sequence in the first subset, and a suffix pilot sequence is a pilot sequence in a subset different from the first subset. A prefix pilot sequence or at least one infix pilot sequence is different from a suffix pilot sequence.

[0252] When the number of first pilot sequences is greater than 1 and the pilot sequence types include prefix, infix, and suffix, at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence, and one suffix pilot sequence. A prefix pilot sequence and a suffix pilot sequence are the same pilot sequence in the second subset. At least one infix pilot sequence is a pilot sequence in a subset different from the second subset. A prefix pilot sequence or a suffix pilot sequence is different from at least one infix pilot sequence.

[0253] When the number of first pilot sequences is greater than 1 and the pilot sequence types include prefix, infix, and suffix, at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence, and one suffix pilot sequence. At least one infix pilot sequence and one suffix pilot sequence are the same pilot sequence in the third subset. One prefix pilot sequence is a pilot sequence in a subset different from the third subset. At least one infix pilot sequence or one suffix pilot sequence is different from one prefix pilot sequence.

[0254] In some embodiments, the predefined information includes pilot sequence type and subset indication information, including at least one of the following:

[0255] When the pilot sequence type is prefix, at least one first pilot sequence includes one prefix pilot sequence, and one prefix pilot sequence is any pilot sequence in the subset;

[0256] When the pilot sequence type includes prefix and infix, at least one first pilot sequence includes a prefix pilot sequence and at least one infix pilot sequence, and at least one first pilot sequence is the same pilot sequence in the subset;

[0257] When the pilot sequence type includes prefix and infix, at least one first pilot sequence includes a prefix pilot sequence and at least one infix pilot sequence, and at least one first pilot sequence is a different pilot sequence in the subset;

[0258] When the pilot sequence type includes a prefix and a suffix, at least one first pilot sequence includes a prefix pilot sequence and a suffix pilot sequence, and at least one first pilot sequence is the same pilot sequence in the subset;

[0259] In the case where the pilot sequence type includes a prefix and a suffix, at least one first pilot sequence includes a prefix pilot sequence and a suffix pilot sequence, and at least one first pilot sequence is a different pilot sequence in the subset;

[0260] When the pilot sequence type includes prefix, infix and suffix, at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence and a suffix pilot sequence, and at least one first pilot sequence is the same pilot sequence in the subset;

[0261] In the case where the pilot sequence type includes prefix, infix and suffix, at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence and a suffix pilot sequence, and at least one first pilot sequence is a different pilot sequence in the subset.

[0262] In some embodiments, the predefined information includes pilot sequence type and pilot sequence length, and includes at least one of the following:

[0263] In the case where the pilot sequence type includes prefix and infix, at least one first pilot sequence includes a prefix pilot sequence and at least one infix pilot sequence, and at least one first pilot sequence has the same length;

[0264] When the pilot sequence type includes prefix and infix, at least one first pilot sequence includes a prefix pilot sequence and at least one infix pilot sequence, wherein the length of a prefix pilot sequence is N1 times the length of at least one infix pilot sequence, and N1 is a positive integer greater than or equal to 1;

[0265] When the pilot sequence type includes prefix, infix and suffix, at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence and a suffix pilot sequence, and at least one first pilot sequence has the same length;

[0266] When the pilot sequence type includes prefix, infix and suffix, at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence and a suffix pilot sequence, the length of a prefix pilot sequence and the length of a suffix pilot sequence are the same, and the length of a prefix pilot sequence or a suffix pilot sequence is greater than the length of at least one infix pilot sequence.

[0267] When the pilot sequence type includes prefix, infix and suffix, at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence and a suffix pilot sequence, at least one infix pilot sequence and a suffix pilot sequence have the same length, and the length of a prefix pilot sequence is greater than the length of at least one infix pilot sequence or a suffix pilot sequence.

[0268] When the pilot sequence type includes prefix, infix and suffix, at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence and a suffix pilot sequence. The length of a prefix pilot sequence and a suffix pilot sequence are the same. The length of a prefix pilot sequence or a suffix pilot sequence is N2 times the length of at least one infix pilot sequence, where N2 is a positive integer greater than or equal to 1.

[0269] When the pilot sequence type includes prefix, infix and suffix, at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence and a suffix pilot sequence, the length of at least one infix pilot sequence and the length of one suffix pilot sequence are the same, and the length of one prefix pilot sequence is N3 times the length of at least one infix pilot sequence or one suffix pilot sequence, where N3 is a positive integer greater than or equal to 1;

[0270] In the case where the pilot sequence type includes a prefix and a suffix, at least one first pilot sequence includes a prefix pilot sequence and a suffix pilot sequence, and at least one first pilot sequence has the same length;

[0271] When the pilot sequence type includes a prefix and a suffix, at least one first pilot sequence includes a prefix pilot sequence and a suffix pilot sequence, and the length of a prefix pilot sequence is greater than the length of a suffix pilot sequence.

[0272] In some embodiments, the predefined information includes pilot sequence type and pilot sequence length; the pilot sequence length includes at least one of the following: a first length set, a second length set, a third length set, a fourth length set, a fifth length set, a sixth length set, a seventh length set, and an eighth length set;

[0273] When the pilot sequence type is prefix, at least one first pilot sequence includes one prefix pilot sequence, and the length of one prefix pilot sequence is any length among the multiple lengths included in the first length set;

[0274] When the pilot sequence type includes prefix and infix, at least one first pilot sequence includes one prefix pilot sequence and at least one infix pilot sequence. The length of one prefix pilot sequence is any length among the multiple lengths included in the second length set, and the length of at least one infix pilot sequence is any length among the multiple lengths included in the third length set. The length of one prefix pilot sequence is greater than or equal to the length of at least one infix pilot sequence.

[0275] When the pilot sequence type includes a prefix and a suffix, at least one first pilot sequence includes a prefix pilot sequence and a suffix pilot sequence. The length of a prefix pilot sequence is any length among the multiple lengths included in the fourth length set, and the length of a suffix pilot sequence is any length among the multiple lengths included in the fifth length set. The length of a prefix pilot sequence is greater than or equal to the length of a suffix pilot sequence.

[0276] When the pilot sequence type includes prefix, infix, and suffix, at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence, and one suffix pilot sequence. The length of a prefix pilot sequence is any length among the multiple lengths included in the sixth length set, the length of at least one infix pilot sequence is any length among the multiple lengths included in the seventh length set, and the length of a suffix pilot sequence is any length among the multiple lengths included in the eighth length set. The length of a prefix pilot sequence is greater than or equal to the length of a suffix pilot sequence, and the length of a suffix pilot sequence is greater than or equal to the length of at least one infix pilot sequence.

[0277] In some embodiments, the first pilot sequence is obtained by repeating the second pilot sequence, and the length of the first pilot sequence is greater than that of the second pilot sequence.

[0278] In some embodiments, the predefined information includes pilot sequence type and second pilot sequence quantity; the second pilot sequence quantity is any one of the following: 1. a first quantity set and a second quantity set;

[0279] When the pilot sequence type is prefix, the number of the second pilot sequence is 1;

[0280] When the pilot sequence type includes prefix and infix, and the number of second pilot sequences is greater than 1, the number of prefix pilot sequences included in at least one first pilot sequence is 1, and the number of infix pilot sequences included in at least one first pilot sequence is the difference between the number of second pilot sequences in the first quantity set and 1.

[0281] When the pilot sequence type includes prefix, infix and suffix, and the number of second pilot sequences is greater than 2, at least one first pilot sequence includes a prefix pilot sequence of 1, at least one first pilot sequence includes a suffix pilot sequence of 1, and at least one first pilot sequence includes an infix pilot sequence of the difference between the number of second pilot sequences in the second quantity set and 2.

[0282] In some embodiments, at least one first pilot sequence is obtained by performing an operation on a set of pilot sequences based on predefined information; the operation includes at least one of the following: direct selection operation, repetition operation, cyclic shift operation, recursive operation, sliding window operation, and protection bit information addition operation.

[0283] In some embodiments, when the pilot sequence type is prefix, at least one first pilot sequence includes a prefix pilot sequence, and the guard bit information addition operation is used to characterize adding guard bit information to the front of a prefix pilot sequence;

[0284] When the pilot sequence type is infix, at least one first pilot sequence includes at least one infix pilot sequence, and the protection bit information addition operation is used to characterize adding protection bit information before and after at least one infix pilot sequence;

[0285] When the pilot sequence type is a suffix, at least one first pilot sequence includes one suffix pilot sequence. The protection bit information addition operation is used to characterize adding protection bit information to the end of a suffix pilot sequence. The above description can be found in the above embodiments, and will not be repeated here.

[0286] The following uses the interaction between the first communication node and the second communication node as an example to introduce the pilot sequence generation method provided in the above embodiment, as shown in Figure 9, including:

[0287] S901, The first communication node determines at least one first pilot sequence from the set of pilot sequences based on predefined information.

[0288] S902, The first communication node maps at least one first pilot sequence onto physical resources to generate pilot signals.

[0289] S903, the first communication node sends a pilot signal to the second communication node. Correspondingly, the second communication node receives the pilot signal sent by the first communication node to generate and transmit the pilot signal.

[0290] In other words, based on the interaction between the first communication node and the second communication node, the embodiments of this disclosure realize that the first communication node determines the first pilot sequence, generates a pilot signal based on the pilot sequence, sends the pilot signal to the second communication node, and the second communication node receives the pilot signal.

[0291] It is understood that, in order to achieve the above-mentioned functions, the communication device includes hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art should readily recognize that, based on the algorithmic steps of the examples described in conjunction with the embodiments of this disclosure, this disclosure can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this disclosure.

[0292] This disclosure embodiment can divide the communication device into functional modules according to the above method embodiment. For example, each function can be divided into a separate functional module, or two or more functions can be integrated into one functional module. The integrated module can be implemented in hardware or software. It should be noted that the module division in this disclosure embodiment is illustrative and only represents one logical functional division. In actual implementation, there may be other division methods. The following description uses the example of dividing each functional module according to each function.

[0293] Figure 10 is a block diagram of a communication device according to some embodiments of the present disclosure. The communication device can be applied to a first communication node and execute the pilot sequence generation method shown in Figure 2 above. As shown in Figure 10, the communication device 1000 includes: a processing module 1001 and a transmitting module 1002.

[0294] Processing module 1001 is used to determine at least one first pilot sequence from a set of pilot sequences based on predefined information. Processing module 1001 is also used to map the at least one first pilot sequence onto physical resources to generate a pilot signal. Transmitting module 1002 is used to transmit the pilot signal to the second communication node.

[0295] In some embodiments, the processing module 1001 is further configured to perform operations on the pilot sequence set based on predefined information to obtain at least one first pilot sequence; the operations include at least one of the following: direct selection operation, repetition operation, cyclic shift operation, recursive operation, sliding window operation, and protection bit information addition operation.

[0296] Figure 11 is a block diagram of another communication device according to some embodiments of the present disclosure. The communication device 1100 can be applied to a second communication node and execute the pilot sequence generation method shown in Figure 8 above. As shown in Figure 11, the communication device 1100 includes: a receiving module 1101.

[0297] The receiving module 1101 is used to receive pilot signals from the first communication node on physical resources. The pilot signals are generated by mapping at least one first pilot sequence onto the physical resources. The at least one first pilot sequence is determined from a set of pilot sequences based on predefined information.

[0298] In implementing the functions of the integrated modules described above in hardware, this disclosure provides another structure for the communication device involved in the above embodiments. As shown in FIG12, the communication device 1200 includes a processor 1202 and a bus 1204. In some embodiments, the communication device may further include a memory 1201. In some embodiments, the communication device may further include a communication interface 1203.

[0299] Processor 1202 may implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with embodiments of this disclosure. Processor 1202 may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It may implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with embodiments of this disclosure. Processor 1202 may also be a combination of functions implementing computation, such as a combination of one or more microprocessors, a digital signal processor (DSP), and a microprocessor.

[0300] The communication interface 1203 is used to connect with other devices via a communication network. This communication network can be Ethernet, wireless access network, wireless local area network (WLAN), etc.

[0301] The memory 1201 may be a read-only memory (ROM) or other type of static storage device capable of storing static information and instructions, random access memory (RAM) or other type of dynamic storage device capable of storing information and instructions, or electrically erasable programmable read-only memory (EEPROM), disk storage medium or other magnetic storage device, or any other medium capable of carrying or storing desired program code in the form of instructions or data structures and accessible by a computer, but is not limited thereto.

[0302] In some embodiments, the memory 1201 may exist independently of the processor 1202. The memory 1201 may be connected to the processor 1202 via a bus 1204 and may be used to store instructions or program code. When the processor 1202 calls and executes the instructions or program code stored in the memory 1201, it can implement the pilot sequence generation method provided in the embodiments of this disclosure.

[0303] In other embodiments, the memory 1201 may also be integrated with the processor 1202.

[0304] Bus 1204 can be an extended industry standard architecture (EISA) bus, etc. Bus 1204 can be divided into address bus, data bus, control bus, etc. For ease of illustration, only one thick line is used to represent it in Figure 12, but this does not mean that there is only one bus or one type of bus.

[0305] Some embodiments of this disclosure provide a computer-readable storage medium (e.g., a non-transitory computer-readable storage medium) storing computer program instructions that, when executed on a computer, cause the computer to perform a pilot sequence generation method as described in any of the above embodiments.

[0306] Exemplary examples show that the aforementioned computer-readable storage media may include, but are not limited to: magnetic storage devices (e.g., hard disks, floppy disks, or magnetic tapes), optical discs (e.g., compact disks (CDs), digital versatile disks (DVDs), etc.), smart cards, and flash memory devices (e.g., erasable programmable read-only memory (EPROMs), cards, sticks, or key drives, etc.). The various computer-readable storage media described in this disclosure may represent one or more devices and / or other machine-readable storage media for storing information. The term "machine-readable storage medium" may include, but is not limited to, wireless channels and various other media capable of storing, containing, and / or carrying instructions and / or data.

[0307] This disclosure provides a computer program product containing instructions that, when run on a computer, cause the computer to execute the pilot sequence generation method described in any of the above embodiments.

[0308] The above description is merely a specific embodiment of this disclosure, but the scope of protection of this disclosure is not limited thereto. Any changes or substitutions within the technical scope disclosed in this disclosure should be included within the scope of protection of this disclosure. Therefore, the scope of protection of this disclosure should be determined by the scope of the claims.

Claims

1. A method for generating pilot sequences, wherein, Applied to the first communication node, including: Based on predefined information, at least one first pilot sequence is determined from the set of pilot sequences; Map the at least one first pilot sequence onto physical resources to generate pilot signals; The pilot signal is sent to the second communication node.

2. The method according to claim 1, wherein, The pilot sequence set includes at least one subset; the subset includes at least one second pilot sequence; the predefined information includes at least one of the following: pilot sequence type, number of pilot sequence repetitions, pilot sequence length, number of first pilot sequences, number of second pilot sequences, subset indication information, and pilot sequence indication information.

3. The method according to claim 1, wherein, The pilot sequence set includes at least one of the following: the Barker sequence set, the Golay sequence set, and the M sequence set.

4. The method according to claim 1, wherein, The predefined information is obtained through signaling or predefined methods.

5. The method according to claim 2, wherein, The predefined information includes the pilot sequence type and the number of the first pilot sequences, and includes at least one of the following: When the number of the first pilot sequences is 1 and the pilot sequence type includes prefix and infix, the at least one first pilot sequence includes one prefix pilot sequence and at least one infix pilot sequence, and the at least one first pilot sequence is the same pilot sequence in the same subset; or, When the number of the first pilot sequences is 1 and the pilot sequence type includes a prefix and a suffix, the at least one first pilot sequence includes a prefix pilot sequence and a suffix pilot sequence, and the at least one first pilot sequence is the same pilot sequence in the same subset; or, When the number of the first pilot sequences is 1 and the pilot sequence type includes prefix, infix and suffix, the at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence and a suffix pilot sequence, and the at least one first pilot sequence is the same pilot sequence in the same subset; or, When the number of the first pilot sequences is greater than 1 and the pilot sequence type includes prefix and infix, the at least one first pilot sequence includes one prefix pilot sequence and at least one infix pilot sequence, and the at least one first pilot sequence is different pilot sequences in the same subset; or, When the number of the first pilot sequences is greater than 1 and the pilot sequence type includes prefix and suffix, the at least one first pilot sequence includes a prefix pilot sequence and a suffix pilot sequence, and the at least one first pilot sequence is a different pilot sequence in the same subset; or, When the number of the first pilot sequences is greater than 1 and the pilot sequence type includes prefix and infix, the at least one first pilot sequence includes a prefix pilot sequence and at least one infix pilot sequence, and the at least one first pilot sequence is a different pilot sequence in a different subset; or, When the number of the first pilot sequences is greater than 1 and the pilot sequence type includes a prefix and a suffix, the at least one first pilot sequence includes a prefix pilot sequence and a suffix pilot sequence, and the at least one first pilot sequence is a different pilot sequence in a different subset; or, When the number of the first pilot sequences is greater than 1 and the pilot sequence type includes prefix, infix and suffix, the at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence and a suffix pilot sequence, and the at least one first pilot sequence is different pilot sequences in the same subset; or, When the number of the first pilot sequences is greater than 1 and the pilot sequence type includes prefix, infix, and suffix, the at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence, and one suffix pilot sequence. The prefix pilot sequence and the at least one infix pilot sequence are the same pilot sequence in the first subset, and the suffix pilot sequence is a pilot sequence in a subset different from the first subset. The prefix pilot sequence or the at least one infix pilot sequence is different from the suffix pilot sequence. or, When the number of the first pilot sequences is greater than 1 and the pilot sequence type includes prefix, infix, and suffix, the at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence, and one suffix pilot sequence. The prefix pilot sequence and the suffix pilot sequence are the same pilot sequence in the second subset. The at least one infix pilot sequence is a pilot sequence in a subset different from the second subset. The prefix pilot sequence or the suffix pilot sequence is different from the at least one infix pilot sequence. or, When the number of the first pilot sequences is greater than 1 and the pilot sequence type includes prefix, infix, and suffix, the at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence, and one suffix pilot sequence. The at least one infix pilot sequence and the one suffix pilot sequence are the same pilot sequence in a third subset. The one prefix pilot sequence is a pilot sequence in a subset different from the third subset. The at least one infix pilot sequence or the one suffix pilot sequence is different from the one prefix pilot sequence.

6. The method according to claim 2, wherein, The predefined information includes the pilot sequence type and the subset indication information, and includes at least one of the following: When the pilot sequence type is prefix, the at least one first pilot sequence includes a prefix pilot sequence, and the prefix pilot sequence is any pilot sequence in the subset; or, When the pilot sequence type includes prefix and infix, the at least one first pilot sequence includes a prefix pilot sequence and at least one infix pilot sequence, and the at least one first pilot sequence is the same pilot sequence in the subset; or, When the pilot sequence type includes prefix and infix, the at least one first pilot sequence includes a prefix pilot sequence and at least one infix pilot sequence, and the at least one first pilot sequence is a different pilot sequence in the subset; or, When the pilot sequence type includes a prefix and a suffix, the at least one first pilot sequence includes a prefix pilot sequence and a suffix pilot sequence, and the at least one first pilot sequence is the same pilot sequence in the subset; or, When the pilot sequence type includes a prefix and a suffix, the at least one first pilot sequence includes a prefix pilot sequence and a suffix pilot sequence, and the at least one first pilot sequence is a different pilot sequence in the subset; or, When the pilot sequence type includes prefix, infix, and suffix, the at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence, and a suffix pilot sequence, and the at least one first pilot sequence is the same pilot sequence in the subset; or, When the pilot sequence type includes prefix, infix, and suffix, the at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence, and a suffix pilot sequence, wherein the at least one first pilot sequence is a different pilot sequence in the subset.

7. The method according to claim 2, wherein, The predefined information includes the pilot sequence type and the pilot sequence length, and includes at least one of the following: When the pilot sequence type includes prefix and infix, the at least one first pilot sequence includes a prefix pilot sequence and at least one infix pilot sequence, and the at least one first pilot sequence has the same length; or, When the pilot sequence type includes prefix and infix, the at least one first pilot sequence includes a prefix pilot sequence and at least one infix pilot sequence, wherein the length of the prefix pilot sequence is N1 times the length of the at least one infix pilot sequence, where N1 is a positive integer greater than or equal to 1; or, When the pilot sequence type includes prefix, infix, and suffix, the at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence, and a suffix pilot sequence, and the at least one first pilot sequence has the same length; or, When the pilot sequence type includes prefix, infix, and suffix, the at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence, and a suffix pilot sequence. The length of the prefix pilot sequence and the length of the suffix pilot sequence are the same, and the length of the prefix pilot sequence or the suffix pilot sequence is greater than the length of the at least one infix pilot sequence. or, When the pilot sequence type includes prefix, infix, and suffix, the at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence, and a suffix pilot sequence. The at least one infix pilot sequence and the suffix pilot sequence have the same length, and the length of the prefix pilot sequence is greater than the length of the at least one infix pilot sequence or the suffix pilot sequence. or, When the pilot sequence type includes prefix, infix, and suffix, the at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence, and one suffix pilot sequence. The prefix pilot sequence and the suffix pilot sequence have the same length, and the length of the prefix pilot sequence or the suffix pilot sequence is N² times the length of the at least one infix pilot sequence, where N² is a positive integer greater than or equal to 1; or... When the pilot sequence type includes prefix, infix, and suffix, the at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence, and one suffix pilot sequence. The at least one infix pilot sequence and the at least one suffix pilot sequence have the same length. The prefix pilot sequence is N3 times the length of either the at least one infix pilot sequence or the at least one suffix pilot sequence, where N3 is a positive integer greater than or equal to 1. Alternatively... When the pilot sequence type includes a prefix and a suffix, the at least one first pilot sequence includes a prefix pilot sequence and a suffix pilot sequence, and the at least one first pilot sequence has the same length; or, When the pilot sequence type includes a prefix and a suffix, the at least one first pilot sequence includes a prefix pilot sequence and a suffix pilot sequence, wherein the length of the prefix pilot sequence is greater than the length of the suffix pilot sequence.

8. The method according to claim 2, wherein, The predefined information includes the pilot sequence type and the pilot sequence length; the pilot sequence length includes at least one of the following: a first length set, a second length set, a third length set, a fourth length set, a fifth length set, a sixth length set, a seventh length set, and an eighth length set; When the pilot sequence type is a prefix, the at least one first pilot sequence includes a prefix pilot sequence, and the length of the prefix pilot sequence is any one of the multiple lengths included in the first length set; or, When the pilot sequence type includes prefix and infix, the at least one first pilot sequence includes a prefix pilot sequence and at least one infix pilot sequence. The length of the prefix pilot sequence is any length among the multiple lengths included in the second length set, and the length of the at least one infix pilot sequence is any length among the multiple lengths included in the third length set. The length of the prefix pilot sequence is greater than or equal to the length of the at least one infix pilot sequence. or, When the pilot sequence type includes a prefix and a suffix, the at least one first pilot sequence includes a prefix pilot sequence and a suffix pilot sequence. The length of the prefix pilot sequence is any length among the multiple lengths included in the fourth length set, and the length of the suffix pilot sequence is any length among the multiple lengths included in the fifth length set. The length of the prefix pilot sequence is greater than or equal to the length of the suffix pilot sequence. or, When the pilot sequence type includes prefix, infix, and suffix, the at least one first pilot sequence includes a prefix pilot sequence, at least one infix pilot sequence, and one suffix pilot sequence. The length of the prefix pilot sequence is any length among the multiple lengths included in the sixth length set, the length of the at least one infix pilot sequence is any length among the multiple lengths included in the seventh length set, and the length of the suffix pilot sequence is any length among the multiple lengths included in the eighth length set. The length of the prefix pilot sequence is greater than or equal to the length of the suffix pilot sequence, and the length of the suffix pilot sequence is greater than or equal to the length of the at least one infix pilot sequence.

9. The method according to claim 8, wherein, The first pilot sequence is obtained by repeating the second pilot sequence, and the length of the first pilot sequence is greater than that of the second pilot sequence.

10. The method according to claim 2, wherein, The predefined information includes the pilot sequence type and the number of the second pilot sequences; the number of the second pilot sequences is any one of the following:

1. a first set of quantities, or a second set of quantities; When the pilot sequence type is a prefix, the number of the second pilot sequence is 1; or, When the pilot sequence type includes prefix and infix, and the number of the second pilot sequence is greater than 1, the number of prefix pilot sequences included in the at least one first pilot sequence is 1, and the number of infix pilot sequences included in the at least one first pilot sequence is the difference between the number of the second pilot sequence in the first set of numbers and 1; or, When the pilot sequence type includes prefix, infix, and suffix, and the number of the second pilot sequences is greater than 2, the number of prefix pilot sequences included in the at least one first pilot sequence is 1, the number of suffix pilot sequences included in the at least one first pilot sequence is 1, and the number of infix pilot sequences included in the at least one first pilot sequence is the difference between the number of the second pilot sequences in the second quantity set and 2.

11. The method according to claim 2, wherein, The step of determining at least one first pilot sequence from the set of pilot sequences based on predefined information includes: Based on predefined information, operations are performed on the set of pilot sequences to obtain at least one first pilot sequence; the operations include at least one of the following: direct selection operation, repetition operation, cyclic shift operation, recursive operation, sliding window operation, and protection bit information addition operation.

12. The method according to claim 11, wherein, When the pilot sequence type is prefix, the at least one first pilot sequence includes a prefix pilot sequence, and the guard bit information addition operation is used to characterize adding the guard bit information to the front of the prefix pilot sequence; or, When the pilot sequence type is infix, the at least one first pilot sequence includes at least one infix pilot sequence, and the guard bit information addition operation is used to characterize adding the guard bit information before and after the at least one infix pilot sequence; or, When the pilot sequence type is a suffix, the at least one first pilot sequence includes a suffix pilot sequence, and the protection bit information addition operation is used to characterize adding the protection bit information to the end of the suffix pilot sequence.

13. A method for generating pilot sequences, wherein, Applied to a second communication node, the method includes: The system receives pilot signals from a first communication node on physical resources. The pilot signals are generated by mapping at least one first pilot sequence onto the physical resources. The at least one first pilot sequence is determined from a set of pilot sequences based on predefined information.

14. A communication device, wherein, include: Memory and processor; The memory and the processor are coupled; The memory is used to store instructions that the processor can execute; When the processor executes the instructions, it performs the method as described in any one of claims 1-13.

15. A computer-readable storage medium, wherein, The computer-readable storage medium includes a non-transitory computer-readable storage medium on which computer instructions are stored, which, when executed on a computer, cause the computer to perform the method as described in any one of claims 1-13.

16. A computer program product, wherein, The computer program product includes computer program instructions that, when executed, implement the method as described in any one of claims 1-13.

Images