Signal transmission method and communication apparatus

Abstract

Provided in the present application are a signal transmission method and a communication apparatus. The method may comprise: receiving a first signal, wherein the first signal comprises X OOK symbols, the X OOK symbols comprise X1 first symbols and X2 second symbols, the first symbols are different from the second symbols, and the X1 first symbols are generated on the basis of N first sequences, or the X1 first symbols are generated on the basis of one second sequence, the N first sequences being sequences among M sequences, the second sequence being a sequence among L sequences, the L sequences forming a subset of the M sequences, M, N and X being integers greater than 1, L being an integer greater than 1 or equal to 1 and less than M, X1 and X2 being integers greater than or equal to 0, and X1+X2=X. On this basis, the number of candidate sequences can be relatively small; in this way, the correlation between different sequences among candidate sequences is relatively low, such that the probability of two cells being configured with highly correlated sequences can be reduced, thereby reducing signal interference between cells.

Description

Methods and communication devices for signal transmission

[0001] This application claims priority to Chinese Patent Application No. 202411588952.X, filed on November 7, 2024, entitled "Method and Communication Apparatus for Signal Transmission", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of wireless communication, and more specifically, to a method and apparatus for signal transmission. Background Technology

[0003] Terminal devices can receive signals (such as wake-up signals) through a separate low-power circuit, such as a wake-up radio (WUR), while the main receiver can be in sleep mode. Taking the wake-up signal as an example, when the terminal device detects the wake-up signal via the WUR, it triggers the main receiver to wake up. After the main receiver wakes up, the terminal device can receive paging, data, etc., through the main receiver. How to design the sequence used to generate the wake-up signal to reduce interference is a problem worth considering. Summary of the Invention

[0004] This application provides a signal transmission method and communication apparatus, which designs a sequence of generated signals (such as wake-up signals) to minimize signal interference between cells.

[0005] Firstly, a signal transmission method is provided. This method can be applied to the terminal side; that is, it can be executed by the terminal device or by components of the terminal device (such as a chip, chip system, circuit, or communication module). This application does not limit the scope of the method. The following description mainly uses a terminal device as an example.

[0006] The method may include: receiving a first signal, the first signal comprising X on / off keying OOK symbols, the X OOK symbols comprising X1 first symbols and X2 second symbols, the first symbols and the second symbols being different, wherein the X1 first symbols are generated based on N first sequences, or the X1 first symbols are generated based on 1 second sequence; wherein the N first sequences belong to sequences in M ​​sequences, the 1 second sequence belongs to sequences in L sequences, the L sequences are subsets of the M sequences, M, N, and X are integers greater than 1, L is an integer greater than or equal to 1 and less than M, X1 and X2 are integers greater than or equal to 0, and X1 + X2 = X. Optionally, the method further includes: performing correlation processing on the first signal based on the first sequence or the second sequence. Optionally, the first signal is used to instruct one or more terminal devices to receive a paging.

[0007] Secondly, a signal transmission method is provided. This method can be applied to the network side; that is, it can be executed by a network device or by a component of the network device (such as a chip, chip system, circuit, or communication module). This application does not limit the scope of the method. The following description mainly uses a network device as an example.

[0008] The method may include: sending a first signal, the first signal comprising X on / off keying OOK symbols, the X OOK symbols comprising X1 first symbols and X2 second symbols, the first symbols and the second symbols being different, wherein the X1 first symbols are generated based on N first sequences, or the X1 first symbols are generated based on 1 second sequence; wherein the N first sequences belong to sequences in M ​​sequences, the 1 second sequence belongs to sequences in L sequences, the L sequences are subsets of the M sequences, M, N, and X are integers greater than 1, L is an integer greater than or equal to 1 and less than M, X1 and X2 are integers greater than or equal to 0, and X1 + X2 = X. Optionally, the method further includes: determining the first signal. Optionally, the first signal is used to instruct one or more terminal devices to receive a paging.

[0009] The first symbol may be generated based on a first sequence, or it may be generated based on a second sequence. N first sequences are selected from M sequences (i.e., M candidate sequences), and the second sequence is selected from L sequences (i.e., L candidate sequences). By designing the L sequences to be a subset of the M sequences, the number of candidate sequences for the second sequence can be relatively small. This results in lower correlation between different sequences within the candidate sequence. When two cells (e.g., adjacent cells) each select one sequence from the L sequences for configuration, the probability of configuring highly correlated sequences between the two cells can be reduced, thereby reducing signal interference between cells. Furthermore, the first sequence can carry additional information. That is, within a cell, when the first symbol is generated based on the first sequence, each first symbol may be generated based on one of the N first sequences, carrying information through the process of sequence selection (choosing a first sequence from the N first sequences). The second sequence does not carry additional information; that is, within a cell, when the first symbol is generated based on the second sequence, multiple first symbols are generated based on one second sequence. Since this second sequence is deterministic, it does not carry information. In other words, the above technical solution can support the simultaneous deployment of sequences carrying additional information and sequences not carrying additional information.

[0010] In some implementations, in conjunction with either the first or the second aspect, when the first condition is met, the X1 first symbols are generated based on N first sequences; when the second condition is met, the X1 first symbols are generated based on 1 second sequence.

[0011] Based on the above technical solution, in some cases, X1 first symbols are generated based on N first sequences; in other cases, X1 first symbols are generated based on 1 second sequence. Specifically, different sequences can be selected to generate X1 first symbols according to the actual communication situation.

[0012] In conjunction with either the first or the second aspect, in some implementations, when N sequences are configured, the X1 first symbols are generated based on N first sequences; when only one sequence is configured, the X1 first symbols are generated based on one second sequence.

[0013] Based on the above technical solution, if multiple sequences are configured, the X1 first symbols are generated based on N first sequences; if only one sequence is configured, the X1 first symbols are generated based on one second sequence. Therefore, the number of configured sequences can be used to determine whether the X1 first symbols are generated based on a first sequence or a second sequence.

[0014] In conjunction with either the first or the second aspect, in some implementations, when N sequences are configured, the X1 first symbols are generated based on N first sequences; when no sequences are configured, the X1 first symbols are generated based on 1 second sequence.

[0015] As an example, in the absence of a configured sequence, multiple second sequences can be predefined. There is a correspondence between cells (such as cell identifiers) and second sequences, such as one cell corresponding to one second sequence. In this way, the second sequence corresponding to a cell can be determined based on the cell identifier and the correspondence.

[0016] Based on the above technical solution, if multiple sequences are configured, then X1 first symbols are generated based on N first sequences; if no sequences are configured, then X1 first symbols are generated based on 1 second sequence. Therefore, it can be determined whether X1 first symbols are generated based on a first sequence or a second sequence depending on whether sequences are configured.

[0017] In some implementations, in conjunction with either the first or the second aspect, the M sequences are composed of K sets of sequences, where K is an integer greater than 1, each of the K sets of sequences corresponds to at least one root, and different sets of sequences in the K sets of sequences correspond to different roots.

[0018] Based on the above technical solution, by designing K sets of sequences, and with different sets of sequences corresponding to different roots, different sets of sequences can be configured for terminal devices in different cells, thereby reducing signal interference between cells.

[0019] In some implementations, in conjunction with either the first or the second aspect, sequences with the same root in the same group of K sequences correspond to different cyclic shift values.

[0020] Based on the above technical solution, sequences with the same root in the same set of sequences correspond to different cyclic shift values. In this way, if the same set of sequences is configured for a cell, different information can be carried through different cyclic shift values ​​of the same root.

[0021] In conjunction with either the first or the second aspect, in some implementations, the M sequences are composed of K sets of sequences, where K is an integer greater than 1, each of the K sets of sequences corresponds to at least one cyclic shift value, and different sets of sequences in the K sets of sequences correspond to different cyclic shift values.

[0022] Based on the above technical solution, by designing K sets of sequences, and with different cyclic shift values ​​corresponding to different sets of sequences in the K sets of sequences, different sets of sequences can be configured for terminal devices in different cells, thereby reducing signal interference between cells.

[0023] In some implementations, in conjunction with either the first or the second aspect, sequences with the same cyclic shift value in the same group of K sequences correspond to different roots.

[0024] Based on the above technical solution, sequences with the same cyclic shift value in the same set of sequences correspond to different roots, so that different roots can be configured to carry different information.

[0025] In conjunction with either the first or the second aspect, in some implementations, the M sequences are composed of K sets of sequences, and the L sequences are composed of k1 sets of sequences from the K sets of sequences, where K is an integer greater than 1, and k1 is an integer greater than or equal to 1 and less than K.

[0026] Based on the above technical solution, the candidate sequences of the second sequence (i.e., L sequences) can be selected from one or more sets of sequences from the candidate sequences of the first sequence (i.e. K sets of sequences). Compared with the scheme where the candidate sequences of the second sequence and the candidate sequences of the first sequence are the same, the above technical solution can achieve a relatively small number of candidate sequences for the second sequence. This results in lower correlation between different sequences in the candidate sequence, thereby reducing interference.

[0027] In conjunction with either the first or second aspect, in some implementations, different groups of sequences in the K groups of sequences correspond to different roots, and the L sequences are composed of k1 groups of sequences in the K groups of sequences, including: the L sequences are composed of k1 groups of sequences in the K groups of sequences that correspond to a first root, where the first root is predefined or configured.

[0028] Based on the above technical solution, considering that the orthogonality between different cyclic shift values ​​of a sequence with the same root is better than the orthogonality between sequences with different roots, by designing the candidate sequences of the second sequence to be one or more sets of sequences corresponding to a specific (one or more) root, better orthogonality between signals from different cells can be achieved, thereby reducing interference.

[0029] In conjunction with the first aspect, in some implementations of the first aspect, the X1 first symbols are generated based on a second sequence, and the method further includes: receiving first indication information, the first indication information indicating the cyclic shift value corresponding to the second sequence.

[0030] In conjunction with the second aspect, in some implementations of the second aspect, the X1 first symbols are generated based on a second sequence, and the method further includes: sending first indication information, the first indication information indicating the cyclic shift value corresponding to the second sequence.

[0031] Based on the above technical solution, when configuring a second sequence for terminal devices in different cells, since the candidate sequences of the second sequence are one or more sequences corresponding to a specific root, the network device does not need to indicate the specific root (such as if the specific root is predefined) and only needs to indicate the cyclic shift value corresponding to the terminal device in the current cell, which reduces the signaling overhead caused by simultaneously indicating the root and the cyclic shift value.

[0032] In conjunction with either the first or second aspect, in some implementations, different groups of sequences in the K groups of sequences correspond to different cyclic shift values, and the L sequences are composed of k1 groups of sequences in the K groups of sequences, including: the L sequences are composed of k1 groups of sequences in the K groups of sequences corresponding to a first cyclic shift value, wherein the first cyclic shift value is predefined or configured.

[0033] In conjunction with the first aspect, in some implementations of the first aspect, the X1 first symbol is generated based on a second sequence, and the method further includes: receiving second indication information, the second indication information indicating the root corresponding to the second sequence.

[0034] In conjunction with the second aspect, in some implementations of the second aspect, the X1 first symbol is generated based on a second sequence, and the method further includes: sending second indication information, the second indication information indicating the root corresponding to the second sequence.

[0035] Based on the above technical solution, when configuring a second sequence for terminal devices in different cells, since the candidate sequences of the second sequence are one or more sequences corresponding to a specific cyclic shift value, the network device does not need to indicate the specific cyclic shift value (such as if the specific cyclic shift value is predefined), and only needs to indicate the root corresponding to the terminal device in the current cell, which reduces the signaling overhead caused by simultaneously indicating the root and the cyclic shift value.

[0036] In conjunction with either the first or the second aspect, in some implementations, the M sequences are composed of K sets of sequences, and the L sequences are composed of k2 sequences from each of the K sets of sequences, where K is an integer greater than 1 and k2 is an integer greater than or equal to 1 and less than M / K.

[0037] Based on the above technical solution, one or more sequences can be selected from each of the K groups of candidate sequences in the first sequence to form the candidate sequences of the second sequence. Compared with the solution where the candidate sequences of the second sequence are the same as those of the first sequence, the above technical solution can achieve a relatively small number of candidate sequences in the second sequence. This results in lower correlation between different sequences in the candidate sequence, thereby reducing interference.

[0038] In conjunction with either the first or the second aspect, in some implementations, different sequences within the same group of sequences in the K groups of sequences correspond to different cyclic shift values, and the L sequences are composed of k2 sequences from each group of sequences in the K groups of sequences, including: the L sequences are composed of k2 sequences from each group of sequences in the K groups of sequences that correspond to a first cyclic shift value, wherein the first cyclic shift value is predefined or configured.

[0039] Based on the above technical solution, one or more sequences corresponding to a specific cyclic shift value can be selected from each of the K groups of candidate sequences in the first sequence to form the candidate sequences of the second sequence. This can randomize the interference. For example, the probability of selecting the same group of sequences is low for cells configured with the first sequence and cells configured with the second sequence.

[0040] In conjunction with the first aspect, in some implementations of the first aspect, the X1 first symbol is generated based on a second sequence, and the method further includes: receiving third indication information, the third indication information indicating the root corresponding to the second sequence.

[0041] In conjunction with the second aspect, in some implementations of the second aspect, the X1 first symbol is generated based on a second sequence, and the method further includes: sending third indication information, the third indication information indicating the root corresponding to the second sequence.

[0042] Based on the above technical solution, when configuring a second sequence for terminal devices in different cells, since the candidate sequences of the second sequence are one or more sequences corresponding to a specific cyclic shift value, the network device does not need to indicate the specific cyclic shift value (such as if the specific cyclic shift value is predefined), and only needs to indicate the root corresponding to the terminal device in the current cell, which reduces the signaling overhead caused by simultaneously indicating the root and the cyclic shift value.

[0043] In some implementations, in conjunction with either the first or the second aspect, the first cyclic shift value is 0.

[0044] In conjunction with either the first or the second aspect, in some implementations, different sequences within the same group of sequences in the K groups of sequences correspond to different roots, and the L sequences are composed of k2 sequences from each group of sequences in the K groups of sequences, including: the L sequences are composed of k2 sequences from each group of sequences in the K groups of sequences that correspond to a first root, where the first root is predefined or configured.

[0045] In conjunction with the first aspect, in some implementations of the first aspect, the X1 first symbol is generated based on a second sequence, and the method further includes: receiving fourth indication information, the fourth indication information indicating a cyclic shift value corresponding to the second sequence.

[0046] In conjunction with the second aspect, in some implementations of the second aspect, the X1 first symbol is generated based on a second sequence, and the method further includes: sending fourth indication information, the fourth indication information indicating the cyclic shift value corresponding to the second sequence.

[0047] Based on the above technical solution, when configuring a second sequence for terminal devices in different cells, since the candidate sequences of the second sequence are one or more sequences corresponding to a specific root, the network device does not need to indicate the specific root (such as if the specific root is predefined) and only needs to indicate the cyclic shift value corresponding to the terminal device in the current cell, which reduces the signaling overhead caused by simultaneously indicating the root and the cyclic shift value.

[0048] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: receiving a reference signal, the reference signal including Y OOK symbols, the Y OOK symbols including Y1 first symbols and Y2 second symbols, the Y1 first symbols being generated based on a third sequence, the third sequence being one of the N first sequences, or the third sequence being a second sequence, Y being an integer greater than 1, Y1 and Y2 being integers greater than or equal to 0, and Y1 + Y2 = Y.

[0049] Based on the above technical solution, the sequence corresponding to the reference signal can be the same as the sequence corresponding to the first signal (such as the wake-up signal). In this way, the terminal device can use the same local sequence to perform related operations on the reference signal and the first signal, thereby simplifying the operation of the terminal device.

[0050] In conjunction with the second aspect, in some implementations of the second aspect, a reference signal is transmitted, the reference signal comprising Y OOK symbols, the Y OOK symbols comprising Y1 first symbols and Y2 second symbols, the Y1 first symbols being generated based on a third sequence, the third sequence being one of the N first sequences, or the third sequence being the second sequence, Y being an integer greater than 1, Y1 and Y2 being integers greater than or equal to 0, and Y1 + Y2 = Y.

[0051] In some implementations, in conjunction with either the first or the second aspect, the reference signal is a low-power synchronization signal LP-SS.

[0052] In some implementations, in conjunction with either the first or the second aspect, the sequence among the M sequences is a ZC sequence.

[0053] In conjunction with either the first or the second aspect, in some implementations, the frequency domain resources occupied by the first signal are F1 first frequency domain units, each first frequency domain unit includes r second frequency domain units, the frequency domain sequence corresponding to the first sequence or the second sequence occupies F2 second frequency domain units, the F2 second frequency domain units are F2 consecutive second frequency domain units among the F1 first frequency domain units, F1 and r are integers greater than 1, and F2 is an integer greater than or equal to 1 and less than F1×r.

[0054] As an example, the first frequency domain unit is a resource block (RB), and the second frequency domain unit is a resource element (RE). As an example, r = 12.

[0055] Based on the above technical solution, a first signal can be received or transmitted on F1 first frequency domain units. The F1 first frequency domain units include F1×r second frequency domain units. When the first symbol is generated based on the first sequence, the frequency domain sequence corresponding to the first sequence occupies F2 consecutive second frequency domain units in the F1×r second frequency domain units. Alternatively, when the first symbol is generated based on the second sequence, the frequency domain sequence corresponding to the second sequence occupies F2 consecutive second frequency domain units in the F1×r second frequency domain units.

