Signal multiplexing method and device, sending end node, receiving end node and medium
By generating random sequences in multi-node collaborative sensing to form code division multiplexing relationships, the problem of reduced channel number in existing technologies is solved, achieving CDM code division gain and resource saving, and improving sensing efficiency.
Patent Information
- Application Number
- CN202411161330.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-22
- Publication Date
- 2026-03-03
AI Technical Summary
In multi-node collaborative sensing processes, existing code division multiplexing methods reduce the number of available channels, affecting sensing parameter estimation and failing to effectively utilize sensing resources.
By generating random sequences and processing signals based on these random sequences, code division multiplexing relationships are formed, ensuring that the number of available channels for sensing resources does not decrease, and restoring the channels at the receiving end to achieve CDM code division gain.
While maintaining the number of available channels, CDM code division gain was achieved, saving sensing air interface resources and improving sensing efficiency.
Smart Images

Figure CN121603175A_ABST
Abstract
Description
Technical Field
[0001] This disclosure relates to the field of communication technology, specifically to a signal multiplexing method, apparatus, transmitting node, receiving node, and medium. Background Technology
[0002] Integrated Sensing and Communication (ISAC) introduces wireless sensing capabilities into the wireless mobile communication process. Cooperative sensing involves multiple sensing nodes (such as base stations and terminals) participating in the sensing process, with these nodes collaborating to improve sensing efficiency.
[0003] How to achieve the multiplexing of sensing signals among multiple sensing nodes is an important aspect of multi-node collaboration. However, when sensing resources include multiple time-domain symbols or multiple frequency-domain RE resources (e.g., M resources), in related technologies, before code division multiplexing (CDM), the signals transmitted by different sensing nodes are independent and unconstrained. However, for the sensing process, CDM will reduce the number of available channels, which will have a significant impact on the estimation of sensing parameters (e.g., the maximum ambiguity distance / velocity decreases, resulting in the need to allocate more resources). Summary of the Invention
[0004] At least one embodiment of this disclosure provides a signal multiplexing method, apparatus, transmitting node, receiving node, and medium to obtain CDM code division gain while maintaining the number of available channels and saving sensing air interface resources.
[0005] In a first aspect, embodiments of this disclosure propose a signal multiplexing method applied to a transmitting node, the method comprising:
[0006] Obtain configuration information, including the identifier of the sending node;
[0007] Obtain the first parameter used to generate the random sequence, and generate the random sequence based on the first parameter;
[0008] Based on the first signal and the random sequence, at least one transmission signal of the first node is obtained;
[0009] Based on the identifier of the transmitting node, at least one transmission signal of the first node is transmitted or at least one transmission signal of the second node is transmitted based on at least one transmission signal of the first node, wherein at least one transmission signal of the first node and the corresponding transmission signal of the second node form a code division multiplexing (CDM) relationship.
[0010] In some embodiments, transmitting at least one transmission signal of a first node or at least one transmission signal of a second node obtained based on the identifier of the transmitting node includes:
[0011] If the identifier of the sending node is the identifier of the first node, send at least one transmission signal of the first node;
[0012] or,
[0013] When the identifier of the transmitting node is the identifier of the second node, a first coding extension factor for each transmitted signal of the first node is determined based on the first signal and at least one transmitted signal of the first node; a corresponding second coding extension factor is determined based on the first coding extension factor for each transmitted signal of the first node; at least one transmitted signal of the second node is obtained based on the first signal and at least one second coding extension factor; and at least one transmitted signal of the second node is transmitted.
[0014] In some embodiments, obtaining at least one transmitted signal of the first node based on the first signal and the random sequence includes:
[0015] Based on a random sequence, the first signal is scrambled to obtain at least one transmitted signal from the first node.
[0016] In some embodiments, based on a random sequence, the first signal is scrambled to obtain at least one transmitted signal from the first node, including:
[0017] Multiply at least one sequence value from the random sequence with the first signal to obtain at least one transmitted signal from the first node; or,
[0018] Based on a random sequence, at least one set of scrambling values is obtained, each set of scrambling values including real part scrambling values and imaginary part scrambling values; based on at least one set of scrambling values, the first signal is scrambled to obtain at least one transmitted signal of the first node.
[0019] In some embodiments, obtaining at least one transmitted signal of the first node based on the first signal and the random sequence includes:
[0020] The first signal is multiplied by at least one preset matrix factor to obtain at least one transmitted signal of the first node.
[0021] In some embodiments, the preset matrix factor is determined through signaling configuration or based on the identifier of the sending node.
[0022] In some embodiments, the configuration information further includes: a reuse factor N and resource configuration information;
[0023] Multiplying the first signal by at least one preset matrix factor to obtain at least one transmitted signal of the first node includes:
[0024] For the first N-1 resources indicated by the resource configuration information, the first signal is multiplied by the N-1 preset matrix factors corresponding to the N-1 resources respectively to obtain the N-1 transmission signals of the first node; where N is an integer greater than or equal to 2.
[0025] In some embodiments, determining a first encoding spread factor for each transmitted signal of the first node based on a first signal and at least one transmitted signal of the first node includes:
[0026] Divide at least one transmitted signal of the first node by the first signal to obtain the first coding spread factor of each transmitted signal of the first node;
[0027] Alternatively, each of the at least one transmitted signal of the first node is divided by the previous transmitted signal to obtain the first encoding spread factor of each transmitted signal of the first node.
[0028] In some embodiments, the configuration information further includes: a reuse factor N and resource configuration information;
[0029] Determining the corresponding second coding spread factor based on the first coding spread factor of each transmitted signal from the first node includes:
[0030] For any resource indicated by the resource configuration information, the despreading factor of the transmission signal of the second node transmitted on any resource is determined based on the first encoding spreading factor of the transmission signal of the first node transmitted on any resource, the first encoding spreading factor of the transmission signal of the first node transmitted on the first N-1 resources of any resource, and the despreading factor of the transmission signal of the second node transmitted on the first N-1 resources of any resource.
[0031] Based on the despreading factor of the transmitted signal of the second node transmitted on any resource, determine the second encoding spread factor of the transmitted signal of the second node transmitted on any resource.
[0032] In some embodiments, if the multiplexing factor N is 2, the despreading factor of the transmitted signal of the second node transmitted on any resource is determined by the following formula:
[0033]
[0034] Among them, L m L is the despreading factor (described as CDM despreading factor in the embodiment) for the m-th transmitted signal of the second node. m-1 K is the despreading factor for the (m-1)th transmitted signal of the second node. mK is the first coding spread factor (described as the first CDM spread factor in the embodiment) for the m-th transmitted signal of the first node. m-1 It is the first encoding spread factor of the (m-1)th transmitted signal of the first node; where m is an integer greater than or equal to 1.
[0035] In some embodiments, if the multiplexing factor N is 4, the despreading factor of the transmitted signal of the second node transmitted on any resource is determined by the following formula:
[0036]
[0037] Among them, L m L is the despreading factor for the m-th transmitted signal of the second node. m-3 L m-2 L m-1 L m K is the despreading factor for the second node's transmitted signal sent on the first three resources of the m-th resource. m K is the first encoding spread factor of the m-th transmitted signal of the first node. m-3 K m-2 K m-1 The first encoding expansion factor is the first encoding expansion factor of the transmission signal of the first node transmitted on the first three resources of the m-th resource; where m is an integer greater than or equal to 3.
[0038] In some embodiments, obtaining at least one transmit signal of the second node based on a first signal and at least one second coding spread factor includes:
[0039] The first signal is multiplied by at least one second coding extension factor to obtain at least one transmit signal of the second node.
[0040] It should be noted that: 1. The first node mentioned above refers to one of the multiple nodes using code division multiplexing, such as node 1. 2. The second node refers to the other nodes in the multiple nodes using code division multiplexing besides the first node, such as node 2, node 3, and node 4.
[0041] It should be noted that: 2. The nodes described above are signal transmitting nodes. When different nodes belong to different base stations (or TRPs) or UEs, different nodes represent different base stations, TRPs, or UEs. When different nodes belong to the same base station / TRP / UE, different nodes represent different antenna port numbers.
[0042] It should be noted that the above-described transmission signal can be a DMRS (Demodulation Reference Signal) used for channel data demodulation, a CSI-RS (Channel Status Information Reference Signal) used for channel measurement, a sensing signal used for sensing, or a positioning signal used for positioning.
[0043] Secondly, this disclosure also proposes a signal multiplexing method applied to a receiving node, the method comprising:
[0044] Receive configuration information, which includes: resource configuration information;
[0045] Receive a third signal sent by one or more sending nodes on multiple adjacent resources indicated by the resource configuration information;
[0046] Determine the encoding despreading factor corresponding to each sending node on multiple adjacent resources indicated by the resource configuration information;
[0047] Based on multiple third signals and the coding / despreading factor corresponding to each transmitting node, the channels between the transmitting and receiving nodes corresponding to multiple adjacent resources are determined.
[0048] In some embodiments, determining the encoding despreading factor corresponding to each sending node on multiple adjacent resources indicated by the resource configuration information includes:
[0049] Determine the coding spread factor for each sending node on multiple adjacent resources indicated by the resource configuration information;
[0050] The corresponding encoding despreading factor is determined based on the encoding expansion factor.
[0051] In some embodiments, determining the encoding spread factor corresponding to each sending node on multiple adjacent resources indicated by the resource configuration information includes:
[0052] For the first node, obtain the first parameter used to generate the random sequence, and generate the random sequence based on the first parameter;
[0053] Based on the first signal of the sending node and the random sequence, at least one transmission signal of the first node transmitted on multiple adjacent resources is obtained.
[0054] Based on the first signal and at least one transmitted signal of the first node, determine the first coding spread factor for each transmitted signal of the first node;
[0055] For the second node, the corresponding second coding spread factor is determined based on the first coding spread factor of each transmitted signal from the first node.
[0056] In some embodiments, based on multiple third signals and the coding / despreading factor corresponding to each transmitting node, the channel between the transmitting node and the receiving node corresponding to multiple adjacent resources is determined, including:
[0057] Determine the received signal matrix composed of multiple third signals, and determine the encoding and despreading matrix composed of encoding and despreading factors corresponding to each transmitting node;
[0058] Multiply the encoded despread matrix by the received signal matrix on the left to obtain the first matrix;
[0059] Based on the first matrix, the channels between the sending end node and the receiving end node corresponding to multiple adjacent resources are determined.
[0060] In some embodiments, determining the channel between the transmitting end node and the receiving end node corresponding to each of the multiple adjacent resources based on the first matrix includes:
[0061] For any one of multiple adjacent resources, divide the element corresponding to any one resource in the first matrix by the first signal of the transmitting node corresponding to any one resource to obtain the channel between the transmitting node and the receiving node corresponding to any one resource.
[0062] In some embodiments, the configuration information also includes a reuse factor N; multiple adjacent resources are N adjacent resources.
[0063] In some embodiments, if the multiplexing factor N is 2, the channels between the transmitting and receiving nodes corresponding to multiple adjacent resources are determined based on multiple third signals and the coding / despreading factor corresponding to each transmitting node, using the following formula:
[0064]
[0065] in, This is the first matrix; The encoding despreading matrix is composed of the encoding despreading factors of the first node and the second node on two adjacent resources m-1 and m;
[0066] The received signal matrix consists of the third signals sent by the first node and the second node on two adjacent resources m-1 and m respectively;
[0067] The encoding expansion matrix is composed of the encoding expansion factors of the first node and the second node on two adjacent resources m-1 and m;
[0068] H1 is the channel between the first node corresponding to resource m-1 and the receiving node; H2 is the channel between the second node corresponding to resource m and the receiving node. The first signal sent by the first node on resources m-1 and m; The first signal sent by the second node on resources m-1 and m; where m is an integer greater than or equal to 1.
[0069] In some embodiments, if the multiplexing factor N is 4, the channels between the transmitting and receiving nodes corresponding to multiple adjacent resources are determined based on multiple third signals and the coding / despreading factor corresponding to each transmitting node, using the following formula:
[0070]
[0071] in, The encoding despreading matrix is composed of the encoding despreading factors of the first node and the three second nodes on the four adjacent resources m-3, m-2, m-1 and m; This is the first matrix;
[0072] The received signal matrix consists of the third signals transmitted by the first node and the three second nodes on four adjacent resources m-3, m-2, m-1 and m respectively;
[0073] The encoding expansion matrix is composed of the encoding expansion factors of the first node and the three second nodes on the four adjacent resources m-3, m-2, m-1 and m;
[0074] H1 is the channel between the first node corresponding to resource m-3 and the receiving node; H2, H3, and H4 are the channels between the second nodes corresponding to resources m-2, m-1, and m, respectively, and the receiving nodes. The first signal sent by the first node on the four adjacent resources m-3, m-2, m-1 and m; The first signal sent by three second nodes on four adjacent resources m-3, m-2, m-1, and m; where m is an integer greater than or equal to 3.
[0075] It should be noted that the aforementioned adjacent resources are those used to send the aforementioned signals.
[0076] If we assume that the assigned transmission signal is on a specific symbol X, and the frequency domain resource indices are: RE#1, RE#3, RE#5, RE#7, RE#9, then RE#1, RE#3, RE#5, RE#7 are four adjacent resources; and RE#3, RE#5, RE#7, RE#9 are four adjacent resources.
[0077] Assume that the allocated transmission signal is located on a certain frequency domain resource, with its frequency domain resource index being RE#X, and the delay resource symbol index being: OS#1, OS#3, OS#5, OS#7, OS#9. Then OS#1, OS#3, OS#5, OS#7 are four adjacent resources; OS#3, OS#5, OS#7, OS#9 are four adjacent resources.
[0078] Thirdly, embodiments of this disclosure also propose a signal multiplexing device applied to a transmitting node, the device comprising:
[0079] The acquisition unit is used to acquire configuration information, which includes the identifier of the sending node;
[0080] A generation unit is used to obtain a first parameter for generating a random sequence and generate a random sequence based on the first parameter.
[0081] The obtaining unit is used to obtain at least one transmitted signal of the first node based on the first signal and the random sequence;
[0082] The transmitting unit is used to transmit at least one transmitting signal of a first node or at least one transmitting signal of a second node obtained based on the identifier of the transmitting end node, wherein the at least one transmitting signal of the first node and the corresponding transmitting signal of the second node form a code division multiplexing (CDM) code division relationship.
[0083] Fourthly, embodiments of this disclosure also propose a signal multiplexing device applied to a receiving node, the device comprising:
[0084] The receiving unit is used to receive configuration information, including: resource configuration information; and to receive third signals sent by one or more sending nodes on multiple adjacent resources indicated by the resource configuration information.
[0085] The first determining unit is used to determine the encoding despreading factor corresponding to each sending node on multiple adjacent resources indicated by the resource configuration information.
[0086] The second determining unit is used to determine, based on multiple third signals and the coding despreading factor corresponding to each transmitting node, the channels between each transmitting node and the receiving node corresponding to multiple adjacent resources.
[0087] Fifthly, embodiments of this disclosure also provide a transmitting node, which includes a memory, a transceiver, and a processor;
[0088] Memory is used to store computer programs; transceiver is used to send and receive data under the control of the processor; processor is used to read the computer program from memory and execute it.
[0089] Obtain configuration information, including the identifier of the sending node;
[0090] Obtain the first parameter used to generate the random sequence, and generate the random sequence based on the first parameter;
[0091] Based on the first signal and the random sequence, at least one transmission signal of the first node is obtained;
[0092] Based on the identifier of the transmitting node, at least one transmission signal of the first node is transmitted or at least one transmission signal of the second node is transmitted based on at least one transmission signal of the first node, wherein at least one transmission signal of the first node and the corresponding transmission signal of the second node form a code division multiplexing (CDM) relationship.
[0093] In a sixth aspect, embodiments of this disclosure also provide a receiving node, which includes a memory, a transceiver, and a processor;
[0094] Memory is used to store computer programs; transceiver is used to send and receive data under the control of the processor; processor is used to read the computer program from memory and execute it.
[0095] Receive configuration information, which includes resource configuration information;
[0096] Receive a third signal sent by one or more sending nodes on multiple adjacent resources indicated by the resource configuration information;
[0097] Determine the encoding despreading factor corresponding to each sending node on multiple adjacent resources indicated by the resource configuration information;
[0098] Based on multiple third signals and the coding / despreading factor corresponding to each transmitting node, the channels between the transmitting and receiving nodes corresponding to multiple adjacent resources are determined.
[0099] In a seventh aspect, embodiments of this disclosure also provide a processor-readable storage medium storing a program for causing a processor to execute the signal multiplexing method of any embodiment of the first aspect or the signal multiplexing method of any embodiment of the second aspect.
[0100] In at least one embodiment of this disclosure, a random sequence is generated, and a first signal is processed based on the random sequence to obtain at least one transmitted signal of a first node, or at least one transmitted signal of a second node is obtained based on the at least one transmitted signal of the first node. The at least one transmitted signal of the first node and the corresponding transmitted signal of the second node form a code division multiplexing (CDM) relationship. When the sensing resources include M resources and the number of sensing cooperative nodes is N, any N adjacent resources can form a CDM relationship, i.e., a total of M-N+1 CDM groups can be formed, thereby obtaining M-N+1 channels H. This achieves CDM gain while maintaining the number of available channels H, conserving sensing air interface resources. Attached Figure Description
[0101] To more clearly illustrate the technical solutions of the embodiments of this disclosure, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this disclosure. For those skilled in the art, other drawings can be obtained based on these drawings.
[0102] Figure 1 This is a schematic diagram of a code division multiplexing (CDM) method.
[0103] Figure 2 A schematic flowchart illustrating a signal multiplexing method provided in an embodiment of this disclosure;
[0104] Figure 3 An embodiment of this disclosure provides a method for determining the transmission signal of TRP2 on the 8th resource. A schematic diagram;
[0105] Figure 4 An embodiment of this disclosure provides a method for determining the transmission signal of TRP2 on the 5th resource. A schematic diagram;
[0106] Figure 5 A schematic flowchart illustrating another signal multiplexing method provided in an embodiment of this disclosure;
[0107] Figure 6 This is a schematic diagram of a signal multiplexing device provided in an embodiment of the present disclosure;
[0108] Figure 7 A schematic diagram of another signal multiplexing device provided in an embodiment of this disclosure;
[0109] Figure 8 A schematic diagram of a sending node provided in an embodiment of this disclosure;
[0110] Figure 9This is a schematic diagram of a receiving node provided in an embodiment of the present disclosure. Detailed Implementation
[0111] To better understand the above-described objectives, features, and advantages of this disclosure, the present disclosure will be further described in detail below with reference to the accompanying drawings and embodiments. It is to be understood that the described embodiments are only some, not all, of the embodiments of this disclosure. The specific embodiments described herein are merely for explaining this disclosure and are not intended to limit it. All other embodiments obtained by those skilled in the art based on the described embodiments of this disclosure are within the scope of protection of this disclosure.
[0112] It should be noted that in this article, relational terms such as “first” and “second” are used only to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations.
[0113] In related technologies, wireless sensing is generally divided into monostatic sensing and dual-station sensing. Monostatic sensing refers to the process where the base station (or terminal) actively transmits sensing signals, which are then reflected or scattered by the object being sensed, and the base station (or terminal) receives the reflected or scattered sensing signals. Dual-station sensing refers to the process where the base station (or terminal) actively transmits sensing signals, which are transmitted through a wireless channel, and the transmitted or scattered sensing signals are received by the other terminal (or base station).
[0114] In related technologies, multi-node collaboration includes two-node collaboration and four-node collaboration. Specifically:
[0115] Two-node collaboration can be understood as two sensing nodes sending sensing signals to a certain sensing object (or sensing area), and at least one node receiving the sensing signal.
[0116] The collaboration of four nodes can be understood as follows: for a certain object (or area), four sensing nodes send sensing signals, and at least one node receives the sensing signals.
[0117] For example, two nodes (TRP1 and TRP2) participate in sensing cooperation, and the signals received by TRP1 include:
[0118] - The echo signal of the sensing signal sent by TRP1.
[0119] - The echo signal of the sensing signal sent by TRP2.
[0120] Two channels are involved. Channel 1 includes the attenuation process of the sensing signal being sent from TRP1 to the target object and then returning to TRP1 from the target object. Channel 2 includes the attenuation process of the sensing signal being sent from TRP2 to the target object and then returning to TRP1 from the target object.
[0121] For example, four nodes (TRP1, TRP2, TRP1, and TRP2) participate in sensing cooperation. The signals received by TRP1 include:
[0122] - The echo signal of the sensing signal sent by TRP1.
[0123] - The echo signal of the sensing signal sent by TRP2.
[0124] - The echo signal of the sensing signal sent by TRP3.
[0125] - The echo signal of the sensing signal sent by TRP4.
[0126] Taking the collaboration of two sensing nodes (TRP1 and TRP2) as an example, this paper illustrates the technical problems existing in the relevant technologies.
[0127] For the multiplexing relationship between the resources used by TRP1 and TRP2 to transmit sensing signals, the CDM method can be used. CDM can be used in data communication processes. Although it occupies two sets of resources for two transmitting nodes, it can obtain transmit diversity gain (about 3dB).
[0128] Therefore, the technical problem in the design of corresponding sensing resources is: how to apply CDM technology to the sensing collaboration process between multiple nodes to obtain the transmission gain of multiple nodes.
[0129] In particular, when sensing resources include multiple time-domain symbols or multiple frequency-domain resource elements (REs), there is still no relevant technical solution for how to construct the transmission process of CDM code division.
[0130] The principle of CDM is as follows:
[0131] Taking 4-CDM as an example, assuming the CDM spreading factor of the transmitting node is K = [+1,+1,+1,+1] and L = [+1,+1,-1,-1], the corresponding CDM despreading factor of the receiving node is: K conj =[+1,+1,+1,+1],L conj = [+1,+1,-1,-1]. The CDM expansion factors K and L have the following relationship:
[0132] K and K conj The inner product (multiplying corresponding terms and then summing them) is: 1×1+1×1+1×1+1×1=4;
[0133] L and L conj The inner product (multiplying corresponding terms and then summing them) is: 1×1+1×1+(-1)×(1-)+(-1)×(1-)=4;
[0134] K and L conj The inner product (multiplying corresponding terms and then summing them) is: 1×1+1×1+1×(-1)+1×(-1)=0;
[0135] L and K conj The inner product (multiplying corresponding terms and then summing them) is: 1×1+1×1+(-1)×1+(-1)×1=0.
[0136] Therefore, the CDM extension factors K and L have a CDM code division relationship.
[0137] Multi-resource code division design in related technologies:
[0138] Related technical applications of code division CDM design in communication: When the code division CDM design for communication includes multiple time-domain symbols or multiple frequency-domain RE resources, the following method is used to construct the code division CDM.
[0139] M symbols, after code demultiplexing, yield M / 2 data channels (for 2-CDM) or M / 4 data channels (for 4-CDM). This method ensures that the code groups are independent and unconstrained before being grouped, making it reasonable for communication design. However, for the sensing process, code division CDM reduces the number of available channels H, significantly impacting the estimation of sensing parameters (e.g., a smaller maximum ambiguity distance range / maximum ambiguity velocity range, requiring more resource allocation).
[0140] In this embodiment of the disclosure, for sensing resources that include multiple resources (frequency domain resources or time domain resources), the code division multiplexing (CDM) scheme includes the following two methods:
[0141] If the perceived resources contain M resources, and the number of sensing collaboration nodes is N, i.e., the reuse factor N, N can be 2. k k is a positive integer greater than or equal to 1, and supports such as Figure 1 The code division multiplexing (CDM) method shown is as follows: Figure 1 Each shaded area represents a resource used to send sensing signals.
[0142] For M resources, any N adjacent resources form a CDM group, meaning a total of M-N+1 CDM groups can be formed. At the receiving end, M-N+1 channels H can be recovered (e.g., for a multiplexing factor N of 2, such as...). Figure 1 As shown, M-1 channels H can be formed.
[0143] When the multiplexing factor N is 2, it involves CDM processing of 2 transmitting nodes; when the multiplexing factor N is 4, it involves CDM processing of 4 transmitting nodes.
[0144] Taking two transmitting nodes (TRP1 and TRP2) as an example, TRP1 uses a random sequence (e.g., a gold sequence) to obtain M transmitted signals, and calculates the equivalent CDM spreading factor (Km) based on the random sequence. TRP2 obtains the spreading factor Lm based on Km, and generates M transmitted signals from Lm. Here, Km and conj(Lm) have a code division orthogonality relationship, and conj() represents the receiver despreading factor corresponding to Lm. The process of obtaining Km for TRP2 is the same as that for TRP1 (e.g., obtaining Km by configuring the parameters of the random sequence). It should be noted that conj() is considered to be a conjugate. When the spreading factor is a real number, the conjugate calculation process may not be performed in practice, because the result of conjugating a real number remains unchanged, that is, the spreading factor is equal to the despreading factor. See the description below for details.
[0145] Figure 2 This is a flowchart illustrating a signal multiplexing method provided in an embodiment of this disclosure, which is applied to a transmitting node. The transmitting node can be a node used to transmit sensing signals. The transmitting node can also receive sensing signals. The transmitting node can calculate sensing parameter values and report these values to a sensing configuration node. The sensing configuration node is a node used to send sensing configuration information to the transmitting node. The sensing configuration node can be a sensing server, a base station, or a terminal (e.g., a specific terminal). If the sensing configuration node is a sensing server or a base station, the transmitting node can be a base station or a terminal; if the sensing configuration node is a terminal, the transmitting node is a terminal.
[0146] like Figure 2 As shown, the signal multiplexing method includes, but is not limited to, steps 201 to 204:
[0147] 201. Obtain configuration information, which includes the identifier of the sending node.
[0148] The configuration information is obtained by the sensing configuration node (e.g., the sensing server) and sent to the sending node. Since there can be multiple sending nodes, the configuration information includes the identifier of the sending node to distinguish different sending nodes.
[0149] For example, when the number of sensing and cooperating nodes N (i.e., the reuse factor N) is 2, the identifier of the sending node is: the first node (denoted as TRP1) or the second node (denoted as TRP2); when the number of sensing and cooperating nodes N is 4, the identifier of the sending node is: the first node (denoted as TRP1) or the second node (denoted as TRP2, TRP3 or TRP4).
[0150] 202. Obtain the first parameter used to generate the random sequence, and generate the random sequence based on the first parameter.
[0151] The type of random sequence is defined by the protocol or configured by the sensing configuration node. For example, if the random sequence is a gold sequence, then the first parameter is the initial state parameter of the m-sequence used to obtain the gold sequence. The first parameter is defined by the protocol, configured by the sensing configuration node, or set by the sending node. The random sequence generated based on the first parameter is a gold sequence, and the sequence value of the gold sequence is +1 or -1.
[0152] 203. Based on the first signal and the random sequence, obtain at least one transmitted signal of the first node.
[0153] The first signal is the original signal sent by the sending node. Different sending nodes send different original signals. For example, when the number of sensing collaboration nodes N is 4, the original signals sent by TRP1, TRP2, TRP3, and TRP4 are as follows: It is also limited to constellation modulation using Quadrature Phase Shift Keying (QPSK) or Binary Phase Shift Keying (BPSK).
[0154] When using QPSK constellation modulation Choose any one of the following four signals:
[0155]
[0156] For ease of explanation, coefficients will be omitted in the following description.
[0157] When using BPSK constellation modulation Choose -1 or +1.
[0158] Obtaining at least one transmitted signal of the first node based on a first signal and a random sequence includes: scrambling the first signal based on the random sequence to obtain at least one transmitted signal of the first node.
[0159] The scrambling process includes either method one or method two:
[0160] Method 1: Multiply at least one sequence value in the random sequence with the first signal to obtain at least one transmitted signal of the first node.
[0161] For example, in the gold sequence, there is a sequence value g(0) = -1, and the first signal is 1+i. The result of scrambling the first signal with g(0) is: (1+i)×g(0) = -1-i.
[0162] Method 2: Based on a random sequence, obtain at least one set of scrambling values, each set of scrambling values including real part scrambling values and imaginary part scrambling values; based on at least one set of scrambling values, scramble the first signal to obtain at least one transmitted signal of the first node.
[0163] Each scrambling value consists of two sequence values from a random sequence. For example, two sequence values g(0) = -1 and g(1) = +1 from the gold sequence constitute a scrambling value. g(0) is the real part scrambling value and g(1) is the imaginary part scrambling value.
[0164] Based on at least one set of scrambling values, a first signal is scrambled to obtain at least one transmission signal of a first node, including: for any set of scrambling values, multiplying the real part of the scrambling value in the set of scrambling values with the real part of the first signal, and multiplying the imaginary part of the scrambling value with the imaginary part of the first signal to obtain the transmission signal of the first node corresponding to the set of scrambling values.
[0165] For example, given two sequence values g(0) = -1 and g(1) = +1 in a gold sequence, the result of scrambling the real and imaginary parts of the first signal 1+i is: 1×g(0) + 1×g(1)i = -1+i.
[0166] The difference between Method 1 and Method 2 is that Method 1 requires a combination of real number codebooks, resulting in a smaller number of codebooks; while Method 2 requires a combination of real, imaginary, and real-imaginary codebooks, resulting in a larger number of codebooks. The following description uses Method 2 as an example, as shown in Tables 1 and 3 for example codebook combinations.
[0167] 204. Based on the identifier of the transmitting node, transmit at least one transmission signal of the first node or transmit at least one transmission signal of the second node obtained based on at least one transmission signal of the first node, wherein at least one transmission signal of the first node and the corresponding transmission signal of the second node form a code division multiplexing (CDM) code division relationship.
[0168] In this embodiment, any k transmitted signals of the first node and any k identical time-domain or frequency-domain positions form a code division relationship. k = 2, 4, 8... (powers of 2).
[0169] If the identifier of the transmitting node is the identifier of the first node (e.g., TRP1), then at least one transmission signal of the first node is transmitted directly. TRP1 can determine the first coding spread factor (i.e., the first CDM spread factor) of each transmission signal of the first node based on the first signal and at least one transmission signal of the first node.
[0170] If the identifier of the transmitting node is the identifier of the second node (e.g., TRP2, TRP3, or TRP4), at least one transmission signal of the first node is not directly transmitted. Instead, a first coding expansion factor (i.e., the first CDM expansion factor) for each transmission signal of the first node is first determined based on the first signal and at least one transmission signal of the first node. Then, a corresponding second coding expansion factor (i.e., the second CDM expansion factor) is determined based on the first coding expansion factor of each transmission signal of the first node. Furthermore, at least one transmission signal of the second node is obtained based on the first signal and at least one second coding expansion factor, that is, the first signal is multiplied by multiple second coding expansion factors to obtain at least one transmission signal of the second node. Finally, at least one transmission signal of the second node is transmitted.
[0171] It should be noted that the first coding expansion factor (i.e., the first CDM expansion factor) obtained by the second node is the same as that obtained by the first node. The first coding expansion factor can be determined by either (1) or (2):
[0172] (1) Divide at least one transmitted signal of the first node by the first signal to obtain the first encoding spread factor of each transmitted signal of the first node.
[0173] For example, there are M resources in total. For the first node (TRP1), each transmitted signal of the first node (denoted as ) is transmitted on the m-th resource. The first encoding expansion factor K) m for:
[0174]
[0175] in, Let m be the first signal of the first node (TRP1), where m = 0, 1, ..., M-1.
[0176] (2) Divide each of the at least one transmitted signals of the first node by the previous transmitted signal to obtain the first encoding spread factor of each transmitted signal of the first node.
[0177] For example, there are M resources in total. For the first node (TRP1), each transmitted signal of the first node (denoted as ) is transmitted on the m-th resource. The first encoding expansion factor K) m for:
[0178]
[0179] in, For each transmitted signal of the first node (TRP1) on the (m-1)th resource, m = 1, 2, ..., M-1.
[0180] As can be seen, in this embodiment of the disclosure, by generating a random sequence and processing the first signal based on the random sequence, at least one transmitted signal of the first node is obtained, or at least one transmitted signal of the second node is obtained based on the at least one transmitted signal of the first node. The at least one transmitted signal of the first node and the corresponding transmitted signal of the second node form a code division multiplexing (CDM) relationship. When the sensing resources include M resources (M time-domain symbols or M frequency-domain resource elements (REs)) and the number of sensing cooperative nodes is N (i.e., multiplexing factor N), any N adjacent resources can form a CDM relationship (i.e., a CDM group), meaning a total of M-N+1 CDM groups can be formed, thereby obtaining M-N+1 channels H. This achieves CDM code division gain while maintaining the number of available channels H, thus saving sensing air interface resources.
[0181] In some embodiments, step 203, based on the first signal and the random sequence, obtains at least one transmitted signal of the first node, including:
[0182] The first signal is multiplied by at least one preset matrix factor to obtain at least one transmitted signal of the first node.
[0183] The preset matrix factor can be understood as a specific CDM extension factor, which can be selected from a preset CDM codebook combination or configured by the sensing configuration node. The CDM codebook combination is determined by the number of sensing collaboration nodes being N (i.e., the reuse factor N).
[0184] In this embodiment, the configuration information obtained in step 201 may further include: a reuse factor N and resource configuration information. The reuse factor N can be 2. k k is a positive integer greater than or equal to 1. Resource configuration information includes at least one of the following:
[0185] Temporal resource information is used to indicate the temporal information of one or more symbols of perceived resources;
[0186] Frequency domain resource information is used to indicate the frequency domain information of the sensing resources of one or more REs. For example:
[0187] The frequency domain resource information includes at least one of the following:
[0188] Used to indicate M RE resources on a specific symbol, where the M RE resources are either contiguous or non-contiguous;
[0189] Used to indicate a specific RE resource on M symbols, where the M symbols can be contiguous or non-contiguous.
[0190] In this embodiment, multiplying the first signal by at least one preset matrix factor to obtain at least one transmitted signal of the first node includes:
[0191] For the first N-1 resources indicated by the resource configuration information, the first signal is multiplied by the N-1 preset matrix factors corresponding to the N-1 resources respectively to obtain the N-1 transmission signals of the first node.
[0192] For example, if the reuse factor N is 2, on the first resource indicated by the resource configuration information, the first signal is multiplied by a preset matrix factor to obtain a transmission signal of the first node. The preset matrix factor is selected from Table 1 or configured by the sensing configuration node.
[0193] Alternatively, with a reuse factor N of 4, the first signal is multiplied by three preset matrix factors for the first three resources indicated in the resource configuration information, resulting in three transmission signals for the first node. The three preset matrix factors are selected from Table 2 or configured by the sensing configuration node.
[0194] In some embodiments, a corresponding second coding spread factor is determined based on a first coding spread factor for each transmitted signal of the first node, including (A) and (B):
[0195] (A) For any resource indicated by the resource configuration information, the despreading factor of the transmission signal of the second node transmitted on any resource is determined based on the first encoding spreading factor of the transmission signal of the first node transmitted on any resource, the first encoding spreading factor of the transmission signal of the first node transmitted on the first N-1 resources of any resource, and the despreading factor of the transmission signal of the second node transmitted on the first N-1 resources of any resource.
[0196] If the multiplexing factor N is 2, for any resource indicated by the resource configuration information, the despreading factor of the transmission signal of the second node transmitted on any resource is determined based on the first encoding spreading factor of the transmission signal of the first node transmitted on any resource, the first encoding spreading factor of the transmission signal of the first node transmitted on the preceding resource of any resource, and the despreading factor of the transmission signal of the second node transmitted on the preceding resource of any resource. For example:
[0197]
[0198] Among them, L m L is the CDM despreading factor for the m-th transmitted signal of the second node. m-1 K is the CDM despreading factor for the (m-1)th transmitted signal of the second node. m K is the first CDM spreading factor for the m-th transmitted signal of the first node. m-1The first CDM spread factor is the (m-1)th transmitted signal of the first node, where m = 1, 2, ..., M-1, and M is the number of resources indicated by the resource configuration information.
[0199] If the multiplexing factor N is 4, for any resource indicated by the resource configuration information, the despreading factor of the second node's transmission signal transmitted on any resource is determined based on the first encoding spreading factor of the first node's transmission signal transmitted on any resource, the first encoding spreading factor of the first node's transmission signal transmitted on the first three resources of any resource, and the despreading factor of the second node's transmission signal transmitted on the first three resources of any resource. For example:
[0200] The despreading factor for the transmitted signal of the second node on any resource is determined by the following formula:
[0201]
[0202] Among them, L m L is the CDM despreading factor for the m-th transmitted signal of the second node. m-3 L m-2 L m-1 L m K is the CDM despreading factor for the transmitted signal of the second node sent on the first three resources of the m-th resource. m K is the first CDM spreading factor for the m-th transmitted signal of the first node. m-3 K m-2 K m-1 The first CDM spread factor is the first signal transmission signal of the first node transmitted on the first three resources of the m-th resource, where m = 3, ..., M-1, and M is the number of resources indicated by the resource configuration information.
[0203] (B) Determine the second coding spread factor of the second node's transmitted signal transmitted on any resource based on the despread factor of the second node's transmitted signal transmitted on any resource.
[0204] In this embodiment, the despreading factor of the transmitted signal of the second node is conjugate to obtain the CDM spreading factor corresponding to the despreading factor. If the despreading factor is a real number (e.g., +1, -1), the spreading factor and the despreading factor are the same, that is, there is no need to perform the conjugation process.
[0205] Example 1
[0206] In this embodiment, the node used to send the sensing configuration information is the sensing server. The number of sensing cooperation nodes N (i.e., the multiplexing factor N) is 2. There are two sending nodes (i.e., sending end nodes): TRP1 and TRP2. TRP2 also serves as a receiving node (receiving end node). Since the multiplexing factor N is 2, the CDM codebook combination is denoted as the 2-CDM codebook combination.
[0207] In this embodiment, the signal multiplexing process includes the following steps 1 to 4:
[0208] Step 1: The perception server sends configuration information to TRP1 and TRP2. The configuration information includes: send / receive node configuration, resource configuration information, and multiplexing factor N (N is 2).
[0209] The transmit / receive node configuration is used to indicate whether a sensing node is transmitting and / or receiving. That is, a sensing node can be configured as a receiving node, a transmitting node, or a node capable of both receiving and transmitting. For transmitting nodes, the identifier of the transmitting end node also needs to be configured, such as TRP1 or TRP2.
[0210] Resource configuration information includes at least one of the following:
[0211] Temporal resource information is used to indicate the temporal information of one or more symbols of perceived resources;
[0212] Frequency domain resource information is used to indicate the frequency domain information of the sensing resources of one or more REs. For example:
[0213] The frequency domain resource information includes at least one of the following:
[0214] Used to indicate M RE resources on a specific symbol;
[0215] Used to indicate a specific RE resource on M symbols.
[0216] Step 2: Send node to determine 2-CDM codebook.
[0217] In this embodiment, the 2-CDM codebook combinations are shown in Table 1.
[0218] Table 1-2 - CDM Codebook Combinations
[0219]
[0220]
[0221] In Table 1, each row has a combination index, representing four combinations. Among them, TRP1 has only one choice of CDM expansion factor, while TRP2 has four choices of CDM despread factor. TRP2 selects one of the four CDM despread factors. The selection of the despread factor can be agreed upon by the protocol or implemented through configuration (described below).
[0222] The conversion relationship between the CDM expansion factor and the CDM despread factor in the 2-CDM codebook combination is shown in Table 2.
[0223] Table 2 - Conversion Relationships Between CDM Spread Factor and CDM Despread Factor in CDM Codebook Combinations
[0224]
[0225] In Tables 1 and 2, j and i in the preceding text both represent imaginary numbers. To ensure power normalization, the norms of the CDM spreading factor and the CDM despreading factor are 1. For 2-CDM codebook combinations, the multiplication factor of the CDM spreading factor is... .
[0226] The CDM spreading factor (transmit) corresponding to TRP1 and the CDM despreading factor (receive) corresponding to TRP2 multiplied by the cumulative sum are 0. That is, the CDM spreading factors of the two TRPs have a CDM code division relationship. For example, the CDM spreading factor of TRP1 is [+1,+1] and the CDM despreading factor of TRP2 is [-j,+j]. The cumulative sum of their multiplication is (+1)*(-j)+(+1)*(+j)=0.
[0227] The values listed in Table 2 represent the CDM spreading factor of TRP1, used during transmission. The CDM despreading factor of TRP2 is equal to the conjugate of the CDM spreading factor of TRP1 (if the CDM spreading factor is a real number, the CDM despreading factor is that real number; if the CDM spreading factor is an imaginary number, the CDM despreading factor is the opposite of that statement). In this embodiment, conj() is used to represent the conversion between the CDM spreading factor and the CDM despreading factor, and conj() is used to find the conjugate.
[0228] Step 3: TRP1 determines the transmission signal of the first node to be sent on each of the M resources.
[0229] (1) TRP1 determines the original signal to be sent. That is, the first signal of TRP1.
[0230] The first signal of TRP1 can be defined by the protocol or configured by higher-layer signaling. For example,
[0231] (2) TRP1 obtains M signals to be transmitted on M resources based on the first signal and the random sequence. That is, the M transmitted signals of the first node.
[0232] In this embodiment, obtaining each transmitted signal from the first node includes the following methods one and two:
[0233] Method 1: For the first resource, multiply the first signal by a preset matrix factor to obtain the transmission signal of the first node transmitted on the first resource. Among them, the preset matrix factor is a specific CDM extension factor, which is selected from Table 1 or configured by the perception server.
[0234] For example, with a preset matrix factor of [+1], TRP1 sends the first node's transmission signal on the first resource.
[0235] In Method 1, for the last M-1 resources, M-1 sets of scrambling values are obtained based on a random sequence, each set of scrambling values including a real part scrambling value and an imaginary part scrambling value; based on the M-1 sets of scrambling values, the first signal of TRP1 is... Scrambling is performed to obtain the transmission signals of the first node sent on the last M-1 resources, i.e. M is a positive integer greater than 1.
[0236] The random sequence is a gold sequence, which generates 2(M-1) sequence values: g(2), g(3), ..., g(2m), g(2m+1), ..., g(2M-2), g(2M-1), where m = 1, 2, ..., M-1; M is a positive integer greater than 1. Each sequence value is either +1 or -1. Two adjacent sequence values form a scrambling value. For example, g(2m) and g(2m+1) form a scrambling value, where g(2m) is the real part scrambling value and g(2m+1) is the imaginary part scrambling value.
[0237] For example, the first signal The first node's transmission signal sent by TRP1 on the m-th resource is:
[0238] Method 2: For M resources, obtain M sets of scrambling values based on a random sequence. Each set of scrambling values includes a real part scrambling value and an imaginary part scrambling value. Based on the M sets of scrambling values, scramble the first signal to obtain the transmission signals of the first node transmitted on each of the M resources.
[0239] The random sequence is a gold sequence, which generates 2M sequence values: g(0), g(1), ..., g(2m), g(2m+1), ..., g(2M-1), where m = 0, 2, ..., M-1; M is a positive integer greater than 0. Each sequence value is +1 or -1. Two adjacent sequence values form a scrambling value. For example, g(2m) and g(2m+1) form a scrambling value, where g(2m) is the real part scrambling value and g(2m+1) is the imaginary part scrambling value.
[0240] For example, the first signal The first node's transmission signal sent by TRP1 on the m-th resource is:
[0241] Step 4: TRP2 determines the transmission signals of the second node to be sent on M resources respectively.
[0242] The transmission signals of the second node sent by TRP2 on M resources are related to the M transmission signals of the first node sent by TRP1, that is, any two adjacent signals sent by the two TRPs have a CDM code division relationship. TRP2 determines the transmission signals of the second node sent on M resources, including (1) to (4):
[0243] (1) TRP2 determines the original signal to be sent. That is, the first signal of TRP2.
[0244] The first signal of TRP2 can be defined by the protocol or configured by higher-layer signaling. For example,
[0245] (2) TRP2 obtains M signals to be transmitted on M resources based on the first signal and the random sequence. That is, the M transmitted signals of the second node. Specifically, it involves (2-1) to (2-4).
[0246] Since the signals transmitted by TRP2 and TRP1 have a CDM code division relationship, the first signal transmitted by TRP2 is related to the first signal transmitted by TRP1.
[0247] (2-1) For the first resource, multiply the first signal by a preset matrix factor to obtain the transmission signal of TRP2 on the first resource.
[0248] The preset matrix factor is a specific CDM expansion factor, which is obtained by converting the CDM despread factor of TRP2. The CDM despread factor of TRP2 is selected from Table 2 and must have the same combination index as the CDM expansion factor selected in TRP1. For example, combination index 1 corresponds to the CDM despread factor [-j] of TRP2, which is converted to the CDM expansion factor [+j].
[0249] Therefore, for the first resource, the first signal will be... Multiplying by a preset matrix factor [+j] yields the transmission signal of TRP2 on the first resource. visible, With the first signal It has a multiplicative relationship with the CDM expansion factor.
[0250] It should be noted that when a set of CDM expansion factors in TRP1 (e.g., [+1,+1]) corresponds to multiple sets of CDM despreading factors in TRP2 (e.g., [-1,+1]; [+1,-1]; [-j,+j]; [+j,-j]), the protocol or configuration will indicate which set of CDM despreading factors TRP2 will use.
[0251] (2-2) For the m-th resource, m = 0, 2, ..., M-1, determine the first CDM spreading factor K of the first node's transmission signal sent by TRP1 on the m-th resource. m First CDM expansion factor K m It can be determined through either method 1 or method 2:
[0252] Method 1: Divide the transmission signal of TRP1 on the m-th resource by the first signal of TRP1 to obtain the first CDM spreading factor K of the m-th transmission signal of the first node. m .
[0253] For example, there are M resources in total, and TRP1 sends a signal on the m-th resource (denoted as...). The first CDM expansion factor K) m for:
[0254]
[0255] in, Let m be the first signal of TRP1, where m = 0, 1, ..., M-1.
[0256] Method 2: Divide the transmission signal of the first node sent by TRP1 on the m-th resource by the previous transmission signal (i.e., the (m-1)-th transmission signal of the first node) to obtain the first CDM spreading factor K of the m-th transmission signal of the first node. m .
[0257] For example, there are M resources in total, and TRP1 sends the transmission signal of the first node on the m-th resource (denoted as...). The first CDM expansion factor K) m for:
[0258]
[0259] in, This is the first node's transmission signal sent by TRP1 on the (m-1)th resource, where m = 1, 2, ..., M-1.
[0260] (2-3) TRP2 is based on the first CDM spreading factor K of the m-th transmitted signal of the first node. m The first CDM spreading factor K of the (m-1)th transmitted signal of the first node m-1 And the CDM despreading factor L of the (m-1)th transmitted signal of the second node. m-1 Determine the CDM despreading factor L of the m-th transmitted signal of the second node. m ,in, The CDM despreading factor L of the m-th transmitted signal of the second node. m The second CDM spreading factor L converted to the m-th transmitted signal of the first node m K L m K =conj(L m ).
[0261] Where conj() is used to find the conjugate, and L is the CDM despreading factor of the m-th transmitted signal of the second node. m It can be guaranteed that [K] m-1 ,K m ] and [L m-1 ,L m It possesses CDM code division relationships, that is, it satisfies:
[0262] K m- 1L m-1 +K m L m =0;
[0263]
[0264] Where m = 1, 2, ..., M-1.
[0265] (2-4) The first signal of TRP2 The second CDM spreading factor L of the m-th transmitted signal of the second node m KMultiplying them together gives the transmission signal of TRP2 on the m-th resource. Right now
[0266] For example, Figure 3 An embodiment of this disclosure provides a method for determining the transmission signal of TRP2 on the 8th resource. The diagram is in Figure 3 In the diagram, each shaded area represents a resource, and the number of resources is M=8. Two adjacent resources form a 2-CDM group, meaning a total of M-1=7 channels H can be formed.
[0267] exist Figure 3 In the above, the first signal of both TRP1 and TRP2 is 1+i.
[0268] Assumption: TRP1 sends the first node's transmission signal on the 7th resource. for:
[0269]
[0270] Assumption: TRP1 sends the first node's transmission signal on the 8th resource. for:
[0271]
[0272] Assumption: TRP2 sends the second node's transmission signal on the 7th resource. for:
[0273]
[0274] Then, the first CDM spreading factor K6 of the 7th transmitted signal from the first node sent by TRP1 is -1, the first CDM spreading factor K7 of the 8th transmitted signal from the first node sent by TRP1 is +i, and the CDM despreading factor L6 of the 7th transmitted signal from the second node sent by TRP2 is -1. The despreading factor L7 of the 8th transmitted signal from the second node sent by TRP2 is f(K6,K7,L6):
[0275]
[0276] Then TRP2 sends the second node's transmission signal on the 8th resource.
[0277] Example 2
[0278] In this embodiment, the node used to send the sensing configuration information is the sensing server. The number of sensing cooperation nodes N (i.e., the multiplexing factor N) is 4, with 4 sending nodes (i.e., sending end nodes): TRP1, TRP2, TRP3, and TRP4. TRP2 also serves as a receiving node (receiving end node). Since the multiplexing factor N is 4, the CDM codebook combination is denoted as the 4-CDM codebook combination.
[0279] In this embodiment, the signal multiplexing process includes the following steps 1 to 4:
[0280] Step 1: The perception server sends configuration information to TRP1, TRP2, TRP3 and TRP4. The configuration information includes: send / receive node configuration, resource configuration information and multiplexing factor N (N is 4).
[0281] The transmit / receive node configuration is used to indicate whether a sensing node is transmitting and / or receiving. That is, a sensing node can be configured as a receiving node, a transmitting node, or a node capable of both receiving and transmitting. For transmitting nodes, the identifier of the transmitting end node also needs to be configured, such as: TRP1, TRP2, TRP3, or TRP4.
[0282] Resource configuration information includes at least one of the following:
[0283] Temporal resource information is used to indicate the temporal information of one or more symbols of perceived resources;
[0284] Frequency domain resource information is used to indicate the frequency domain information of the sensing resources of one or more REs. For example:
[0285] The frequency domain resource information includes at least one of the following:
[0286] Used to indicate M RE resources on a specific symbol;
[0287] Used to indicate a specific RE resource on M symbols.
[0288] Step 2: Send node to determine 4-CDM codebook.
[0289] In this embodiment, the 4-CDM codebook combinations are shown in Table 3.
[0290] Table 3.4 - CDM Codebook Combinations (Partial Content)
[0291]
[0292] Due to space limitations, Table 3 only shows a portion of the 4-CDM codebook combination.
[0293] In Table 3, each row represents a combination index, indicating 36 combinations. Among them, TRP1 has only one choice of CDM expansion factor, while TRP2 has 36 choices of CDM despreading factor. TRP2 selects one of the 36 CDM expansion factors. The selection of the despreading factor can be agreed upon by the protocol or implemented through configuration (described below).
[0294] The conversion relationship between the CDM expansion factor and the CDM despread factor in the 4-CDM codebook combination is shown in Table 4.
[0295] Table 4.4 Conversion Relationships Between CDM Spread Factor and CDM Despread Factor in CDM Codebook Combinations
[0296]
[0297]
[0298] In Tables 3 and 4, j, like i in the preceding text, represents imaginary numbers.
[0299] The CDM spreading factor (transmit) corresponding to TRP1 and the CDM despreading factor (receive) corresponding to TRP2, when multiplied and summed, are 0. This means that the CDM spreading factors of the two TRPs have a CDM code division relationship. For example, the CDM spreading factor of TRP1 is [+1,+1,+1,+1], and the CDM despreading factor of TRP2 is [-j,+j,-j,+j]. The sum of their multiplications is: (+1)*(-j)+(+1)*(+j)+(+1)*(-j)+(+1)*(+j)=0.
[0300] The values listed in Table 4 represent the CDM spreading factor of TRP1 used during transmission, and the CDM despreading factor of TRP2 equal to the conjugate of the spreading factor of TRP1 (if the CDM spreading factor is a real number, the CDM despreading factor is that real number; if the CDM spreading factor is an imaginary number, the CDM despreading factor is the opposite of that statement). In this embodiment, conj() is used to represent the conversion between the CDM spreading factor and the CDM despreading factor.
[0301] Step 3: TRP1 determines the transmission signal of the first node to be sent on each of the M resources.
[0302] (1) TRP1 determines the original signal to be sent. That is, the first signal of TRP1.
[0303] The first signal of TRP1 can be defined by the protocol or configured by higher-layer signaling. For example,
[0304]
[0305] (2) TRP1 obtains M signals to be transmitted on M resources based on the first signal and the random sequence. That is, the M transmitted signals of the first node.
[0306] In this embodiment, obtaining each transmitted signal from the first node includes the following methods one and two:
[0307] Method 1: For the first three resources, multiply the first signal by three preset matrix factors respectively to obtain the transmission signals of the first node sent by TRP1 on the first three resources respectively.
[0308] Among them, the three preset matrix factors are specific CDM extension factors, which are selected from Table 3 or configured by the perception server.
[0309] For example, with three preset matrix factors of [+1, +1, +1], TRP1 sends the transmission signals of the first node on the first three resources respectively:
[0310] In Method 1, for the last M-3 resources, M-3 sets of scrambling values are obtained based on a random sequence, each set of scrambling values including a real part scrambling value and an imaginary part scrambling value; based on the M-3 sets of scrambling values, the first signal of TRP1 is... Scrambling is performed to obtain the transmission signals of the first node sent on the last M-3 resources, i.e.
[0311] The random sequence is a gold sequence, which generates 2(M-3) sequence values: g(6), g(7), ..., g(2m), g(2m+1), ..., g(2(M-3)-2), g(2(M-3)-1), where m = 3, ..., M-1; M is a positive integer greater than 3. Each sequence value is +1 or -1. Two adjacent sequence values form a scrambling value. For example, g(2m) and g(2m+1) form a scrambling value, where g(2m) is the real part scrambling value and g(2m+1) is the imaginary part scrambling value.
[0312] For example, the first signal The first node's transmission signal sent by TRP1 on the m-th resource is:
[0313] Method 2: For M resources, obtain M sets of scrambling values based on a random sequence. Each set of scrambling values includes a real part scrambling value and an imaginary part scrambling value. Based on the M sets of scrambling values, scramble the first signal to obtain the transmission signals of the first node transmitted on each of the M resources.
[0314] The random sequence is a gold sequence, which generates 2M sequence values: g(0), g(1), ..., g(2m), g(2m+1), ..., g(2M-1), where m = 0, 2, ..., M-1; M is a positive integer greater than 0. Each sequence value is +1 or -1. Two adjacent sequence values form a scrambling value. For example, g(2m) and g(2m+1) form a scrambling value, where g(2m) is the real part scrambling value and g(2m+1) is the imaginary part scrambling value.
[0315] For example, the first signal The first node's transmission signal sent by TRP1 on the m-th resource is:
[0316] Step 4: TRP2 determines the transmission signals of the second node to be sent on M resources respectively.
[0317] The transmission signals of the second node sent by TRP2 on M resources are related to the transmission signals of the first node sent by TRP1, that is, any four adjacent signals sent by the two TRPs have a CDM code division relationship. TRP2 determines the transmission signals of the second node sent on M resources, including (1) and (2):
[0318] (1) TRP2 determines the original signal to be sent. That is, the first signal of TRP2.
[0319] The first signal of TRP2 can be defined by the protocol or configured by higher-layer signaling. For example,
[0320] (2) TRP2 obtains M signals to be transmitted on M resources based on the first signal and the random sequence. That is, the M transmitted signals of the second node. Specifically, it involves (2-1) to (2-4).
[0321] Since the signals transmitted by TRP2 and TRP1 have a CDM code division relationship, the first three signals transmitted by TRP2 are related to the first three signals transmitted by TRP1.
[0322] (2-1) For the first three resources, the first signal is multiplied by three preset matrix factors respectively to obtain the transmission signal of the second node sent by TRP2 on the first three resources.
[0323] Among them, the three preset matrix factors are specific CDM expansion factors, which are obtained based on the CDM despreading factors of TRP2. The CDM despreading factors of TRP2 are selected from Table 3 and need to be the same as the combination index of the CDM expansion factors selected in TRP1. For example, combination index 1 corresponds to the CDM despreading factor [+1, -1, +j] of TRP2, which is converted to the CDM expansion factor [+1, -1, -j].
[0324] Therefore, for the first three resources, the first signal Multiplying each of these by three preset matrix factors [+1, -1, -j] yields the transmission signals of the second node sent by TRP2 on the first three resources:
[0325]
[0326] It should be noted that when a set of CDM expansion factors in TRP1 (e.g., [+1,+1,+1,+1]) corresponds to multiple sets of CDM despreading factors in TRP2 (such as the 36 sets of CDM despreading factors in Table 3), the protocol or configuration will indicate which set of CDM despreading factors TRP2 will use.
[0327] (2-2) For the m-th resource, m = 0, 2, ..., M-1, determine the first CDM spreading factor K of the first node's transmission signal sent by TRP1 on the m-th resource. m First CDM expansion factor K m It can be determined through either method 1 or method 2:
[0328] Method 1: Divide the transmission signal of the first node sent by TRP1 on the m-th resource by the first signal of TRP1 to obtain the first CDM spreading factor K of the m-th transmission signal of the first node. m .
[0329] For example, there are M resources in total, and TRP1 sends the transmission signal of the first node on the m-th resource (denoted as...). The first CDM expansion factor K) m for:
[0330]
[0331] in, Let m be the first signal of TRP1, where m = 0, 1, ..., M-1.
[0332] Method 2: Divide the transmission signal of the first node sent by TRP1 on the m-th resource by the previous transmission signal (i.e., the (m-1)-th transmission signal of the first node) to obtain the first CDM spreading factor K of the m-th transmission signal of the first node. m.
[0333] For example, there are M resources in total, and TRP1 sends the transmission signal of the first node on the m-th resource (denoted as...). The first CDM expansion factor K) m for:
[0334]
[0335] in, This is the first node's transmission signal sent by TRP1 on the (m-1)th resource, where m = 1, 2, ..., M-1.
[0336] (2-3) TRP2 is based on the first CDM spreading factor K of the m-th transmitted signal of the first node. m The first CDM spreading factor [K] of the first node's transmission signal sent on the first three resources of the m-th resource. m-3 K m-2 K m-1 ], and the CDM despreading factor [L] of the second node's transmitted signal sent on the first three resources of the m-th resource. m-3 L m-2 L m-1 Determine the CDM despreading factor L of the m-th transmitted signal of the second node. m The CDM despreading factor L of the m-th transmitted signal of the second node. m The second CDM spreading factor L converted to the m-th transmitted signal of the first node m K L m K =conj(L m ).
[0337] in,
[0338]
[0339] Where conj() represents the mutual conversion between the CDM spreading factor and the CDM despreading factor, and L is the CDM despreading factor of the m-th transmitted signal of the second node. m It can be guaranteed that [K] m-3 K m-21 K m-1 K m ] and [L m-3 L m-2 L m-1 L m It possesses CDM code division relationships, that is, it satisfies:
[0340] K m-3 Lm-3 +K m-2 L m-2 +K m-1 L m-1 +K m L m =0;
[0341]
[0342] Where m = 3, 4, ..., M-1.
[0343] (2-4) The first signal of TRP2 The second CDM spreading factor L of the m-th transmitted signal of the second node m K Multiplying them together yields the transmission signal of the second node sent by TRP2 on the m-th resource. Right now
[0344] For example, Figure 4 An embodiment of this disclosure provides a method for determining the transmission signal of TRP2 on the 5th resource. The diagram is in Figure 4 In this diagram, each shaded area represents a resource, and the number of resources is M=5. Four adjacent resources form a 4-CDM group, meaning that a total of two channels can be formed.
[0345] exist Figure 4 In the above, the first signal of both TRP1 and TRP2 is 1+i.
[0346] Assumption: The transmission signals sent by the first node on resources 2 through 5 of TRP1 are as follows:
[0347]
[0348] Assumption: The transmission signals sent by the second node on resources 2 through 4 in TRP2 are as follows:
[0349]
[0350] The first CDM spreading factors of the second to fifth transmitted signals from the first node sent by TRP1 are K1 = +1, K2 = +1, K3 = +1, and K4 = +i, respectively. The CDM despreading factors of the second to fourth transmitted signals sent by TRP2 are L1 = -1, L2 = +i, and L3 = -i, respectively. The despreading factor of the fifth transmitted signal sent by TRP2 is L4 = f(K1, K2, K3, K4, L1, L2, L3).
[0351]
[0352] Then the signal sent by TRP2 on the 5th resource is:
[0353]
[0354] It should be noted that the transmission signals of the second node in TRP3 and TRP4 can be determined in the same way as TRP2. The only difference is that when calculating the transmission signals of the second node for the first three resources, the CDM despreading factor of the corresponding TRP is selected. This selection process is implemented through air interface protocol or higher layer signaling configuration, which will not be elaborated here.
[0355] It should be noted that for the CDM multiplexing scheme of three TRPs, it can be designed according to the 4-CDM scheme. In the process, it can be assumed that the signal sent by one of the TRPs is 0 (i.e., not the signal sent by the second node).
[0356] Figure 5 This is a flowchart illustrating another signal multiplexing method provided in an embodiment of this disclosure, which is applied to a receiving node. The receiving node can be a node used to receive sensing signals. The receiving node can also transmit sensing signals. The receiving node receives configuration information sent by a sensing configuration node. The sensing configuration node can be a sensing server, a base station, or a terminal (e.g., a specific terminal). If the sensing configuration node is a sensing server or a base station, the transmitting node can be a base station or a terminal; if the sensing configuration node is a terminal, the transmitting node is a terminal.
[0357] like Figure 5 As shown, the signal multiplexing method includes, but is not limited to, steps 501 to 504:
[0358] 501. Receive configuration information, which includes resource configuration information.
[0359] Resource configuration information includes at least one of the following:
[0360] Temporal resource information is used to indicate the temporal information of one or more symbols of perceived resources;
[0361] Frequency domain resource information is used to indicate the frequency domain information of the sensing resources of one or more REs. For example:
[0362] The frequency domain resource information includes at least one of the following:
[0363] Used to indicate M RE resources on a specific symbol;
[0364] Used to indicate a specific RE resource on M symbols.
[0365] The configuration information may also include: transmit / receive node configuration. Transmit / receive node configuration is used to indicate whether a sensing node is transmitting and / or receiving. That is, a sensing node can be configured as a receiving node, a transmitting node, or a node capable of both receiving and transmitting. For transmitting nodes, the identifier of the transmitting end node for each transmitting node also needs to be configured.
[0366] 502. Receive a third signal sent by one or more sending nodes on multiple adjacent resources indicated by the resource configuration information.
[0367] Among them, adjacent resources are adjacent resources among multiple resources indicated by resource configuration information. For example, when resource configuration information indicates 3 frequency domain resources on a symbol (denoted as: RE indx 1, RE indx 4, RE indx 7), then indx 1 and indx 4 are adjacent resources, and indx 4 and indx 7 are adjacent resources.
[0368] The configuration information may also include a reuse factor N (N = 2 or 4), and correspondingly, the multiple adjacent resources in step 502 are N adjacent resources.
[0369] The following (1) and (2) describe the signal reception processing procedures for 2-CDM and 4-CDM, respectively:
[0370] (1) For the signal reception and processing of 2-CDM, there are two transmitting nodes: TRP1 and TRP2. The first signal (i.e., the original signal) transmitted by TRP1 on resources m-1 and m is... The first signal (i.e., the original signal) sent by TRP2 on resources m-1 and m is
[0371] The signals received by the receiving node on two adjacent resources m-1 and m can be represented as:
[0372]
[0373] in, The matrix consists of the CDM expansion factors of TRP1 and TRP2.
[0374] [K m-1 K m [L] is the first CDM spread factor of the transmitted signal of the first node sent by TRP1 on adjacent resources m-1 and m; m-1 L mH1 is the second CDM spreading factor of the transmitted signal of the second node transmitted by TRP2 on adjacent resources m-1 and m. H2 is the channel between TRP1 and the receiving node corresponding to resource m-1, and H2 is the channel between TRP2 and the receiving node corresponding to resource m. The third signal sent by TRP1 is received by the receiving node on resource m-1. This is the third signal sent by TRP2 that the receiving node receives on resource m-1.
[0375] (2) For the signal reception and processing of 4-CDM, there are four transmitting nodes: TRP1, TRP2, TRP3, and TRP4. The first signal (i.e., the original signal) of TRP1 is... The first signal of TRP2 (i.e., the original signal) is The first signal of TRP3 (i.e., the original signal) is The first signal of TRP4 (i.e., the original signal) is
[0376] The signals received by the receiving node on the four adjacent resources m-3, m-2, m-1, and m can be represented as:
[0377]
[0378] in, The matrix consists of the CDM expansion factors of TRP1, TRP2, TRP3 and TRP4.
[0379] K m L m P m Q m These are the CDM spread factors of the signals sent by TRP1, TRP2, TRP3, and TRP4 on the m-th resource, respectively. This is the third signal sent by TRP1 received by the receiving node on resource m. This is the third signal sent by TRP2 that the receiving node receives on resource m. This is the third signal sent by TRP3 received by the receiving node on resource m. This is the third signal sent by TRP4 that the receiving node receives on resource m.
[0380] 503. Determine the encoding despreading factor corresponding to each sending node on multiple adjacent resources indicated by the resource configuration information.
[0381] In this embodiment, the coding spread factor (i.e., CDM spread factor) corresponding to each sending node on multiple adjacent resources indicated by the resource configuration information is first determined, and then the corresponding coding despread factor (i.e., CDM despread factor) is determined based on the coding spread factor.
[0382] The determination of the coding spread factor (CDM spread factor) for each sending node on multiple adjacent resources indicated by the resource configuration information includes the process for determining the CDM spread factor for the first node (TRP1) and for the second node (TRP2, TRP3, or TRP4):
[0383] For the first node (TRP1), steps 1 and 2 are included:
[0384] Step 1:
[0385] Obtain the first parameter used to generate the random sequence, and generate the random sequence based on the first parameter;
[0386] Based on the first signal of the transmitting node and the random sequence, at least one transmission signal of the first node transmitted on multiple adjacent resources is obtained. The process of obtaining the transmission signal of the first node is the same as in the previous embodiment and will not be repeated here.
[0387] Step 2: Based on the first signal and at least one transmitted signal of the first node, determine the first CDM spread factor for each transmitted signal of the first node.
[0388] For the second node (TRP2, TRP3, or TRP4), the corresponding second CDM spread factor is determined based on the first CDM spread factor of each transmitted signal from the first node.
[0389] The following (1) and (2) describe the signal reception processing procedures for 2-CDM and 4-CDM, respectively:
[0390] (1) For the 2-CDM signal reception processing procedure, for TRP1, calculate the first CDM spread factor [K] of the transmitted signal of the first node transmitted by TRP1 on the m-th resource. m ], m=0,1…M-1, calculate the first CDM expansion factor [K m The method is the same as that used by the sending node (i.e., TRP1); it should be noted that, after obtaining K... m At that time, the random sequence generated by the receiving node and the first signal All are the same as the sending node (i.e., TRP1), and can be implemented through protocol agreement or higher-level signaling configuration. Additionally, for TRP2, the second CDM spreading factor [L] of the second node's transmitted signal sent on the m-th resource by TRP2 is calculated. m], m=0,1…M-1, calculate the second CDM expansion factor [L m The method is the same as that used by the sending node (i.e., TRP2); it should be noted that, after obtaining L... m At that time, the random sequence generated by the receiving node and the first signal All are the same as the sending node (i.e., TRP2), and can be implemented through protocol agreement or through higher-level signaling configuration.
[0391] The signals received by the receiving node on two adjacent resources m-1 and m can be represented as:
[0392]
[0393] in, The matrix consists of the CDM expansion factors of TRP1 and TRP2.
[0394] Therefore, the matrix composed of the CDM despreading factors of TRP1 and TRP2 is:
[0395] (2) For the signal reception processing of 4-CDM, for TRP1, calculate the first CDM spread factor [K] of the transmitted signal of the first node transmitted by TRP1 on the m-th resource. m ], m=0,1…M-1, calculate the first CDM expansion factor [K m The method is the same as that used by the sending node (i.e., TRP1); it should be noted that, after obtaining K... m At that time, the random sequence generated by the receiving node and the first signal All are the same as the sending node (i.e., TRP1), and can be implemented through protocol agreement or through higher-level signaling configuration.
[0396] Additionally, for TRP2, TRP3, or TRP4, calculate the second CDM spreading factor [L] of the transmitted signal of the second node sent by TRP2, TRP3, or TRP4 on the m-th resource. m ], [P m ], [Q m ], m=0,1…M-1, calculate the second CDM expansion factor [L m ], [P m ], [Q m The method is the same as that used by the sending node (i.e., TRP2, TRP3, or TRP4); it should be noted that, after obtaining L... m At that time, the random sequence generated by the receiving node and the first signal All are the same as the sending node (i.e., TRP2), and can be implemented through protocol agreement or higher-level signaling configuration. After obtaining P... mAt that time, the random sequence generated by the receiving node and the first signal All are the same as the sending node (i.e., TRP3), and can be implemented through protocol agreement or higher-level signaling configuration. After obtaining Q... m At that time, the random sequence generated by the receiving node and the first signal All of these are the same as the sending node (i.e., TRP4), and can be implemented through protocol agreement or through higher-level signaling configuration.
[0397] The signals received by the receiving node on the four adjacent resources m-3, m-2, m-1, and m can be represented as:
[0398]
[0399] in, The matrix consists of the CDM expansion factors of TRP1, TRP2, TRP3 and TRP4.
[0400] Therefore, the matrix composed of the CDM despreading factors of TRP1, TRP2, TRP3, and TRP4 is as follows:
[0401]
[0402] 504. Based on multiple third signals and the coding despreading factor corresponding to each transmitting node, determine the channels between the transmitting nodes and receiving nodes corresponding to multiple adjacent resources.
[0403] In this embodiment, firstly, a received signal matrix composed of multiple third signals is determined, and a coded despreading matrix composed of the coded despreading factor (i.e., CDM despreading factor) corresponding to each transmitting node is determined; then, the coded despreading matrix is multiplied by the received signal matrix on the left to obtain a first matrix; finally, the channel between the transmitting node and the receiving node corresponding to multiple adjacent resources is determined based on the first matrix.
[0404] The method of determining the channel between the transmitting node and the receiving node corresponding to multiple adjacent resources based on the first matrix includes: for any one of the multiple adjacent resources, dividing the element corresponding to any one resource in the first matrix by the first signal of the transmitting node corresponding to any one resource to obtain the channel between the transmitting node and the receiving node corresponding to any one resource.
[0405] The following (1) and (2) describe the signal reception processing procedures for 2-CDM and 4-CDM, respectively:
[0406] (1) For the signal reception processing of 2-CDM, the received signal matrix composed of multiple third signals is:
[0407]
[0408] The coding despreading matrix composed of multiple coding despreading factors (i.e., CDM despreading factors) is as follows:
[0409]
[0410] Multiplying the encoded despreading matrix by the received signal matrix on the left yields the first matrix:
[0411]
[0412] Based on the first matrix, determine the channels H1 and H2 corresponding to two adjacent resources m-1 and m, respectively:
[0413]
[0414] Because there is a CDM code division relationship between the CDM spread factor and the CDM despread factor of TRP1 and TRP2, it is possible to:
[0415]
[0416] therefore, Where H1 is the channel between TRP1 and the receiving node corresponding to resource m-1; H2 is the channel between TRP2 and the receiving node corresponding to resource m.
[0417] It should be noted that for 2-CDM, it is assumed that the channel H of two adjacent sensed resource symbols is the same. In reality, they may be the same. If the channel H of two adjacent sensed resource symbols is different, compensation is required at the receiving node. Specifically:
[0418] Different time domains: For two adjacent sensing resource symbols, which are different time-domain OFDM symbols, the Doppler effect caused by a velocity of vrate (m / s) is assumed to be: e jθ Here, the angle θ is related to the velocity. Compensation is needed at the receiving node.
[0419] Different frequency domains: Two adjacent sensing resource symbols are different frequency domain RE symbols, affected by multipath delay caused by the transmission distance d (meters); the difference in H between two adjacent symbols due to multipath delay is: e jθ Here, the angle θ is related to the transmission distance. Compensation is required at the receiving node.
[0420] The following example, using velocity vrate (m / s), illustrates how to perform compensation at the receiving node. At the receiving node, assuming the estimated radial velocity of the sensed object is vrate (m / s), the angle θ is calculated as follows:
[0421] θ=4×pi×Tsym×f0×vrate×1 / c0
[0422] Where Tsym is the time interval between two adjacent sensing resource symbols, f0 is the carrier wave, and c0 is the speed of light.
[0423] The compensation process for the receiving node is as follows;
[0424]
[0425] Where θ1 is the angle calculated from the Doppler effect on the signal transmitted by TRP1, and θ2 is the angle calculated from the Doppler effect on the signal transmitted by TRP2.
[0426] (2) For the signal reception processing of 4-CDM, the received signal matrix composed of multiple third signals is:
[0427]
[0428] The coding despreading matrix composed of multiple coding despreading factors (i.e., CDM despreading factors) is as follows:
[0429]
[0430] Multiplying the encoded despreading matrix by the received signal matrix on the left yields the first matrix:
[0431]
[0432] Based on the first matrix, determine the channels H1, H2, H3, and H4 corresponding to the four adjacent resources m-3, m-2, m-1, and m, respectively:
[0433]
[0434] Since there is a CDM code division relationship between the CDM spread factor and the CDM despread factor of TRP1, TRP2, TRP3, and TRP4, it is possible to:
[0435]
[0436] therefore, Wherein, H1 is the channel between TRP1 corresponding to resource m-3 and the receiving node; H2 is the channel between TRP2 corresponding to resource m-2 and the receiving node; H3 is the channel between TRP3 corresponding to resource m-1 and the receiving node; and H4 is the channel between TRP4 corresponding to resource m and the receiving node.
[0437] It should be noted that, for the sake of simplicity, the foregoing method embodiments are all described as a series of actions. However, those skilled in the art will understand that the embodiments of this disclosure are not limited to the described order of actions, because according to the embodiments of this disclosure, some steps can be performed in other orders or simultaneously. Furthermore, those skilled in the art will understand that the embodiments described in the specification are all optional embodiments.
[0438] It should be noted that: 1. In this technical solution, the first node, similar to the method of generating a random sequence, first determines the transmission signal, and then determines the code division (CDM) spreading factor based on the transmission signal. Technically, a random sequence method can also be used to first determine the code division spreading factor of the first node, and then determine the transmission signal based on the code division spreading factor. The technical logic and implementation effect are the same.
[0439] It should be noted that point 2: This technical solution uses a random sequence method to determine the transmitted signal. Its goal is to randomize the transmitted signal, thus achieving randomized white noise reduction of interference and lowering the impact of interference between signals. Alternatively, a fixed spreading factor can be used to achieve a code division relationship between N adjacent transmitted signals, such as:
[0440] When N=2:
[0441] The code division spread factor of node 1 is +1, +1, and it is repeated on M resources (e.g., +1, +1, +1, +1, ...).
[0442] The code division spread factor of node 2 is +1, -1, and it is repeated on M resources (e.g., +1, -1, +1, -1, ...).
[0443] When N=4:
[0444] The code division spread factor of node 1 is +1, +1, +1, +1 and it is repeated on M resources (e.g., +1, +1, +1, +1, +1, +1, +1, +1, +1, ...).
[0445] The code division spread factor of node 2 is -1, -1, +1, +1, and it is repeated on M resources (e.g., -1, -1, +1, +1, -1, -1, +1, +1, ...).
[0446] The code division spread factor of node 3 is +1, -1, -1, +1, and it is repeated on M resources (e.g., +1, -1, -1, +1, +1, -1, -1, +1, ...).
[0447] The code division spread factor of node 4 is +1, -1, +1, -1, and it is repeated on M resources (e.g., +1, -1, +1, -1, +1, -1, +1, -1, ...).
[0448] Figure 6 This is a schematic diagram of a signal multiplexing device provided in an embodiment of the present disclosure. The signal multiplexing device is applied to a transmitting node, such as... Figure 6 As shown, the signal multiplexing device includes, but is not limited to, an acquisition unit 61, a generation unit 62, an acquisition unit 63, and a transmission unit 64, as detailed below:
[0449] The acquisition unit 61 is used to acquire configuration information, which includes the identifier of the sending node;
[0450] Generation unit 62 is used to obtain a first parameter for generating a random sequence and generate a random sequence based on the first parameter;
[0451] The obtaining unit 63 is used to obtain at least one transmitted signal of the first node based on the first signal and the random sequence;
[0452] The transmitting unit 64 is used to transmit at least one transmitting signal of a first node or at least one transmitting signal of a second node obtained based on the identifier of the transmitting end node, wherein the at least one transmitting signal of the first node and the corresponding transmitting signal of the second node form a code division multiplexing (CDM) code division relationship.
[0453] In some embodiments, the sending unit 64 is used for:
[0454] If the identifier of the sending node is the identifier of the first node, send at least one transmission signal of the first node;
[0455] or,
[0456] When the identifier of the transmitting node is the identifier of the second node, a first coding extension factor for each transmitted signal of the first node is determined based on the first signal and at least one transmitted signal of the first node; a corresponding second coding extension factor is determined based on the first coding extension factor for each transmitted signal of the first node; at least one transmitted signal of the second node is obtained based on the first signal and at least one second coding extension factor; and at least one transmitted signal of the second node is transmitted.
[0457] In some embodiments, the obtaining unit 63 is used for:
[0458] Based on a random sequence, the first signal is scrambled to obtain at least one transmitted signal from the first node.
[0459] In some embodiments, the obtaining unit 63 scrambles the first signal based on a random sequence to obtain at least one transmitted signal from the first node, including:
[0460] Multiply at least one sequence value from the random sequence with the first signal to obtain at least one transmitted signal from the first node; or,
[0461] Based on a random sequence, at least one set of scrambling values is obtained, each set of scrambling values including real part scrambling values and imaginary part scrambling values; based on at least one set of scrambling values, the first signal is scrambled to obtain at least one transmitted signal of the first node.
[0462] In some embodiments, the obtaining unit 63 is used for:
[0463] The first signal is multiplied by at least one preset matrix factor to obtain at least one transmitted signal of the first node.
[0464] In some embodiments, the preset matrix factor is determined through signaling configuration or based on the identifier of the sending node.
[0465] In some embodiments, the configuration information further includes: a reuse factor N and resource configuration information;
[0466] The obtaining unit 63 multiplies the first signal by at least one preset matrix factor to obtain at least one transmitted signal of the first node, including:
[0467] For the first N-1 resources indicated by the resource configuration information, the first signal is multiplied by the N-1 preset matrix factors corresponding to the N-1 resources respectively to obtain the N-1 transmission signals of the first node; where N is an integer greater than or equal to 2.
[0468] In some embodiments, the transmitting unit 64 determines a first encoding spread factor for each transmitted signal of the first node based on the first signal and at least one transmitted signal of the first node, including:
[0469] Divide at least one transmitted signal of the first node by the first signal to obtain the first coding spread factor of each transmitted signal of the first node;
[0470] Alternatively, each of the at least one transmitted signal of the first node is divided by the previous transmitted signal to obtain the first encoding spread factor of each transmitted signal of the first node.
[0471] In some embodiments, the configuration information further includes: a reuse factor N and resource configuration information;
[0472] The transmitting unit 64 determines the corresponding second coding spread factor based on the first coding spread factor of each transmitted signal of the first node, including:
[0473] For any resource indicated by the resource configuration information, the despreading factor of the transmission signal of the second node transmitted on any resource is determined based on the first encoding spreading factor of the transmission signal of the first node transmitted on any resource, the first encoding spreading factor of the transmission signal of the first node transmitted on the first N-1 resources of any resource, and the despreading factor of the transmission signal of the second node transmitted on the first N-1 resources of any resource.
[0474] Based on the despreading factor of the transmitted signal of the second node transmitted on any resource, determine the second encoding spread factor of the transmitted signal of the second node transmitted on any resource.
[0475] In some embodiments, if the multiplexing factor N is 2, the transmitting unit 64 determines the despreading factor of the transmitted signal of the second node transmitted on any resource by the following formula:
[0476]
[0477] Among them, L m L is the CDM despreading factor for the m-th transmitted signal of the second node. m-1 K is the CDM despreading factor for the (m-1)th transmitted signal of the second node. m K is the first CDM spreading factor for the m-th transmitted signal of the first node. m-1 is the first CDM spread factor of the (m-1)th transmitted signal of the first node; where m is an integer greater than or equal to 1.
[0478] In some embodiments, if the multiplexing factor N is 4, the transmitting unit 64 determines the despreading factor of the transmitted signal of the second node transmitted on any resource by the following formula:
[0479]
[0480] Among them, L m L is the CDM despreading factor for the m-th transmitted signal of the second node. m-3 L m-2 L m-1 L m K is the CDM despreading factor for the transmitted signal of the second node sent on the first three resources of the m-th resource. m K is the first CDM spreading factor for the m-th transmitted signal of the first node. m-3 K m-2 K m-1 The first CDM spread factor is the first signal transmission signal of the first node transmitted on the first three resources of the m-th resource; where m is an integer greater than or equal to 3.
[0481] In some embodiments, the transmitting unit 64 obtains at least one transmitting signal of the second node based on the first signal and at least one second coding spread factor, including:
[0482] The first signal is multiplied by at least one second coding extension factor to obtain at least one transmit signal of the second node.
[0483] Figure 6 For details of the various embodiments of the signal multiplexing apparatus shown, please refer to [link / reference]. Figure 2 The various embodiments of the signal multiplexing method shown are not described again to avoid repetition.
[0484] Figure 7 This is a schematic diagram of another signal multiplexing device provided in an embodiment of this disclosure, which is applied to a receiving node. For example... Figure 7 As shown, the signal multiplexing device includes, but is not limited to, a receiving unit 71, a first determining unit 72, and a second determining unit 73, as detailed below:
[0485] The receiving unit 71 is used to receive configuration information, which includes: resource configuration information; and to receive third signals sent by one or more sending nodes on multiple adjacent resources indicated by the resource configuration information.
[0486] The first determining unit 72 is used to determine the encoding despreading factor corresponding to each sending node on multiple adjacent resources indicated by the resource configuration information;
[0487] The second determining unit 73 is used to determine the channel between the transmitting end node and the receiving end node corresponding to the multiple adjacent resources based on the multiple third signals and the coding despreading factor corresponding to each transmitting end node.
[0488] In some embodiments, the first determining unit 72 is used to:
[0489] Determine the coding spread factor for each sending node on multiple adjacent resources indicated by the resource configuration information;
[0490] The corresponding encoding despreading factor is determined based on the encoding expansion factor.
[0491] In some embodiments, the first determining unit 72 determines the encoding expansion factor corresponding to each transmitting node on multiple adjacent resources indicated by the resource configuration information, including:
[0492] For the first node, obtain the first parameter used to generate the random sequence, and generate the random sequence based on the first parameter;
[0493] Based on the first signal of the sending node and the random sequence, at least one transmission signal of the first node transmitted on multiple adjacent resources is obtained.
[0494] Based on the first signal and at least one transmitted signal of the first node, determine the first coding spread factor for each transmitted signal of the first node;
[0495] For the second node, the corresponding second coding spread factor is determined based on the first coding spread factor of each transmitted signal from the first node.
[0496] In some embodiments, the second determining unit 73 is used to:
[0497] Determine the received signal matrix composed of multiple third signals, and determine the encoding and despreading matrix composed of encoding and despreading factors corresponding to each transmitting node;
[0498] Multiply the encoded despread matrix by the received signal matrix on the left to obtain the first matrix;
[0499] Based on the first matrix, the channels between the sending end node and the receiving end node corresponding to multiple adjacent resources are determined.
[0500] In some embodiments, the second determining unit 73 determines the channel between the transmitting end node and the receiving end node corresponding to each of the multiple adjacent resources based on the first matrix, including:
[0501] For any one of multiple adjacent resources, divide the element corresponding to any one resource in the first matrix by the first signal of the transmitting node corresponding to any one resource to obtain the channel between the transmitting node and the receiving node corresponding to any one resource.
[0502] In some embodiments, the configuration information also includes a reuse factor N; multiple adjacent resources are N adjacent resources.
[0503] In some embodiments, if the multiplexing factor N is 2, the second determining unit 73 determines the channel between the transmitting end node and the receiving end node corresponding to the multiple adjacent resources based on the multiple third signals and the coding despreading factor corresponding to each transmitting end node, and determines it by the following formula:
[0504]
[0505] in, This is the first matrix; The encoding despreading matrix is composed of the encoding despreading factors of the first node and the second node on two adjacent resources m-1 and m;
[0506] The received signal matrix consists of the third signals sent by the first node and the second node on two adjacent resources m-1 and m respectively;
[0507] The encoding expansion matrix is composed of the encoding expansion factors of the first node and the second node on two adjacent resources m-1 and m;
[0508] H1 is the channel between the first node corresponding to resource m-1 and the receiving node; H2 is the channel between the second node corresponding to resource m and the receiving node. The first signal sent by the first node on resources m-1 and m; The first signal sent by the second node on resources m-1 and m; where m is an integer greater than or equal to 1.
[0509] In some embodiments, if the multiplexing factor N is 4, the second determining unit 73 determines the channel between the transmitting end node and the receiving end node corresponding to the multiple adjacent resources based on the multiple third signals and the coding despreading factor corresponding to each transmitting end node, and determines it by the following formula:
[0510]
[0511]
[0512] in, The encoding despreading matrix is composed of the encoding despreading factors of the first node and the three second nodes on the four adjacent resources m-3, m-2, m-1 and m; This is the first matrix;
[0513] The received signal matrix consists of the third signals transmitted by the first node and the three second nodes on four adjacent resources m-3, m-2, m-1 and m respectively;
[0514] The encoding expansion matrix is composed of the encoding expansion factors of the first node and the three second nodes on the four adjacent resources m-3, m-2, m-1 and m;
[0515] H1 is the channel between the first node corresponding to resource m-3 and the receiving node; H2, H3, and H4 are the channels between the second nodes corresponding to resources m-2, m-1, and m, respectively, and the receiving nodes. The first signal sent by the first node on the four adjacent resources m-3, m-2, m-1 and m; The first signal sent by three second nodes on four adjacent resources m-3, m-2, m-1, and m; where m is an integer greater than or equal to 3.
[0516] Figure 7 For details of the various embodiments of the signal multiplexing apparatus shown, please refer to [link / reference]. Figure 5 The various embodiments of the signal multiplexing method shown are not described again to avoid repetition.
[0517] This disclosure also provides a processor-readable storage medium storing a program for causing a processor to execute the steps of various embodiments of the signal multiplexing method. The processor-readable storage medium can be any available medium or data storage device accessible to the processor, including but not limited to magnetic storage (e.g., floppy disks, hard disks, magnetic tapes, magneto-optical disks (MO), etc.), optical storage (e.g., CDs, DVDs, BDs, HVDs, etc.), and semiconductor storage (e.g., ROMs, EPROMs, EEPROMs, non-volatile memory (NAND flash), solid-state drives (SSDs)).
[0518] Figure 8 This is a schematic diagram of a sending node provided in an embodiment of the present disclosure, as shown below. Figure 8 As shown, the transmitting node provided in this embodiment includes a memory 81, a transceiver 82, and a processor 83.
[0519] Memory 81 is used to store computer programs; transceiver 82 is used to send and receive data under the control of processor 83; processor 83 is used to read the computer program in memory 81 and execute it.
[0520] Obtain configuration information, including the identifier of the sending node;
[0521] Obtain the first parameter used to generate the random sequence, and generate the random sequence based on the first parameter;
[0522] Based on the first signal and the random sequence, at least one transmission signal of the first node is obtained;
[0523] Based on the identifier of the transmitting node, at least one transmission signal of the first node is transmitted or at least one transmission signal of the second node is transmitted based on at least one transmission signal of the first node, wherein at least one transmission signal of the first node and the corresponding transmission signal of the second node form a code division multiplexing (CDM) relationship.
[0524] In some embodiments, transmitting at least one transmission signal of a first node or at least one transmission signal of a second node obtained based on the identifier of the transmitting node includes:
[0525] If the identifier of the sending node is the identifier of the first node, send at least one transmission signal of the first node;
[0526] or,
[0527] When the identifier of the transmitting node is the identifier of the second node, a first coding extension factor for each transmitted signal of the first node is determined based on the first signal and at least one transmitted signal of the first node; a corresponding second coding extension factor is determined based on the first coding extension factor for each transmitted signal of the first node; at least one transmitted signal of the second node is obtained based on the first signal and at least one second coding extension factor; and at least one transmitted signal of the second node is transmitted.
[0528] In some embodiments, obtaining at least one transmitted signal of the first node based on the first signal and the random sequence includes:
[0529] Based on a random sequence, the first signal is scrambled to obtain at least one transmitted signal from the first node.
[0530] In some embodiments, based on a random sequence, the first signal is scrambled to obtain at least one transmitted signal from the first node, including:
[0531] Multiply at least one sequence value from the random sequence with the first signal to obtain at least one transmitted signal from the first node; or,
[0532] Based on a random sequence, at least one set of scrambling values is obtained, each set of scrambling values including real part scrambling values and imaginary part scrambling values; based on at least one set of scrambling values, the first signal is scrambled to obtain at least one transmitted signal of the first node.
[0533] In some embodiments, obtaining at least one transmitted signal of the first node based on the first signal and the random sequence includes:
[0534] The first signal is multiplied by at least one preset matrix factor to obtain at least one transmitted signal of the first node.
[0535] In some embodiments, the preset matrix factor is determined through signaling configuration or based on the identifier of the sending node.
[0536] In some embodiments, the configuration information further includes: a reuse factor N and resource configuration information;
[0537] Multiplying the first signal by at least one preset matrix factor to obtain at least one transmitted signal of the first node includes:
[0538] For the first N-1 resources indicated by the resource configuration information, the first signal is multiplied by the N-1 preset matrix factors corresponding to the N-1 resources respectively to obtain the N-1 transmission signals of the first node; where N is an integer greater than or equal to 2.
[0539] In some embodiments, determining a first encoding spread factor for each transmitted signal of the first node based on a first signal and at least one transmitted signal of the first node includes:
[0540] Divide at least one transmitted signal of the first node by the first signal to obtain the first coding spread factor of each transmitted signal of the first node;
[0541] Alternatively, each of the at least one transmitted signal of the first node is divided by the previous transmitted signal to obtain the first encoding spread factor of each transmitted signal of the first node.
[0542] In some embodiments, the configuration information further includes: a reuse factor N and resource configuration information;
[0543] Determining the corresponding second coding spread factor based on the first coding spread factor of each transmitted signal from the first node includes:
[0544] For any resource indicated by the resource configuration information, the despreading factor of the transmission signal of the second node transmitted on any resource is determined based on the first encoding spreading factor of the transmission signal of the first node transmitted on any resource, the first encoding spreading factor of the transmission signal of the first node transmitted on the first N-1 resources of any resource, and the despreading factor of the transmission signal of the second node transmitted on the first N-1 resources of any resource.
[0545] Based on the despreading factor of the transmitted signal of the second node transmitted on any resource, determine the second encoding spread factor of the transmitted signal of the second node transmitted on any resource.
[0546] In some embodiments, if the multiplexing factor N is 2, the despreading factor of the transmitted signal of the second node transmitted on any resource is determined by the following formula:
[0547]
[0548] Among them, L m L is the CDM despreading factor for the m-th transmitted signal of the second node. m-1 K is the CDM despreading factor for the (m-1)th transmitted signal of the second node. m K is the first CDM spreading factor for the m-th transmitted signal of the first node. m-1 is the first CDM spread factor of the (m-1)th transmitted signal of the first node; where m is an integer greater than or equal to 1.
[0549] In some embodiments, if the multiplexing factor N is 4, the despreading factor of the transmitted signal of the second node transmitted on any resource is determined by the following formula:
[0550]
[0551] Among them, L m L is the CDM despreading factor for the m-th transmitted signal of the second node. m-3 L m-2 L m-1 L m K is the CDM despreading factor for the transmitted signal of the second node sent on the first three resources of the m-th resource. m K is the first CDM spreading factor for the m-th transmitted signal of the first node. m-3 K m-2 K m-1 The first CDM spread factor is the first signal transmission signal of the first node transmitted on the first three resources of the m-th resource; where m is an integer greater than or equal to 3.
[0552] In some embodiments, obtaining at least one transmit signal of the second node based on a first signal and at least one second coding spread factor includes:
[0553] The first signal is multiplied by at least one second coding extension factor to obtain at least one transmit signal of the second node.
[0554] Figure 8 In this configuration, transceiver 82 is used to receive and transmit data under the control of processor 83. The bus architecture may include any number of interconnected buses and bridges, specifically linking various circuits of one or more processors represented by processor 83 and memory represented by memory 81. The bus architecture may also link various other circuits such as peripheral devices, voltage regulators, and power management circuits, which are well known in the art and therefore will not be described further herein. A bus interface provides an interface. Transceiver 82 may be multiple elements, including transmitters and receivers, providing a unit for communicating with various other devices over transmission media, including wireless channels, wired channels, optical fibers, etc. Processor 83 is responsible for managing the bus architecture and general processing, and memory 81 may store data used by processor 83 during operation.
[0555] Figure 8In this implementation, processor 83 can be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above method can be completed through integrated logic circuits in the hardware of processor 83 or through software instructions. Processor 83 can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. A general-purpose processor can be a microprocessor or any conventional processor.
[0556] Figure 9 This is a schematic diagram of a receiving node provided in an embodiment of the present disclosure, as shown below. Figure 9 As shown, the receiving node provided in this embodiment includes a memory 91, a transceiver 92, and a processor 93.
[0557] Memory 91 is used to store computer programs; transceiver 92 is used to send and receive data under the control of processor 93; processor 93 is used to read the computer program from memory 91 and execute it.
[0558] Receive configuration information, which includes resource configuration information;
[0559] Receive a third signal sent by one or more sending nodes on multiple adjacent resources indicated by the resource configuration information;
[0560] Determine the encoding despreading factor corresponding to each sending node on multiple adjacent resources indicated by the resource configuration information;
[0561] Based on multiple third signals and the coding / despreading factor corresponding to each transmitting node, the channels between the transmitting and receiving nodes corresponding to multiple adjacent resources are determined.
[0562] In some embodiments, determining the encoding despreading factor corresponding to each sending node on multiple adjacent resources indicated by the resource configuration information includes:
[0563] Determine the coding spread factor for each sending node on multiple adjacent resources indicated by the resource configuration information;
[0564] The corresponding encoding despreading factor is determined based on the encoding expansion factor.
[0565] In some embodiments, determining the encoding spread factor corresponding to each sending node on multiple adjacent resources indicated by the resource configuration information includes:
[0566] For the first node, obtain the first parameter used to generate the random sequence, and generate the random sequence based on the first parameter;
[0567] Based on the first signal of the sending node and the random sequence, at least one transmission signal of the first node transmitted on multiple adjacent resources is obtained.
[0568] Based on the first signal and at least one transmitted signal of the first node, determine the first coding spread factor for each transmitted signal of the first node;
[0569] For the second node, the corresponding second coding spread factor is determined based on the first coding spread factor of each transmitted signal from the first node.
[0570] In some embodiments, based on multiple third signals and the coding / despreading factor corresponding to each transmitting node, the channel between the transmitting node and the receiving node corresponding to multiple adjacent resources is determined, including:
[0571] Determine the received signal matrix composed of multiple third signals, and determine the encoding and despreading matrix composed of encoding and despreading factors corresponding to each transmitting node;
[0572] Multiply the encoded despread matrix by the received signal matrix on the left to obtain the first matrix;
[0573] Based on the first matrix, the channels between the sending end node and the receiving end node corresponding to multiple adjacent resources are determined.
[0574] In some embodiments, determining the channel between the transmitting end node and the receiving end node corresponding to each of the multiple adjacent resources based on the first matrix includes:
[0575] For any one of multiple adjacent resources, divide the element corresponding to any one resource in the first matrix by the first signal of the transmitting node corresponding to any one resource to obtain the channel between the transmitting node and the receiving node corresponding to any one resource.
[0576] In some embodiments, the configuration information also includes a reuse factor N; multiple adjacent resources are N adjacent resources.
[0577] In some embodiments, if the multiplexing factor N is 2, the channels between the transmitting and receiving nodes corresponding to multiple adjacent resources are determined based on multiple third signals and the coding / despreading factor corresponding to each transmitting node, using the following formula:
[0578]
[0579] in, This is the first matrix; The encoding despreading matrix is composed of the encoding despreading factors of the first node and the second node on two adjacent resources m-1 and m;
[0580] The received signal matrix consists of the third signals sent by the first node and the second node on two adjacent resources m-1 and m respectively;
[0581] The encoding expansion matrix is composed of the encoding expansion factors of the first node and the second node on two adjacent resources m-1 and m;
[0582] H1 is the channel between the first node corresponding to resource m-1 and the receiving node; H2 is the channel between the second node corresponding to resource m and the receiving node. The first signal sent by the first node on resources m-1 and m; The first signal sent by the second node on resources m-1 and m; where m is an integer greater than or equal to 1.
[0583] In some embodiments, if the multiplexing factor N is 4, the channels between the transmitting and receiving nodes corresponding to multiple adjacent resources are determined based on multiple third signals and the coding / despreading factor corresponding to each transmitting node, using the following formula:
[0584]
[0585] in, The encoding despreading matrix is composed of the encoding despreading factors of the first node and the three second nodes on the four adjacent resources m-3, m-2, m-1 and m; This is the first matrix;
[0586] The received signal matrix consists of the third signals transmitted by the first node and the three second nodes on four adjacent resources m-3, m-2, m-1 and m respectively;
[0587] The encoding expansion matrix is composed of the encoding expansion factors of the first node and the three second nodes on the four adjacent resources m-3, m-2, m-1 and m;
[0588] H1 is the channel between the first node corresponding to resource m-3 and the receiving node; H2, H3, and H4 are the channels between the second nodes corresponding to resources m-2, m-1, and m, respectively, and the receiving nodes. The first signal sent by the first node on the four adjacent resources m-3, m-2, m-1 and m; The first signal sent by three second nodes on four adjacent resources m-3, m-2, m-1, and m; where m is an integer greater than or equal to 3.
[0589] Figure 9 In this configuration, transceiver 92 is used to receive and transmit data under the control of processor 93. The bus architecture can include any number of interconnected buses and bridges, specifically linking various circuits of one or more processors represented by processor 93 and memory represented by memory 91. The bus architecture can also link various other circuits such as peripheral devices, voltage regulators, and power management circuits, which are well known in the art and therefore will not be described further herein. A bus interface provides an interface. Transceiver 92 can be multiple elements, including transmitters and receivers, providing units for communicating with various other devices over transmission media, including wireless channels, wired channels, optical fibers, etc. Processor 93 is responsible for managing the bus architecture and general processing, and memory 91 can store data used by processor 93 during operation.
[0590] Figure 9 In this implementation, processor 93 can be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above method can be completed through integrated logic circuits in the hardware of processor 93 or through software instructions. Processor 93 can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. The general-purpose processor can be a microprocessor or any conventional processor.
[0591] It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Unless otherwise specified, an element defined by the phrase "comprising..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes that element.
[0592] Those skilled in the art will understand that although some embodiments described herein include certain features included in other embodiments but not others, combinations of features from different embodiments are meant to be within the scope of this disclosure and form different embodiments.
[0593] Those skilled in the art will understand that the descriptions of the various embodiments have different focuses, and for parts not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.
[0594] Although embodiments of the present disclosure have been described in conjunction with the accompanying drawings, those skilled in the art can make various modifications and variations without departing from the spirit and scope of the present disclosure, and all such modifications and variations fall within the scope defined by the appended claims.
Claims
1. A signal multiplexing method applied to a transmitting node, the method comprising: Obtain configuration information, which includes the identifier of the sending node; Obtain a first parameter for generating a random sequence, and generate a random sequence based on the first parameter; Based on the first signal and the random sequence, at least one transmission signal of the first node is obtained; Based on the identifier of the transmitting node, at least one transmission signal of the first node is transmitted or at least one transmission signal of the second node obtained based on at least one transmission signal of the first node is transmitted, wherein at least one transmission signal of the first node and the corresponding transmission signal of the second node form a code division multiplexing (CDM) relationship.
2. The method according to claim 1, characterized in that, The step of transmitting at least one transmission signal of the first node or transmitting at least one transmission signal of the second node obtained based on at least one transmission signal of the first node, based on the identifier of the transmitting node, includes: If the identifier of the transmitting node is a first node identifier, at least one transmitting signal of the first node is transmitted; or, When the identifier of the transmitting node is the identifier of the second node, a first coding expansion factor is determined for each transmitted signal of the first node based on the first signal and at least one transmitted signal of the first node; a corresponding second coding expansion factor is determined based on the first coding expansion factor for each transmitted signal of the first node; at least one transmitted signal of the second node is obtained based on the first signal and at least one second coding expansion factor; and at least one transmitted signal of the second node is transmitted.
3. The method according to claim 1 or 2, characterized in that, Obtaining at least one transmitted signal from the first node based on the first signal and the random sequence includes: Based on the random sequence, the first signal is scrambled to obtain at least one transmitted signal from the first node.
4. The method according to claim 3, characterized in that, The step of scrambling the first signal based on the random sequence to obtain at least one transmitted signal from the first node includes: Multiply at least one sequence value from the random sequence by the first signal to obtain at least one transmitted signal from the first node; or, Based on the random sequence, at least one set of scrambling values is obtained, each set of scrambling values including real part scrambling value and imaginary part scrambling value; based on the at least one set of scrambling values, the first signal is scrambled to obtain at least one transmission signal of the first node.
5. The method according to claim 1, characterized in that, Obtaining at least one transmitted signal from the first node based on the first signal and the random sequence includes: The first signal is multiplied by at least one preset matrix factor to obtain at least one transmit signal of the first node.
6. The method according to claim 5, characterized in that, The preset matrix factor is determined through signaling configuration or based on the identifier of the sending node.
7. The method according to claim 5, characterized in that, The configuration information also includes: reuse factor N and resource configuration information; The step of multiplying the first signal by at least one preset matrix factor to obtain at least one transmitted signal of the first node includes: For the first N-1 resources indicated by the resource configuration information, the first signal is multiplied by the N-1 preset matrix factors corresponding to the N-1 resources respectively to obtain the N-1 transmission signals of the first node; where N is an integer greater than or equal to 2.
8. The method according to claim 2, characterized in that, The step of determining a first coding spread factor for each transmitted signal of the first node based on the first signal and at least one transmitted signal of the first node includes: Divide at least one transmitted signal of the first node by the first signal to obtain the first encoding spread factor for each transmitted signal of the first node; Alternatively, each transmitted signal of the first node can be divided by the previous transmitted signal to obtain a first encoding spread factor for each transmitted signal of the first node.
9. The method according to claim 2, characterized in that, The configuration information also includes: reuse factor N and resource configuration information; The step of determining the corresponding second coding spread factor based on the first coding spread factor of each transmitted signal of the first node includes: For any resource indicated by the resource configuration information, the despreading factor of the transmission signal of the second node transmitted on any resource is determined based on the first encoding spreading factor of the transmission signal of the first node transmitted on any resource, the first encoding spreading factor of the transmission signal of the first node transmitted on the first N-1 resources of any resource, and the despreading factor of the transmission signal of the second node transmitted on the first N-1 resources of any resource. Based on the despreading factor of the transmitted signal of the second node transmitted on any of the resources, a second encoding spread factor of the transmitted signal of the second node transmitted on any of the resources is determined.
10. The method according to claim 9, characterized in that, If the multiplexing factor N is 2, the despreading factor for the transmitted signal of the second node sent on any resource is determined by the following formula: Among them, L m L is the despreading factor for the m-th transmitted signal of the second node. m-1 K is the despreading factor for the (m-1)th transmitted signal of the second node. m K is the first encoding spread factor of the m-th transmitted signal of the first node. m-1 It is the first encoding spread factor of the (m-1)th transmitted signal of the first node; where m is an integer greater than or equal to 1.
11. The method according to claim 9, characterized in that, If the multiplexing factor N is 4, the despreading factor for the transmitted signal of the second node sent on any resource is determined by the following formula: Among them, L m L is the despreading factor for the m-th transmitted signal of the second node. m-3 L m-2 L m-1 L m K is the despreading factor for the second node's transmitted signal sent on the first three resources of the m-th resource. m K is the first encoding spread factor of the m-th transmitted signal of the first node. m-3 K m-2 K m-1 The first encoding expansion factor is the first encoding expansion factor of the transmission signal of the first node transmitted on the first three resources of the m-th resource; where m is an integer greater than or equal to 3.
12. The method according to claim 2, characterized in that, Obtaining at least one transmit signal of the second node based on the first signal and the at least one second coding spread factor includes: The first signal is multiplied by the at least one second coding extension factor to obtain at least one transmit signal of the second node.
13. A signal multiplexing method applied to a receiving node, the method comprising: Receive configuration information, which includes: resource configuration information; Receive a third signal sent by one or more sending nodes on multiple adjacent resources indicated by the resource configuration information; Determine the encoding despreading factor corresponding to each of the sending nodes on the multiple adjacent resources indicated by the resource configuration information; Based on the multiple third signals and the coding / despreading factor corresponding to each of the multiple adjacent resources, the channels between the transmitting and receiving nodes are determined.
14. The method according to claim 13, characterized in that, The step of determining the encoding despreading factor corresponding to each of the sending nodes on the multiple adjacent resources indicated by the resource configuration information includes: Determine the encoding expansion factor corresponding to each of the sending nodes on the multiple adjacent resources indicated by the resource configuration information; The corresponding encoding despreading factor is determined based on the encoding expansion factor.
15. The method according to claim 14, characterized in that, Determining the encoding spread factor corresponding to each of the sending nodes on the multiple adjacent resources indicated by the resource configuration information includes: For the first node, obtain the first parameter used to generate the random sequence, and generate the random sequence based on the first parameter; Based on the first signal of the transmitting node and the random sequence, at least one transmitting signal of the first node transmitted on the plurality of adjacent resources is obtained; Based on the first signal and at least one transmitted signal of the first node, a first coding spread factor is determined for each transmitted signal of the first node; For the second node, the corresponding second coding spread factor is determined based on the first coding spread factor of each transmitted signal from the first node.
16. The method according to claim 13, characterized in that, The step of determining the channel between the transmitting and receiving nodes corresponding to the plurality of adjacent resources based on the plurality of third signals and the coding despreading factor corresponding to each of the transmitting nodes includes: Determine a received signal matrix composed of multiple third signals, and determine a coding despreading matrix composed of coding despreading factors corresponding to each of the transmitting nodes; Multiply the encoded despread matrix on the left by the received signal matrix to obtain the first matrix; Based on the first matrix, the channels between the sending end node and the receiving end node corresponding to the plurality of adjacent resources are determined.
17. The method according to claim 16, characterized in that, The step of determining the channel between the sending node and the receiving node corresponding to the plurality of adjacent resources based on the first matrix includes: For any one of the plurality of adjacent resources, the element in the first matrix corresponding to any one resource is divided by the first signal of the transmitting node corresponding to any one resource to obtain the channel between the transmitting node and the receiving node corresponding to any one resource.
18. The method according to claim 13, characterized in that, The configuration information also includes a reuse factor N; the multiple adjacent resources are N adjacent resources.
19. The method according to claim 18, characterized in that, If the multiplexing factor N is 2, the channel between the transmitting and receiving nodes corresponding to the multiple adjacent resources is determined based on the multiple third signals and the coding / despreading factor corresponding to each transmitting node, using the following formula: in, This is the first matrix; The encoding despreading matrix is composed of the encoding despreading factors of the first node and the second node on two adjacent resources m-1 and m; The received signal matrix consists of the third signals sent by the first node and the second node on two adjacent resources m-1 and m respectively; The encoding expansion matrix is composed of the encoding expansion factors of the first node and the second node on two adjacent resources m-1 and m; H1 is the channel between the first node corresponding to resource m-1 and the receiving node; H2 is the channel between the second node corresponding to resource m and the receiving node. The first signal sent by the first node on resources m-1 and m; The first signal sent by the second node on resources m-1 and m; where m is an integer greater than or equal to 1.
20. The method according to claim 18, characterized in that, If the multiplexing factor N is 4, the channel between the transmitting and receiving nodes corresponding to the multiple adjacent resources is determined based on the multiple third signals and the coding / despreading factor corresponding to each transmitting node, using the following formula: in, The encoding despreading matrix is composed of the encoding despreading factors of the first node and the three second nodes on the four adjacent resources m-3, m-2, m-1 and m; This is the first matrix; The received signal matrix consists of the third signals transmitted by the first node and the three second nodes on four adjacent resources m-3, m-2, m-1 and m respectively; The encoding expansion matrix is composed of the encoding expansion factors of the first node and the three second nodes on the four adjacent resources m-3, m-2, m-1 and m; H1 is the channel between the first node corresponding to resource m-3 and the receiving node; H2, H3, and H4 are the channels between the second nodes corresponding to resources m-2, m-1, and m, respectively, and the receiving nodes. The first signal sent by the first node on the four adjacent resources m-3, m-2, m-1 and m; The first signal sent by three second nodes on four adjacent resources m-3, m-2, m-1, and m; where m is an integer greater than or equal to 3.
21. A signal multiplexing device applied to a transmitting node, the device comprising: An acquisition unit is used to acquire configuration information, the configuration information including the identifier of the sending node; A generation unit is configured to obtain a first parameter for generating a random sequence and generate a random sequence based on the first parameter. The obtaining unit is used to obtain at least one transmitted signal of the first node based on the first signal and the random sequence; The transmitting unit is configured to transmit at least one transmitting signal of the first node or at least one transmitting signal of the second node obtained based on the identifier of the transmitting node, wherein the at least one transmitting signal of the first node and the corresponding transmitting signal of the second node form a code division multiplexing (CDM) relationship.
22. A signal multiplexing device applied to a receiving node, the device comprising: A receiving unit is configured to receive configuration information, the configuration information including: resource configuration information; and to receive third signals sent by one or more sending nodes on multiple adjacent resources indicated by the resource configuration information. The first determining unit is used to determine the encoding despreading factor corresponding to each of the sending end nodes on the multiple adjacent resources indicated by the resource configuration information; The second determining unit is used to determine the channel between the transmitting end node and the receiving end node corresponding to the plurality of adjacent resources based on the plurality of third signals and the coding despreading factor corresponding to each of the transmitting end nodes.
23. A transmitting node, characterized in that, The transmitting node includes a memory, a transceiver, and a processor; The memory is used to store computer programs; the transceiver is used to send and receive data under the control of the processor; the processor is used to read the computer programs in the memory and execute them. Obtain configuration information, which includes the identifier of the sending node; Obtain a first parameter for generating a random sequence, and generate a random sequence based on the first parameter; Based on the first signal and the random sequence, at least one transmission signal of the first node is obtained; Based on the identifier of the transmitting node, at least one transmission signal of the first node is transmitted or at least one transmission signal of the second node obtained based on at least one transmission signal of the first node is transmitted, wherein at least one transmission signal of the first node and the corresponding transmission signal of the second node form a code division multiplexing (CDM) relationship.
24. A receiving node, characterized in that, The receiving node includes a memory, a transceiver, and a processor; The memory is used to store computer programs; the transceiver is used to send and receive data under the control of the processor. The processor is configured to read and execute the computer program in the memory: Receive configuration information, which includes: resource configuration information; Receive a third signal sent by one or more sending nodes on multiple adjacent resources indicated by the resource configuration information; Determine the encoding despreading factor corresponding to each of the sending nodes on the multiple adjacent resources indicated by the resource configuration information; Based on the multiple third signals and the coding / despreading factor corresponding to each of the multiple adjacent resources, the channels between the transmitting and receiving nodes are determined.
25. A processor-readable storage medium, characterized in that, The processor-readable storage medium stores a program for causing the processor to perform the signal multiplexing method as described in any one of claims 1 to 12 or the signal multiplexing method as described in any one of claims 13 to 20.