[0056] In conjunction with either the first or the second aspect, in some implementations, the frequency domain resources occupied by the reference signal are F1 first frequency domain units, the frequency domain sequence corresponding to the third sequence occupies F2 second frequency domain units, one first frequency domain unit includes r second frequency domain units, the F2 second frequency domain units are F2 consecutive second frequency domain units among the F1 first frequency domain units, F1 and r are integers greater than 1, and F2 is an integer greater than or equal to 1 and less than F1×r.

[0057] In conjunction with either the first or second aspect, in certain implementations, the F2 second frequency domain units satisfy any one of the following: the starting position of the F2 second frequency domain units is the same as the starting position of the F1 first frequency domain units; the ending position of the F2 second frequency domain units is the same as the ending position of the F1 first frequency domain units; the F2 second frequency domain units are consecutive F2 second frequency domain units located at the center position among the F1 first frequency domain units; the starting position of the F2 second frequency domain units is spaced apart from the starting position of the F1 first frequency domain units by at least one second frequency domain unit, and the ending position of the F2 second frequency domain units is spaced apart from the ending position of the F1 first frequency domain units by at least one second frequency domain unit.

[0058] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: receiving fifth indication information, the fifth indication information indicating at least one of the following: the offset between the starting position of the F2 second frequency domain units and the starting position of the F1 first frequency domain units, and the offset between the ending position of the F2 second frequency domain units and the ending position of the F1 first frequency domain units.

[0059] In conjunction with the second aspect, in some implementations of the second aspect, the method further includes: sending fifth indication information, the fifth indication information indicating at least one of the following: the offset between the starting position of the F2 second frequency domain units and the starting position of the F1 first frequency domain units, and the offset between the ending position of the F2 second frequency domain units and the ending position of the F1 first frequency domain units.

[0060] Thirdly, a signal transmission method is provided. This method can be applied to the terminal side; that is, it can be executed by the terminal device or by components of the terminal device (such as a chip, chip system, circuit, or communication module). This application does not limit the scope of the method. The following description mainly uses a terminal device as an example.

[0061] The method may include: receiving a first signal on F1 first frequency domain units, the first signal including X on / off keying OOK symbols, the X OOK symbols including X1 first symbols and X2 second symbols, the first symbols and the second symbols being different, wherein the X1 first symbols are generated based on N first sequences, or the X1 first symbols are generated based on 1 second sequence, N and X are integers greater than 1, X1 and X2 are integers greater than or equal to 0, and X1 + X2 = X; wherein a first frequency domain unit includes r second frequency domain units, the frequency domain sequence corresponding to the first sequence or the second sequence occupies F2 second frequency domain units, the F2 second frequency domain units are F2 consecutive second frequency domain units in the F1 first frequency domain units, F1 and r are integers greater than 1, and F2 is an integer greater than or equal to 1 and less than F1 × r.

[0062] As an example, the first frequency domain unit is RB, and the second frequency domain unit is RE. As an example, r = 12.

[0063] Fourthly, a method for signal transmission is provided. This method can be applied to the network device side; that is, the method can be executed by the network device itself, or by components of the network device (such as chips, chip systems, circuits, or communication modules). This application does not limit this. The following description mainly uses a network device as an example.

[0064] The method may include: transmitting a first signal on F1 first frequency domain units, the first signal including X on / off keying OOK symbols, the X OOK symbols including X1 first symbols and X2 second symbols, the first symbols and the second symbols being different, wherein the X1 first symbols are generated based on N first sequences, or the X1 first symbols are generated based on 1 second sequence, N and X are integers greater than 1, X1 and X2 are integers greater than or equal to 0, and X1 + X2 = X; wherein a first frequency domain unit includes r second frequency domain units, the frequency domain sequence corresponding to the first sequence or the second sequence occupies F2 second frequency domain units, the F2 second frequency domain units are F2 consecutive second frequency domain units in the F1 first frequency domain units, F1 and r are integers greater than 1, and F2 is an integer greater than or equal to 1 and less than F1 × r.

[0065] In conjunction with any of the third or fourth aspects, in some implementations, the F2 second frequency domain units satisfy any of the following: the starting position of the F2 second frequency domain units is the same as the starting position of the F1 first frequency domain units; the ending position of the F2 second frequency domain units is the same as the ending position of the F1 first frequency domain units; the F2 second frequency domain units are consecutive F2 second frequency domain units located at the center position among the F1 first frequency domain units; the starting position of the F2 second frequency domain units is spaced apart from the starting position of the F1 first frequency domain units by at least one second frequency domain unit, and the ending position of the F2 second frequency domain units is spaced apart from the ending position of the F1 first frequency domain units by at least one second frequency domain unit.

[0066] In conjunction with the third aspect, in some implementations of the third aspect, the method further includes: receiving fifth indication information, the fifth indication information indicating at least one of the following: the offset between the starting position of the F2 second frequency domain units and the starting position of the F1 first frequency domain units, and the offset between the ending position of the F2 second frequency domain units and the ending position of the F1 first frequency domain units.

[0067] In conjunction with the fourth aspect, in some implementations of the fourth aspect, the method further includes: sending fifth indication information, the fifth indication information indicating at least one of the following: the offset between the starting position of the F2 second frequency domain units and the starting position of the F1 first frequency domain units, and the offset between the ending position of the F2 second frequency domain units and the ending position of the F1 first frequency domain units.

[0068] In some implementations, in conjunction with either the third or fourth aspect, the first signal is a wake-up signal or a reference signal.

[0069] In some implementations, in conjunction with either the third or fourth aspect, the reference signal is a low-power synchronization signal LP-SS.

[0070] Fifthly, a communication apparatus is provided for performing the methods of any one of the first to fourth aspects and any possible implementation thereof. Specifically, the apparatus may include units and / or modules for performing the methods of any one of the first to fourth aspects and any possible implementation thereof, such as processing units and / or communication units.

[0071] In one implementation, the device is a communication device (such as a terminal device or a network device). When the device is a communication device, the communication unit can be a transceiver or an input / output interface; the processing unit can be at least one processor. Optionally, the transceiver can be a transceiver circuit. Optionally, the input / output interface can be an input / output circuit.

[0072] In another implementation, the device is a chip, chip system, circuit, or communication module for communication equipment (such as terminal equipment or network equipment). When the device is a chip, chip system, or circuit for communication equipment, the communication unit may be an input / output interface, interface circuit, output circuit, input circuit, pin, or related circuit on the chip, chip system, or circuit; the processing unit may be at least one processor, processing circuit, or logic circuit.

[0073] A sixth aspect provides a communication device comprising: at least one processor configured to cause the device to perform any one of the first to fourth aspects and any possible implementation thereof.

[0074] Optionally, the at least one processor is configured to execute computer programs or instructions to perform any of the first to fourth aspects described above and any possible implementation thereof.

[0075] Optionally, the device further includes a memory for storing the computer program or instructions.

[0076] Optionally, the at least one processor is coupled to a memory for storing the computer program or instructions. The memory may be located externally to the device.

[0077] Optionally, the device also includes a communication interface through which the processor reads instructions from memory. This can be understood as the communication interface being coupled to the processor and used to input computer programs or instructions to the processor, or to output information from the processor.

[0078] Unless otherwise specified, or if the transmission and acquisition / reception operations involved do not contradict their actual function or internal logic in the relevant description, they can be understood as output, input, or other operations, or as transmission and reception operations performed by radio frequency circuits and antennas. This application does not limit them in this regard.

[0079] In one implementation, the device is a communication device (such as a terminal device or a network device).

[0080] In another implementation, the device is a chip, chip system, circuit, or communication module for communication equipment (such as terminal equipment or network equipment). Optionally, the chip is a modem chip, also known as a baseband chip, or a system-on-chip (SoC) chip containing a modem core or a system-in-package (SIP) chip.

[0081] In a seventh aspect, a computer-readable storage medium is provided, on which a computer program (e.g., program code) or instructions are stored, which, when executed on a communication device, cause the communication device to perform any of the first to fourth aspects and any possible implementation thereof.

[0082] Eighthly, a computer program product containing instructions is provided, which, when run on a computer, causes the computer to perform any one of the first to fourth aspects and any possible implementation thereof.

[0083] A ninth aspect provides a communication system, including a first communication device and a second communication device. The first communication device is configured to execute a method provided in any implementation of the first aspect, and the second communication device is configured to execute a method provided in any implementation of the second aspect; or, the first communication device is configured to execute a method provided in any implementation of the third aspect, and the second communication device is configured to execute a method provided in any implementation of the fourth aspect. Attached Figure Description

[0084] Figure 1 is a schematic diagram of a wireless communication system applicable to an embodiment of this application.

[0085] Figure 2 is a schematic diagram of the main circuit and the wake-up circuit.

[0086] Figure 3 is a waveform diagram of the signal when OOK modulation is used.

[0087] Figure 4 is a schematic diagram of the waveform of the signal after Manchester encoding.

[0088] Figure 5 is another schematic diagram of the waveform of the signal after Manchester encoding.

[0089] Figures 6 and 7 are schematic diagrams of the OOK symbol in the time and frequency domains.

[0090] Figure 8 is a schematic diagram of OFDM and OOK symbols.

[0091] Figure 9 is a schematic diagram of the waveform of the signal after passing through the channel.

[0092] Figure 10 is a schematic diagram of a signal transmission method 1000 provided in an embodiment of this application.

[0093] Figure 11 is a schematic diagram of candidate sequences for scenarios 1 and 2 provided in an embodiment of this application.

[0094] Figure 12 is another schematic diagram of the candidate sequences for scenario 1 and scenario 2 provided in the embodiments of this application.

[0095] Figure 13 is a schematic diagram of a signal transmission method 1300 provided in an embodiment of this application.

[0096] Figure 14 is a schematic diagram showing the relationship between F1 first frequency domain units and F2 second frequency domain units provided in the embodiments of this application.

[0097] Figure 15 is a schematic diagram of a communication device 1500 provided in an embodiment of this application.

[0098] Figure 16 is a schematic diagram of another communication device 1600 provided in an embodiment of this application.

[0099] Figure 17 is a schematic diagram of a chip system 1700 provided in an embodiment of this application. Detailed Implementation

[0100] The technical solutions in this application will now be described with reference to the accompanying drawings.

[0101] Before introducing the scheme of this application, the following points should be noted.

[0102] (1) In this application, "instruction" can include direct instruction, indirect instruction, explicit instruction, implicit instruction, etc. When describing an instruction information as indicating A, it can be understood that the instruction information carries A, carries the identifier of A, carries B which is associated with A, carries the identifier of B which is associated with A, etc. In other words, if the receiving side of an instruction information can determine A based on the instruction information, it can be described as the instruction information indicating A, and the specific method of determination is not limited. When it is understood that the instruction information carries A, "instruction" can be replaced with "includes". In this case, a statement such as "send / receive instruction information, the instruction information indicates A" can be replaced with "send / receive A".

[0103] In this application, the information indicated by the instruction information is called the information to be instructed. In specific implementations, there are many ways to indicate the information to be instructed, such as, but not limited to, directly indicating the information to be instructed, such as the information to be instructed itself or its index. It can also indirectly indicate the information to be instructed by indicating other information, where there is a relationship between the other information and the information to be instructed. It can also indicate only a part of the information to be instructed, while the other parts are known or pre-agreed upon. For example, the instruction of specific information can be achieved by using a pre-agreed (e.g., protocol-defined) arrangement of various pieces of information, thereby reducing instruction overhead to some extent. Furthermore, the information to be instructed can be sent as a whole or divided into multiple sub-information pieces, and the sending period and / or timing of these sub-information pieces can be the same or different.

[0104] (2) In this application, the expression " / " is used to indicate that the objects before and after are in an "or" relationship; for example, A / B can mean: A or B. The expression "and / or" is used to indicate that the objects before and after are in a relationship of either "and" or "or"; for example, A and / or B can mean the following: A exists alone, B exists alone, A and B exist simultaneously, where A and B can be single or multiple. "At least one of the following" or similar expressions are used to indicate any combination of the listed items; for example, at least one of A, B and / or C can mean the following: A exists alone, B exists alone, C exists alone, A and B exist simultaneously, B and C exist simultaneously, A and C exist simultaneously, A, B and C exist simultaneously, where A, B, and C can be single or multiple.

[0105] (3) In this application, "send" and "receive" indicate the direction of signal transmission. For example, "send information to XX" can be understood as the destination of the information being XX, which may include direct transmission via the air interface or indirect transmission by other units or modules via the air interface. "Receive information from YY" can be understood as the source of the information being YY, which may include direct reception from YY via the air interface or indirect reception from YY by other units or modules via the air interface. "Send" can also be understood as the "output" of the chip interface, and "receive" can also be understood as the "input" of the chip interface. In other words, sending and receiving can occur between devices, such as between network devices and terminal devices, or within a device, such as between components, modules, chips, software modules, or hardware modules within the device via a bus, wiring, or interface.

[0106] (4) In the various embodiments of this application, unless otherwise specified or in case of logical conflict, the terms and / or descriptions of different embodiments are consistent and can be referenced by each other. The technical features of different embodiments can be combined to form new embodiments according to their inherent logical relationship.

[0107] (5) In this application, "first," "second," and "#1," "#2," and "#A" are merely for descriptive convenience and are used to distinguish objects, and are not intended to limit the scope of the embodiments of this application. They are not used to describe the order or sequence of features. It should be understood that such described objects can be interchanged where appropriate in order to describe solutions other than those in the embodiments of this application.

[0108] (6) In this application, "predefined" or "defined" may refer to a predefined standard protocol, or it may refer to a pre-agreed or pre-negotiated agreement between devices. Here, "protocol" may refer to a standard protocol in the field of communications, such as fourth-generation (4G) protocols. thGeneration 4G network, fifth generation (5G) network th This application does not limit the scope to network protocols such as 5G (generation, 5G), New Radio (NR), 5.5G, and related protocols applied in future communication networks.

[0109] (7) In this application, the configuration can be signaling configuration, such as radio resource control (RRC) messages, downlink control information (DCI), or medium access control (MAC) signaling (e.g., MAC control element (MAC CE / MAC-CE)). As an example, the signaling configuration can be configured to the terminal device by signaling, for example, the network device configures the root (or the network device configures the root for the terminal device), which can be understood as the network device instructing the terminal device to use signaling.

[0110] (8) In this application, the words “exemplary,” “for example,” etc., are used to indicate examples, illustrations, or descriptions. Any embodiment or design described as an “example” in this application should not be construed as being more preferred or advantageous than other embodiments or designs. Specifically, the use of the word “example” is intended to present the concept in a concrete manner. In the embodiments of this application, “of,” “corresponding, relevant,” and “corresponding” may sometimes be used interchangeably, and it should be noted that their intended meanings are consistent unless their distinction is emphasized.

[0111] First, let me introduce the communication system to which this application applies.

[0112] The technical solutions provided in this application can be applied to various communication systems, such as 5th generation (5G) or new radio (NR) systems, long term evolution (LTE) systems, LTE frequency division duplex (FDD) systems, and LTE time division duplex (TDD) systems. The technical solutions provided in this application can also be applied to future communication network systems. Furthermore, the technical solutions provided in this application can be applied to device-to-device (D2D) communication, vehicle-to-everything (V2X) communication, machine-to-machine (M2M) communication, machine-type communication (MTC), and Internet of Things (IoT) communication systems. The technical solutions provided in this application can also be applied to non-terrestrial network (NTN) systems such as inter-satellite communication and satellite communication.

[0113] As an example, a satellite communication system includes a satellite base station and terminal equipment. The satellite base station provides communication services to the terminal equipment. Satellite base stations can also communicate with each other. A satellite can act as a base station or as a terminal device. Here, "satellite" can refer to drones, hot air balloons, low-Earth orbit satellites, medium-Earth orbit satellites, high-Earth orbit satellites, etc. "Satellite" can also refer to non-terrestrial base stations or non-terrestrial equipment.

[0114] As an example, V2X communication can include: vehicle-to-vehicle (V2V) communication, vehicle-to-infrastructure (V2I) communication, vehicle-to-pedestrian (V2P) communication, and vehicle-to-network (V2N) communication.

[0115] In a communication system, a device can send signals to or receive signals from another device. These signals can include information, signaling, or data. The device can also be replaced by an entity, network entity, communication equipment, communication module, node, communication node, etc. This application uses a device as an example for description.

[0116] The terminal device in this application embodiment can be a device or module that accesses the aforementioned communication system and has corresponding communication functions. The terminal device can include various devices with wireless communication capabilities, which can be used to connect people, objects, machines, etc. The terminal device can be widely applied in various scenarios, such as: cellular communication, D2D, V2X, peer-to-peer, M2M, MTC, IoT, virtual reality (VR), augmented reality (AR), industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, smart transportation, smart cities, drones, robots, remote sensing, passive sensing, positioning, navigation and tracking, autonomous delivery, etc. The terminal device can be a terminal in any of the above scenarios, such as an MTC terminal, an IoT terminal, etc. Terminal equipment can be user equipment (UE), terminal, fixed equipment, mobile station equipment or mobile equipment, subscriber unit, handheld device, vehicle-mounted equipment, wearable device, cellular phone, smartphone, session initiation protocol (SIP) phone, wireless data card, personal digital assistant (PDA), computer, tablet computer, laptop computer, wireless modem, handset, laptop computer, computer with wireless transceiver capability, smart book, vehicle, satellite, global positioning system (GPS) device, target tracking device, aircraft (e.g., drone, helicopter, multiple helicopters, four helicopters, or airplanes), ship, remote control device, smart home device, industrial equipment, transportation vehicle with wireless communication capability, communication module, or roadside unit with terminal function, all conforming to the 3rd generation partnership project (3GPP) standard. The device may be a wireless communication unit (RSU), or a device built into the aforementioned device (e.g., a communication module, modem, or chip in the aforementioned device), or other processing devices connected to the wireless modem.

[0117] It should be understood that in certain scenarios, a UE can also be used as a base station. For example, a UE can act as a scheduling entity, providing sidelink signaling between UEs in scenarios such as V2X, D2D, or end-to-end.

[0118] In this embodiment, the device for implementing the functions of a terminal device, i.e., the terminal device, can be the terminal device itself, or it can be any device capable of supporting the terminal device in implementing the functions, such as a chip system, chip, circuit, or communication module (i.e., a communication module that performs communication functions). This device can be installed in the terminal device. In this embodiment, the chip system can be composed of chips, or it can include chips and other discrete devices. Furthermore, the device can also be configured with program instructions for performing corresponding communication functions.

[0119] The network device in this application embodiment can be a device or module with corresponding communication functions. The network device can be a device used to communicate with terminal devices; it can also be called an access network device or a wireless access network device, such as a base station. In this application embodiment, the network device can refer to a radio access network (RAN) node (or device) that connects the terminal device to the wireless network. A base station can broadly encompass, or be replaced by, various names including: NodeB, evolved NodeB (eNB), next-generation NodeB (gNB), relay station, access point, transmitting and receiving point (TRP), transmitter, master station, auxiliary station, multiple standard radio (MSR) node, home base station, network controller, access node, wireless node, access point (AP), transmission node, transceiver node, baseband unit (BBU), remote radio unit (RRU), active antenna unit (AAU), remote radio head (RRH), central unit (CU), distributed unit (DU), positioning node, etc. A base station can be a macro base station, micro base station, relay node, donor node, or similar, or a combination thereof. A base station can also refer to a communication module, modem, or chip installed within the aforementioned equipment or apparatus. A base station can also be a mobile switching center, a device that performs base station functions in D2D, V2X, and M2M communications, a network-side device in future communication networks, or a device that performs base station functions in future communication systems. A base station can support networks using the same or different access technologies. The embodiments of this application do not limit the specific technologies or device forms used in the network equipment.

[0120] Base stations can be fixed or mobile. For example, a helicopter or drone can be configured to act as a mobile base station, and one or more cells can move depending on the location of the mobile base station. In other examples, a helicopter or drone can be configured as a device to communicate with another base station.

[0121] In some deployments, the network devices mentioned in the embodiments of this application may be devices including CU, or DU, or devices including CU and DU, or devices with control plane CU nodes (central unit-control plane (CU-CP)) and user plane CU nodes (central unit-user plane (CU-UP)) and DU nodes.

[0122] In some deployments, multiple RAN nodes collaborate to assist terminal devices in achieving wireless access, with different RAN nodes each implementing some of the base station's functions. For example, RAN nodes can be CUs, DUs, CU-CPs, CU-UPs, or radio units (RUs). CUs and DUs can be configured separately or included in the same network element, such as a BBU. RUs can be included in radio equipment or radio units, such as RRUs, AAUs, or RRHs.

[0123] In different systems, CU (or CU-CP and CU-UP), DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, a radio access network can also be an open radio access network (O-RAN) architecture. In an O-RAN system, CU can also be called an open CU (openCU, O-CU), DU can also be called an open DU (open DU, O-DU), CU-CP can also be called an open CU-CP (open CU-CP, O-CU-CP), CU-UP can also be called an open CU-UP (open CU-UP, O-CU-UP), and RU can also be called an open RU (openRU, O-RU). Any of the units among CU (or CU-CP, CU-UP), DU, and RU in this application can be implemented through software modules, hardware modules, or a combination of software modules and hardware modules.

[0124] In this embodiment, the device for implementing the functions of a network device can be a network device itself, or a device capable of supporting the network device in implementing those functions, such as a chip system, chip, circuit, or communication module (i.e., a communication module that performs communication functions). This device can be installed within the network device. In this embodiment, the chip system can be composed of chips, or it can include chips and other discrete devices. Furthermore, the device can be configured with program instructions for performing corresponding communication functions. This embodiment only uses a network device as an example to illustrate the device for implementing the functions of a network device, and does not limit the solution of this embodiment.

[0125] Network devices and terminal devices can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; and they can also be deployed in the air on airplanes, balloons, and satellites. This application does not limit the scenario in which the network devices and terminal devices are located.

[0126] The communication system applicable to the embodiments of this application is briefly described below with reference to Figure 1.

[0127] Referring to Figure 1, as an example, Figure 1 is a schematic diagram of a wireless communication system applicable to an embodiment of this application. As shown in Figure 1, the wireless communication system includes a wireless access network 100. The wireless access network 100 may be a next-generation (e.g., future or higher version) wireless access network or a traditional (e.g., 5G, 4G, 3G, or 2G) wireless access network. One or more terminal devices (120a-120j, collectively referred to as 120) may be interconnected or connected to one or more network devices (110a, 110b, collectively referred to as 110) in the wireless access network 100. Network elements in the wireless communication system are connected through interfaces (e.g., NG, Xn) or air interfaces.

[0128] When network devices and terminal devices communicate, the network device can manage one or more cells, and a cell can include at least one terminal device. A cell can be understood as an area within the wireless signal coverage range of the network device.

[0129] Figure 1 is just a schematic diagram. The wireless communication system may also include other devices, such as core network devices, wireless relay devices and / or wireless backhaul devices, which are not shown in Figure 1.

[0130] To facilitate understanding of the embodiments of this application, the terms used in this application will be briefly explained.

[0131] 1. Wake-up circuit: Also known as a wake-up receiver / radio (WUR), low-power wake-up receiver (LP-WUR), or wake-up module, it can be understood as a single, low-power small circuit, such as the circuit used by a terminal device in the idle state. This low-power small circuit can be implemented using a simple, single small circuit or chip with low power consumption. It is understood that the term "wake-up circuit" is merely a designation for differentiation, and its specific naming does not limit the scope of protection of this application. For example, without loss of generality, a wake-up circuit can also be described as a first circuit (or first module). The following description will uniformly refer to it as a wake-up circuit.

[0132] The signal received by the terminal device through the wake-up circuit can be referred to as being transmitted on the wake-up link. The wake-up link represents a connection relationship between the terminal device and the network device; it is a logical concept, not a physical entity. It is understood that the term "wake-up link" is merely a designation for differentiation, and its specific naming does not limit the scope of protection of this application. For example, without loss of generality, a wake-up link can also be described as a first link. Hereinafter, it will be uniformly referred to as a wake-up link.

[0133] The signals received by the terminal device using the wake-up circuit may include, but are not limited to: a wake-up signal (WUS) (or low-power wake-up signal (LP-WUS)) and a low-power synchronization signal (LP-SS). It is understood that the terms "wake-up signal" and "low-power synchronization signal" are merely designations for distinction, and their specific names do not limit the scope of protection of this application. For example, without loss of generality, the wake-up signal may also be referred to as a signal.

[0134] 2. Main Circuit: Also known as the main receiver (MR) or main module, this can be understood as the circuit used by the terminal device during normal data transmission, or the circuit used by the terminal device during data transmission in the connected state. For example, the circuit or module used by the terminal device when performing the paging process in the idle or inactive state, or the circuit or module used by the terminal device when transmitting and receiving data in the connected state, can all be considered main circuits or main modules. Terminal devices consume significant power when transmitting data through the main circuit. It is understood that the term "main circuit" is merely a designation for differentiation and does not limit the scope of protection of this application. For example, without loss of generality, the main circuit can also be described as a second circuit (or second module). The following text will uniformly describe it as a main circuit.

[0135] Signals received by a terminal device through the main circuit can be referred to as being transmitted on the main link. The main link represents a connection between the terminal device and the network device; it is a logical concept, not a physical entity. It is understood that the term "main link" is merely a designation for distinction, and its specific naming does not limit the scope of protection of this application. For example, without loss of generality, the main link can also be described as a second link. The following text will uniformly refer to it as the main link.

[0136] In the following text, for the sake of distinction, the signals transmitted by the main circuit of the terminal device will be referred to as data signals.

[0137] Referring to Figure 2, as an example, Figure 2 is a schematic diagram of the main circuit and the wake-up circuit.

[0138] As shown in Figure 2, the terminal device can receive (or detect, or monitor) a wake-up signal through a wake-up circuit, and can receive data signals through the main circuit. Assume the terminal device receives the wake-up signal through the wake-up circuit. If the terminal device does not detect the wake-up signal, it continues to receive it through the wake-up circuit, and the main circuit can be in a closed state (or sleep state). If the terminal device detects the wake-up signal, it triggers the main circuit to wake up, that is, it puts the main circuit into / switches to an open state (or working state, or active state). After the main circuit is turned on, the terminal device can transmit data signals through the main circuit.

[0139] As an example, when the terminal device is in idle or inactive state, the wake-up signal can be used to carry paging-related information. When the terminal device is in connected state, the wake-up signal can be used to carry scheduling-related information, such as indicating whether the terminal device needs to activate the main circuit to receive scheduling information (e.g., whether it needs to monitor the physical downlink control channel (PDCCH)).

[0140] 3. On-Off-Key (OOK) Modulation: This modulates information based on whether a signal is transmitted or not. The corresponding wake-up circuit can use envelope detection to receive the signal. OOK modulation technology can be demodulated using a low-complexity receiver, thus achieving the low-power goal of the wake-up circuit. To ensure power efficiency, the wake-up signal can use OOK modulation. It is understood that other modulation methods can also be used for the wake-up signal; there are no restrictions on this.

[0141] When a signal uses OOK modulation, each bit (i.e., the encoded bit) corresponds to a symbol, where the encoding can include Manchester encoding. Equivalently, a symbol can also be called a chip, or other names, without restriction here.

[0142] For example, when a bit is "1", a signal is transmitted within the symbol length (i.e., the signal transmission power within that symbol length is not 0); when a bit is "0", no signal is transmitted within the symbol length (i.e., the signal transmission power within that symbol length is 0). Alternatively, it can be understood that in OOK modulation, transmitting energy represents "1", and not transmitting energy represents "0".

[0143] For example, when the bit is "0", a signal is transmitted within the symbol length (i.e., the signal transmission power within that symbol length is not 0); when the bit is "1", no signal is transmitted within the symbol length (i.e., the signal transmission power within that symbol length is 0). Alternatively, it can be understood that in OOK modulation, transmitting energy represents "0", and not transmitting energy represents "1".

[0144] For ease of description, the following text will primarily use the example of a signal being emitted within the symbol length when the bit is "1" and no signal being emitted within the symbol length when the bit is "0" as an example for illustration.

[0145] Furthermore, for ease of description, if a symbol emits a signal, it is denoted as an ON symbol; if a symbol emits no signal, it is denoted as an OFF symbol. Taking the example that when a bit is "1", a signal is emitted within the length of the symbol; and when a bit is "0", no signal is emitted within the length of the symbol, the ON symbol represents an information bit of "1", and the OFF symbol represents an information bit of "0". The ON symbol can also be called an ON signal, and the OFF symbol can also be called an OFF signal; for consistency, the ON and OFF symbols will be used in the following descriptions.

[0146] In this context, the signal amplitude of the ON symbol is greater than or equal to a threshold (e.g., threshold #A), and the signal amplitude of the OFF symbol is less than or equal to a threshold (e.g., threshold #B); or, the signal amplitude of the ON symbol is greater than the signal amplitude of the OFF symbol; or, within a preset time period, the signal amplitude of the ON symbol is greater than the signal amplitude of the OFF symbol; or, within a preset time period, the signal power of the ON symbol is greater than the signal power of the OFF symbol; or, within a preset time period, the signal power of the ON symbol is greater than or equal to threshold #A, and the signal power of the OFF symbol is less than or equal to threshold #B; or, within a preset time period, the signal power of the ON symbol is greater than or equal to threshold #A. The signal power of the ON symbol is equal to threshold #A, and the signal power of the OFF symbol is less than or equal to threshold #B; or the signal level of the ON symbol is greater than the signal level of the OFF symbol; or, within a preset time period, the signal level of the ON symbol is greater than the signal level of the OFF symbol; or the signal level of the ON symbol is greater than or equal to threshold #A, and the signal level of the OFF symbol is less than or equal to threshold #B; or, within a preset time period, the signal level of the ON symbol is greater than or equal to threshold #A, and the signal level of the OFF symbol is less than or equal to threshold #B; or, the ON symbol indicates (or corresponds to, or represents) the first bit value, and the OFF symbol indicates (or corresponds to, or represents) the second bit value. The first bit value and the second bit value are different. For example, the first bit value is "1", and the second bit value is "0".

[0147] Furthermore, the OOK symbol mentioned below refers to a symbol obtained by OOK modulation. An OOK symbol can be either an ON symbol or an OFF symbol. For example, if the information bit is "1", the OOK symbol obtained by OOK modulation is an ON symbol; if the information bit is "0", the OOK symbol obtained by OOK modulation is an OFF symbol. The OOK symbol can also be called an OOK signal; for consistency, it will be described as an OOK symbol below.

[0148] Referring to Figure 3, as an example, Figure 3 is a waveform diagram of a signal using OOK modulation.

[0149] As an example, suppose that when the bit is "1", a signal is transmitted within the length of the OOK symbol; when the bit is "0", no signal is transmitted within the length of the OOK symbol. Therefore, the waveform shown in Figure 3 can represent the four bits "0100", that is, the first is the OFF symbol, the second is the ON symbol, and the third and fourth are both OFF symbols. As shown in Figure 3, communication systems generally use a certain frequency to transmit, and the transmitted signal needs to be modulated onto the carrier wave. At the receiving end, the receiver detects the envelope (or energy) of the received signal to determine whether the OOK symbol corresponds to a bit "0" or a bit "1", thereby completing demodulation.

[0150] After a signal passes through a channel, it may be distorted due to factors such as channel conditions. Therefore, to determine whether the signal corresponds to a bit "0" or a bit "1", the receiver can compare the received signal level with a threshold. For example, if the received signal level is greater than the threshold, it means the signal corresponds to a bit "1"; if the received signal level is less than the threshold, it means the signal corresponds to a bit "0". However, setting the threshold is difficult. For instance, an inappropriate threshold selection may lead to demodulation errors. To solve this problem, one possible approach is to use Manchester encoding.

[0151] 4. Manchester encoding: This is a biphase encoding method that uses high-low level switching to represent bits "0" or "1". For example, Manchester encoding can encode a raw bit "0" as bit "10" and a raw bit "1" as bit "01". To distinguish them, the encoded bits, such as bits "10" and "01", are called encoded bits. When transmitting a signal, the transmitter can use two OOK symbols to send one bit of original information. If the raw bit "0" is encoded as bit "10" and the raw bit "1" is encoded as bit "01", then the raw bit "0" corresponds to one ON symbol followed by one OFF symbol, and the raw bit "1" corresponds to one OFF symbol followed by one ON symbol. When the receiver demodulates the Manchester encoded signal, it can compare the relative magnitudes of the signal power (or signal amplitude) within two adjacent OOK symbols. If the signal power (or signal amplitude) in the preceding OOK symbol is greater than the signal power (or signal amplitude) in the following OOK symbol, the received information bit is considered to be "0"; otherwise, it is considered to be "1". This method avoids using an absolute threshold for decision-making.

[0152] It is understood that the above example of encoding a raw bit "0" as bit "10" and a raw bit "1" as bit "01" is for illustrative purposes only and is not intended to be limiting. For example, a raw bit "0" can be encoded as bit "01" and a raw bit "1" can be encoded as bit "10".

[0153] As an example, a signal can be generated based on an orthogonal frequency division multiplexing (OFDM) transmitter, that is, an OFDM transmitter can be used to modulate the signal.

[0154] One possible approach is to transmit an OOK symbol within the length of an OFDM symbol, or in other words, an OOK symbol occupies one OFDM symbol. For example, to transmit an ON symbol within the length of an OOK symbol, the transmitter can send a specific signal whose contour within the OOK symbol length is as square as possible; to transmit an OFF symbol within the length of an OOK symbol, the transmitter can turn off the signal for the length of an OOK symbol.

[0155] Referring to Figure 4, as an example, Figure 4 is a schematic diagram of the waveform of a signal after Manchester encoding. As shown in Figure 4, the original bits are "0 0 1 0 0 1 0 1 1 0". Assuming that the original bit "0" is encoded as "10" and the original bit "1" is encoded as "01", then the encoded bits after Manchester encoding are "10 10 01 10 10 01 10 01 01 10", as shown in Figure 4. The time length corresponding to each encoded bit can be considered as the length of one OFDM symbol, that is, one OOK symbol is transmitted within the length of one OFDM symbol, or one OOK symbol occupies one OFDM symbol. When demodulating the signal, the receiver can compare the relative magnitudes of the signal power (or signal amplitude) within two adjacent OOK symbols, and determine the demodulated information bits based on the comparison results.

[0156] In the above method, one OOK symbol is transmitted within the length of one OFDM symbol. This method is simple, but it also supports a relatively low data rate. This is because, regardless of the signal bandwidth, only one OOK symbol is transmitted within the length of one OFDM symbol. If the system uses a sub-carrier space (SCS) of 30kHz, a slot length of 0.5ms, and one slot contains 14 OFDM symbols, assuming no coding is used and each OOK symbol carries 1 bit of information, then the maximum supported data rate is 1 / 0.5 × 14 × 1000 = 28kbps.

[0157] To increase the data rate of OOK symbols, one possible approach is to shorten the length of the OOK symbols, that is, to transmit at least two OOK symbols within the length of one OFDM symbol, or in other words, to have at least two OOK symbols occupy one OFDM symbol.

[0158] Referring to Figure 5, as an example, Figure 5 is another schematic diagram of the waveform after the signal is encoded using Manchester encoding. As shown in Figure 5, the original bits are "0 0 0 1". Assuming that the original bit "0" is encoded as "10" and the original bit "1" is encoded as "01", then the encoded bits after Manchester encoding are "10 10 10 10 01", as shown in Figure 5. Within one OFDM symbol length (2192 sampling points in Figure 5), eight OOK symbols are transmitted: ON symbol-OFF symbol-ON symbol-OFF symbol-ON symbol-OFF symbol-OFF symbol-ON symbol. When demodulating the signal, the receiver can compare the relative magnitudes of the signal power (or signal amplitude) of two adjacent OOK symbols, and determine the demodulated information bits based on the comparison results.

[0159] To generate the above waveform, one possible approach is to first determine the target waveform x in the time domain, and then perform some operations, such as discrete fourier transformation (DFT) and inverse fast fourier transform (IFFT), to obtain the sequence to be sent.

[0160] Referring to Figures 6 and 7, as examples, Figures 6 and 7 are schematic diagrams of the OOK symbol in the time and frequency domains. As shown in Figure 6, assuming we want to generate an "ON symbol - OFF symbol - ON symbol - OFF symbol" waveform, the target waveform can be set to: x = [1,1,…,1,0,0,…,0,1,1,…,1,0,0,…,0], or, That is, the amplitude of part of the ON symbol is 1, and the phase of part of the ON symbol can be inconsistent, as shown in Figure 6. As shown in Figure 7, a DFT can be performed on x to obtain the frequency domain sequence y corresponding to x; then y is mapped to a frequency resource (such as the frequency resource corresponding to the wake-up signal); then an IFFT is performed on the frequency domain signal; and a cyclic prefix (CP) is added to the signal after the IFFT to obtain the sequence to be transmitted x' (see the curve in Figure 6). As can be seen from Figure 6, x and x' have similar shapes, so at least two OOK symbols can be transmitted within the length of one OFDM symbol.

[0161] 5. Overlaid OFDM sequence: Also known as overlaid sequence over OOK or sequence on top of OOK, in order for an OFDM transmitter to generate an OOK waveform, a specific sequence can be used or constructed to make the final transmitted signal form a shape similar to an ON or OFF symbol (i.e., the signal energy / amplitude is high at some time positions, and the signal energy / amplitude is low at some time positions).

[0162] For the receiver, one possible implementation is to use envelope detection or energy detection to receive the signal. For example, the signal received by the receiver (referred to as an OOK receiver for distinction) first passes through a matching network and a radio frequency (RF) filter to remove out-of-band noise / interference; then, the spectrum is shifted to baseband (BB) by a mixer, and further filtered by a baseband filter to remove out-of-band noise / interference; finally, envelope detection / energy detection is performed on the signal (at this point, the baseband signal value is mathematically represented as a real number, with only amplitude and no phase). Specifically, the OOK receiver can determine whether the received signal is ON or OFF by detecting the energy level within different time ranges, and then proceed with subsequent processing. However, this reception method is significantly affected by in-band noise or interference. Because the OOK receiver only judges the energy level and does not distinguish the source of the energy, the energy of noise (such as in-band noise) and / or interference that has not been filtered out by the filter (such as in-band noise) and / or interference will also be treated as the energy of the useful signal, thus affecting the determination of ON / OFF. To further improve demodulation performance, a more advanced receiver can be considered, such as a receiver with both in-phase (I) and quadrature (Q) paths (referred to as an OFDM receiver for distinction).

[0163] As an example, the signal received by the OFDM receiver first passes through a matching network and an RF filter to remove out-of-band noise / interference. Then, the spectrum is shifted to the baseband by a mixer. When shifting the spectrum to the baseband, two branches, I and Q, are distinguished (the corresponding mixing signals have a phase difference of pi / 2). The signals on each branch are further filtered by a baseband filter to remove out-of-band noise / interference. The two signals are then combined together. At this point, the value of the baseband signal is mathematically represented as a complex number, which has both amplitude and phase. The baseband signal is then further processed.

[0164] When receiving the aforementioned OOK symbol using an OFDM receiver, the OFDM receiver's ability to detect signal phase allows it to further detect the sequence information within the ON symbol of the OOK symbol. For example, if the OFDM receiver knows in advance (e.g., predefined by the protocol, or pre-configured parameters by the network device for the terminal device), it can generate a local sequence based on this sequence. By correlating the received signal with the local sequence, it can mitigate the impact of unfiltered noise (such as in-band noise) and / or interference, thereby improving demodulation performance. Alternatively, if there may be multiple sequences generating the ON symbol, the OFDM receiver can identify which sequence is being transmitted, thus obtaining more information. For example, assuming there may be four sequences generating the ON symbol, each corresponding to the information {00, 01, 10, 11}, the OFDM receiver can obtain an additional 2 bits of information by detecting which sequence is being used. This can increase the data rate carried by the wake-up signal. The method described above, which "informs the OFDM receiver about the sequence used to generate the OOK symbol, thereby improving demodulation performance and / or increasing the data rate," can be called an overlaid OFDM sequence. An example will be given below.

[0165] Referring to Figure 8, which serves as an example, Figure 8 is a schematic diagram of OFDM symbols and OOK symbols. Assuming each OFDM symbol contains 4 OOK symbols, when using Manchester encoding, there are four possible scenarios as shown in Figure 8. Taking the transmission of "1010" as an example, the positions of "1" are set to a specific sequence, and the positions of "0" are set to 0, resulting in the time-domain sequence corresponding to the entire OFDM symbol. Then, the corresponding frequency-domain sequence is obtained through some algorithms (e.g., DFT, or least squares (LS) algorithm). The frequency-domain sequence is mapped to the frequency-domain resources corresponding to the wake-up signal to obtain the frequency-domain signal. Finally, the frequency-domain signal (and other NR downlink frequency-domain signals) undergo IFFT to obtain the signal to be transmitted.

[0166] To avoid performing complex calculations (such as generating time-domain sequences, performing DFT or least squares calculations) for each signal generation, network devices can pre-store the generated frequency-domain sequences. As shown in Figure 8, there are four possible signal transmission scenarios within an OFDM symbol; therefore, the network device can pre-store four possible frequency-domain sequences. The network device can select one of the four possible frequency-domain sequences based on the OOK information to be transmitted within each OFDM symbol. In this approach, it can be seen that the "specific sequence" used to generate the ON symbol for OOK is always the same. At the receiving end, for an OOK receiver, the energy level within each OOK symbol can be determined for demodulation; for an OFDM receiver, the sequence can be detected, thereby improving demodulation performance and / or increasing the data rate.

[0167] 6. LP-SS: It can be used to implement synchronization functions and also to implement radio resource management (RRM) measurement functions, without limitation.

[0168] After a signal passes through a channel, it may be distorted due to factors such as channel conditions. Taking the OOK modulation waveform shown in Figure 3 as an example, the waveform shown in Figure 3 may become the waveform shown in Figure 9 at the receiving end.

[0169] Referring to Figure 9, which is a waveform diagram of a signal after passing through a channel, the terminal device can compare the received signal level with a threshold (shown by the dashed line in Figure 11) to determine whether the signal corresponds to a bit "0" or a bit "1". For example, if the received signal level is greater than the threshold, it indicates that the signal corresponds to a bit "1"; if the received signal level is less than the threshold, it indicates that the signal corresponds to a bit "0". As shown in Figure 9, if the time position of the comparison between the received signal level and the threshold is within the range of t2, the judgment is accurate; if the time position of the comparison is within the range of t1 or t3, the judgment is inaccurate, i.e., a 1 will be mistakenly judged as a 0.

[0170] Therefore, when a terminal device uses a wake-up circuit to receive a wake-up signal, it needs to obtain time synchronization of the wake-up link in order to receive the wake-up signal correctly. That is, the terminal device can obtain the boundary position of a symbol and select the time position to determine whether the signal corresponds to 0 or 1 based on the boundary position. For example, the terminal device can use the level value at the middle position of the symbol to determine whether the signal corresponds to 0 or 1. Furthermore, due to the limited accuracy of the terminal device's local clock, time drift may occur. If the wake-up link does not provide synchronization, after the terminal device has been working on the wake-up link for a period of time, a time synchronization problem may arise between the terminal device and the network device (i.e., the symbol boundary positions perceived by the terminal device and the network device are inconsistent), thus affecting signal reception.

[0171] To support synchronization, LP-SS can be introduced. Specifically, terminal devices can perform synchronization based on LP-SS. As an example, LP-SS is sent periodically.

[0172] As an example, the modulation scheme of LP-SS is OOK. Furthermore, the pattern (or pattern) of the ON / OFF symbols in LP-SS can follow a specific order to enhance its detection performance. For example, LP-SS can be generated based on a binary sequence with good autocorrelation properties. The modulation scheme of LP-SS is OOK, which can also be described as follows: within the time interval corresponding to LP-SS, some time-domain positions have energy, while others do not.

[0173] As an example, an OOK receiver or an OFDM receiver can be used to receive the LP-SS. Furthermore, if the OFDM receiver has prior knowledge of the sequence information used to generate each OOK symbol of the LP-SS, the impact of noise / interference can be reduced and synchronization accuracy improved by correlating the received LP-SS with the local sequence. One possible implementation is to use a method similar to that described above for generating OOK symbols to generate the LP-SS.

[0174] 7. ZC (Zadoff-Chu) sequence: A mathematical sequence used to generate signals, such as reference signals (e.g., LP-SS) or wake-up signals. Let x be the ZC sequence. u (t), as an example, x u (t) satisfies the following formula:

[0175] Where T is an integer greater than 1, and T represents the length of the ZC sequence. u is the root of the ZC sequence (also called the root index or root value).

[0176] ZC sequences exhibit good autocorrelation and cross-correlation properties. When a ZC sequence is generated with a fixed u value, the sequence generated by cyclically shifting this ZC sequence is still a ZC sequence, and there is good autocorrelation between ZC sequences generated by cyclic shifting them. For example, when the cyclic shift value = 0, the correlation value is high; when the cyclic shift value ≠ 0, the correlation value is 0. ZC sequences generated with different u values ​​also exhibit good autocorrelation properties; that is, although the correlation value between two ZC sequences generated with two different u values ​​is not 0, it remains at a relatively low level.

[0177] The ZC sequence is also a constant-mode sequence; in other words, the amplitude of the ZC sequence is always 1.

[0178] Even after DFT transformation, a ZC sequence remains a ZC sequence. In other words, when using a ZC sequence, the power distribution is relatively flat in both the time and frequency domains, which helps to resist time-selective fading and frequency-selective fading.

[0179] The terms and concepts involved in this application have been introduced above. It is understood that the above is only an illustrative example for ease of understanding and does not limit the scope of protection of the embodiments of this application.

[0180] Taking the wake-up signal as an example, the sequence of the wake-up signal (i.e., the overlaid OFDM sequence mentioned above) can be defined before the DFT operation, and the sequence type can be a ZC sequence. The wake-up signal sequence (hereinafter referred to as the sequence) can specifically include the following two scenarios.

[0181] 1) Scenario where sequences carry additional information (referred to as Scenario 1). For example, there are multiple sequences used to generate the ON symbol. The terminal device can detect and identify which sequence is being transmitted. Therefore, in addition to the information carried by the OOK modulation ON / OFF mode, it can obtain more information from the sequence used to generate the ON symbol. In this case, it can be understood that the sequence used to generate the ON symbol carries additional information. In Scenario 1, within a cell, the sequences used to generate each ON symbol can come from the same set of sequences, and different ON symbols use different sequences to carry information. For example, assuming a set of sequences has 4 sequences, each ON symbol signal can carry 2 bits of information through the sequence. Different sets of sequences can be configured between different cells to reduce interference between them.

[0182] 2) Scenario where the sequence does not carry additional information (referred to as Scenario 2). For example, if there is only one sequence for generating the ON symbol, the terminal device can generate a local sequence based on this sequence. By correlating the received signal with the local sequence, the impact of noise and / or interference can be reduced. In this case, it can be understood that the sequence for generating the ON symbol does not carry additional information. In Scenario 2, within a cell, the sequence used to generate each ON symbol is the same. Different sequences can be configured between different cells to reduce interference between them.

[0183] One possible implementation is to use the same set of candidate sequences (e.g., called candidate overlaid OFDM sequence) for both scenario 1 and scenario 2. However, this approach may introduce some problems. An example is provided below to illustrate this.

[0184] Assumptions: There are 4 sets of candidate sequences, each set containing 4 sequences. Each set is generated using different u values ​​(i.e., different roots), and the 4 sequences within a set are generated using different cyclic shift values. For scenario 1, for terminal devices within the same cell, there are a total of 4 candidate sequences. This means that for a terminal device within a cell, an ON symbol can be generated based on any one of the 4 candidate sequences, thus carrying an additional 2 bits of information within each ON symbol. For scenario 2, for terminal devices within the same cell, there are a total of 16 candidate sequences. This means that for a terminal device within a cell, any one of the 16 candidate sequences can be configured. However, the more candidate sequences there are, the more difficult it is to guarantee the correlation between any two sequences. With 16 candidate sequences, the correlation between any two sequences may be high or low. Therefore, in scenario 2, two cells (such as adjacent cells) may be configured with relatively high-correlation candidate sequences, potentially causing significant interference.

[0185] In view of this, this application proposes that there is no overlap between the candidate sequence for scenario 1 and the candidate sequence for scenario 2, or that the candidate sequence for scenario 2 is a subset of the candidate sequence for scenario 1. This can reduce the probability of two cells (such as adjacent cells) configuring highly correlated sequences, thereby reducing interference between cells.

[0186] The methods provided by the embodiments of this application will be described in detail below with reference to the accompanying drawings. The embodiments provided by this application can be applied to the scenarios shown in the above figures and are not limited thereto. Furthermore, the terms used below are as explained above and will not be repeated hereafter. For ease of description, terminal devices and network devices are used as examples for illustrative purposes. The terminal device can be replaced by components of the terminal device (e.g., a chip, chip system, circuit, or communication module), and the network device can be replaced by components of the network device (e.g., a chip, chip system, circuit, or communication module). Furthermore, the steps described below as being performed by a single execution entity can also be divided into steps performed by multiple execution entities, which can be logically and / or physically separated.

[0187] Referring to Figure 10, as an example, Figure 10 is a schematic diagram of a signal transmission method 1000 provided in an embodiment of this application. The method 1000 shown in Figure 10 may include the following steps.

[0188] Method 1000 includes step S1020. Optionally, method 1000 includes step S1010.

[0189] S1010, the network device identifies the first signal.

[0190] As an example, determining the first signal includes: determining the transmission time of the first signal; or generating the first signal or retrieving a pre-stored first signal from memory.

[0191] Optionally, the first signal is used to instruct one or more terminal devices to receive a paging. Specifically, the first signal may represent a signal on a wake-up link. As an example, the first signal may be a wake-up signal (such as LP-WUS) used to instruct one or more terminal devices to receive a paging; or the first signal may be a reference signal (such as LP-SS) upon which the terminal devices may perform synchronization and / or measurements.

[0192] The first signal consists of X OOK symbols; in other words, the modulation method of the first signal is OOK modulation. Taking X OOK symbols as an example, the X OOK symbols include X1 first symbols and X2 second symbols, where X is an integer greater than 1, X1 and X2 are integers greater than or equal to 0, and X1 + X2 = X.

[0193] The first symbol and the second symbol are different. The first symbol can be called the ON symbol, and the second symbol can be called the OFF symbol. For a description of the ON and OFF symbols in the previous terminology explanation section, please refer to that section.

[0194] In one possible scenario, the first symbol indicates the first bit value, and the second symbol indicates the second bit value. The first bit value and the second bit value are different. One example is that the first bit value is "1" and the second bit value is "0". Another example is that the first bit value is "0" and the second bit value is "1". Assuming the first bit value is "1" and the second bit value is "0", taking the example in Figure 3, X = 4, the four OOK symbols include two first symbols and two second symbols, and the first and third OOK symbols are first symbols, indicating a first bit value of "1"; the second and fourth OOK symbols are second symbols, indicating a second bit value of "0".

[0195] Another possible scenario is that the first and second symbols jointly indicate either the first or second bit value. Assuming the first bit value is "1" and the second bit value is "0", taking the example in Figure 5, X = 8, the 8 OOK symbols include 4 ON symbols (an example of the first symbol) and 4 OFF symbols (an example of the second symbol). The 8 OOK symbols are: ON symbol-OFF symbol-ON symbol-OFF symbol-ON symbol-OFF symbol-OFF symbol-ON symbol-OFF symbol-ON symbol. In one example, "ON symbol-OFF symbol" jointly indicates the second bit value "0", and "OFF symbol-ON symbol" jointly indicates the first bit value "1"; in another example, "ON symbol-OFF symbol" jointly indicates the first bit value "1", and "OFF symbol-ON symbol" jointly indicates the second bit value "0".

[0196] Among them, X1 first symbols are generated based on N first sequences, or X1 first symbols are generated based on 1 second sequence.

[0197] Optionally, when the first condition is met, X1 first symbols are generated based on N first sequences; when the second condition is met, X1 first symbols are generated based on 1 second sequence. In other words, in some cases, the network device can choose to generate X1 first symbols using N first sequences, that is, the terminal device can determine that X1 first symbols are generated using N first sequences, or the sequence used to generate X1 first symbols is the sequence in scenario 1; in other cases, the network device can choose to generate X1 first symbols using 1 second sequence, that is, the terminal device can determine that X1 first symbols are generated using 1 second sequence, or the sequence used to generate X1 first symbols is the sequence in scenario 2.

[0198] One possible implementation is that, when N sequences are configured, X1 first symbols are generated based on N first sequences; when only one sequence is configured, X1 first symbols are generated based on one second sequence. Based on this, the terminal device can determine whether the X1 first symbols are generated based on the sequences in scenario 1 or scenario 2, depending on the number of configured sequences. The above method is illustrative, and the embodiments of this application are not limited thereto. For example, the network device can also configure multiple sequences (i.e., more than N sequences), and the X1 first symbols can be generated based on a portion of these multiple sequences.

[0199] Another possible implementation is that, with N sequences configured, X1 first symbols are generated based on N first sequences; without sequences configured, X1 first symbols are generated based on 1 second sequence. Based on this, the terminal device can determine whether the X1 first symbols are generated based on the sequences in scenario 1 or scenario 2, depending on whether sequences are configured. The second sequence can be predefined. For example, without sequences configured, L second sequences can be predefined, and there is a correspondence between cells (such as cell identifiers) and second sequences. This allows the second sequence corresponding to a cell to be determined based on the cell identifier and this correspondence. As an example, the correspondence between cells and second sequences can be configured or predefined. As an example, the correspondence between cells and second sequences is shown in Table 1.

[0200] Table 1

[0201] In Table 1, the first column can be the identifier of the cell, and the second column can be the identifier of the second sequence or the content of the second sequence. As an example, the identifier of the second sequence and the identifier of the corresponding cell satisfy a certain relationship, for example, the identifier of the second sequence and the identifier of the corresponding cell satisfy: ID#A=(ID#B)mod(L), where ID#A represents the identifier of the second sequence and ID#B represents the identifier of the cell corresponding to the second sequence.

[0202] Taking Table 1 as an example, for instance, the second sequence corresponding to cell #1 is the second sequence #1. That is, for scenario 2, the network device can use the second sequence #1 to generate X1 first symbols for the terminal device in cell #1. The terminal device can determine that the X1 first symbols are generated based on the second sequence #1, based on its own cell as cell #1.

[0203] It is understood that Table 1 is merely an example, and the embodiments of this application are not limited thereto. For example, it may include a larger number of cells and corresponding second sequences. Furthermore, the cells in the first column may be replaced with cell groups. Also, the cells in the first column may be replaced with terminal devices within the cells.

[0204] In this sequence, N first sequences belong to M sequences; in other words, the N first sequences are selected from M candidate sequences, where N is an integer greater than 1 and less than M. One second sequence belongs to L sequences; in other words, the one second sequence is selected from L candidate sequences, where L is an integer greater than or equal to 1 and less than M. Both the first and second sequences are the overlaid OFDM sequences described earlier. Specifically, the first sequence is the sequence in scenario 1 above, meaning the first sequence carries additional information; the second sequence is the sequence in scenario 2 above, meaning the second sequence does not carry additional information. As an example, the first and second sequences are ZC sequences.

[0205] The following explanation combines two scenarios.

[0206] One possible scenario is that X1 first symbols are generated based on N first sequences; in other words, X1 first symbols are determined according to N first sequences. In this case, the X1 first symbols in the first signal are generated based on the sequences in scenario 1, meaning the first sequences used to generate the first symbols carry additional information. For example, for the same cell, assuming there are four candidate sequences for generating the first symbols (i.e., one example of N sequences), each corresponding to the information {00, 01, 10, 11}, the terminal device can detect which sequence is used for each first symbol in the received first signal and obtain an additional 2 bits of information in each first symbol (a maximum of 2 × X1 bits of additional information in total). Each of the X1 first symbols is generated based on a first sequence; different first symbols in the X1 first symbols may be generated based on the same first sequence or different first sequences.

[0207] Another possible scenario is that X1 first symbols are generated based on one second sequence; in other words, X1 first symbols are determined according to one second sequence. In this case, the X1 first symbols in the first signal are generated based on the sequence in scenario 2, meaning that the first sequence used to generate the first symbols does not carry additional information.

[0208] Regarding the relationship between L sequences and M sequences, there are two possible implementation methods, as follows.

[0209] One possible implementation is that the L sequences are a subset of the M sequences. Based on this, the candidate sequences for scenario 2 are a subset of the candidate sequences for scenario 1. Here, "subset" can also be replaced with "proper subset," meaning that the L sequences are a subset of the M sequences.

[0210] Another possible implementation is that the L sequences and the M sequences have no overlap. Based on this, it can be concluded that the candidate sequences used for scenario 2 have no overlap with the candidate sequences used for scenario 1.

[0211] This application primarily uses the example of L sequences being a subset of M sequences for illustration. The relevant schemes for the first and second sequences will be explained in detail later.

[0212] S1020, the network device sends the first signal. Correspondingly, the terminal device receives the first signal.

[0213] As an example, sending a first signal includes: sending the first signal at the designated transmission time, or sending the first signal according to the designated transmission time. Specifically, the network device determines the transmission time of the first signal and then sends the first signal at the designated transmission time, or sends the first signal according to the designated transmission time.

[0214] Optionally, method 1000 further includes: the terminal device processing the first signal.

[0215] As an example, the terminal device performs relevant processing on the first signal based on the first sequence or the second sequence.

[0216] For example, assuming X1 first symbols are generated based on N first sequences, the terminal device determines N local sequences based on the N first sequences, and then performs related processing on the N local sequences and the signal to be processed. The terminal device determining the local sequences based on the first sequences may include, for example, processing the first sequences (such as spread spectrum processing, or oversampling processing, etc.) to obtain the local sequences. It is understood that the local sequence is merely a descriptive term for differentiation, and its naming does not limit the scope of protection of the embodiments of this application. It is also understood that in some cases, the local sequence may also be a first sequence, and this is not limited.

[0217] For example, suppose X1 first symbols are generated based on one second sequence. The terminal device determines its local sequence based on the second sequence, and then performs correlation processing on the local sequence and the signal to be processed. The process of the terminal device determining its local sequence based on the second sequence can be found in the previous examples, and will not be elaborated upon here.

[0218] The following section uses the example of L sequences being a subset of M sequences to detail the relevant schemes for the first and second sequences.

[0219] Optionally, the M sequences consist of K sets of sequences, where K is an integer greater than 1. As an example, each of the K sets of sequences has the same number of sequences, meaning each set of sequences in the K sets includes M / K sequences. The number of sequences in each of the K sets of sequences may not be exactly the same, and this is not a limitation. This application's embodiments primarily use the example of each of the K sets of sequences having the same number of sequences for illustration.

[0220] As introduced in the ZC sequence section, the parameters associated with the sequence include at least the root and the cyclic shift value. The cyclic shift value represents the value associated with the cyclic shift. For example, the cyclic shift value is the interval of the cyclic shift, or it could be the number of bits in the cyclic shift. Regarding the root and cyclic shift values ​​for the K sets of sequences, at least the following two schemes are applicable:

[0221] Option 1: Each of the K sets of sequences corresponds to at least one root, and different sets of sequences in the K sets of sequences correspond to different roots;

[0222] Option 2: Each of the K sets of sequences corresponds to at least one cyclic shift value, and different sets of sequences in the K sets of sequences correspond to different cyclic shift values.

[0223] The two schemes will be introduced below.

[0224] Option 1: Each of the K sets of sequences corresponds to at least one root, and different sets of sequences in the K sets of sequences correspond to different roots.

[0225] For example, each of the K sets of sequences corresponds to a root. Further, alternatively, different sequences within the same set of K sets of sequences correspond to different cyclic shift values. Suppose that one set of sequences in the K sets of sequences corresponds to 1 root and 8 cyclic shift values, meaning that this set of sequences contains a total of 8 sequences, where these 8 cyclic shift values ​​are different. Based on this, for terminal devices within the same cell, the network device can be configured with the same set of sequences; for terminal devices in different cells, the network device can be configured with different sets of sequences.

[0226] Another example involves K sets of sequences, each corresponding to multiple roots. Sequences within the same set of K sets with the same root correspond to different cyclic shift values. For instance, suppose one set of K sets of sequences corresponds to two roots, denoted as root#1 and root#2. Root#1 corresponds to 4 cyclic shift values ​​(i.e., the sequence corresponding to root#1 corresponds to 4 cyclic shift values), and root#2 corresponds to 4 cyclic shift values ​​(i.e., the sequence corresponding to root#2 corresponds to 4 cyclic shift values). This set contains a total of 8 sequences, where the 4 cyclic shift values ​​corresponding to root#1 and root#2 are different. Whether the cyclic shift values ​​corresponding to root#1 and root#2 are the same is not limited. Based on this, for terminal devices within the same cell, the network device can configure the same set of sequences, such as sequences corresponding to the same root within the same set; for terminal devices in different cells, the network device can configure different sets of sequences, or the network device can configure sequences corresponding to different roots within the same set.

[0227] In Scheme 1, for L sequences, at least the following two implementation methods are included:

[0228] Implementation method 1: The L sequences are composed of k1 sequences from the K sequences;

[0229] Implementation method 2: L sequences are composed of k2 sequences from each of the K sets of sequences.

[0230] The following describes the two implementation methods, taking the example of each of the K sets of sequences corresponding to a root.

[0231] Implementation Method 1: The L sequences are composed of k1 sequences from the K sequences. Here, k1 is an integer greater than or equal to 1 and less than K.

[0232] Example 1, k1 = 1, that is, L sequences are composed of one set of sequences from K sets of sequences.

[0233] Referring to Figure 11, as an example, Figure 11 is a schematic diagram of candidate sequences for scenarios 1 and 2 provided in an embodiment of this application. As shown in Figure 11, assume there are K groups of sequences, such as group #1, group #2, ..., group #K respectively; each of the K groups of sequences has S sequences, such as the S sequences in group #i being denoted as: seq_i_1, seq_i_2, ..., seq_i_S, 1≤i≤K, and the total number of sequences in the K groups of sequences is M, that is, M=K×S. L sequences are composed of one sequence from the K groups of sequences, in other words, L sequences are one sequence from the K groups of sequences. As shown in Figure 11(a), L sequences are composed of sequences from group #K of the K groups of sequences.

[0234] Example 2, k1>1, that is, L sequences are composed of multiple sequences from K sets of sequences. Taking Figure 11 as an example, as shown in Figure 11(b), as an example, L sequences are composed of sequences from group #K and group #K-1 of K sets of sequences.

[0235] Optionally, the L sequences consist of k1 sequences corresponding to the first root from the K sequences. The first root is predefined or configured.

[0236] In one example, k1 = 1. Specifically, each of the K sets of sequences corresponds to a root, and different sets of sequences in the K sets correspond to different roots. L sequences can be composed of a set of sequences from the K sets that correspond to the first root. Taking Figure 11(a) as an example, for instance, K roots are predefined or configured for generating sequences. These K roots are used for the K sets of sequences, meaning there is a one-to-one correspondence between the K roots and the K sets of sequences. Assume that the K roots are root#1, root#2, ..., root#K, and correspond to groups #1, #2, ..., #K respectively. L sequences can be composed of a set of sequences corresponding to root#K (i.e., the sequences of group #K), meaning the first root is root#K.

[0237] Another example is k1>1. Specifically, each of the K sets of sequences corresponds to a root, and different sets of sequences in the K sets correspond to different roots. The L sequences can be composed of multiple sets of sequences in the K sets that correspond to the first root. Taking Figure 11(b) as an example, for instance, K roots are predefined or configured to generate sequences. The K roots are used for the K sets of sequences, that is, the K roots correspond one-to-one with the K sets of sequences. Assume that the K roots are root#1, root#2, ..., root#K, and correspond to group #1, group #2, ..., group #K in sequence. The L sequences can be composed of a set of sequences corresponding to root#1 (i.e., the sequence of group #1) and a set of sequences corresponding to root#K (i.e., the sequence of group #K). That is, the first root is root#1 and root#K.

[0238] Optionally, method 1000 further includes: the terminal device receiving first indication information, and correspondingly, the network device sending the first indication information. The first indication information indicates a cyclic shift value corresponding to the second sequence, or the first indication information indicates a root and / or cyclic shift value corresponding to the first sequence. The following description illustrates both scenarios.

[0239] In the first possible scenario, X1 first symbols are generated based on N first sequences. In this case, the first indication information indicates the root and / or cyclic shift value corresponding to the first sequence.

[0240] For example, the first indication information indicates the root and cyclic shift value corresponding to the first sequence. Taking Figure 11(a) as an example, the network device can configure the root and cyclic shift value used by the sequence in the current cell (i.e., the first sequence). For example, the network device may configure any sequence in any group of K sequences.

[0241] For example, the first indication information indicates the cyclic shift value corresponding to the first sequence. Taking Figure 11(a) as an example, multiple cell-to-root correspondences can be predefined, and the network device can configure the cyclic shift value used by the sequence in the current cell (i.e., the first sequence). For example, the network device may configure any one of the sequences in a certain group of K sequences (i.e., the group of sequences corresponding to the root of the current cell).

[0242] Furthermore, when the first indication information indicates the root and the cyclic shift value, such as when the first indication information indicates the root and the cyclic shift value corresponding to the first sequence, the root and the cyclic shift value can be carried in one signaling or one field, or they can be carried in different signaling or different fields, without limitation. For example, the first indication information includes two fields (or two sub-information), one field (or one sub-information) indicates the root, and the other field (or another sub-information) indicates the cyclic shift value.

[0243] In the second possible scenario, X1 first symbols are generated based on one second sequence. In this case, the first indication information indicates the cyclic shift value corresponding to the second sequence. Taking Figure 11(a) as an example, a root (such as root#K) is predefined for scenario 2, and the network device configures the cyclic shift value used by the sequence in the current cell; in other words, the sequence in group #K of the predefined K groups of sequences is used for scenario 2, and the network device can configure any sequence in group #K.

[0244] Implementation Method 2: The L sequences are composed of k2 sequences from each of the K sets of sequences. Here, k2 is an integer greater than or equal to 1 and less than M / K.

[0245] Example 1, k2 = 1, that is, L sequences are composed of one sequence from each of the K sets of sequences.

[0246] Referring to Figure 12, as an example, Figure 12 is another schematic diagram of candidate sequences for scenarios 1 and 2 provided in the embodiments of this application. As shown in Figure 12, assume there are K groups of sequences, such as group #1, group #2, ..., group #K respectively; each of the K groups of sequences has S sequences, such as the S sequences in group #i being denoted as: seq_i_1, seq_i_2, ..., seq_i_S, 1≤i≤K. L sequences are composed of one sequence from each of the K groups of sequences. As shown in Figure 12(a), the L sequences are composed of the sequence seq_i_1 from group #i of the K groups of sequences, 1≤i≤K.

[0247] Example 2, k2>1, that is, L sequences are composed of multiple sequences from each of the K sets of sequences. Taking Figure 12 as an example, as shown in Figure 12(b), L sequences are composed of sequences seq_i_1 and seq_i_2 from group #i of the K sets of sequences, 1≤i≤K.

[0248] Optionally, the L sequences consist of k2 sequences corresponding to the first cyclic shift value in each group of sequences. The first cyclic shift value is predefined or configured. One possible implementation is that the first cyclic shift value is 0.

[0249] For example, k2 = 1. Specifically, each of the K sets of sequences corresponds to a root, different sets of sequences in the K sets of sequences correspond to different roots, and the same set of sequences in the K sets of sequences corresponds to different cyclic shift values. The L sequences can be composed of a sequence corresponding to the first cyclic shift value in each set of sequences. Taking Figure 12(a) as an example, for instance, K roots are predefined or configured for generating sequences, and the K roots are used for the K sets of sequences respectively, that is, the K roots correspond one-to-one with the K sets of sequences. Assume that each sequence group corresponds to S cyclic shift values, namely cyclic shift value #1, cyclic shift value #2, ..., cyclic shift value #S. Taking group #1 as an example, the S cyclic shift values ​​correspond to seq_1_1, seq_1_2, ..., seq_1_S in sequence. L sequences can be composed of the sequences corresponding to cyclic shift value #1 in each sequence group. That is, L sequences are composed of the sequence seq_i_1 in group #i (1≤i≤K), which means the first cyclic shift value is cyclic shift value #1.

[0250] Another example is k2>1. Specifically, each of the K sets of sequences corresponds to a root, different sets of sequences in the K sets of sequences correspond to different roots, and the same set of sequences in the K sets of sequences corresponds to different cyclic shift values. The L sequences can be composed of multiple sequences in each set of sequences corresponding to the first cyclic shift value. Taking Figure 12(b) as an example, for instance, K roots are predefined or configured for generating sequences, and the K roots are used for the K sets of sequences respectively, that is, the K roots correspond one-to-one with the K sets of sequences. Assume that each sequence group corresponds to S cyclic shift values, namely cyclic shift value #1, cyclic shift value #2, ..., cyclic shift value #S. Taking group #1 as an example, the S cyclic shift values ​​correspond to seq_1_1, seq_1_2, ..., seq_1_S in sequence. L sequences can be composed of the sequences corresponding to cyclic shift values ​​#1 and #2 in each sequence group. That is, L sequences are composed of the sequences seq_i_1 and seq_i_2 in group #i (1≤i≤K). In other words, the first cyclic shift value is cyclic shift value #1 and cyclic shift value #2.

[0251] Alternatively, the terminal device may determine whether the currently configured first sequence or second sequence is based on the number of configured cyclic shift values ​​or whether cyclic shift values ​​are configured.

[0252] One possible implementation is that the terminal device determines whether the currently configured sequence is a first sequence or a second sequence based on the number of configured cyclic shift values. In other words, the terminal device determines whether the currently configured sequence is for scenario 1 or scenario 2 based on the number of configured cyclic shift values; specifically, it determines whether the currently configured signal is for scenario 1 or scenario 2. For example, if multiple cyclic shift values ​​are configured, it can be determined that the currently configured sequence is the first sequence, i.e., the sequence for scenario 1, or the signal for scenario 1; if only one cyclic shift value is configured, it can be determined that the currently configured sequence is the second sequence, i.e., the sequence for scenario 2, or the signal for scenario 2.

[0253] Another possible implementation is that the terminal device determines whether the currently configured sequence is the first sequence or the second sequence based on whether a cyclic shift value is configured. In other words, the terminal device determines whether the currently configured sequence is for scenario 1 or scenario 2 based on whether a cyclic shift value is configured. For example, if a cyclic shift value is configured, it can be determined that the currently configured sequence is the first sequence, that is, the sequence for scenario 1, or the signal for scenario 1; if no cyclic shift value is configured (e.g., the cyclic shift value for the second sequence is predefined), it can be determined that the currently configured sequence is the second sequence, that is, the sequence for scenario 2, or the signal for scenario 2.

[0254] Optionally, method 1000 further includes: the terminal device receiving third indication information, and correspondingly, the network device sending the third indication information. The third indication information indicates the root corresponding to the second sequence, or the third indication information indicates the root and / or cyclic shift value corresponding to the first sequence. The following description illustrates both scenarios.

[0255] In the first possible scenario, X1 first symbols are generated based on N first sequences. In this case, the third indication information indicates the root and / or cyclic shift value corresponding to the first sequence.

[0256] For example, the third indication information indicates the root and cyclic shift value corresponding to the first sequence. Taking Figure 12(a) as an example, the network device can configure the root and cyclic shift value used by the sequence in the current cell (i.e., the first sequence). For example, the network device may configure any sequence in any group of K sequences.

[0257] For example, the third indication information indicates the cyclic shift value corresponding to the first sequence. Taking Figure 12(a) as an example, multiple cell-to-root correspondences can be predefined, and the network device can configure the cyclic shift value used by the sequence in the current cell (i.e., the first sequence). For example, the network device may configure any one of the sequences in a certain group of K sequences (i.e., the group of sequences corresponding to the root of the current cell).

[0258] Furthermore, when the third indication information indicates the root and the cyclic shift value, such as when the third indication information indicates the root and the cyclic shift value corresponding to the first sequence, the root and the cyclic shift value can be carried in one signaling or one field, or they can be carried in different signaling or different fields, without limitation. For example, the third indication information includes two fields (or two sub-information), one field (or one sub-information) indicates the root, and the other field (or another sub-information) indicates the cyclic shift value.

[0259] In the second possible scenario, X1 first symbols are generated based on one second sequence. In this case, the third indication information indicates the root corresponding to the second sequence. Taking Figure 12(a) as an example, a cyclic shift value (such as cyclic shift value #1) is predefined for scenario 2, and the root used by the sequence in the current cell is configured by the network device; in other words, one sequence from each of the K predefined sequences is used for scenario 2, and the network device can configure one sequence from any of the K predefined sequences.

[0260] The above section details Option 1; the following section details Option 2.

[0261] Option 2: Each of the K sets of sequences corresponds to at least one cyclic shift value, and different sets of sequences in the K sets of sequences correspond to different cyclic shift values.

[0262] For example, each of the K sets of sequences corresponds to a cyclic shift value. Further, alternatively, different sequences within the same set of K sets of sequences correspond to different roots. Suppose that one set of sequences in the K sets of sequences corresponds to 1 cyclic shift value and 8 roots, meaning that this set of sequences contains a total of 8 sequences, where these 8 roots are different. Based on this, for terminal devices within the same cell, the network device can be configured with the same set of sequences; for terminal devices in different cells, the network device can be configured with different sets of sequences.

[0263] Another example involves K sets of sequences, each set corresponding to multiple cyclic shift values. Sequences within the same set of K sets with the same cyclic shift value correspond to different roots. For instance, suppose one set of K sets of sequences corresponds to two cyclic shift values, denoted as cyclic shift value #1 and cyclic shift value #2. Cyclic shift value #1 corresponds to 4 roots (i.e., the sequence corresponding to cyclic shift value #1 corresponds to 4 roots), and cyclic shift value #2 corresponds to 4 roots (i.e., the sequence corresponding to cyclic shift value #2 corresponds to 4 roots). This set contains a total of 8 sequences, where the 4 roots corresponding to cyclic shift value #1 and cyclic shift value #2 are different. Whether the roots corresponding to cyclic shift value #1 and cyclic shift value #2 are the same is not required. Based on this, for terminal devices within the same cell, network devices can be configured with the same set of sequences, such as sequences corresponding to the same cyclic shift value within the same set of sequences; for terminal devices in different cells, network devices can be configured with different sets of sequences, or, network devices can be configured with sequences corresponding to different cyclic shift values ​​within the same set of sequences.

[0264] In Scheme 2, regarding the L sequences, at least the following two implementation methods are also included:

[0265] Implementation method 1: The L sequences are composed of k1 sequences from the K sequences;

[0266] Implementation method 2: L sequences are composed of k2 sequences from each of the K sets of sequences.

[0267] The following describes the two implementation methods using the example of each of the K sets of sequences corresponding to a cyclic shift value.

[0268] Implementation Method 1: The L sequences are composed of k1 sequences from the K sequences. Here, k1 is an integer greater than or equal to 1 and less than K.

[0269] Example 1, k1 = 1, that is, L sequences are composed of one set of sequences from K sets of sequences.

[0270] Example 2, k1>1, that is, L sequences are composed of multiple sequences from K sequences.

[0271] For examples 1 and 2 above, please refer to examples 1 and 2 in implementation method 1 of scheme 1, which will not be repeated here.

[0272] Optionally, the L sequences consist of k1 sequences corresponding to the first cyclic shift value from the K sequences. The first cyclic shift value is predefined or configured.

[0273] In one example, k1 = 1. Specifically, each of the K sets of sequences corresponds to a cyclic shift value. Different sets of sequences in the K sets of sequences correspond to different cyclic shift values. L sequences can be composed of a set of sequences from the K sets of sequences corresponding to the first cyclic shift value. Taking Figure 11(a) as an example, for instance, K cyclic shift values ​​are predefined or configured for generating sequences. These K cyclic shift values ​​are used for the K sets of sequences, meaning there is a one-to-one correspondence between the K cyclic shift values ​​and the K sets of sequences. Assume that the K cyclic shift values ​​are cyclic shift value #1, cyclic shift value #2, ..., cyclic shift value #K, and correspond to groups #1, #2, ..., #K respectively. L sequences can be composed of a set of sequences corresponding to the cyclic shift value #K (i.e., the sequence of group #K), meaning the first cyclic shift value is the cyclic shift value #K.

[0274] Another example, k1>1. Specifically, each of the K sets of sequences corresponds to a cyclic shift value. Different sets of sequences in the K sets of sequences correspond to different cyclic shift values. L sequences can be composed of multiple sets of sequences in the K sets of sequences corresponding to the first cyclic shift value. Taking Figure 11(b) as an example, for instance, K cyclic shift values ​​are predefined or configured for generating sequences. The K cyclic shift values ​​are used for the K sets of sequences, that is, the K cyclic shift values ​​correspond one-to-one with the K sets of sequences. Assume that the K cyclic shift values ​​are cyclic shift value #1, cyclic shift value #2, ..., cyclic shift value #K, and correspond to groups #1, group #2, ..., group #K in sequence. L sequences can be composed of a set of sequences corresponding to cyclic shift value #1 (i.e., the sequence of group #1) and a set of sequences corresponding to cyclic shift value #K (i.e., the sequence of group #K). That is, the first cyclic shift value is cyclic shift value #1 and cyclic shift value #K.

[0275] Optionally, method 1000 further includes: the terminal device receiving second indication information, and correspondingly, the network device sending the second indication information. The second indication information indicates the root corresponding to the second sequence, or the second indication information indicates the cyclic shift value and / or root corresponding to the first sequence. The following describes these two scenarios.

[0276] In the first possible scenario, X1 first symbols are generated based on N first sequences. In this case, the second indication information indicates the cyclic shift value and / or root corresponding to the first sequence.

[0277] For example, the second indication information indicates the cyclic shift value and root corresponding to the first sequence. Taking Figure 11(a) as an example, the network device can configure the cyclic shift value and root used by the sequence in the current cell (i.e., the first sequence). For example, the network device may configure any sequence in any group of K sequences.

[0278] For example, the second indication information indicates the root corresponding to the first sequence. Taking Figure 11(a) as an example, the correspondence between multiple cells and multiple cyclic shift values ​​can be predefined, and the network device can configure the root used by the sequence in the current cell (i.e., the first sequence). For example, the network device may configure any one of the sequences in a certain group of K sequences (that is, the group of sequences corresponding to the cyclic shift value of the current cell).

[0279] Furthermore, when the second indication information indicates the root and the cyclic shift value, such as when the second indication information indicates the root and the cyclic shift value corresponding to the first sequence, the root and the cyclic shift value can be carried in one signaling or one field, or they can be carried in different signaling or different fields, without limitation. For example, the second indication information includes two fields (or two sub-information), one field (or one sub-information) indicates the root, and the other field (or another sub-information) indicates the cyclic shift value.

[0280] In the second possible scenario, X1 first symbols are generated based on one second sequence. In this case, the second indication information indicates the root corresponding to the second sequence. Taking Figure 11(a) as an example, a cyclic shift value (such as cyclic shift value #K) is predefined for scenario 2, and the network device configures the root used by the sequence in the current cell; in other words, the sequence in group #K of the predefined K groups of sequences is used for scenario 2, and the network device can configure any sequence in group #K.

[0281] Implementation Method 2: The L sequences are composed of k2 sequences from each of the K sets of sequences. Here, k2 is an integer greater than or equal to 1 and less than M / K.

[0282] Example 1, k2 = 1, that is, L sequences are composed of one sequence from each of the K sets of sequences.

[0283] Example 2, k2>1, that is, L sequences are composed of multiple sequences from each of the K sets of sequences.

[0284] For examples 1 and 2 above, please refer to examples 1 and 2 in implementation method 2 of scheme 1, which will not be elaborated here.

[0285] Optionally, the L sequences consist of k2 sequences corresponding to the first root in each sequence group. The first root is predefined or configured.

[0286] In one example, k2 = 1. Specifically, each of the K sets of sequences corresponds to a cyclic shift value. Different sets of sequences in the K sets of sequences correspond to different cyclic shift values. The same set of sequences in the K sets of sequences corresponds to different roots. L sequences can be composed of a sequence corresponding to the first root in each set of sequences. Taking Figure 12(a) as an example, K cyclic shift values ​​are predefined or configured to generate sequences. These K cyclic shift values ​​are used for the K sets of sequences, meaning that the K cyclic shift values ​​correspond one-to-one with the K sets of sequences. Assume that each set of sequences corresponds to S roots, namely root#1, root#2, ..., root#S. Taking set #1 as an example, these S roots correspond to seq_1_1, seq_1_2, ..., seq_1_S in sequence. L sequences can be composed of the sequence corresponding to root#1 in each set of sequences. That is, L sequences are composed of the sequence seq_i_1 in set #i (1≤i≤K), meaning the first root is root#1.

[0287] Another example is k2>1. Specifically, each of the K sets of sequences corresponds to a cyclic shift value. Different sets of sequences in the K sets of sequences correspond to different cyclic shift values. The same set of sequences in the K sets of sequences corresponds to different roots. The L sequences can be composed of multiple sequences in each set that correspond to the first root. Taking Figure 12(b) as an example, for instance, K cyclic shift values ​​are predefined or configured to generate sequences. These K cyclic shift values ​​are used for the K sets of sequences, meaning that the K cyclic shift values ​​correspond one-to-one with the K sets of sequences. Assume that each sequence group corresponds to S roots, namely root#1, root#2, ..., root#S. Taking group #1 as an example, the S roots correspond to seq_1_1, seq_1_2, ..., seq_1_S in sequence. L sequences can be composed of the sequences corresponding to root#1 and root#2 in each sequence group. That is, L sequences are composed of the sequences seq_i_1 and seq_i_2 in group #i (1≤i≤K). In other words, the first root is root#1 and root#2.

[0288] Alternatively, the terminal device may determine whether the currently configured first sequence or second sequence is based on the number of configured roots or whether roots are configured.

[0289] One possible implementation is that the terminal device determines whether the currently configured sequence is the first sequence or the second sequence based on the number of configured roots. In other words, the terminal device determines whether the currently configured sequence is for scenario 1 or scenario 2 based on the number of configured roots; that is, whether the currently configured signal is for scenario 1 or scenario 2. For example, if multiple roots are configured, it can be determined that the currently configured sequence is the first sequence, i.e., the sequence for scenario 1, or the signal for scenario 1; if only one root is configured, it can be determined that the currently configured sequence is the second sequence, i.e., the sequence for scenario 2, or the signal for scenario 2.

[0290] Another possible implementation is that the terminal device determines whether the currently configured sequence is the first sequence or the second sequence based on whether root is configured. In other words, the terminal device determines whether the currently configured sequence is for scenario 1 or scenario 2 based on whether root is configured. For example, if root is configured, it can be determined that the currently configured sequence is the first sequence, that is, the sequence for scenario 1, and thus the signal for scenario 1; if root is not configured (e.g., the root for the second sequence is predefined), it can be determined that the currently configured sequence is the second sequence, that is, the sequence for scenario 2, and thus the signal for scenario 2.

[0291] Optionally, method 1000 further includes: the terminal device receiving fourth indication information, and correspondingly, the network device sending the fourth indication information. The fourth indication information indicates the cyclic shift value corresponding to the second sequence, or the fourth indication information indicates the cyclic shift value and / or root corresponding to the first sequence. The following description illustrates both scenarios.

[0292] In the first possible scenario, X1 first symbols are generated based on N first sequences. In this case, the fourth indication information indicates the cyclic shift value and / or root corresponding to the first sequence.

[0293] For example, the fourth indication information indicates the cyclic shift value and root corresponding to the first sequence. Taking Figure 12(a) as an example, the network device can configure the cyclic shift value and root used by the sequence in the current cell (i.e., the first sequence). For example, the network device may configure any sequence in any group of K sequences.

[0294] For example, the fourth indication information indicates the root corresponding to the first sequence. Taking Figure 12(a) as an example, multiple cells and multiple cyclic shift values ​​can be predefined, and the network device can configure the root used by the sequence in the current cell (i.e., the first sequence). For example, the network device may configure any one of the sequences in a certain group of K sequences (that is, the group of sequences corresponding to the cyclic shift value of the current cell).

[0295] Furthermore, when the fourth indication information indicates the root and the cyclic shift value, such as when the fourth indication information indicates the root and the cyclic shift value corresponding to the first sequence, the root and the cyclic shift value can be carried in one signaling or one field, or they can be carried in different signaling or different fields, without limitation. For example, the fourth indication information includes two fields (or two sub-information), one field (or one sub-information) indicates the root, and the other field (or another sub-information) indicates the cyclic shift value.

[0296] In the second possible scenario, X1 first symbols are generated based on one second sequence. In this case, the fourth indication information indicates the cyclic shift value corresponding to the second sequence. Taking Figure 12(a) as an example, a root (such as root#1) is predefined for scenario 2, and the network device configures the cyclic shift value used by the sequence in the current cell; in other words, one sequence from each of the K predefined sequences is used for scenario 2, and the network device can configure one sequence from any of the K predefined sequences.

[0297] The above section, combining Scheme 1 and Scheme 2, introduces relevant schemes regarding the first and second sequences.

[0298] Assuming the first signal is not a reference signal, but rather a wake-up signal, method 1000 may optionally further include: the terminal device receiving a reference signal, and the network device transmitting a reference signal. The reference signal comprises Y OOK symbols, which include Y1 first symbols and Y2 second symbols. Y is an integer greater than 1, Y1 and Y2 are integers greater than or equal to 0, and Y1 + Y2 = Y. As an example, the reference signal is LP-SS.

[0299] Regarding the first and second symbols, please refer to the previous descriptions; they will not be repeated here.

[0300] Among them, Y1 first symbols are generated based on one third sequence. Regarding the third sequence, at least the following two implementation methods are included.

[0301] One possible implementation is that the third sequence is one of N first sequences.

[0302] Specifically, for scenario 1 (i.e., the scenario where the sequence carries additional information), the X1 first symbols of the wake-up signal (i.e., an example of the first signal) are generated based on N first sequences, and the reference signal can use the same sequence as the wake-up signal, that is, the reference signal can use one of the N first sequences.

[0303] As an example, the reference signal can use one of N first sequences corresponding to a second cyclic shift value, where the second cyclic shift value is predefined or configured. For example, the second cyclic shift value is 0. For instance, suppose K roots are predefined, each of the K sets of sequences corresponds to one root, and different sets of sequences correspond to different roots. In scenario 1, the network device can configure the root and cyclic shift value of the wake-up signal, and the reference signal can use the same root as the wake-up signal, with a configured or predefined second cyclic shift value (e.g., the second cyclic shift value is 0).

[0304] In another example, the reference signal can use one of the N first sequences corresponding to the second root, where the second root is predefined or configured. For instance, suppose there are K predefined cyclic shift values, each of the K sets of sequences corresponds to one cyclic shift value, and different sets of sequences in the K sets of sequences correspond to different cyclic shift values. In scenario 1, the network device can configure the root and cyclic shift value of the wake-up signal, and the reference signal can use the same cyclic shift value as the wake-up signal and configure or predefine the second root.

[0305] The second possible implementation is that the third sequence is the second sequence.

[0306] Specifically, for scenario 2 (i.e., the scenario where the sequence does not carry additional information), the X1 first symbols of the wake-up signal (i.e., an example of the first signal) are generated based on a second sequence, and the reference signal can use the same sequence as the wake-up signal, that is, the reference signal can use the second sequence.

[0307] In some cases, a mismatch may occur between the frequency domain resources occupied by the first signal (such as a wake-up signal or a reference signal) and the DFT size (or, in other words, a mismatch between the number of redundancies (RBs) occupied by the first signal and the actual number of recurrent frequencies (REs) used). For example, when generating the final signal based on the first or second sequence, the process typically involves first generating a frequency domain sequence through a DFT operation, mapping it to frequency domain resources, then transforming it to the time domain through an IFFT operation, and finally transmitting it. In this DFT operation step, the DFT size is 2^2. n Let n be a positive integer. Assuming the first signal might occupy 11 physical resource blocks (PRBs) (i.e., 132 REs), then n can be 7, meaning the DFT size is 2.7 (That is, 128 points). This raises a problem: the length of the frequency domain sequence corresponding to the first or second sequence is less than the number of available REs. In this case, how should the first signal be mapped onto the frequency domain resources? To address this, this application proposes that the first signal can be designed to be mapped onto partially continuous frequency domain resources. The following describes this in detail with reference to method 1300. The method 1300 described below can be used in combination with the preceding method 1000, or it can be used alone; there is no limitation on this.

[0308] Referring to Figure 13, as an example, Figure 13 is a schematic diagram of a signal transmission method 1300 provided in an embodiment of this application. The method 1300 shown in Figure 13 may include the following steps.

[0309] Method 1300 includes step S1320. Optionally, method 1300 includes step S1310.

[0310] S1310, the network device determines F1 first frequency domain units, where F1 is an integer greater than 1.

[0311] As an example, determining F1 first frequency domain units includes: determining the frequency domain locations of the F1 first frequency domain units. The F1 first frequency domain units can be understood as configured or predefined frequency domain resources for transmitting a first signal.

[0312] S1320, the network device transmits a first signal on F1 first frequency domain units. Correspondingly, the terminal device receives the first signal on F1 first frequency domain units.

[0313] The first signal can represent a signal on the wake-up link. As an example, the first signal may be a wake-up signal (such as LP-WUS) or a reference signal (such as LP-SS).

[0314] The first signal comprises X OOK symbols; in other words, the modulation method of the first signal is OOK modulation. Taking X OOK symbols as an example, the X OOK symbols include X1 first symbols and X2 second symbols, where X is an integer greater than 1, X1 and X2 are integers greater than or equal to 0, and X1 + X2 = X. For a detailed description of the first signal, the first symbols, and the second symbols, please refer to Method 1000; it will not be elaborated upon here.

[0315] The X1 first symbols are generated based on sequence #A. As an example, sequence #A is a ZC sequence.

[0316] Sequence #A can represent a class of sequences, specifically sequences used to generate X1 first symbols. Two possible implementations are described below.

[0317] One possible implementation is that sequence #A is a set of sequences containing N first sequences, meaning that X1 first symbols are generated based on N first sequences. The N first sequences belong to a set of M sequences; in other words, the N first sequences are selected from M candidate sequences. N is an integer greater than 1 and less than M.

[0318] Another possible implementation is that sequence #A is a second sequence, meaning that X1 first symbols are generated based on one second sequence. Here, one second sequence belongs to a sequence among L sequences; in other words, one second sequence is selected from L candidate sequences. L is an integer greater than or equal to 1.

[0319] The first and second sequences are the overlaid OFDM sequences described above. Specifically, the first sequence is the sequence in scenario 1 above, meaning the first sequence carries additional information; the second sequence is the sequence in scenario 2 above, meaning the second sequence does not carry additional information.

[0320] As an example, L sequences are a subset of M sequences, in which case L is less than M; or, the L sequences have no intersection with the M sequences; or, the L sequences are identical to the M sequences, in which case L is equal to M. For related schemes where L sequences are subsets of M sequences, please refer to the relevant description in Method 1000, which will not be elaborated here.

[0321] Here, the frequency domain sequence corresponding to sequence #A occupies F2 second frequency domain units. One first frequency domain unit includes r second frequency domain units, that is, F1 first frequency domain units contain F1×r second frequency domain units. The F2 second frequency domain units are F2 consecutive second frequency domain units within the F1 first frequency domain units. Based on this, it can be seen that the frequency domain sequence corresponding to sequence #A can be mapped to F2 consecutive second frequency domain units within the F1 first frequency domain units. r is an integer greater than 1, and F2 is an integer greater than or equal to 1 and less than F1×r. Further, as an example, (F1-1)×r <F2<F1×r。

[0322] In one possible scenario, a first frequency domain unit can be a resource block (RB), and a second frequency domain unit can be a resource element (RE). In this case, as an example, r = 12.

[0323] The following describes several possible implementations of F2 second frequency domain units (i.e., F2 REs) with reference to Figure 14, using the first frequency domain unit as RB and the second frequency domain unit as RE. As an example, Figure 14 is a schematic diagram showing the relationship between F2 second frequency domain units and F1 first frequency domain units provided in the embodiments of this application.

[0324] In the first possible implementation, the starting positions of the F2 REs are separated from the starting positions of the F1 RBs by f1 REs, and the ending positions of the F2 REs are separated from the ending positions of the F1 RBs by f2 REs, where f1 and f2 are integers greater than 0 and less than F1.

[0325] As an example, f1 = f2. Based on this, we know that F2 REs are located at the center of F1 RBs. As shown in Figure 14(a), the F2 REs are located at the center of F1 RBs, and the interval f1 between the starting positions of the F2 REs and the starting positions of the F1 RBs, and the interval f2 between the ending positions of the F2 REs and the ending positions of the F1 RBs are the same. Based on this method, the sequence #A is mapped to the center position, thus ensuring that the first signal is not adjacent (i.e., has a gap) or has a larger gap with signals occupying other RBs (outside of F1 RBs) in the frequency domain, thereby reducing the impact of frequency offset.

[0326] In the second possible implementation, the starting positions of F2 REs are the same as the starting positions of F1 RBs.

[0327] In this implementation, it is assumed that the end positions of F2 REs are separated from the end positions of F1 RBs by f2 REs, where f2 = F1 × r - F2. As shown in Figure 14(b), the starting positions of F2 REs are the same as the starting positions of F1 RBs, and the end positions of F2 REs are separated from the end positions of F1 RBs by (F1 × r - F2) REs. Based on this approach, considering that in some cases the frequency domain position of the first signal may be located at an edge position (such as an edge position with a lower frequency), it is possible to design that one end of the frequency domain resource occupied by the first signal has an interval or a larger interval between it and the frequency domain resources occupied by other RBs (outside of F1 RBs). This allows the first signal to be non-adjacent (i.e., have an interval) or have a larger interval with the signals occupying other RBs (outside of F1 RBs) in the frequency domain, reducing the impact of frequency offset.

[0328] In the third possible implementation, the ending positions of F2 REs are the same as the ending positions of F1 RBs.

[0329] In this implementation, it is assumed that the starting positions of F2 REs are separated from the starting positions of F1 RBs by F2 REs, and f1 = F1 × r - F2. As shown in Figure 14(c), the ending positions of F2 REs are the same as the ending positions of F1 RBs, and the starting positions of F2 REs are separated from the starting positions of F1 RBs by (F1 × r - F2) REs. Based on this approach, considering that in some cases the frequency domain position of the first signal may be located at an edge position (such as an edge position with a higher frequency), it is possible to design that one end of the frequency domain resource occupied by the first signal has an interval or a larger interval between the frequency domain resources occupied by the signal occupying other RBs (outside of F1 RBs). This allows the first signal to be non-adjacent (i.e., have an interval) or have a larger interval with the signal occupying other RBs (outside of F1 RBs) in the frequency domain, reducing the impact of frequency offset.

[0330] The above three implementation methods are illustrative examples, and the embodiments of this application are not limited to them. Furthermore, the above examples use RB as the first frequency domain unit and RE as the second frequency domain unit as an example; the embodiments of this application are not limited to this. In other words, the above implementation methods can be applied to scenarios where a first frequency domain unit includes multiple second frequency domain units.

[0331] Optionally, the relationship between the F2 second frequency domain units and the F1 first frequency domain units can be predefined or configured.

[0332] One possible scenario is that the relationship between the F2 second frequency domain units and the F1 first frequency domain units is predefined. For example, the F2 second frequency domain units are predefined to be located at the center of the F1 first frequency domain units. Another example is that the starting positions of the predefined F2 second frequency domain units are the same as the starting positions of the F1 first frequency domain units. Yet another example is that the ending positions of the predefined F2 second frequency domain units are the same as the ending positions of the F1 first frequency domain units.

[0333] In another possible scenario, the relationship between the F2 second frequency domain units and the F1 first frequency domain units is configured by the network device.

[0334] For example, a network device can determine F2 second frequency domain units based on actual communication conditions, such as the positions of F1 first frequency domain units. For instance, if F1 first frequency domain units are located at an edge position, and at a higher frequency, then, as an example, the network device can configure the ending position of the F2 second frequency domain units to be the same as the ending position of the F1 first frequency domain units. As another example, if F1 first frequency domain units are located at an edge position, such as at a lower frequency, then, as an example, the network device can configure the starting position of the F2 second frequency domain units to be the same as the starting position of the F1 first frequency domain units. As yet another example, if F1 first frequency domain units are not located at an edge position, then, as an example, the network device can configure the F2 second frequency domain units to be two consecutive F2 second frequency domain units located at the center position of the F1 first frequency domain units.

[0335] Another example is that multiple candidate schemes are predefined (such as the first to third possible implementations mentioned above), each candidate scheme corresponds to a number, and the network device can select one from them according to the actual communication situation, such as the position of F1 first frequency domain units, and can indicate the number corresponding to the selected scheme to the terminal device.

[0336] Optionally, method 1300 further includes: the terminal device receiving fifth indication information, and correspondingly, the network device sending the fifth indication information. The fifth indication information indicates at least one of the following: the offset between the starting positions of the F2 second frequency domain units and the starting positions of the F1 first frequency domain units, and the offset between the ending positions of the F2 second frequency domain units and the ending positions of the F1 first frequency domain units.

[0337] For ease of understanding, the following describes a possible specific process applicable to the embodiments of this application from the perspective of the network device. Assume the first frequency domain unit is RB, the second frequency domain unit is RE, the DFT size is 128, the wake-up signal (i.e., an example of the first signal) occupies 132 REs, and the length of the overlaid OFDM sequence (i.e., the first sequence or the second sequence) is 128 / W, where W is the number of OOK symbols in one OFDM symbol. As an example, the network device can perform the following operations.

[0338] 1) Determine the overlaid OFDM sequence and its location. For example, a network device may determine the overlaid OFDM sequence and its location based on at least one of the following: the root used by the overlaid OFDM sequence, the cyclic shift value used by the overlaid OFDM sequence, the information carried by the wake-up signal, and other configuration information (such as whether the overlaid OFDM sequence carries additional information, i.e., whether the overlaid OFDM sequence is a sequence from scenario 1 or scenario 2).

[0339] The position of the overlaid OFDM sequence represents the relative position of the overlaid OFDM sequence and the all-zero sequence. For example, assuming an OFDM symbol contains four OOK symbols and uses Manchester encoding, there are four possibilities: ON OFF ON OFF, ON OFF OFF ON, OFF ON ON OFF, and OFF ON OFF ON. Correspondingly, the relative positions of the overlaid OFDM sequence and the all-zero sequence also have the following four possibilities:

[0340] overlaid OFDM sequence / all-zero sequence / overlaid OFDM sequence / all-zero sequence

[0341] overlaid OFDM sequence / all-zero sequence / all-zero sequence / overlaid OFDM sequence

[0342] all-zero sequence / overlaid OFDM sequence / overlaid OFDM sequence / all-zero sequence

[0343] all-zero sequence / overlaid OFDM sequence / all-zero sequence / overlaid OFDM sequence.

[0344] 2) Concatenate the W sequences (including the overlaid OFDM sequence and the all-zero sequence) to obtain a pre-DFT sequence of length 128.

[0345] Specifically, when W>1, W sequences can be concatenated to obtain a pre-DFT sequence of length 128. Taking Figure 8 as an example, assuming W=4, that is, each OFDM symbol contains 4 OOK symbols, by concatenating the sequences at the 4 positions (that is, the specific sequence at the "1" position and the 0 sequence at the "0" position), the pre-DFT sequence corresponding to the entire OFDM symbol can be obtained.

[0346] 3) Perform a fast fourier transform (FFT) on the pre-DFT sequence to obtain a DFT sequence of length 128 (post-DFT sequence).

[0347] It is understood that the above is an illustrative example, and the embodiments of this application are not limited thereto. For example, the network device may also directly read from multiple pre-generated post-DFT sequences; in other words, multiple possible frequency domain sequences can be pre-stored on the network device side, and the network device can select one of the frequency domain sequences for use according to the actual situation.

[0348] For example, in scenario 2, as in the example in step 1), assuming an OFDM symbol contains 4 OOK symbols and also uses Manchester encoding, then 4 possible frequency domain sequences can be pre-stored on the network device side. These 4 possible frequency domain sequences are the four possible DFT transforms mentioned above.

[0349] For example, in scenario 1, assuming an OFDM symbol contains four OOK symbols and uses Manchester encoding, and each ON symbol can be generated based on one of four sequences (i.e., the second sequence), then 64 possible frequency domain sequences can be pre-stored on the network device side. Specifically, as in step 1), each of the four possibilities can further have 4×4=16 possibilities (because each possibility has two overlaid OFDM sequences, and each overlaid OFDM sequence has 4 possibilities). Therefore, 4×4×4=64 possible frequency domain sequences can be pre-stored on the network device side.

[0350] 4) Map the post-DFT sequence onto 128 REs (i.e., F2 second frequency domain units) of 132 REs (i.e., F1 first frequency domain units in one example).

[0351] One possible implementation is to map the post-DFT sequence onto the center 128 REs of the 132 REs, leaving two empty REs on each side. In other words, insert two zeros at the beginning and end of the 128-length post-DFT sequence to obtain a frequency sequence of length 132, and then map this frequency sequence onto the 132 REs.

[0352] Another possible implementation is to map the post-DFT sequence onto the edge of the 132 REs, leaving 4 empty REs on one side. In other words, insert 4 zeros into one side of the 128-length post-DFT sequence to obtain a frequency domain sequence of length 132, and then map this frequency domain sequence onto the 132 REs.

[0353] It is understood that in the various embodiments of this application, "monitoring" can be used interchangeably with "receiving," "detecting," or "reading." For example, "receiving the first signal" can also be replaced with "monitoring the first signal," "detecting the first signal," or "reading the first signal."

[0354] It is also understood that, in the various embodiments of this application, the interaction between a terminal device and a network device is mainly used as an example for illustrative purposes. This application is not limited thereto. The terminal device can be replaced by a receiving device, which can be either a terminal device or a network device; the network device can be replaced by a sending device, which can be either a terminal device or a network device. For example, "terminal device" can be replaced by "first terminal device," and "network device" can be replaced by "second terminal device."

[0355] The methods provided by the embodiments of this application have been described in detail above with reference to Figures 10-14. The apparatus provided by the embodiments of this application will be described in detail below with reference to Figures 15 to 17. It should be understood that the descriptions of the apparatus embodiments correspond to the descriptions of the method embodiments; therefore, any content not described in detail can be referred to the method embodiments above, and for the sake of brevity, will not be repeated here.

[0356] Referring to Figure 15, as an example, Figure 15 is a schematic diagram of a communication device 1500 provided in an embodiment of this application. The communication device 1500 includes a transceiver unit 1510. The transceiver unit 1510 can be used to implement corresponding communication functions. The transceiver unit 1510 can also be referred to as a communication interface or a communication unit. Optionally, the communication device 1500 further includes a processing unit 1520. The processing unit 1520 can be used to perform processing, such as performing correlation processing based on local sequences and received signals.

[0357] Optionally, the device 1500 may further include a storage unit for storing instructions and / or data, and the processing unit 1520 may read the instructions and / or data from the storage unit to enable the device to implement the aforementioned method embodiments.

[0358] In a first possible design, the device 1500 can be the terminal device in the foregoing embodiments, which can implement the steps or processes corresponding to those executed by the terminal device in the above method embodiments. Specifically, the transceiver unit 1510 can be used to perform transceiver-related operations (such as sending and / or receiving data or messages) of the terminal device in the above method embodiments, and the processing unit 1520 can be used to perform processing-related operations of the terminal device in the above method embodiments, or operations other than transceiver (such as operations other than sending and / or receiving data or messages).

[0359] One possible implementation is that the transceiver unit 1510 is used to receive a first signal, the first signal including X on / off keyed OOK symbols, the X OOK symbols including X1 first symbols and X2 second symbols, the first symbols and the second symbols are different, wherein the X1 first symbols are generated based on N first sequences, or the X1 first symbols are generated based on 1 second sequence; wherein the N first sequences belong to sequences in M ​​sequences, the 1 second sequence belongs to sequences in L sequences, the L sequences are subsets of the M sequences, M, N, and X are integers greater than 1, L is an integer greater than or equal to 1 and less than M, X1 and X2 are integers greater than or equal to 0, and X1 + X2 = X.

[0360] In a second possible design, the device 1500 can be a network device as described in the foregoing embodiments. This device 1500 can implement the steps or processes performed by the network device corresponding to those described in the method embodiments above. Specifically, the transceiver unit 1510 can be used to perform transceiver-related operations (such as sending and / or receiving data or messages) of the network device described in the method embodiments above, and the processing unit 1520 can be used to perform processing-related operations of the network device described in the method embodiments above, or operations other than transceiver operations (such as operations other than sending and / or receiving data or messages).

[0361] One possible implementation is that the transceiver unit 1510 is used for a first signal, the first signal including X on / off keyed OOK symbols, the X OOK symbols including X1 first symbols and X2 second symbols, the first symbols and the second symbols are different, wherein the X1 first symbols are generated based on N first sequences, or the X1 first symbols are generated based on 1 second sequence; wherein the N first sequences belong to sequences in M ​​sequences, the 1 second sequence belongs to sequences in L sequences, the L sequences are subsets of the M sequences, M, N, and X are integers greater than 1, L is an integer greater than or equal to 1 and less than M, X1 and X2 are integers greater than or equal to 0, and X1 + X2 = X.

[0362] It should be understood that the specific process of each unit performing the above-mentioned corresponding steps has been described in detail in the above method embodiments, and will not be repeated here for the sake of brevity.

[0363] It should also be understood that the device 1500 here is embodied in the form of a functional unit. The term "unit" here can refer to an application-specific integrated circuit (ASIC), electronic circuitry, a processor (e.g., a shared processor, a proprietary processor, or a group processor, etc.) and memory for executing one or more software or firmware programs, integrated logic circuitry, and / or other suitable components supporting the described functions. In an alternative example, those skilled in the art will understand that the device 1500 can be specifically the communication device in the above embodiments, and can be used to execute the various processes and / or steps corresponding to the communication device in the above method embodiments; to avoid repetition, these will not be described again here.

[0364] The apparatus 1500 of each of the above-described schemes has the function of implementing the corresponding steps performed by the communication device (such as a terminal device or a network device) in the above-described methods. The function can be implemented in hardware or by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above functions; for example, the transceiver unit can be replaced by a transceiver (e.g., the transmitting unit in the transceiver unit can be replaced by a transmitter, and the receiving unit in the transceiver unit can be replaced by a receiver), and other units, such as processing units, can be replaced by processors, each performing the transceiver operations and related processing operations in the respective method embodiments.

[0365] In addition, the transceiver unit 1510 may also be a transceiver circuit (for example, it may include a receiving circuit and a transmitting circuit), and the processing unit may be a processing circuit.

[0366] It should be noted that the device in Figure 15 can be the communication device (such as a terminal device or a network device) in the aforementioned embodiments, or it can be a chip or a chip system, such as a system on a chip (SoC). The transceiver unit can be an input / output circuit or a communication interface; the processing unit is a processor, microprocessor, or integrated circuit integrated on the chip. No limitations are imposed here.

[0367] Referring to Figure 16, as an example, Figure 16 is a schematic diagram of another communication device 1600 provided in an embodiment of this application. The device 1600 includes a processor 1610, which is coupled to a memory 1620. The memory 1620 is used to store computer programs or instructions and / or data. The processor 1610 is used to execute the computer programs or instructions stored in the memory 1620, or to read the data stored in the memory 1620, in order to perform the methods in the above method embodiments.

[0368] Optionally, there may be one or more processors 1610.

[0369] Optionally, the memory 1620 may be one or more.

[0370] Alternatively, the memory 1620 can be integrated with the processor 1610, or it can be set separately.

[0371] Optionally, as shown in FIG16, the device 1600 further includes a transceiver 1630 for receiving and / or transmitting signals. For example, a processor 1610 is used to control the transceiver 1630 to receive and / or transmit signals.

[0372] As an example, processor 1610 may have the functions of processing unit 1520 shown in FIG15, memory 1620 may have the functions of storage unit, and transceiver 1630 may have the functions of transceiver unit 1510 shown in FIG15.

[0373] As one option, the device 1600 is used to implement the operations performed by a communication device (such as a terminal device or a network device) in the various method embodiments described above.

[0374] For example, processor 1610 is used to execute computer programs or instructions stored in memory 1620 to implement the relevant operations of the communication device in the various method embodiments described above.

[0375] It should be understood that the processor mentioned in the embodiments of this application can be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSPs), ASICs, field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor can be a microprocessor or any conventional processor.

[0376] It should also be understood that the memory mentioned in the embodiments of this application can be volatile memory and / or non-volatile memory. Non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. Volatile memory can be random access memory (RAM). For example, RAM can be used as an external cache. By way of example and not limitation, RAM includes the following forms: static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous linked dynamic random access memory (SLDRAM), and direct rambus RAM (DR RAM).

[0377] It should be noted that when the processor is a general-purpose processor, DSP, ASIC, FPGA, or other programmable logic device, discrete gate or transistor logic device, or discrete hardware component, the memory (storage module) can be integrated into the processor.

[0378] It should also be noted that the memory described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0379] Referring to Figure 17, as an example, Figure 17 is a schematic diagram of a chip system 1700 provided in an embodiment of this application. The chip system 1700 (or may also be referred to as a processing system) includes logic circuitry 1710 and an input / output interface 1720.

[0380] The logic circuit 1710 can be a processing circuit in the chip system 1700. The logic circuit 1710 can be coupled to a memory unit, calling instructions from the memory unit, enabling the chip system 1700 to implement the methods and functions of the embodiments of this application. The input / output interface 1720 can be an input / output circuit in the chip system 1700, outputting processed information from the chip system 1700, or inputting data or signaling information to be processed into the chip system 1700 for processing.

[0381] As one approach, the chip system 1700 is used to implement operations performed by communication devices (such as terminal devices or network devices) in the various method embodiments described above.

[0382] For example, logic circuit 1710 is used to implement processing-related operations performed by a communication device (such as a terminal device or a network device) in the above method embodiments; input / output interface 1720 is used to implement sending and / or receiving-related operations performed by a communication device (such as a terminal device or a network device) in the above method embodiments.

[0383] This application also provides a computer-readable storage medium storing a computer program or instructions for implementing the methods executed by a communication device (such as a terminal device or a network device) in the above-described method embodiments. For example, when the computer program or instructions are run on the communication device, they cause the communication device (such as a terminal device or a network device) to execute the above-described methods (such as method 1000 or method 1300).

[0384] This application also provides a computer program product comprising instructions that, when executed by a computer, implement the methods described above as performed by a communication device (such as a terminal device or a network device). For example, when the computer program or instructions are run on the communication device, the communication device (such as a terminal device or a network device) performs the methods described above (such as method 1000 or method 1300).

[0385] This application also provides a communication system that includes the terminal device and / or network device described in the embodiments above. For example, the system includes the terminal device and network device shown in the embodiment of FIG10. As another example, the system includes the terminal device and network device shown in the embodiment of FIG13.

[0386] The explanations and beneficial effects of the relevant contents in any of the devices provided above can be found in the corresponding method embodiments provided above, and will not be repeated here.

[0387] In the several embodiments provided in this application, it should be understood that the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces, and the indirect coupling or communication connection of apparatus or units may be electrical, mechanical, or other forms.

[0388] In the above embodiments, implementation can be achieved entirely or partially through software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented entirely or partially in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of this application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. For example, the computer can be a personal computer, a server, or a network device, etc. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. The available media can be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., DVDs), or semiconductor media (e.g., solid-state disks, SSDs). For example, the aforementioned available media include, but are not limited to, USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks, and other media capable of storing program code.

[0389] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A method for signal transmission, characterized in that, include: Receive a first signal, the first signal including X on / off keying OOK symbols, the X OOK symbols including X1 first symbols and X2 second symbols, the first symbols and the second symbols being different, wherein the X1 first symbols are generated based on N first sequences, or the X1 first symbols are generated based on 1 second sequence; Wherein, the N first sequences belong to the sequences in the M sequences, the 1 second sequence belongs to the sequences in the L sequences, the L sequences are subsets of the M sequences, M, N, and X are integers greater than 1, L is an integer greater than or equal to 1 and less than M, X1 and X2 are integers greater than or equal to 0, and X1 + X2 = X.

2. A method for signal transmission, characterized in that, include: Send a first signal, the first signal including X on / off keying OOK symbols, the X OOK symbols including X1 first symbols and X2 second symbols, the first symbols and the second symbols being different, wherein the X1 first symbols are generated based on N first sequences, or the X1 first symbols are generated based on 1 second sequence; Wherein, the N first sequences belong to the sequences in the M sequences, the 1 second sequence belongs to the sequences in the L sequences, the L sequences are subsets of the M sequences, M, N, and X are integers greater than 1, L is an integer greater than or equal to 1 and less than M, X1 and X2 are integers greater than or equal to 0, and X1 + X2 = X.

3. The method according to claim 1 or 2, characterized in that, The X1 first symbols are generated based on N first sequences, including: when N sequences are configured, the X1 first symbols are generated based on N first sequences; The X1 first symbols are generated based on one second sequence, including: when one sequence is configured, the X1 first symbols are generated based on one second sequence.

4. The method according to any one of claims 1 to 3, characterized in that, The M sequences are composed of K sets of sequences, where K is an integer greater than 1. Each set of sequences in the K sets of sequences corresponds to at least one root, and different sets of sequences in the K sets of sequences correspond to different roots.

5. The method according to claim 4, characterized in that, In the K sets of sequences, sequences with the same root in the same set of sequences correspond to different cyclic shift values.

6. The method according to any one of claims 1 to 3, characterized in that, The M sequences are composed of K sets of sequences, where K is an integer greater than 1. Each set of sequences in the K sets of sequences corresponds to at least one cyclic shift value, and different sets of sequences in the K sets of sequences correspond to different cyclic shift values.

7. The method according to claim 6, characterized in that, In the K sets of sequences, sequences with the same cyclic shift value in the same set of sequences correspond to different roots.

8. The method according to any one of claims 1 to 7, characterized in that, The M sequences are composed of K sets of sequences, and the L sequences are composed of k1 sets of sequences from the K sets of sequences, where K is an integer greater than 1, and k1 is an integer greater than or equal to 1 and less than K.

9. The method according to claim 8, characterized in that, In the K groups of sequences, different groups of sequences correspond to different roots, and the L sequences are composed of k1 groups of sequences from the K groups of sequences, including: The L sequences are composed of k1 sequences corresponding to the first root in the K sequences, where the first root is predefined or configured.

10. The method according to claim 8 or 9, characterized in that, The X1 first symbols are generated based on one second sequence, and the method further includes: Receive or send a first indication message, the first indication message indicating the cyclic shift value corresponding to the second sequence.

11. The method according to claim 9, characterized in that, Different sequences in the K sets of sequences correspond to different cyclic shift values, and the L sequences are composed of k1 sequences from the K sets of sequences, including: The L sequences are composed of k1 sequences corresponding to the first cyclic shift value in the K sequences, where the first cyclic shift value is predefined or configured.

12. The method according to claim 8 or 11, characterized in that, The first symbol of X1 is generated based on a second sequence, and the method further includes: Receive or send a second indication message, the second indication message indicating the root corresponding to the second sequence.

13. The method according to any one of claims 1 to 7, characterized in that, The M sequences are composed of K sets of sequences, and the L sequences are composed of k2 sequences from each of the K sets of sequences, where K is an integer greater than 1 and k2 is an integer greater than or equal to 1 and less than M / K.

14. The method according to claim 13, characterized in that, Different sequences within the same group of the K groups of sequences correspond to different cyclic shift values. The L sequences are composed of k2 sequences from each of the K groups of sequences, including: The L sequences are composed of k2 sequences corresponding to the first cyclic shift value in each of the K sets of sequences, where the first cyclic shift value is predefined or configured.

15. The method according to claim 13 or 14, characterized in that, The first symbol of X1 is generated based on a second sequence, and the method further includes: Receive or send a third indication message, which indicates the root corresponding to the second sequence.

16. The method according to claim 11 or 14, characterized in that, The first cyclic shift value is 0.

17. The method according to claim 13, characterized in that, In the K sets of sequences, different sequences within the same set correspond to different roots. The L sequences are composed of k2 sequences from each of the K sets of sequences, including: The L sequences consist of k2 sequences corresponding to the first root in each of the K sets of sequences, where the first root is predefined or configured.

18. The method according to claim 13 or 17, characterized in that, The first symbol of X1 is generated based on a second sequence, and the method further includes: Receive or send a fourth indication message, which indicates the cyclic shift value corresponding to the second sequence.

19. The method according to any one of claims 1 to 18, characterized in that, The method further includes: Receive or transmit a reference signal, the reference signal comprising Y OOK symbols, the Y OOK symbols comprising Y1 first symbols and Y2 second symbols, the Y1 first symbols being generated based on a third sequence, the third sequence being one of the N first sequences, or the third sequence being the second sequence, Y being an integer greater than 1, Y1 and Y2 being integers greater than or equal to 0, and Y1 + Y2 = Y.

20. The method according to claim 19, characterized in that, The reference signal is the low-power synchronization signal LP-SS.

21. The method according to any one of claims 1 to 20, characterized in that, The sequence among the M sequences is the ZC sequence.

22. The method according to any one of claims 1 to 21, characterized in that, The frequency domain resources occupied by the first signal are F1 first frequency domain units, each first frequency domain unit includes r second frequency domain units, and the frequency domain sequence corresponding to the first sequence or the second sequence occupies F2 second frequency domain units. The F2 second frequency domain units are F2 consecutive second frequency domain units among the F1 first frequency domain units, where F1 and r are integers greater than 1, and F2 is an integer greater than or equal to 1 and less than F1×r.

23. A method for signal transmission, characterized in that, include: A first signal is received in F1 first frequency domain units. The first signal includes X on / off keying OOK symbols. The X OOK symbols include X1 first symbols and X2 second symbols. The first symbols and the second symbols are different. The X1 first symbols are generated based on N first sequences, or the X1 first symbols are generated based on 1 second sequence. N and X are integers greater than 1, and X1 and X2 are integers greater than or equal to 0. X1 + X2 = X. Wherein, a first frequency domain unit includes r second frequency domain units, the frequency domain sequence corresponding to the first sequence or the second sequence occupies F2 second frequency domain units, the F2 second frequency domain units are F2 consecutive second frequency domain units in the F1 first frequency domain units, F1 and r are integers greater than 1, and F2 is an integer greater than or equal to 1 and less than F1×r.

24. A method for signal transmission, characterized in that, include: A first signal is transmitted on F1 first frequency domain units. The first signal includes X on / off keying OOK symbols. The X OOK symbols include X1 first symbols and X2 second symbols. The first symbols and the second symbols are different. The X1 first symbols are generated based on N first sequences, or the X1 first symbols are generated based on 1 second sequence. N and X are integers greater than 1, X1 and X2 are integers greater than or equal to 0, and X1 + X2 = X. Wherein, a first frequency domain unit includes r second frequency domain units, the frequency domain sequence corresponding to the first sequence or the second sequence occupies F2 second frequency domain units, the F2 second frequency domain units are F2 consecutive second frequency domain units in the F1 first frequency domain units, F1 and r are integers greater than 1, and F2 is an integer greater than or equal to 1 and less than F1×r.

25. The method according to any one of claims 22 to 24, characterized in that, The F2 second frequency domain units satisfy any one of the following: The starting positions of the F2 second frequency domain units are the same as the starting positions of the F1 first frequency domain units; The ending positions of the F2 second frequency domain units are the same as the ending positions of the F1 first frequency domain units; The F2 second frequency domain units are the F2 consecutive second frequency domain units located at the center position among the F1 first frequency domain units; The starting positions of the F2 second frequency domain units are spaced apart from the starting positions of the F1 first frequency domain units by at least one second frequency domain unit, and the ending positions of the F2 second frequency domain units are spaced apart from the ending positions of the F1 first frequency domain units by at least one second frequency domain unit.

26. The method according to any one of claims 22 to 25, characterized in that, The method further includes: Receive or send a fifth indication message, the fifth indication message indicating at least one of the following: the offset between the starting position of the F2 second frequency domain units and the starting position of the F1 first frequency domain units, and the offset between the ending position of the F2 second frequency domain units and the ending position of the F1 first frequency domain units.

27. The method according to any one of claims 22 to 26, characterized in that, The first signal is a wake-up signal or a reference signal.

28. The method according to claim 27, characterized in that, The reference signal is the low-power synchronization signal LP-SS.

29. A communication device, characterized in that, Includes modules or units for performing the method according to any one of claims 1 to 28.

30. A communication device, characterized in that, Includes a processor, the processor being configured to cause the communication device to perform the method of any one of claims 1 to 28.

31. The apparatus according to claim 30, characterized in that, The device also includes a memory and / or a communication interface. The memory, coupled to the processor, is used to store computer programs or instructions; The communication interface is coupled to the processor and is used for inputting and / or outputting information.

32. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program or instructions that, when executed on a communication device, cause the communication device to perform the method as described in any one of claims 1 to 28.

33. A computer program product, characterized in that, The computer program product includes a computer program or instructions that, when executed on a communication device, cause the communication device to perform the method as described in any one of claims 1 to 28.

Images