Communication method, apparatus, and system, and storage medium
By time-division multiplexing or frequency-division multiplexing of the SS/PBCH block signals of multiple nodes in a 5G network, the problem of inter-node measurement interference and mutual measurement cannot be solved, and the effect of rapid measurement of multiple nodes and reduced delay is achieved.
Patent Information
- Application Number
- PCT/CN2024/128199
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2023-10-31
- Filing Date
- 2024-10-29
- Publication Date
- 2025-05-08
AI Technical Summary
In 5G network, multiple nodes do not send SS/PBCH blocks orthogonally, resulting in the problem of measurement interference and mutual inability to measure each other, making it difficult to achieve rapid measurement of multiple nodes.
By determining the resource locations of the first node and the second node to perform time-division multiplexing or frequency-division multiplexing, the resource location is ensured to be associated with the identification of the node, thereby achieving rapid measurement of multiple nodes and avoiding signal interference.
It realizes rapid multi-node measurement, reduces measurement delay, avoids interference between signals, and improves network efficiency and reliability.
Smart Images

Figure CN2024128199_08052025_PF_FP_ABST
Abstract
Description
Communication method, device, system and storage medium
[0001] This application claims priority to the Chinese patent application filed with the State Intellectual Property Office of China on October 31, 2023, with application number 202311441113.0 and invention name “Communication Method, Device, System and Storage Medium”, the entire contents of which are incorporated by reference into this application. Technical Field
[0002] The present application relates to the field of communication technology, and in particular to a communication method, device, system and storage medium. Background Art
[0003] Synchronization signal / Physical broadcast channel block (SS / PBCH block) is a fifth generation mobile communication technology (5 th The SS / PBCH is one of the pilot signals used in 5G (5G generation) designs. Terminal devices use this block to synchronize with the cell and perform cell search operations. Furthermore, terminal devices' measurements of the SS / PBCH are crucial during mobility management processes such as handover, reselection, and redirection.
[0004] Each of the multiple nodes can transmit multiple SS / PBCH blocks within a certain 5ms period (multiple SS / PBCH blocks can be referred to as a synchronization signal / physical broadcast channel block burst set (SS Burst Set)). Figure 1 shows a schematic diagram of the existing non-orthogonalized transmission of SS / PBCH blocks by multiple nodes. Nodes 1, 2, and 3 use the same time domain resources to transmit SS / PBCH blocks, resulting in measurement interference or mutual inability to measure each other.
[0005] If SS / PBCH blocks are orthogonally transmitted with a minimum granularity of 5ms to avoid measurement interference, as shown in Figure 2, which shows the orthogonal transmission of SS / PBCH blocks by multiple nodes, the nodes in the network may actually use omnidirectional antennas and only transmit one SS / PBCH block in a cycle. However, SS / PBCH blocks are still orthogonally transmitted with a 5ms granularity. If mutual measurement between hundreds of nodes is supported or cell search is performed without interference from SS / PBCH blocks in neighboring cells, the measurement delay can be as long as hundreds of milliseconds.
[0006] In view of this, how to enable multiple nodes to quickly measure SS / PBCH blocks and avoid interference is an urgent problem to be solved.
[0007] Summary of the Invention
[0008] The present application provides a communication method, device, system and storage medium to enable multiple nodes to quickly measure a first signal and avoid interference.
[0009] In a first aspect, a communication method is provided, performed by a first node or a chip or circuit for the first node, the method comprising: determining a first resource location for the first node to transmit a first signal, the first resource location being time-division multiplexed and / or frequency-division multiplexed with a second resource location, the second resource location being used for a second node to transmit a second signal, the first resource location being associated with an identifier of the first node, and the second resource location being associated with an identifier of the second node; and transmitting the first signal at the first resource location. In this aspect, the first resource location for the first node to transmit the first signal is time-division multiplexed and / or frequency-division multiplexed with a second resource location for the second node to transmit the second signal, the first resource location being associated with the identifier of the first node, and the second resource location being associated with the identifier of the second node, thereby enabling rapid measurement of multiple nodes and avoiding interference between signals.
[0010] Exemplarily, the first resource position and the second resource position are located within a half-frame.
[0011] In one possible implementation, the first resource location where the first node sends the first signal is frequency-division multiplexed with the second resource location where the second node sends the second signal; the method further includes: sending a third signal at a third resource location, wherein the third signal is used for mutual measurement between the first node and the second node, the third resource location is time-division multiplexed with the fourth resource location, the fourth resource location is used for the second node to send a fourth signal, the third resource location is associated with the identifier of the first node, and the fourth resource location is associated with the identifier of the second node. In this implementation, by orthogonally sending signals by multiple nodes in time division for mutual measurement between nodes, interference from neighboring cell signals during signal measurement can be avoided, while reducing the delay of multi-node measurement.
[0012] The method of the first aspect described above may be executed by the first node, or by a module (such as a processor, chip, or chip system) applied to the first node, or by a logical node, logical module, or software that can implement all or part of the functions of the first node.
[0013] In a possible implementation, the second resource location is time-division multiplexed with the first resource location, and the method further includes:
[0014] The second signal is received at the second resource location.
[0015] In a second aspect, a communication method is provided, performed by a second node or a chip or circuit for the second node, the method comprising: determining a second resource location at which the second node transmits a second signal, the second resource location being time-division multiplexed with a first resource location, the first resource location being used for the first node to transmit a first signal, the first resource location and the second resource location being located within a half-frame, the first resource location being associated with an identifier of the first node, and the second resource location being associated with an identifier of the second node; receiving the first signal at the first resource location; and transmitting the second signal at the second resource location. In this aspect, the second resource location at which the second node transmits the second signal is time-division multiplexed with the first resource location at which the first node transmits the first signal, the first resource location being associated with the identifier of the first node, and the second resource location being associated with the identifier of the second node, thereby enabling rapid measurement of multiple nodes and avoiding interference between signals.
[0016] In a third aspect, a communication method is provided, performed by a second node or a chip or circuit for the second node, the method comprising: determining a second resource location at which the second node transmits a second signal, the second resource location being frequency-division multiplexed with a first resource location, the first resource location being used by the first node to transmit a first signal, the first resource location being associated with an identifier of the first node, and the second resource location being associated with an identifier of the second node; and transmitting the second signal at the second resource location. In this aspect, the second resource location at which the second node transmits the second signal is frequency-division multiplexed with the first resource location at which the first node transmits the first signal, the first resource location being associated with the identifier of the first node, and the second resource location being associated with the identifier of the second node, thereby enabling rapid measurement of multiple nodes and avoiding interference between signals.
[0017] The methods of the second and third aspects above can be executed by the second node, or by a module applied to the second node (such as a processor, chip, or chip system, etc.), or by a logical node, logical module or software that can realize all or part of the functions of the second node.
[0018] In combination with the first aspect to the third aspect, in another possible implementation, the first resource location is also time-division multiplexed and / or frequency-division multiplexed with the x-th resource location, the x-th resource location is used for the x-th node to send a third signal, and the x-th resource location is associated with the identifier of the x-th node, wherein x is a natural number. In this implementation, the first resource location where the first node sends the first signal is time-division multiplexed and / or frequency-division multiplexed with the x-th resource location where the x-th node sends the x-th signal, and the first resource location is associated with the identifier of the first node, and the x-th resource location is associated with the identifier of the x-th node, which can achieve rapid measurement of multiple nodes and avoid interference between signals. The node can autonomously determine the resource location for sending the first signal without the need for configuration through network-side equipment, or without coordination with other nodes to determine, which can save signaling overhead.
[0019] In combination with any one of the implementations of the first to third aspects or the first to third aspects, in another possible implementation, the first resource location is associated with the offset of the half frame where the first resource location is located within the period of the first signal and the index of the first signal within the half frame, wherein the period includes at least one half frame.
[0020] In combination with any one of the implementations of the first aspect to the third aspect or the first aspect to the third aspect, in another possible implementation, the first resource location and the second resource location are time-division multiplexed, and the offset of the half-frame where the first resource location is located within the period of the first signal is associated with the identifier of the first node and the number of candidate locations of the first signal in the half-frame; the index of the first signal in the half-frame is associated with the identifier of the first node and the number of candidate locations of the first signal in the half-frame. In this implementation, the resource locations of multiple nodes are time-division multiplexed, the signals sent by different nodes are orthogonalized through time division, the time domain resource location of the signal is associated with the identifier of the node, and the node can autonomously determine the resource location for sending the first signal through its own node identifier without the need for network-side device configuration or coordination with other nodes to determine. This can save signaling overhead while avoiding interference from signals of neighboring nodes when performing signal measurement, and multiple nodes can reduce the delay of multiple node measurements through time division multiplexing.
[0021] In combination with any one of the implementations of the first to third aspects or the first to third aspects, in another possible implementation, the offset of the half frame where the first resource position is located within the period of the first signal and the identifier of the first node, as well as the number of candidate positions of the first signal within the half frame satisfy a first functional relationship; the index of the first signal within the half frame and the identifier of the first node, as well as the number of candidate positions of the first signal within the half frame satisfy a second functional relationship.
[0022] In combination with any one of the implementations of the first to third aspects or the first to third aspects, in another possible implementation, the half frame where the first resource position is located is or Among them, L max is the number of candidate positions of the first signal in the half frame, / represents division, Indicates rounding down; the index of the first signal in the half frame = the identifier of the first node % L max or (identity of the first node + m) % L max , % represents remainder; wherein, m is a natural number or an integer.
[0023] In combination with any one of the implementations of the first to third aspects or the first to third aspects, in another possible implementation, the number of candidate positions of the first signal within the half frame is associated with at least one of the carrier frequency and the subcarrier spacing.
[0024] In combination with any one of the implementations of the first aspect to the third aspect or the first aspect to the third aspect, in another possible implementation, the index of the first symbol in the candidate position of the first signal in the half frame is at least one of the following indexes: {2, 6, 10} + 14 * n; wherein, when the subcarrier spacing corresponding to the first signal is 15kHz, the n = 0, 1, 2, 3, 4; when the subcarrier spacing corresponding to the first signal is 30kHz, the n = 0, 1, 2, 3, 4, 5, 6, 7, 8, 9; when the subcarrier spacing corresponding to the first signal is 60kHz, the n = 0, 1, 2, 3, 4, 5 ,6,7,8,9,10,11,12,13,14,15,16,17,18,19; when the subcarrier spacing corresponding to the first signal is 120kHz, the n=0,1,2,3,4,…,39; when the subcarrier spacing corresponding to the first signal is 240kHz, the n=0,1,2,3,4,,…,79; when the subcarrier spacing corresponding to the first signal is 480kHz, the n=0,1,2,3,4,,…,159; when the subcarrier spacing corresponding to the first signal is 960kHz, the n=0,1,2,3,4,,…,319.
[0025] In combination with any one of the implementations of the first aspect to the third aspect or the first aspect to the third aspect, in another possible implementation, the index of the first symbol in the candidate position of the first signal in the half frame is at least one of the following indexes: {4}+4*n; wherein, when the subcarrier spacing corresponding to the first signal is 15kHz, the n=0,1,2,3,4,…,15; when the subcarrier spacing corresponding to the first signal is 30kHz, the n=0,1,2,3,4,…,33; when the subcarrier spacing corresponding to the first signal is 60kHz, the n=0,1,2,3,4,…,33. n=0,1,2,3,4,…,68; when the subcarrier spacing corresponding to the first signal is 120kHz, n=0,1,2,3,4,…,138; when the subcarrier spacing corresponding to the first signal is 240kHz, n=0,1,2,3,4,…,278; when the subcarrier spacing corresponding to the first signal is 480kHz, n=0,1,2,3,4,…,558; when the subcarrier spacing corresponding to the first signal is 960kHz, n=0,1,2,3,4,…,1118.
[0026] In combination with any one of the implementations of the first aspect to the third aspect or the first aspect to the third aspect, in another possible implementation, the index of the first symbol in the candidate position of the first signal in the half frame is at least one of the following indexes: {2}+4*n; wherein, when the subcarrier spacing corresponding to the first signal is 15kHz, the n=0,1,2,3,4,…,16; when the subcarrier spacing corresponding to the first signal is 30kHz, the n=0,1,2,3,4,…,33; when the subcarrier spacing corresponding to the first signal is 60kHz, the n=0,1,2,3,4,…,33. n=0,1,2,3,4,…,68; when the subcarrier spacing corresponding to the first signal is 120kHz, n=0,1,2,3,4,…,138; when the subcarrier spacing corresponding to the first signal is 240kHz, n=0,1,2,3,4,…,278; when the subcarrier spacing corresponding to the first signal is 480kHz, n=0,1,2,3,4,…,558; when the subcarrier spacing corresponding to the first signal is 960kHz, n=0,1,2,3,4,…,1118.
[0027] In combination with any one of the implementations of the first aspect to the third aspect or the first aspect to the third aspect, in another possible implementation, the first resource location and the second resource location are frequency-division multiplexed, and the offset of the half-frame where the first resource location is located within the period of the first signal is associated with the identifier of the first node, the first parameter, the second parameter, the number of times the first signal currently being sent has been repeatedly sent within the period, and the number of candidate positions of the first signal within the half-frame; the index of the first signal within the half-frame is associated with the identifier of the first node, the first parameter, the second parameter, the number of times the first signal currently being sent has been repeatedly sent within the period, and the number of candidate positions of the first signal within the half-frame; wherein the first parameter is predefined, or preconfigured, or based on a predefined or preconfigured third parameter; and the second parameter is predefined, or preconfigured, or based on a predefined or preconfigured fourth parameter. In this implementation, the first resource location where the first node sends the first signal is frequency-division multiplexed with the second resource location where the second node sends the second signal, and the first resource location is associated with the identifier of the first node, and the second resource location is associated with the identifier of the second node, which can achieve fast measurement of multiple nodes and avoid interference between signals. Optionally, the third parameter is the maximum value of the pre-configured physical cell identifiers. Optionally, the fourth parameter is the pre-configured system bandwidth.
[0028] In combination with any one of the implementations of the first to third aspects or the first to third aspects, in another possible implementation, the offset of the half frame where the first resource location is located within the period of the first signal satisfies a third functional relationship with the identifier of the first node, the first parameter, the second parameter, the number of times the currently transmitted first signal has been repeatedly transmitted within the period, and the number of candidate positions of the first signal within the half frame; the index of the first signal within the half frame satisfies a fourth functional relationship with the identifier of the first node, the first parameter, the second parameter, the number of times the currently transmitted first signal has been repeatedly transmitted within the period, and the number of candidate positions of the first signal within the half frame.
[0029] In combination with any one of the implementations of the first to third aspects or the first to third aspects, in another possible implementation, the half frame where the first resource position is located is or or Wherein, r is the number of times the first signal currently being sent has been repeatedly sent within the period, and N cell is the total number of nodes measuring each other, the Nf,cell is the number of nodes that support orthogonality in the frequency domain, the L max is the number of candidate positions of the first signal in the half frame, m is a natural number or an integer, and / represents division. Indicates rounding down. Indicates rounding up, and % indicates remainder.
[0030] In combination with any one of the implementations of the first to third aspects or the first to third aspects, in another possible implementation, in different half frames within the cycle, there is at least one different second node among the multiple second nodes that perform frequency division multiplexing with the first node.
[0031] In combination with any one of the first to third aspects or the first to third aspects, in another possible implementation, the first signal is used for cell search. In this implementation, the cell search is performed by orthogonally transmitting signals through frequency division between multiple nodes, thereby improving resource utilization.
[0032] In one possible implementation, the first resource location where the first node sends the first signal is frequency-division multiplexed with the second resource location where the second node sends the second signal; the method further includes: sending a third signal at a third resource location, wherein the third signal is used for mutual measurement between the first node and the second node, the third resource location is time-division multiplexed with the fourth resource location, the fourth resource location is used for the second node to send a fourth signal, the third resource location is associated with the identifier of the first node, and the fourth resource location is associated with the identifier of the second node. In this implementation, by orthogonally sending signals by multiple nodes in time division for mutual measurement between nodes, interference from neighboring cell signals during signal measurement can be avoided, while reducing the delay of multi-node measurement.
[0033] Among them, for the SS / PBCH block used for cell search, that is, SSB, the half-frame offset of SSB can be based on the node identification, the number of nodes N that support orthogonality in the frequency domain f,cell and the number of SSBs used for cell search in each half frame L1, that is, the number of nodes N that are orthogonal to the node identification and frequency domain support f,cell Associated with the number of SSBs used for cell search in each half frame L1, or the node identifier, the number of nodes N that support orthogonality in the frequency domain f,cell And the function of the number of SSBs used for cell search in each half frame L1, for example, the half-frame offset of SSB can be expressed as The SSB index can be based on the node identification and the number of nodes N that support orthogonality in the frequency domain. f,cell , the number of SSBs used for cell search in each half frame L1, that is, the number of nodes N that are orthogonal to the node identification and frequency domain support f,cell, the number of SSBs used for cell search in each half frame L1 is associated, or, the node identifier, the number of nodes N that support orthogonality in the frequency domain f,cell And the function of the number of SSBs L1 used for cell search in each half frame, for example, SSB index can be expressed as The SSB center frequency position can be based on the cell identifier, for example, it can be expressed as PCI%N f,cell .
[0034] For SSBs used for mutual measurement between nodes, the half-frame offset of the SSB can be based on the node identification, the number of SSBs used for cell search in each half-frame L1, the number of candidate SSBs in each half-frame L max , that is, the node identifier, the number of SSBs used for cell search in each half frame L1, the number of candidate SSBs in each half frame L max Associated, or, for the node identifier, the number of SSBs used for cell search in each half frame L1, the number of candidate SSBs in each half frame L max For example, the half-frame offset of SSB can be expressed as The SSB index can be based on the node identity, the number of SSBs used for cell search in each half frame L1, the number of candidate SSBs in each half frame L max , that is, the node identifier, the number of SSBs used for cell search in each half frame L1, the number of candidate SSBs in each half frame L max Associated, or, for the node identifier, the number of SSBs used for cell search in each half frame L1, the number of candidate SSBs in each half frame L max function, such as SSB index can be expressed as PCI% (L max -L1)+1 or
[0035] In a fourth aspect, a communication device is provided for implementing the communication method in the above-mentioned first aspect or any one of the implementations of the first aspect. The device can be a first node, or a module applied to the first node (such as a processor, a chip, or a chip system, etc.), or a logical node, a logical module, or software that can implement all or part of the functions of the first node. In one implementation, the communication device may include a sending unit, a receiving unit, and may also include a processing unit. The sending unit and the receiving unit may be independent or combined together (which may be referred to as a "transceiver unit").
[0036] In a fifth aspect, a communication device is provided for implementing the communication method in the second aspect or any one of the implementations of the second aspect; or for implementing the communication method in the third aspect or any one of the implementations of the third aspect. The device can be a second node, or a module applied to the second node (such as a processor, a chip, or a chip system, etc.), or a logical node, a logical module, or software that can implement all or part of the functions of the second node. In one implementation, the communication device may include a sending unit, a receiving unit, and may also include a processing unit. The sending unit and the receiving unit may be independent or combined together (which may be referred to as a "transceiver unit").
[0037] In a possible implementation, the communication device in the fourth to fifth aspects includes a module for respectively executing the method in any aspect or any implementation of the first to third aspects.
[0038] In another possible implementation, the communication device in the fourth to fifth aspects includes a processor coupled to a memory; the processor is configured to enable the device to perform the corresponding functions in the above-mentioned communication method. The memory is used to be coupled to the processor and stores the necessary programs (instructions) and / or data for the device. Optionally, the communication device may further include a communication interface for enabling communication between the device and other network elements. Optionally, the memory may be located inside or outside the communication device.
[0039] In another possible implementation, the communication device of the fourth to fifth aspects includes a processing circuit configured to execute the communication method of any implementation of any one of the first to third aspects, such as determining a first resource location for a first node to transmit a first signal, the first resource location being time-division multiplexed and / or frequency-division multiplexed with a second resource location, the second resource location being used for a second node to transmit a second signal, the first resource location being associated with an identifier of the first node, and the second resource location being associated with an identifier of the second node; and transmitting the first signal at the first resource location. The communication device may further include a memory configured to store instructions executed by the processing circuit, or input data required by the processing circuit to execute instructions, or data generated after the processing circuit executes instructions. The memory may be located within or outside the processing circuit. Optionally, the communication device may further include a transceiver circuit, the processing circuit and the transceiver circuit being coupled to each other. The processing circuit is configured to execute a computer program or instructions to control the transceiver circuit to receive and transmit information. When the processing circuit executes the computer program or instructions, the processing circuit is further configured to implement the above method via logic circuitry or by executing code instructions. The transceiver circuit may be a transceiver or an interface circuit configured to receive signals from a communication device other than the communication device and transmit the signals to the processing circuit, or to transmit the signals from the processing circuit to the communication device other than the communication device. Optionally, the processing circuit includes one or more processors, or circuits within one or more processors configured to process signals.
[0040] When the communication device in the fourth and fifth aspects above is a chip, the transmitting unit may be an output unit, such as an output circuit or a communication interface; the receiving unit may be an input unit, such as an input circuit or a communication interface. The transceiver circuit may be an interface circuit or an input / output interface. When the communication device is a terminal, the transmitting unit may be a transmitter or a transmitter; the receiving unit may be a receiver or a receiver. The transceiver circuit may be a transceiver.
[0041] In a sixth aspect, a computer-readable storage medium is provided, in which a computer program or instruction is stored. When the computer program or instruction is executed, the methods described in the above aspects are implemented.
[0042] In a seventh aspect, a computer program product comprising instructions is provided, which, when executed on a communication device, causes the communication device to execute the methods described in the above aspects.
[0043] In an eighth aspect, a communication system is provided, which includes the communication device described in the fourth aspect and the communication device described in the fifth aspect. BRIEF DESCRIPTION OF THE DRAWINGS
[0044] FIG1 is a schematic diagram of an existing method of transmitting SS / PBCH blocks by multiple nodes without orthogonalization;
[0045] FIG2 is a schematic diagram of an existing method of orthogonally transmitting SS / PBCH blocks by multiple nodes;
[0046] FIG3 is a simplified schematic diagram of a wireless communication system provided by an embodiment of the present application;
[0047] FIG4 is a schematic diagram of the format of the SS / PBCH block;
[0048] FIG5 is a schematic diagram of SS / PBCH block patterns and their positions within the slot in some scenarios from Case A to Case E;
[0049] FIG6 is a schematic diagram of an IAB network topology applicable to an embodiment of the present application;
[0050] FIG7 is a flow chart of a communication method provided in an embodiment of the present application;
[0051] FIG8 is a schematic diagram of an example of time-division orthogonal transmission of SS / PBCH blocks provided in an embodiment of the present application;
[0052] FIG9 is a schematic diagram of another example of time-division orthogonal transmission of SS / PBCH blocks provided in an embodiment of the present application;
[0053] FIG10 is a schematic diagram of another example of time-division orthogonal transmission of SS / PBCH blocks provided in an embodiment of the present application;
[0054] FIG11 is a flow chart of another communication method provided in an embodiment of the present application;
[0055] FIG12 is a schematic diagram of an example of frequency division orthogonal transmission of SS / PBCH blocks provided in an embodiment of the present application;
[0056] FIG13 is a schematic diagram of another example of frequency division orthogonal transmission of SS / PBCH blocks provided in an embodiment of the present application;
[0057] FIG14 is a schematic diagram of another example of frequency division orthogonal transmission of SS / PBCH blocks provided in an embodiment of the present application;
[0058] FIG15 is a schematic diagram of another example of frequency division orthogonal transmission of SS / PBCH blocks provided in an embodiment of the present application;
[0059] FIG16 is a schematic diagram of another example of frequency division orthogonal transmission of SS / PBCH blocks provided in an embodiment of the present application;
[0060] FIG17 is a schematic diagram of another example of frequency division orthogonal transmission of SS / PBCH blocks provided in an embodiment of the present application;
[0061] FIG18 is a flow chart of another communication method provided in an embodiment of the present application;
[0062] FIG19 is a schematic diagram of an example of time-frequency orthogonal transmission of SS / PBCH blocks provided in an embodiment of the present application;
[0063] FIG20 is a schematic diagram of another example of time-frequency orthogonal transmission of SS / PBCH blocks provided in an embodiment of the present application;
[0064] FIG21 is a schematic structural diagram of a communication device provided in an embodiment of the present application;
[0065] FIG22 is a schematic structural diagram of another communication device provided in an embodiment of the present application. DETAILED DESCRIPTION
[0066] The embodiments of the present application are described below in conjunction with the drawings in the embodiments of the present application.
[0067] In order to make the purpose, technical solutions and advantages of this application clearer, this application will be further described in detail below with reference to the accompanying drawings.
[0068] The following at least one (item) involved in this application indicates one (item) or more (items). More than one (item) refers to two (items) or more than two (items). "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. In addition, it should be understood that although the terms first, second, etc. may be used to describe each object in this application, these objects should not be limited to these terms. These terms are only used to distinguish each object from each other.
[0069] The terms "including" and "having" and any variations thereof mentioned in the following description of this application are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device that includes a series of steps or units is not limited to the listed steps or units, but may optionally include other steps or units that are not listed, or may optionally include other steps or units that are inherent to these processes, methods, products or devices. It should be noted that, in this application, words such as "exemplary" or "for example" are used to indicate examples, illustrations or descriptions. Any method or design described in this application as "exemplary" or "for example" should not be interpreted as being more preferred or more advantageous than other methods or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a concrete way.
[0070] It should be understood that, in this application, indication includes direct indication (also known as explicit indication) and implicit indication. Direct indication of information A refers to including information A; implicit indication of information A refers to indicating information A through the correspondence between information A and information B and the direct indication of information B. The correspondence between information A and information B can be predefined, pre-stored, pre-burned, or pre-configured.
[0071] It should be understood that, in this application, information C is used to determine information D, which includes both information D being determined solely based on information C and information D being determined based on information C and other information. Furthermore, information C can also be used to determine information D indirectly, for example, where information D is determined based on information E, and information E is determined based on information C.
[0072] In addition, in each embodiment of the present application, "device A sends information A to device B" can be understood as the destination of the information A or the intermediate device in the transmission path between the destination and the device B, which may include directly or indirectly sending information to device B. "Device B receives information A from device A" can be understood as the source of the information A or the intermediate device in the transmission path between the source and the device A, which may include directly or indirectly receiving information from device A. The information may undergo necessary processing between the source and destination of the information, such as format changes, but the destination can understand the valid information from the source. Similar expressions in this application can be understood similarly and will not be elaborated here.
[0073] The technology provided by this application can be applied to various communication systems. For example, the communication system can be a fourth generation (4G) th generation, 4G) communication systems (such as long term evolution (LTE) systems), fifth generation (5 th generation (5G) communication systems, worldwide interoperability for microwave access (WiMAX) or wireless local area network (WLAN) systems, or integrated systems of multiple systems, or future communication systems such as the sixth generation (6 th generation, 6G) communication system, etc. Among them, the 5G communication system can also be called a new radio (NR) system.
[0074] A device in a communication system can send a signal to another device or receive a signal from another device. The signal may include information, signaling, or data, etc. The device can also be replaced by an entity, a network entity, a network element, a mobile node, a terminal device, a communication module, a node, a communication node, etc. The present application describes the device as an example. For example, the communication system may include at least one terminal device and at least one access network device. The access network device can send a downlink signal to the terminal device, and / or the terminal device can send an uplink signal to the access network device. In addition, it can be understood that if the communication system includes multiple terminal devices, the multiple terminal devices can also send signals to each other, that is, the signal sending device and the signal receiving device can both be terminal devices.
[0075] The communication method provided in the embodiment of the present application can be applied to wireless communication systems such as 5G, 6G, and satellite communication. Referring to Figure 3, Figure 3 is a simplified schematic diagram of the wireless communication system provided in the embodiment of the present application. As shown in Figure 3, the wireless communication system includes a wireless access network 100. The wireless access network 100 can be a next-generation (e.g., 6G or higher) wireless access network, or a traditional (e.g., 5G, 4G) wireless access network. One or more terminal devices (120a-120j, collectively referred to as 120) can be connected to each other, or connected to one or more network devices (110a, 110b, collectively referred to as 110) in the wireless access network 100. Optionally, Figure 3 is only a schematic diagram, and the wireless communication system may also include other devices, such as core network devices, wireless relay devices and / or wireless backhaul devices, which are not drawn in Figure 3.
[0076] Optionally, in actual applications, the wireless communication system may include multiple network devices (also called access network devices) and multiple terminal devices at the same time. A network device can serve one or more terminal devices at the same time. A terminal device can also access one or more network devices at the same time. The embodiments of the present application do not limit the number of terminal devices and network devices included in the wireless communication system.
[0077] The network device may be an entity on the network side for transmitting or receiving signals. The network device may be an access device for a terminal device to access the wireless communication system in a wireless manner, such as a base station. Base station can broadly cover various names as follows, or be replaced with the following names, such as: radio access network (RAN) node, NodeB, evolved NodeB (eNB), next generation NodeB (gNB), access network equipment in open radio access network (O-RAN), relay station, integrated access and backhaul (IAB) node (such as the base station (BS) functional part in the IAB node), access point, transmitting and receiving point (TRP), transmitting point (TP), master eNB (MeNB), secondary eNB (SeNB), multi-standard radio (MSR) node, home base station, network controller, access node, wireless node, access point (AP), transmission node, transceiver node, building baseband unit (BBU), remote radio unit (RRU), etc. The term "network device" may also refer to a communication module, modem, or chip used in the aforementioned equipment or device.The network device may also be a mobile switching center and a device that performs base station functions in device-to-device (D2D), vehicle-to-everything (V2X), and machine-to-machine (M2M) communications, a network-side device in a 6G network, or a device that performs base station functions in future communication systems. The network device may support networks with the same or different access technologies. The embodiments of this application do not limit the specific technology and specific device form adopted by the network device.
[0078] Network devices can be fixed or mobile. For example, base stations 110a and 110b are stationary and are responsible for wireless transmission and reception in one or more cells from terminal device 120. The helicopter or drone 120i shown in Figure 3 can be configured to act as a mobile base station, and one or more cells can move according to the location of the mobile base station 120i. In other examples, the helicopter or drone (120i) can be configured to act as a terminal device communicating with base station 110b.
[0079] In this application, the communication device used to implement the above-mentioned access network function can be an access network device, a network device having some of the access network functions, or a device capable of supporting the implementation of the access network function, such as a chip system, a hardware circuit, a software module, or a hardware circuit and a software module. The device can be installed in the access network device or used in combination with the access network device. In the method of this application, the communication device used to implement the access network device function is described as an access network device.
[0080] A terminal device may be an entity on the user side for receiving or transmitting signals, such as a mobile phone. The terminal device may be used to connect people, objects, and machines. The terminal device may communicate with one or more core networks through a network device. The terminal device includes a handheld device with wireless connection capabilities, other processing devices connected to a wireless modem, or a vehicle-mounted device. The terminal device may be a portable, pocket-sized, handheld, computer-built-in, or vehicle-mounted mobile device. The terminal device 120 may be widely used in various scenarios, such as cellular communication, D2D, V2X, point-to-point (P2P), machine-to-machine (M2M), machine type communication (MTC), Internet of Things (IoT), virtual reality (VR), augmented reality (AR), industrial control, autonomous driving, telemedicine, smart grid, smart furniture, smart office, smart wearable, smart transportation, smart city, drones, robots, remote sensing, passive sensing, positioning, navigation and tracking, autonomous delivery and mobility, etc.Some examples of terminal devices 120 include: user equipment (UE), fixed devices, mobile devices, handheld devices, wearable devices, cellular phones, smart phones, session initiated protocol (SIP) phones, laptops, personal computers, smart books, vehicles, satellites, global positioning system (GPS) devices, target tracking devices, drones, helicopters, aircraft, ships, remote control devices, smart home devices, industrial devices, personal communication service (PCS) phones, wireless local loop (WLL) stations, personal digital assistants (PDAs), wireless network cameras, tablet computers, handheld computers, mobile internet devices (MIDs), wearable devices such as smart watches, virtual reality (VR) devices, augmented reality (AR) devices, wireless terminals in industrial control, terminals in vehicle networking systems, wireless terminals in self-driving, wireless terminals in smart grids, transportation security systems, etc. Safety), wireless terminals in smart cities such as smart refueling pumps, terminal devices on high-speed railways, and wireless terminals in smart homes such as smart speakers, smart coffee machines, smart printers, etc. The terminal device 120 can be a wireless device in the above various scenarios or a device for being set up in a wireless device, for example, a communication module, modem or chip in the above device. The terminal device can also be called a terminal, terminal device, UE, mobile station (MS), mobile terminal (MT), etc. The terminal device can also be a terminal device in a future wireless communication system. The terminal device can be used in a dedicated network device or a general device. The embodiments of the present application do not limit the specific technology and specific device form adopted by the terminal device.
[0081] By way of example and not limitation, in an embodiment of the present application, the terminal device may also be a portion of a network device used to implement terminal device functions. For example, the network device may be an IAB node, which integrates a mobile terminal (MT) and a distributed unit (DU), or an MT and a base station (BS), where the BS includes a centralized unit (CU) and a DU. When the IAB node faces its parent node, it can be considered a terminal. In this case, the IAB node plays the role of the MT.
[0082] Alternatively, a terminal device can function as a base station. For example, a UE can act as a dispatching entity, providing sidelink signals between UEs in V2X, D2D, or P2P scenarios. As shown in Figure 3, a cell phone 120a and a car 120b communicate with each other using sidelink signals. Cell phone 120a and smart home device 120e communicate without relaying the communication signal through base station 110b.
[0083] In this application, the communication device used to implement the functions of the terminal device can be a terminal device, or a terminal device with some of the functions of the above terminal devices, or a device that can support the implementation of the functions of the above terminal devices, such as a chip system, which can be installed in the terminal device or used in combination with the terminal device. In this application, the chip system can be composed of chips, or it can include chips and other discrete devices. In the technical solution provided in this application, the communication device is described as a terminal device or UE as an example.
[0084] Optionally, a wireless communication system is typically composed of cells, with base stations providing cell management and communication services to multiple mobile stations (MS) in the cell. The base station includes a baseband unit (BBU) and a remote radio unit (RRU). The BBU and RRU can be placed in different locations, for example: the RRU is remote and placed in an area with high traffic volume, while the BBU is placed in a central computer room. The BBU and RRU can also be placed in the same computer room. The BBU and RRU can also be different components under the same rack. Optionally, a cell can correspond to a carrier or component carrier.
[0085] In some deployments, the network devices mentioned in the embodiments of the present application may include a CU, a DU, or both a CU and a DU, or a control plane CU node (central unit-control plane (CU-CP)), a user plane CU node (central unit-user plane (CU-UP)), and a DU node. For example, the network devices may include a gNB-CU-CP, a gNB-CU-UP, and a gNB-DU.
[0086] In some deployments, multiple RAN nodes collaborate to assist terminals in achieving wireless access, with different RAN nodes implementing parts of the base station's functionality. For example, a RAN node can be a CU, DU, CU-CP, CU-UP, or RU. The CU and DU can be separate or included in the same network element, such as a BBU. The RU can be included in a radio frequency device or radio frequency unit, such as an RRU, active antenna unit (AAU), or remote radio head (RRH).
[0087] A RAN node may support one or more types of fronthaul interfaces, with different fronthaul interfaces corresponding to DUs and remote units (RUs) with different functions. If the fronthaul interface between the DU and RU is a common public radio interface (CPRI), the DU is configured to implement one or more baseband functions, and the RU is configured to implement one or more radio frequency functions. If the fronthaul interface between the DU and RU is another type of interface, relative to CPRI, some downlink and / or uplink baseband functions, such as precoding, digital beamforming (BF), or one or more of inverse fast Fourier transform (IFFT) / cyclic prefix (CP) for downlink, are moved from the DU to the RU for implementation; and for uplink, digital beamforming (BF), or one or more of fast Fourier transform (FFT) / cyclic prefix (CP) removal, are moved from the DU to the RU for implementation. In one possible implementation, the interface may be an enhanced common public radio interface (eCPRI). In the eCPRI architecture, the division between the DU and RU is different, corresponding to different types (category, Cat) of eCPRI, such as eCPRI Cat A, B, C, D, E, and F.
[0088] Taking eCPRI Cat A as an example, for downlink transmission, based on layer mapping, the DU is configured to implement layer mapping and one or more functions preceding it (i.e., one or more of coding, rate matching, scrambling, modulation, and layer mapping). Other functions after layer mapping (e.g., resource element (RE) mapping, digital beamforming (BF), or one or more of inverse fast Fourier transform (IFFT) / CP addition) are moved to the RU for implementation. For uplink transmission, based on RE demapping, the DU is configured to implement demapping and one or more functions preceding it (i.e., one or more of decoding, rate matching, descrambling, demodulation, inverse discrete Fourier transform (IDFT), channel equalization, and RE demapping). Other functions after demapping (e.g., one or more of digital BF or FFT / CP removal) are moved to the RU for implementation. It is understandable that for the functional description of DU and RU corresponding to various types of eCPRI, reference can be made to the eCPRI protocol, which will not be described in detail here.
[0089] In one possible design, the processing unit for implementing baseband functions in the BBU is called a baseband high layer (BBH) unit, and the processing unit for implementing baseband functions in the RRU / AAU / RRH is called a baseband low layer (BBL) unit.
[0090] In different systems, CU (or CU-CP and CU-UP), DU or RU may also have different names, but those skilled in the art can understand their meanings. For example, in the ORAN system, CU may also be called O-CU (Open CU), DU may also be called O-DU, CU-CP may also be called O-CU-CP, CU-UP may also be called O-CU-UP, and RU may also be called O-RU. Any unit of CU (or CU-CP, CU-UP), DU and RU in this application can be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.
[0091] In the embodiments of the present application, the device for implementing the functions of the network device can be a network device; it can also be a device that can support the network device to implement the functions, such as a chip system, a hardware circuit, a software module, or a hardware circuit and a software module. The device can be installed in the network device or used in conjunction with the network device. In the embodiments of the present application, only the device for implementing the functions of the network device is used as an example to illustrate, and does not constitute a limitation on the solutions of the embodiments of the present application.
[0092] It is understandable that the present application can be applied between network devices and terminal devices.
[0093] The communication between the network device and the terminal device follows a certain protocol layer structure. The protocol layer structure may include a control plane protocol layer structure and a user plane protocol layer structure. For example, the control plane protocol layer structure may include the functions of the radio resource control (RRC) layer, the packet data convergence protocol (PDCP) layer, the radio link control (RLC) layer, the medium access control (MAC) layer, and the physical layer. For example, the user plane protocol layer structure may include the functions of the PDCP layer, the RLC layer, the MAC layer, and the physical layer. In one possible implementation, a service data adaptation protocol (SDAP) layer may also be included above the PDCP layer.
[0094] Optionally, the protocol layer structure between the network device and the terminal device may further include an artificial intelligence (AI) layer for transmitting data related to AI functions.
[0095] Taking data transmission between a network device and a terminal device as an example, data transmission can pass through user plane protocol layers, such as the SDAP layer, PDCP layer, RLC layer, MAC layer, and physical layer. The SDAP layer, PDCP layer, RLC layer, MAC layer, and physical layer are collectively referred to as the access layer. Data transmission is divided into sending and receiving based on the direction of transmission, and each of these layers is further divided into a sending part and a receiving part. Taking downlink data transmission as an example, after the PDCP layer obtains data from the upper layer, it transmits the data to the RLC layer and MAC layer. The MAC layer then generates a transport block, which is then wirelessly transmitted through the physical layer. Data is encapsulated accordingly in each layer. For example, data received by a layer from the layer above it is considered a service data unit (SDU) of that layer. After encapsulation by that layer, it becomes a protocol data unit (PDU) and is then passed to the next layer.
[0096] For example, a terminal device may also include an application layer and a non-access layer. The application layer can be used to provide services to applications installed in the terminal device. For example, downlink data received by the terminal device can be sequentially transmitted from the physical layer to the application layer, which then provides it to the application. For another example, the application layer can obtain data generated by the application and sequentially transmit the data to the physical layer for transmission to other communication devices. The non-access layer can be used to forward user data, such as forwarding uplink data received from the application layer to the SDAP layer, or forwarding downlink data received from the SDAP layer to the application layer.
[0097] It should be understood that the number and type of each device in the communication system shown in Figure 3 are for illustration only, and the present application is not limited to this. In actual applications, the communication system may also include more terminal devices, more access network devices, and other network elements, such as core network devices, and / or network elements for implementing artificial intelligence functions.
[0098] It is understandable that all or part of the functions implemented by one or more of the terminal equipment, access network equipment, core network equipment, or network elements for implementing artificial intelligence functions can be virtualized, that is, implemented by one or more of the proprietary processors or general-purpose processors and the corresponding software modules. Among them, since the terminal equipment and the access network equipment involve interfaces for air interface transmission, the transceiver functions of the interfaces can be implemented by hardware. Core network equipment, such as operation administration and maintenance (OAM) network elements, can be virtualized. Optionally, one or more functions of the virtualized terminal equipment, access network equipment, core network equipment, or network elements for implementing artificial intelligence functions can be implemented by cloud devices, such as cloud devices in over the top (OTT) systems.
[0099] The following describes the format, function, etc. of the SS / PBCH block involved in the embodiments of the present application:
[0100] The SS / PBCH block is the first information that a terminal device must demodulate during initial access. Figure 4 shows the format of the SS / PBCH block, which includes the primary synchronization signal (PSS), the secondary synchronization signal (SSS), and the physical broadcast channel (PBCH). The SS / PBCH block consists of a two-dimensional region consisting of four orthogonal frequency division multiplexing (OFDM) symbols in the time domain and 20 resource blocks (RBs) in the frequency domain. The time domain location is pre-defined, while the frequency domain location is configurable.
[0101] During initial access, the terminal device acquires the cell identifier (ID), frequency synchronization, and downlink time synchronization through initial downlink synchronization, which can be considered the first step. The initial downlink synchronization process for the received SS / PBCH block consists of three steps: PSS search, SSS detection, and PBCH detection. The terminal device achieves cell synchronization and coarse symbol-level timing synchronization by demodulating the PSS and SSS. The PBCH carries the master information block (MIB) information configured by higher layers.
[0102] In the second step, the terminal device completes the timing synchronization of the system frame level by demodulating the MIB information, and obtains the system information block 1 (SIB1), that is, the location information of the remaining minimum system information (RMSI). Furthermore, based on the information in the SIB1, the terminal device can receive the type 0 physical downlink control channel (type0 physical downlink control channel, type0-PDCCH), and then receive the physical downlink shared channel (PDSCH). The control resource set CORESET#0 (Control Resource Set 0) is the information of Type0-PDCCH. The terminal device obtains the information of CORESET#0 and then blindly detects the downlink control information (DCI) corresponding to the SIB, and then receives the SIB.
[0103] The third step is to find the PDSCH that schedules SIB1 based on the location information, and demodulate SIB1 from the PDSCH to obtain random access related configuration information.
[0104] In a specific implementation, the network device can send multiple SS / PBCH blocks through time division multiplexing (TDM). Optionally, the network device can send the multiple SS / PBCH blocks in the form of SS / PBCH block burst sets. Furthermore, the network device can configure the period of the SS / PBCH block burst set through SIB1, and send the SS / PBCH block burst set through a certain period, and its period supports: 5ms, 10ms, 20ms, 40ms, 80ms and 160ms. Within the period of the SS / PBCH block burst set, the number of SS / PBCH blocks in the SS / PBCH block burst set is related to the frequency band and / or subcarrier spacing (SCS). The frequency band can be understood as the frequency band (or spectrum) where the network device and / or terminal device is located, and the subcarrier spacing can be understood as the subcarrier spacing used by the network device and / or terminal device. Generally, the frequency band where the network device and the terminal device are located is the same, and the subcarrier spacing used by the network device is the same as the subcarrier spacing used by the terminal device. Frequency bands may include low-frequency bands (for example, such as frequency bands with carrier frequencies less than 6 GHz) and high-frequency bands (for example, such as the spectrum from 52.6 GHz to 71 GHz). It is understandable that the low-frequency band may refer to a frequency band within a frequency range that is lower than a preset frequency, and the high-frequency band may refer to a frequency band within a frequency range that is higher than a preset frequency. In some scenarios, the frequency band may be an authorized frequency band or referred to as an operator spectrum; in other scenarios, the frequency band may be an unauthorized frequency band or referred to as a non-operator spectrum, etc. Optionally, the number of SS / PBCH blocks included in the SS / PBCH block burst set may be related to the frequency band in which the network device and / or terminal device operates. For example, when the frequency band f is less than or equal to 3 GHz, the maximum number of SS / PBCH blocks in the SS / PBCH block burst set can be 4, and the minimum can be 1; when the frequency band f is greater than 3 GHz and less than or equal to 6 GHz, the maximum number of SS / PBCH blocks in the SS / PBCH block burst set can be 8, and the minimum can be 1; when the frequency band f is greater than 6 GHz, the maximum number of SS / PBCH blocks in the SS / PBCH block burst set can be 64, and the minimum can be 1.
[0105] Among them, when the period of the SS / PBCH block burst set sent by the network device is 5ms (5ms corresponds to the time of half a wireless system frame), the following multiple SS / PBCH block formats / patterns are defined. The corresponding SS / PBCH block formats in each SS / PBCH block scanning period with different subcarrier spacing are described as follows:
[0106] Case A-15kHz SCS: The index of the first symbol (or starting symbol) of the candidate SS / PBCH block may be {2, 8}+14·n.
[0107] - For operation without shared spectrum channel access:
[0108] -Carrier frequency is less than or equal to 3 GHz, n = 0, 1.
[0109] - The carrier frequency in frequency range 1 (FR1) is greater than 3 GHz, and n = 0, 1, 2, 3.
[0110] - For operation with shared spectrum channel access, n = 0, 1, 2, 3, 4.
[0111] Case B - 30kHz SCS: The index of the first symbol of the candidate SS / PBCH block can be {4, 8, 16, 20} + 28·n. If the carrier frequency is less than or equal to 3 GHz, n = 0; if the carrier frequency in FR1 is greater than 3 GHz, n = 0, 1.
[0112] Case C - 30kHz SCS: The index of the first symbol of the candidate SS / PBCH block may be {2,8}+14·n.
[0113] - For operation without shared spectrum channel access:
[0114] -For paired spectrum operations:
[0115] - If the carrier frequency is less than or equal to 3 GHz, n = 0, 1; if the carrier frequency in FR1 is greater than 3 GHz, n = 0, 1, 2, 3.
[0116] -For unpaired spectrum operation:
[0117] - If the carrier frequency is less than 1.88 GHz, n = 0, 1; if the carrier frequency in FR1 is greater than or equal to 1.88 GHz, n = 0, 1, 2, 3.
[0118] - For operation with shared spectrum channel access, n = 0, 1, 2, 3, 4, 5, 6, 7, 8, 9.
[0119] Case D - 120kHz SCS: The index of the first symbol of the candidate SS / PBCH block can be {4, 8, 16, 20} + 28·n. For carrier frequencies in FR2, n = 0, 1, 2, 3, 5, 6, 7, 8, 10, 11, 12, 13, 15, 16, 17, 18.
[0120] Case E - 240kHz SCS: The index of the first symbol of the candidate SS / PBCH block can be {8, 12, 16, 20, 32, 36, 40, 44} + 56·n. For carrier frequencies in FR2-1, n = 0, 1, 2, 3, 5, 6, 7, 8.
[0121] Case F-480kHz SCS: The index of the first symbol of the candidate SS / PBCH block may be {2,9}+14·n. For carrier frequencies in FR2-2, n=0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31.
[0122] Case G - 960 kHz SCS: The index of the first symbol of the candidate SS / PBCH block may be {2, 9} + 14·n. For carrier frequencies in FR2-2, n = 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31.
[0123] Taking a 30kHz subcarrier spacing for an SS / PBCH block as an example, for a carrier spectrum with a frequency band f less than or equal to 3GHz, the starting symbol of the SS / PBCH block is expressed as {2,8}+14·n, where n=0,1. Since 14 is the number of OFDM symbols occupied by a timeslot, 14 indicates that the SS / PBCH block recurs in units of one timeslot. 2 and 8 represent the starting symbol of the SS / PBCH block in each timeslot. In other words, the pattern (also understood as the position distribution) of the SS / PBCH block burst set recurs in units of one timeslot. In each timeslot, the relative positions of the SS / PBCH blocks in the SS / PBCH block pattern remain the same. This also means that in different SS / PBCH block burst sets, SS / PBCH blocks with the same relative position have the same offset relative to the starting position of their respective SS / PBCH block burst sets. For frequencies below 3 GHz (Sub3G), the maximum number of SS / PBCH blocks transmitted is 4; for frequencies between 3 GHz and 6 GHz (Sub3G-Sub6G), the maximum number of SS / PBCH blocks transmitted is 8; and for frequencies above 6 GHz (above 6G), a maximum of 64 SS / PBCH blocks are defined. The number of beams a base station can implement is determined by its capabilities. Figure 5 shows the SS / PBCH block patterns and their positions within the slots for scenarios A through E. Each SS / PBCH block has a unique SS / PBCH block index. For low frequencies, the SS / PBCH block index can be directly obtained from the PBCH pilot signal; for high frequencies, the lower 3 bits can be obtained from the PBCH pilot signal, and the upper 3 bits can be obtained from the MIB message. When the actual number of SS / PBCH blocks transmitted in a cell is less than the maximum number of SS / PBCH blocks defined in the protocol, SIB1 or other RRC signaling can be used to indicate which SS / PBCH blocks are not transmitted. These unused positions can then be used to transmit PDSCH data.
[0124] As described in the background technology, the SS / PBCH blocks sent by different cells in the current cellular network are not orthogonalized, resulting in measurement interference and the inability to measure each other. Alternatively, according to the NR protocol, SS / PBCH blocks are periodically sent in units of 5ms half frames in the time domain. The symbol position of the SS / PBCH block depends on the SCS. Different cells send SS / PBCH blocks orthogonally with a minimum unit of 5ms as the granularity. That is, different cells send SS / PBCH blocks within different 5ms to avoid measurement interference, resulting in a large measurement delay.
[0125] In view of this, the following embodiments of the present application provide a communication scheme, in which the first resource location where the first node sends the first signal is time-division multiplexed and / or frequency-division multiplexed with the second resource location where the second node sends the second signal, and the first resource location is associated with the identifier of the first node, and the second resource location is associated with the identifier of the second node, which can achieve rapid measurement of multiple nodes and avoid interference between signals.
[0126] The embodiments of the present application can be applied to any of the following scenarios: relay, wireless mesh network, IAB, ad hoc network, etc.
[0127] As an example, the following introduces the IAB scenario.
[0128] With the development of technologies like VR, AR, and the Internet of Things, future networks will see an increasing number of devices, leading to a continuous increase in network data usage. To accommodate this growing number of devices and the rapidly increasing market demand for network data, higher capacity requirements are currently being placed on 5G networks. In hotspots, the use of high-frequency small cell networks is becoming increasingly popular to meet the ultra-high capacity demands of 5G. High-frequency carriers have poor propagation characteristics, suffer from severe attenuation due to obstruction, and have limited coverage. Therefore, a large number of small cells need to be densely deployed in hotspots. These small cells can serve as IAB nodes.
[0129] In order to design flexible and convenient access and backhaul solutions, the access link (AL) and backhaul link (BL) in the IAB scenario both adopt wireless transmission solutions. In a network containing IAB nodes (hereinafter referred to as the IAB network), the IAB node can provide wireless access services for terminal devices and connect to the donor node through a wireless backhaul link to transmit user business data. For example, the donor node can be called a donor base station. The donor base station can be referred to as an IAB donor or a donor next generation node base station (DgNB) in a 5G network. The donor node can be a complete entity, or it can be in a form where the CU and DU are separated, that is, the host node consists of a host CU (donor-CU) and a host DU (donor-DU). Among them, the donor-CU can also be in a form where the UP and CP are separated, that is, the donor-CU consists of CU-UP and CU-CP. The IAB node is connected to the core network through a wired link via the host node. For example, in a standalone 5G architecture, the IAB node connects to the 5G core (5GC) via a wired link via a donor node. In a non-standalone 5G architecture, the IAB node connects to the evolved packet core (EPC) via the eNB on the control plane and to the EPC via the donor node and eNB on the user plane.
[0130] To ensure the reliability of service transmission, the IAB network supports multi-hop IAB nodes and multi-connection IAB node networking. Therefore, there may be multiple transmission paths between host nodes. On a path, there is a definite hierarchical relationship between IAB nodes, as well as between IAB nodes and the host nodes they serve. Each IAB node regards the node that provides backhaul services to it as its parent node. Accordingly, each IAB node can be regarded as a child node of its parent node, or in other words, downstream (lower-level) nodes that are away from the host node of the IAB node and adjacent to the IAB node are called child nodes of the IAB node.
[0131] Figure 6 is a schematic diagram of an IAB network topology applicable to an embodiment of the present application. The parent node of IAB node 1 is the host node, which is in turn the parent node of IAB node 2 and IAB node 3. IAB node 2 and IAB node 3 are both the parent nodes of IAB node 4, and the parent node of IAB node 5 is IAB node 2. In the network architecture shown in Figure 6, the terminal's uplink data packet can be transmitted to the host node via one or more IAB nodes, and then sent by the host node to a mobile gateway device (such as a user plane function (UPF) network element in a 5G network). The downlink data packet will be received by the host node from the mobile gateway device and then sent to the terminal via one or more IAB nodes. Exemplarily, the IAB node can be customer premises equipment (CPE) or a residential gateway (RG). Exemplarily, the terminal device and network device in the embodiment of the present application can correspond to a node in Figure 6 and the parent node of the node. For example, the terminal device and network device in the embodiment of the present application can be terminal 1 and IAB node 4 (i.e., the parent node of terminal 1). For another example, the terminal device and the network device in the embodiment of the present application may be IAB node 3 and IAB node 1 (ie, the parent node of IAB node 3).
[0132] To facilitate understanding of the technical solution of the present application, a brief introduction to the relevant concepts involved in the application embodiments is first given, but this is not intended to be limiting.
[0133] 1. Radio frame: A radio frame can be divided into multiple radio frames in the time domain. For example, the length of each radio frame is 10 ms. For example, in this application, a radio frame may also be referred to as a system frame, a wireless system frame, or a frame.
[0134] 2. Subframe: A radio frame is divided into multiple subframes. For example, it is divided into 10 subframes, numbered #0 to #9, and the length of each subframe is 1ms.
[0135] In the LTE system, since there is only one type of subcarrier spacing, that is, 15kHz, each subframe has 2 time slots, each time slot is 0.5ms. However, in the NR system, the time slot length depends on the subcarrier spacing. There are multiple optional subcarrier spacings, such as 15kHz, 30kHz, 60kHz, 120kHz, 240kHz, etc. The wider the subcarrier spacing, the shorter the time slot duration. For example, when the subcarrier is 30kHz, each subframe has 2 time slots, each time slot is 0.5ms, and each radio frame contains 20 time slots, numbered #0 to #19.
[0136] 3. System frame number (SFN): the number of each wireless frame.
[0137] 4. Time domain resources: In the embodiments of the present application, data or information can be carried by time domain resources. Time-frequency resources can include one or more time domain units (also called time units, time units, etc.).
[0138] In the time domain, the smallest granularity is an orthogonal frequency division multiplexing (OFDM) symbol. A time domain unit (also called a time unit) can be a symbol, several OFDM symbols, a slot, a mini-slot, or a subframe. A slot can consist of 7 or 14 symbols; a mini-slot can include at least one symbol (e.g., 2 symbols, 7 symbols, 14 symbols, or any number of symbols less than or equal to 14 symbols); and a subframe can last 1 millisecond (ms) in the time domain.
[0139] As shown in Figure 7, a flow chart of a communication method provided in an embodiment of the present application is shown. Exemplarily, the method may include the following steps:
[0140] S701. A first node determines a first resource location for sending a first signal.
[0141] In this embodiment, a first node sends a first signal at a first resource location, and a UE served by the first node receives and measures the first signal at the first resource location. Before sending the first signal, the first node must determine the first resource location. However, a second node may be within a relatively close network range to the first node. If the first resource location where the first node sends the first signal differs from the second resource location where the second node sends the second signal, interference with the signal sent by the other node can be avoided.
[0142] To avoid interference with the second signal, in this embodiment, the first resource location and the second resource location are time-division multiplexed. The first resource location is associated with the identifier of the first node, and the second resource location is associated with the identifier of the second node. For example, the first resource location is a function of the identifier of the first node, and the second resource location is a function of the identifier of the second node. Time-division multiplexing the resource locations of the first and second nodes, and associating their time-domain resource locations with the node identifiers, can avoid interference from signals from neighboring nodes and reduce measurement latency.
[0143] This embodiment is described using the first signal and the second signal as SS / PBCH blocks as an example. The first signal and the second signal may also be other signals, for example, one or more of a channel state information-reference signal (CSI-RS), a sounding reference signal (SRS), a demodulation reference signal (DMRS), a tracking reference signal (TRS), and a phase tracking reference signal (PTRS). The embodiment of the present application is not limited to this.
[0144] Different nodes transmit SS / PBCH blocks in a time-division orthogonal manner. This embodiment is described using the example of a first node and a second node transmitting SS / PBCH blocks in a time-division orthogonal manner. In another embodiment, the first node may also transmit SS / PBCH blocks in a time-division orthogonal manner with other nodes. That is, the first resource location may also be time-division multiplexed with the xth resource location, where the xth resource location is used for the xth node to transmit a third signal (e.g., an SS / PBCH block). The xth resource location is associated with the identifier of the xth node, where x is a natural number.
[0145] The time domain position occupied by each SS / PBCH block reuses the SS / PBCH time domain resource format described in Cases A to G above. However, the SS / PBCH blocks are sent at different time domain absolute positions for different nodes. The resource position in this embodiment refers to the time domain absolute position. Exemplarily, the first resource position is associated with the offset of the half frame where the first resource position is located within the SS / PBCH block period (SS / PBCH transmission timing offset of a half frame in a SS / PBCH block period) and the index of the SS / PBCH blocks in the half frame (the index of SS / PBCHs to be transmitted in the half frame), wherein one period includes at least one half frame.
[0146] The transmission period of the SS / PBCH block supports: 5ms, 10ms, 20ms, 40ms, 80ms or 160ms. For example, assuming that the period is 20ms, including 4 half frames, the half frame where the first resource position is located can be the 0th, 1st, 2nd or 3rd half frame. Assuming that the half frame where the first resource position is located is the 0th half frame in the period, the offset of the half frame where the first resource position is located in the period of the SS / PBCH block is 0; assuming that the half frame where the first resource position is located is the 1st half frame in the period, the offset of the half frame where the first resource position is located in the period of the SS / PBCH block is 1; and so on. That is, the aforementioned offset is in the granularity or unit of half a frame. It can be understood that the aforementioned offset can also be the number of milliseconds corresponding to the half frame, such as 5ms as the granularity or unit. The following description is based on the offset being in the granularity or unit of half a frame. When the offset is in the granularity or unit of 5ms, the offset (i.e., the number of half frames of offset) in the following description can be equal to the offset (i.e., the number of milliseconds of offset) / 5ms.
[0147] Furthermore, the offset of the half-frame where the first resource position is located within the period of the SS / PBCH block and the identifier of the first node, as well as the number L of candidate positions of the SS / PBCH block in the half-frame max For example, the offset of the half-frame where the first resource location is located within the period of the SS / PBCH block is associated with the identifier of the first node and the number L of candidate locations of the SS / PBCH block in the half-frame. max Satisfies the first functional relationship. For example, L max It is determined based on the time domain position of the SS / PBCH block defined by the protocol, the subframe format of the current system configuration, or the uplink and downlink ratio of the current system configuration; or it is a predefined or configured value. For example, the first functional relationship can be: the first resource position or That is, the node identifier is added with an offset m, where m is a natural number or integer. Indicates rounding down. It is understandable that Can also be replaced by That is, the node identifier is subtracted by an offset m, where m is a natural number or an integer.
[0148] The index of the first signal and the identifier of the first node in the half-frame, and the number of candidate positions of the SS / PBCH block in the half-frame L max For example, the index of the SS / PBCH block in the half-frame is associated with the identifier of the first node, and the number L of candidate positions of the SS / PBCH block in the half-frame. max Satisfy the second functional relationship. For example, the second functional relationship may be: index of SS / PBCH block in half frame = identifier of first node % L max, or (identity of the first node + m) % L max , that is, the node identifier is added with an offset m, where m is a natural number or integer. % represents the remainder. Among them, (the identifier of the first node + m) % L max It can also be replaced by (the first node's identifier - m)% L max , that is, the node identifier is subtracted by an offset m, where m is a natural number or an integer.
[0149] Exemplarily, the identifier of the first node may be a node identifier or a physical cell identifier (PCI).
[0150] Furthermore, for a network architecture with separate CUs and DUs, the CU may send configuration information of the first resource location to the DU via an F1 application protocol (F1-AP) message. The configuration information may include an offset of the half-frame where the first resource location is located within the SS / PBCH block period and an index of the SS / PBCH block within the half-frame.
[0151] In the frequency domain, the SS / PBCH blocks of different nodes occupy the same frequency domain resources, for example, 20 RBs at the same frequency domain position.
[0152] S702. The first node sends a first signal at a first resource location.
[0153] The UE1 served by the first node may receive the first signal at the first resource location.
[0154] In addition, the second node may be a next-hop node of the first node, and the second node may also receive the first signal at the first resource location.
[0155] S703: The second node determines a second resource location.
[0156] S704. UE2 served by the second node may receive the second signal at the second resource location.
[0157] The second node determines a second resource location, which is time-division multiplexed with the first resource location. Therefore, when the second node sends a second signal at the second resource location, the first signal does not interfere with the second signal, or the second signal does not interfere with the first signal.
[0158] The following examples illustrate how time division multiplexing (TDM) can be used to implement fast multi-node measurements and avoid measurement interference:
[0159] As shown in Figure 8, it is a schematic diagram of an example of time-division orthogonal transmission of SS / PBCH blocks provided in an embodiment of the present application. Taking 30kHz SCS (case C above) as an example, for the scenario where the operator spectrum frequency f<=3GHz, the position of the first symbol of the candidate SS / PBCH block in each half frame (5ms) is {2,8}+14*n, n=0, 1. Taking the time division duplex (TDD) time slot ratio of 2:3 as an example, when n=1, there are GAP symbols corresponding to symbol positions 8 to 11, which cannot be used to send SS / PBCH blocks, that is, the downlink (downlink, D) time slot supports 2 SS / PBCH blocks, and the special time slot (S slot) supports 1 SS / PBCH block. Therefore, under the TDD uplink and downlink 2:3 time slot ratio, there are a total of 3 SS / PBCH block candidate positions within 5ms, namely L max =3. Different nodes transmit SS / PBCH blocks in a time-division orthogonal manner, and orthogonal SS / PBCH block resources can be allocated to three nodes every 5 ms. The timeslot ratio refers to the ratio of the number of downlink timeslots to the number of uplink timeslots, or the ratio of the sum of the number of downlink timeslots and special timeslots to the number of uplink timeslots. All timeslot ratios mentioned below refer to this definition.
[0160] Based on the first resource location Among them, L max =3, the identifier of node 0 is 0, then the offset of the half frame where the resource position of node 0 is located in the period of the SS / PBCH block is 0, that is, the half frame where the resource position of node 0 is located is the 0th half frame in the period; the identifier of node 1 is 1, through the rounding-down operation, the offset of the half frame where the resource position of node 1 is located in the period of the SS / PBCH block is 0, that is, the half frame where the resource position of node 1 is located is also the 0th half frame in the period; the identifier of node 2 is 2, through the rounding-down operation, the offset of the half frame where the resource position of node 2 is located in the period of the SS / PBCH block is 0, that is, the half frame where the resource position of node 2 is located is also the 0th half frame in the period.
[0161] There are three SS / PBCH block (SSB) candidate positions in the half frame. max , the index of the SS / PBCH block sent by node 0 in the half-frame is the 0th SSB index, that is, SSB index0; the index of the SS / PBCH block sent by node 1 in the half-frame is the 1st SSB index, that is, SSB index1; the index of the SS / PBCH block sent by node 2 in the half-frame is the 2nd SSB index, that is, SSB index2.
[0162] Thus, the SS / PBCH block sent by node 0 is at SSB index 0, the SS / PBCH block sent by node 1 is at SSB index 1, and the SS / PBCH block sent by node 2 is at SSB index 2.
[0163] In another example, assuming a 30kHz SCS (Case C above), an operator spectrum frequency f <= 3GHz, and a TDD timeslot ratio of 2:3, there are three candidate SS / PBCH block locations within a half-frame. Assuming a maximum of 12 nodes in the network, these 12 nodes need to transmit SS / PBCH blocks within four half-frames, with each node transmitting an SS / PBCH block every 20ms.
[0164] According to the calculation formula for the offset of the half-frame where the node's resource location is located within the SS / PBCH block period, the offset of the half-frame where the resource locations of nodes 0, 1, and 2 are located within the SS / PBCH block period is 0, that is, the half-frame where the resource locations of nodes 0, 1, and 2 are located is the 0th half-frame within the period; the offset of the half-frame where the resource locations of nodes 3, 4, and 5 are located within the SS / PBCH block period is 1, that is, the half-frame where the resource locations of nodes 3, 4, and 5 are located is the 1st half-frame within the period; the offset of the half-frame where the resource locations of nodes 6, 7, and 8 are located within the SS / PBCH block period is 2, that is, the half-frame where the resource locations of nodes 6, 7, and 8 are located is the 2nd half-frame within the period; and the offset of the half-frame where the resource locations of nodes 9, 10, and 11 are located within the SS / PBCH block period is 3, that is, the half-frame where the resource locations of nodes 9, 10, and 11 are located is the 3rd half-frame within the period.
[0165] According to the calculation formula of the index of the SS / PBCH block in the half frame, nodes 0, 3, 6, and 9 are respectively at the 0th SSB index in their respective half frames, that is, SSB index0; nodes 1, 4, 7, and 10 are respectively at the 1st SSB index in their respective half frames, that is, SSB index1; nodes 2, 5, 8, and 11 are respectively at the 2nd SSB index in their respective half frames, that is, SSB index2.
[0166] Then in this 20ms period:
[0167] Node 0, node 1, and node 2 send SS / PBCH blocks at SSB index 0, SSB index 1, and SSB index 2 in the 0th half frame, respectively.
[0168] Node 3, node 4, and node 5 send SS / PBCH blocks at SSB index 0, SSB index 1, and SSB index 2 in the first half frame, respectively.
[0169] Node 6, node 7, and node 8 send SS / PBCH blocks at SSB index 0, SSB index 1, and SSB index 2 in the second half frame, respectively.
[0170] Node 9, node 10, and node 11 send SS / PBCH blocks at SSB index 0, SSB index 1, and SSB index 2 in the third half frame, respectively.
[0171] In another example, assuming a 30kHz SCS (Case C above), an operator spectrum frequency f <= 3GHz, and a TDD timeslot ratio of 2:3, there are three candidate SS / PBCH block locations within a half-frame. Assuming a maximum of 96 nodes in the network, these 96 nodes need to transmit SS / PBCH blocks within 32 half-frames, with each node transmitting an SS / PBCH block every 160ms.
[0172] According to the calculation formula of the offset of the half frame where the node's resource position is located in the period of the SS / PBCH block, the offset of the half frame where the resource position of nodes 0, 1, and 2 is located in the period of the SS / PBCH block is 0, that is, the half frame where the resource position of nodes 0, 1, and 2 is located is the 0th half frame in the period; the offset of the half frame where the resource position of nodes 3, 4, and 5 is located in the period of the SS / PBCH block is 1, that is, the half frame where the resource position of nodes 3, 4, and 5 is located is the 1st half frame in the period; the half frame where the resource position of nodes 6, 7, and 8 is located in the period of the SS / PBCH block is 1. The offset within the H block period is 2, that is, the half frame where the resource positions of nodes 6, 7, and 8 are located is the second half frame within the period; and the offset of the half frame where the resource positions of nodes 9, 10, and 11 are located within the SS / PBCH block period is 3, that is, the half frame where the resource positions of nodes 9, 10, and 11 are located is the third half frame within the period; and so on, the offset of the half frame where the resource positions of nodes 93, 94, and 95 are located within the SS / PBCH block period is 31, that is, the half frame where the resource positions of nodes 93, 94, and 95 are located is the 31st half frame within the period.
[0173] According to the calculation formula of the index of the SS / PBCH block in the half frame, nodes 0, 3, 6, 9...93 are respectively at the 0th SSB index in their respective half frames, that is, SSB index0; nodes 1, 4, 7, 10...94 are respectively at the 1st SSB index in their respective half frames, that is, SSB index1; nodes 2, 5, 8, 11...95 are respectively at the 2nd SSB index in their respective half frames, that is, SSB index2.
[0174] Then in this 160ms period:
[0175] Node 0, node 1, and node 2 send SS / PBCH blocks at SSB index 0, SSB index 1, and SSB index 2 in the 0th half frame, respectively.
[0176] Node 3, node 4, and node 5 send SS / PBCH blocks at SSB index 0, SSB index 1, and SSB index 2 in the first half frame, respectively.
[0177] And so on;
[0178] Node 93, node 94, and node 95 send SS / PBCH blocks at SSB index 0, SSB index 1, and SSB index 2 in the 31st half frame, respectively.
[0179] As shown in Figure 9, it is a schematic diagram of another example of time-division orthogonal transmission of SS / PBCH blocks provided in an embodiment of the present application. For non-operator spectrum, taking 30kHz SCS as an example, the position of the first symbol of the candidate SS / PBCH block in each half frame is {2,8}+14*n, n=0,1,2,3,4,5,6,7,8,9. Similarly, where D slot supports 2 SS / PBCH blocks and S slot supports 1 SS / PBCH block, under the TDD uplink and downlink 2:3 time slot ratio, there are a maximum of 6 SSB candidate positions within 5ms, that is, L max = 6. If this SS / PBCH block format can be extended to support the operator's spectrum, different nodes send SS / PBCH blocks in a time-division orthogonal manner, and SS / PBCH block orthogonal resources can be allocated to 6 nodes every 5 ms.
[0180] Based on the first resource location Among them, L max=6, the identifier of node 0 is 0, then the offset of the half frame where the resource position of node 0 is located in the period of the SS / PBCH block is 0, that is, the half frame where the resource position of node 0 is located is the 0th half frame in the period; the identifier of node 1 is 1, through the rounding-down operation, the offset of the half frame where the resource position of node 1 is located in the period of the SS / PBCH block is 0, that is, the half frame where the resource position of node 1 is located is also the 0th half frame in the period; the identifier of node 2 is 2, through the rounding-down operation, the offset of the half frame where the resource position of node 2 is located in the period of the SS / PBCH block is 0, that is, the half frame where the resource position of node 2 is located is also the 0th half frame in the period; and so on.
[0181] There are a total of 6 candidate SS / PBCH block positions in the half frame. The index of the SS / PBCH block in the half frame = the identifier of the first node % L max , the index of the SS / PBCH block sent by node 0 in the half-frame is the 0th SSB index, that is, SSB index0; the index of the SS / PBCH block sent by node 1 in the half-frame is the 1st SSB index, that is, SSB index1; the index of the SS / PBCH block sent by node 2 in the half-frame is the 2nd SSB index, that is, SSB index2; and so on.
[0182] Therefore, the SS / PBCH block sent by node 0 is at SSB index 0, the SS / PBCH block sent by node 1 is at SSB index 1, the SS / PBCH block sent by node 2 is at SSB index 2, and so on. The SS / PBCH block sent by node 5 is at SSB index 5.
[0183] In another example, assuming the current system uses carrier spectrum but can use the protocol specifications for SS / PBCH block locations in non-carrier spectrum, using a TDD timeslot ratio of 2:3 and an SCS of 30 kHz, there are a total of six candidate SS / PBCH block locations within a half-frame. Assuming the maximum number of nodes in the network is 12, these 12 nodes need to transmit SS / PBCH blocks within two half-frames, with each node transmitting SS / PBCH blocks every 10 ms.
[0184] According to the calculation formula for the offset of the half-frame where the node's resource location is located within the SS / PBCH block period, the offset of the half-frame where the resource locations of nodes 0 to 5 are located within the SS / PBCH block period is 0, that is, the half-frame where the resource locations of nodes 0 to 5 are located is the 0th half-frame in the period; the offset of the half-frame where the resource locations of nodes 6 to 11 are located within the SS / PBCH block period is 1, that is, the half-frame where the resource locations of nodes 6 to 11 are located is the 1st half-frame in the period.
[0185] According to the calculation formula of the index of the SS / PBCH block in the half frame, nodes 0 and 6 are respectively at the 0th SSB index in their respective half frames, that is, SSB index0; nodes 1 and 7 are respectively at the 1st SSB index in their respective half frames, that is, SSB index1; and so on.
[0186] Then in this 10ms period:
[0187] Node 0, node 1, node 2, node 3, node 4, and node 5 send SS / PBCH blocks at SSB index 0, SSB index 1, SSB index 2, SSB index 3, SSB index 4, and SSB index 5 in the 0th half frame, respectively;
[0188] Node 6, node 7, node 8, node 9, node 10, and node 11 send SS / PBCH blocks at SSB index 0, SSB index 1, SSB index 2, SSB index 3, SSB index 4, and SSB index 5 in the first half frame, respectively.
[0189] In another example, assume the current system uses carrier spectrum, but can use the protocol specifications for SS / PBCH block locations in non-carrier spectrum. For example, with a TDD timeslot ratio of 2:3 and an SCS of 30 kHz, there are a total of six candidate SS / PBCH block locations within a half-frame. Assuming a maximum of 96 nodes in the network, these 96 nodes need to transmit SS / PBCH blocks within 16 half-frames, with each node transmitting SS / PBCH blocks every 80 ms.
[0190] According to the calculation formula for the offset of the half-frame where the node's resource location is located within the SS / PBCH block period, the offset of the half-frame where the resource locations of nodes 0 to 5 are located within the SS / PBCH block period is 0, that is, the half-frame where the resource locations of nodes 0 to 5 are located is the 0th half-frame within the period; the offset of the half-frame where the resource locations of nodes 6 to 11 are located within the SS / PBCH block period is 1, that is, the half-frame where the resource locations of nodes 6 to 11 are located is the 1st half-frame within the period; and so on, the offset of the half-frame where the resource locations of nodes 90 to 95 are located within the SS / PBCH block period is 15, that is, the half-frame where the resource locations of nodes 90 to 95 are located is the 15th half-frame within the period.
[0191] According to the calculation formula of the index of the SS / PBCH block in the half frame, nodes 0, 6...90 are respectively at the 0th SSB index in their respective half frames, that is, SSB index0; nodes 1, 7...91 are respectively at the 1st SSB index in their respective half frames, that is, SSB index1; nodes 2, 8...92 are respectively at the 2nd SSB index in their respective half frames, that is, SSB index2; and so on.
[0192] Then in this 80ms period:
[0193] Node 0, node 1, node 2, node 3, node 4, and node 5 send SS / PBCH blocks at SSB index 0, SSB index 1, SSB index 2, SSB index 3, SSB index 4, and SSB index 5 in the 0th half frame, respectively;
[0194] Node 6, node 7, node 8, node 9, node 10, and node 11 send SS / PBCH blocks at SSB index 0, SSB index 1, SSB index 2, SSB index 3, SSB index 4, and SSB index 5 in the first half frame, respectively.
[0195] And so on;
[0196] Node 90, node 91, node 92, node 93, node 94, and node 95 send SS / PBCH blocks at SSB index 0, SSB index 1, SSB index 2, SSB index 3, SSB index 4, and SSB index 5 in the 15th half frame, respectively.
[0197] It can be seen from the above examples that the resource locations of the above-mentioned multiple nodes are time-division multiplexed, the SS / PBCH blocks sent by different nodes are orthogonalized through time division, and the time domain resource location of the SS / PBCH block is associated with the node identifier, which can avoid signal interference from neighboring nodes when performing SS / PBCH block measurement, and multiple nodes can reduce the measurement delay of multiple nodes through time division multiplexing.
[0198] According to a communication method provided in an embodiment of the present application, the first resource location where the first node sends the first signal and the second resource location where the second node sends the second signal are time-division multiplexed, and the first resource location is associated with the identifier of the first node, and the second resource location is associated with the identifier of the second node, which can achieve rapid measurement of multiple nodes and avoid interference between signals.
[0199] In another embodiment, the transmission of SS / PBCH blocks may be based on newly defined time domain patterns (i.e., time domain patterns not included in the above cases A to G). These newly defined time domain patterns may be as follows:
[0200] When the SCS is 15 kHz, the position of the first symbol in the candidate positions of the SS / PBCH block within every 5 ms is {2, 6, 10} + 14*n, (n = 0, 1, 2, 3, 4), or {4} + 4*n, (n = 0, 1, 2, 3, 4, ..., 15), or {2} + 4*n, (n = 0, 1, 2, 3, 4, ..., 16);
[0201] When the SCS is 30 kHz, the position of the first symbol in the candidate positions of the SS / PBCH block within every 5 ms is {2, 6, 10} + 14*n, (n = 0, 1, 2, 3, 4, 5, 6, 7, 8, 9), or {4} + 4*n, (n = 0, 1, 2, 3, 4, ..., 33), or {2} + 4*n, (n = 0, 1, 2, 3, 4, ..., 33);
[0202] When the SCS is 60 kHz, the position of the first symbol in the candidate positions of the SS / PBCH block within every 5 ms is {2, 6, 10} + 14*n, (n = 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19), or {4} + 4*n, (n = 0, 1, 2, 3, 4, ..., 68), or {2} + 4*n, (n = 0, 1, 2, 3, 4, ..., 68);
[0203] When the SCS is 120 kHz, the position of the first symbol in the candidate positions of the SS / PBCH block within every 5 ms is {2, 6, 10} + 14*n, (n = 0, 1, 2, 3, 4, ..., 39), or {4} + 4*n, (n = 0, 1, 2, 3, 4, ..., 138), or {2} + 4*n, (n = 0, 1, 2, 3, 4, ..., 138);
[0204] When the SCS is 240 kHz, the position of the first symbol in the candidate positions of the SS / PBCH block within every 5 ms is {2, 6, 10} + 14*n, (n = 0, 1, 2, 3, 4, ..., 79), or {4} + 4*n, (n = 0, 1, 2, 3, 4, ..., 278), or {2} + 4*n, (n = 0, 1, 2, 3, 4, ..., 278);
[0205] When the SCS is 480 kHz, the position of the first symbol in the candidate positions of the SS / PBCH block selected every 5 ms is {2, 6, 10} + 14*n, (n = 0, 1, 2, 3, 4, ..., 159), or {4} + 4*n, (n = 0, 1, 2, 3, 4, ..., 558), or {2} + 4*n, (n = 0, 1, 2, 3, 4, ..., 558);
[0206] When the SCS is 960kHz, the position of the first symbol in the candidate positions of the SS / PBCH block within every 5ms is {2, 6, 10} + 14*n, (n = 0, 1, 2, 3, 4, ..., 319), or {4} + 4*n, (n = 0, 1, 2, 3, 4, ..., 1118), or {2} + 4*n, (n = 0, 1, 2, 3, 4, ..., 1118).
[0207] By newly defining the time domain pattern of the SS / PBCH block, more candidate positions of the SS / PBCH block can be supported within a half-frame.
[0208] In the new time domain pattern, the method for determining the resource location of the node may refer to the above embodiment.
[0209] As shown in Figure 10, it is a schematic diagram of another example of time-division orthogonal transmission of SS / PBCH blocks provided in an embodiment of the present application. Taking 30kHz SCS and a TDD time slot ratio of 2:3 as an example, D slot supports 3 SS / PBCH blocks and S slot supports 2 SS / PBCH blocks. Under the 2:3 time slot ratio, there are 10 candidate positions of SS / PBCH blocks within 5ms, that is, SS / PBCH block orthogonal resources can be allocated to 10 nodes every 5ms, such as the SS / PBCH block sent by node 0 is at the position of SSB index 0, the SS / PBCH block sent by node 1 is at the position of SSB index 1, the SS / PBCH block sent by node 2 is at the position of SSB index 2, and so on. The SS / PBCH block sent by node 9 is at the position of SSB index 9.
[0210] For example, if the maximum number of nodes in the network is 20, the period for each node to send SS / PBCH blocks is 10ms, or in other words, 20 nodes can measure each other within 10ms. During this 10ms period:
[0211] Node 0, node 1, ..., node 9 transmits SS / PBCH blocks at SSB index 0, SSB index 1, ..., SSB index 9 in the 0th half frame respectively;
[0212] Node 10, node 11, ..., node 19 transmits the SS / PBCH block at SSB index 0, SSB index 1, ..., SSB index 9 in the first half frame, respectively.
[0213] Assume that the maximum number of nodes in the network is 160, and the period for each node to send SSB is 80ms. During this 80ms period:
[0214] Node 0, node 1, ..., node 9 transmits SS / PBCH blocks at SSB index 0, SSB index 1, ..., SSB index 9 in the 0th half frame respectively;
[0215] Node 10, node 11, ..., node 19 transmits the SS / PBCH block at SSB index 0, SSB index 1, ..., SSB index 9 in the first half frame, respectively.
[0216] And so on;
[0217] Node 150, node 151, ..., node 159 transmits SS / PBCH blocks at SSB index 0, SSB index 1, ..., SSB index 9 in the 15th half frame, respectively.
[0218] It can be seen from the above examples that the resource locations of the above multiple nodes are time-division multiplexed, the SS / PBCH blocks sent by different nodes are orthogonalized through time division, and the time domain resource location of the SS / PBCH block is associated with the node identifier, which can avoid signal interference from neighboring nodes when performing SS / PBCH block measurement, and multiple nodes are time-division multiplexed, which can reduce the delay of multiple node measurements.
[0219] By designing a new time domain pattern, more candidate positions of SS / PBCH blocks can be supported in each half frame, thereby further reducing the measurement delay of multiple nodes.
[0220] The above embodiment describes time division multiplexing between multiple nodes, where only one node transmits an SS / PBCH block at a candidate location within the system bandwidth. The following embodiment describes frequency division multiplexing between multiple nodes at a candidate location within the system bandwidth to support more candidate locations for SS / PBCH blocks and further reduce multi-node measurement latency.
[0221] As shown in Figure 11, it is a flow chart of another communication method provided in an embodiment of the present application. Exemplarily, the method may include the following steps:
[0222] S1101. A first node determines a first resource location for sending a first signal.
[0223] This embodiment is described by taking the first signal and the second signal as SS / PBCH blocks as an example. The first signal and the second signal may also be other signals, as described in the foregoing embodiments, and this embodiment of the present application does not limit this.
[0224] The network is configured with a certain system bandwidth, which supports frequency division orthogonality of SS / PBCH blocks of multiple nodes within the system bandwidth to improve the utilization of frequency domain resources. Therefore, in this embodiment, different nodes can send SS / PBCH blocks in a frequency division orthogonal manner, and each SS / PBCH block occupies a certain frequency domain resource (for example, 20 RBs). In addition, due to half-duplex limitations, different nodes sending SS / PBCH blocks at the same time domain location and different frequency domain locations may cause these nodes to be unable to measure each other. Therefore, it is also possible to send SS / PBCH blocks in the time domain by changing different node combinations within the period of one SS / PBCH block. That is, within the period of one SS / PBCH block, a node will send SS / PBCH blocks multiple times, so that a node can measure the SS / PBCH blocks sent by another node.
[0225] The first resource location is associated with an offset of the half-frame where the first resource location is located within the period of the SS / PBCH block and an index of the SS / PBCH block within the half-frame. One period includes at least one half-frame.
[0226] Furthermore, the offset of the half-frame where the first resource position is located within the period of the SS / PBCH block is related to the identifier of the first node, the first parameter, the second parameter, the number of times the currently transmitted SS / PBCH block has been repeatedly transmitted within the period, and the number of candidate positions of the SS / PBCH block in the half-frame L max For example, the offset of the half-frame where the first resource position is located within the period of the SS / PBCH block is associated with the identifier of the first node, the first parameter, the second parameter, the number of times the currently transmitted SS / PBCH block has been repeatedly transmitted within the period, and the number of candidate positions of the SS / PBCH block in the half-frame L. max Satisfy the third functional relationship. For example, the first resource location or That is, the node identifier is added with an offset m, where m is a natural number or an integer. Among them, r is the number of times the currently transmitted SS / PBCH block has been repeatedly transmitted within the SS / PBCH block period; N cell is the total number of nodes, i.e. the first parameter; N f,cell L is the number of nodes that support orthogonality in the frequency domain, i.e. the second parameter; max is the number of candidate positions of SS / PBCH blocks in a half-frame. max It is determined based on the time domain position of the SS / PBCH block defined by the protocol, the subframe format of the current system configuration, or the uplink and downlink ratio of the current system configuration; or it is a predefined or configured value. Wherein, / represents division and % represents remainder. Indicates rounding down. Indicates rounding up. Where (identity of the first node + m + r-1) % N cell It can also be replaced by (identity of the first node - m + r - 1) % N cell , that is, the node identifier is subtracted by an offset m, where m is a natural number or an integer.
[0227] The index of the SS / PBCH block in the half-frame and the identifier of the first node, the first parameter, the second parameter, the number of times the currently transmitted SS / PBCH block has been repeatedly transmitted in the period, and the number of candidate positions of the SS / PBCH block in the half-frame L max For example, L max It is determined based on the time domain position of the SS / PBCH block defined by the protocol, the subframe format of the current system configuration, or the uplink and downlink ratio of the current system configuration; or it is a predefined or configured value. For example, the index of the SS / PBCH block in the half frame is combined with the identifier of the first node, the first parameter, the second parameter, the number of times the currently transmitted SS / PBCH block has been repeatedly transmitted in the period, and the number of candidate positions of the SS / PBCH block in the half frame L max Satisfies the fourth functional relationship. For example, or That is, the node identifier is added with an offset m, where m is a natural number or an integer. Among them, r is the number of times the currently transmitted SS / PBCH block has been repeatedly transmitted within the period; N cell is the total number of nodes, i.e. the first parameter; N f,cell L is the number of nodes that support orthogonality in the frequency domain, i.e. the second parameter; max is the number of candidate positions of SS / PBCH blocks in a half-frame. Where % means remainder. Indicates rounding down. Indicates rounding up. Where (identity of the first node + m + r-1) % N cell It can also be replaced by (identity of the first node - m + r - 1) % N cell , that is, the node identifier is subtracted by an offset m, where m is a natural number or an integer.
[0228] Illustratively, the first parameter may be predefined, preconfigured, or based on a predefined or preconfigured third parameter; the second parameter may be predefined, preconfigured, or based on a predefined or preconfigured fourth parameter. Optionally, the third parameter is the maximum value of a preconfigured physical cell identifier. Optionally, the fourth parameter is a preconfigured system bandwidth.
[0229] Exemplarily, the identifier of the first node may be a node identifier or a PCI.
[0230] In the above example, the center frequency position of the SS / PBCH block depends on the identifier of the first node, which is
[0231] Furthermore, for a network architecture in which CU and DU are separated, the CU may send the configuration information of the above-mentioned first resource location to the DU through an F1-AP message. The configuration information may include the offset of the half-frame where the first resource location is located within the period of the SS / PBCH block and the index of the SS / PBCH block within the half-frame. In this configuration, there is a mapping relationship between the offset of the half-frame where the node's resource location is located within the period of the SS / PBCH block, the index of the SS / PBCH block within the half-frame, the center frequency position of the SS / PBCH block, and the node identifier.
[0232] S1102. The first node sends a first signal at a first resource location.
[0233] UE1 served by the first node receives the first signal at the first resource location.
[0234] S1103. The second node determines the second resource location.
[0235] S1104. The second node sends a second signal at a second resource location.
[0236] UE2 served by the second node receives the second signal at the second resource location.
[0237] The second resource location is frequency-division orthogonal to the first resource location.
[0238] The following examples illustrate how frequency division multiplexing (FDM) can be used to implement fast multi-node measurements while avoiding interference:
[0239] As shown in Figure 12, it is a schematic diagram of an example of frequency division orthogonal transmission of SS / PBCH blocks provided in an embodiment of the present application. Taking 100M system bandwidth as an example, the 100M system bandwidth supports frequency division orthogonal SS / PBCH blocks of up to 13 nodes. The format of the SS / PBCH block in the time domain adopts the time domain pattern of Case A to Case G above. For the operator spectrum frequency f<=3GHz, taking 30kHz SCS as an example, the position of the first symbol in the candidate position of the SS / PBCH block within every 5ms is {2,8}+14*n, n=0,1. Under the TDD2:3 time slot ratio, there are 3 candidate positions of SS / PBCH blocks every 5ms. Under the SS / PBCH block frequency division orthogonal scheme, 39 nodes can be supported to send an SSB once within 5ms.
[0240] According to the offset of the half frame where the node resource position is located in the SS / PBCH block period and the method of determining the index of the SS / PBCH block in the half frame, it can be concluded that the SS / PBCH block sent by node 0 is at the position of f0 in the frequency domain and SSB index 0 in the time domain, the SS / PBCH block sent by node 1 is at the position of f1 in the frequency domain and SSB index 0 in the time domain, and so on. The SS / PBCH block sent by node 12 is at the position of f1 in the frequency domain and SSB index 0 in the time domain. 12 The time domain is the position of SSB index 0, the SS / PBCH block sent by node 13 is at the position of SSB index 1 in the frequency domain, the SS / PBCH block sent by node 14 is at the position of SSB index 1 in the frequency domain, and so on. The SS / PBCH block sent by node 25 is at the position of SSB index 1 in the frequency domain. 12 The SS / PBCH block sent by node 26 is at the position of SSB index 1 in the time domain, the SS / PBCH block sent by node 26 is at the position of SSB index 2 in the frequency domain, the SS / PBCH block sent by node 27 is at the position of SSB index 2 in the frequency domain, and so on. The SS / PBCH block sent by node 38 is at the position of SSB index 2 in the frequency domain. 12 The time domain is the position of SSB index 2.
[0241] As shown in Figure 13, it is a schematic diagram of another example of frequency division orthogonal transmission of SS / PBCH blocks provided in an embodiment of the present application. Taking 30kHz SCS as an example, assuming that 4 SS / PBCH blocks are supported for frequency division orthogonal transmission within the system bandwidth, and 5ms includes 3 candidate positions of SS / PBCH, then 12 nodes are supported to send 1 SS / PBCH block each within 5ms.
[0242] Since nodes 0 to 3 are frequency-divided orthogonally, nodes 4 to 7 are frequency-divided orthogonally, and nodes 8 to 11 are frequency-divided orthogonally, nodes 0 to 3 cannot measure each other, nodes 4 to 7 cannot measure each other, and nodes 8 to 11 cannot measure each other. Therefore, it is necessary to transform different node combinations in the time domain to send SS / PBCH blocks. The node combination transformation is shown in Table 1 below:
[0243] Table 1 Node combination table
[0244] That is, the period of the SS / PBCH block is configured to be 20ms, including 4 half-frames. Within this 20ms, the time-frequency domain positions of each node sending SS / PBCH are staggered according to their respective node identifiers: the offset of the half-frame where the node resource location is located within the period of the SS / PBCH block is (r-1), r = 1, 2, 3, 4; the index of the SS / PBCH block within the half-frame is The center frequency position of each SS / PBCH block is Specifically, nodes 0 to 3 send SS / PBCH blocks at SSB index0 in the 0th half frame, nodes 4 to 7 send SS / PBCH blocks at SSB index1 in the 0th half frame, and nodes 8 to 11 send SS / PBCH blocks at SSB index2 in the 0th half frame; nodes 11 to 2 send SS / PBCH blocks at SSB index0 in the 1st half frame, nodes 3 to 6 send SS / PBCH blocks at SSB index1 in the 1st half frame, and nodes 7 to 10 send SS / PBCH blocks at SSB index2 in the 1st half frame; nodes 10 to 1 send SS / PBCH blocks at SSB index0 in the 2nd half frame, nodes 2 to 5 send SS / PBCH blocks at SSB index1 in the 2nd half frame, and nodes 6 to 9 send SS / PBCH blocks at SSB index2 in the 2nd half frame; nodes 9 to 0 send SS / PBCH blocks at SSB index0 in the 3rd half frame, and nodes 1 to 4 send SS / PBCH blocks at SSB index1 in the 3rd half frame. Index 1 sends an SS / PBCH block, and nodes 5 to 8 send an SS / PBCH block at SSB index 2 in the third half frame. Thus, these 12 nodes can complete mutual measurement within 20ms.
[0245] As shown in the table above, in different half-frames within a cycle, at least one of the multiple nodes frequency-division multiplexing with node 3 is different. For example, in half-frame 0, nodes 0 through 2 frequency-division multiplex with node 3. Since nodes 0 through 2 frequency-division multiplex with node 3, and assuming that nodes 0 through 2 operate in half-duplex mode, they cannot receive the SS / PBCH blocks sent by node 3. However, in half-frame 1, node 3 transmits an SS / PBCH block at SSB index 1. Nodes 0 through 2 are time-division multiplexed with node 3, allowing them to receive the SS / PBCH blocks sent by node 3. This prevents the problem of nodes not being able to measure each other in multi-node networking scenarios.
[0246] In addition, these 12 nodes can complete the cell search within the 0th half frame, and the cell search does not need to consider the problem of not being able to measure each other.
[0247] As shown in Figure 14, it is a schematic diagram of another example of frequency division orthogonal transmission of SS / PBCH blocks provided in an embodiment of the present application. Taking 30kHz SCS as an example, assuming that 8 SS / PBCH blocks are supported for frequency division orthogonal transmission within the system bandwidth, and 5ms includes 3 candidate positions of SS / PBCH, then 48 nodes are supported to send 1 SS / PBCH block each within 10ms.
[0248] Since nodes 0 to 7 are frequency-division multiplexed in the 0th half-frame, nodes 8 to 15 are frequency-division multiplexed, and nodes 16 to 23 are frequency-division multiplexed, and nodes 24 to 31, 32 to 39, and 40 to 47 are frequency-division multiplexed in the 1st half-frame, nodes 0 to 7 cannot measure each other, nodes 8 to 15 cannot measure each other, and nodes 16 to 23 cannot measure each other in the 0th half-frame, and nodes 24 to 31 cannot measure each other, nodes 32 to 39 cannot measure each other, and nodes 40 to 47 cannot measure each other in the 1st half-frame. Therefore, it is necessary to transform different node combinations in the time domain to send SS / PBCH blocks. The node combination transformation is shown in Table 2 below:
[0249] Table 2 Node combination table
[0250] That is, the period of the SS / PBCH block is configured to be 80ms, which includes 16 half-frames. Within this 80ms, the time-frequency domain positions of each node sending SS / PBCH are staggered according to their respective node identifiers: the offset of the half-frame where the node resource location is located within the period of the SS / PBCH block is The index of the SS / PBCH block in the half frame is The center frequency position of each SS / PBCH block is Specifically, nodes 0 to 7 transmit an SS / PBCH block at SSB index 0 in half-frame 0, nodes 8 to 15 transmit an SS / PBCH block at SSB index 1 in half-frame 0, and nodes 16 to 23 transmit an SS / PBCH block at SSB index 2 in half-frame 0. Nodes 24 to 31 transmit an SS / PBCH block at SSB index 0 in half-frame 1, nodes 32 to 39 transmit an SS / PBCH block at SSB index 1 in half-frame 1, and nodes 40 to 47 transmit an SS / PBCH block at SSB index 2 in half-frame 1. Nodes 47 to 6 transmit an SS / PBCH block at SSB index 0 in half-frame 2, nodes 7 to 14 transmit an SS / PBCH block at SSB index 1 in half-frame 2, and nodes 15 to 22 transmit an SS / PBCH block at SSB index 2 in half-frame 2, and so on. Thus, these 48 nodes can complete mutual measurement within 80 ms.
[0251] In addition, these 48 nodes can complete the cell search within the 0th half frame and the 1st half frame. It only takes 10ms to complete the cell search, and the cell search does not need to consider the problem of not being able to measure each other.
[0252] As shown in Figure 15, it is a schematic diagram of another example of frequency division orthogonal transmission of SS / PBCH blocks provided in an embodiment of the present application. Taking 30kHz SCS as an example, for non-operator spectrum, the position of the first symbol in the candidate position of the SS / PBCH block within every 5ms is {2,8}+14·nn=0,1,2,3,4,5,6,7,8,9. Similarly, the D slot supports 2 SSBs and the S slot supports 1 SSB. Under the 2:3 time slot ratio, there are a maximum of 6 SSB candidate positions within 5ms. If the format of this SS / PBCH block can be extended to support operator spectrum, the SS / PBCH block frequency division orthogonal scheme can support 78 nodes to send an SSB once within 5ms. As shown in Figure 15, the SS / PBCH block sent by node 0 is at the position of SSB index 0 in the frequency domain and f0 in the time domain, the SS / PBCH block sent by node 1 is at the position of SSB index 0 in the frequency domain and f1 in the time domain, and so on. The SS / PBCH block sent by node 12 is at the position of SSB index 0 in the frequency domain and f1 in the time domain. 12 The time domain is the position of SSB index 0, the SS / PBCH block sent by node 13 is at the position of SSB index 1 in the frequency domain, the SS / PBCH block sent by node 14 is at the position of SSB index 1 in the frequency domain, and so on. The SS / PBCH block sent by node 25 is at the position of SSB index 1 in the frequency domain. 12The SS / PBCH block sent by node 26 is at the position of SSB index 1 in the time domain, the SS / PBCH block sent by node 26 is at the position of SSB index 2 in the frequency domain, the SS / PBCH block sent by node 27 is at the position of SSB index 2 in the frequency domain, and so on. The SS / PBCH block sent by node 77 is at the position of SSB index 2 in the frequency domain. 12 The time domain is the position of SSB index 5.
[0253] As shown in Figure 16, it is a schematic diagram of another example of frequency division orthogonal transmission of SS / PBCH blocks provided in an embodiment of the present application. Assuming that 6 SS / PBCH blocks are supported for frequency division orthogonal transmission within the system bandwidth, 12 nodes are supported to send SS / PBCH blocks 3 times each within 5ms.
[0254] Since nodes 0 to 5 are frequency-division multiplexed and nodes 6 to 11 are frequency-division multiplexed when the SS / PBCH block is first sent, nodes 0 to 5 cannot measure each other, and nodes 6 to 11 cannot measure each other. To support mutual measurement between nodes, different node combinations need to be transformed in the time domain to send SS / PBCH blocks at the same time domain position. The node combination transformation method is shown in Table 3:
[0255] Table 3 Node combination table
[0256] That is, the period of the SS / PBCH block is configured to be 10ms, including 2 half-frames. Figure 16 only illustrates the schematic diagram of the frequency division orthogonal transmission of the SS / PBCH block within 5ms. Within this 10ms, the time-frequency domain positions of each node sending the SS / PBCH are staggered according to their respective node identifiers: the offset of the half-frame where the node resource position is located within the period of the SS / PBCH block is The index of the SS / PBCH block in the half frame is The center frequency position of each SS / PBCH block is Specifically, nodes 0 to 5 send SS / PBCH blocks at SSB index0 in the 0th half frame, nodes 6 to 11 send SS / PBCH blocks at SSB index1 in the 0th half frame, nodes 11 to 4 send SS / PBCH blocks at SSB index2 in the 0th half frame, nodes 5 to 10 send SS / PBCH blocks at SSB index3 in the 0th half frame, nodes 10 to 3 send SS / PBCH blocks at SSB index4 in the 0th half frame, and nodes 4 to 9 send SS / PBCH blocks at SSB index5 in the 0th half frame; nodes 9 to 2 send SS / PBCH blocks at SSB index0 in the 1st half frame, nodes 3 to 8 send SS / PBCH blocks at SSB index1 in the 1st half frame, nodes 8 to 1 send SS / PBCH blocks at SSB index2 in the 1st half frame, nodes 2 to 7 send SS / PBCH blocks at SSB index3 in the 1st half frame, and nodes 7 to 0 send SS / PBCH blocks at SSB index Index 4 sends the SS / PBCH block, and nodes 1 to 6 send the SS / PBCH block at SSB index 5 in the first half frame. This supports mutual measurement between 12 nodes.
[0257] In addition, these 12 nodes can complete the cell search within the 0th half frame, and it only takes 5ms to complete the cell search.
[0258] As shown in Figure 17, another example of frequency-division orthogonal transmission of SS / PBCH blocks provided in an embodiment of the present application is shown. Taking 30kHz SCS as an example, the position of the first symbol in the candidate positions of the SS / PBCH block within every 5ms is {2,8}+14·nn=0,1,2,3,4,5,6,7,8,9. Assuming that the system bandwidth supports 8 SS / PBCH blocks for frequency-division orthogonal transmission, 10ms supports 96 nodes, each transmitting an SS / PBCH block once. Figure 17 illustrates a schematic diagram of frequency-division orthogonal transmission of 48 nodes within 5ms, and the frequency-division orthogonal transmission of the remaining nodes is similar.
[0259] Since nodes 0 to 7 cannot measure each other when the SS / PBCH block is sent for the first time (similar problems exist for other nodes), different node combinations need to be transformed in the time domain to send the SS / PBCH block at the same time domain position. The node combination transformation method is shown in Table 4:
[0260] Table 4 Node combination table
[0261] That is, the period of the SS / PBCH block is configured to be 80ms, which includes 16 half-frames. Within this 80ms, the time-frequency domain positions of each node sending SS / PBCH are staggered according to their respective node identifiers: the offset of the half-frame where the node resource location is located within the period of the SS / PBCH block is The index of the SS / PBCH block in the half frame is The center frequency position of each SS / PBCH block is Therefore, mutual measurement between 96 nodes can be supported.
[0262] In addition, these 96 nodes can complete the cell search within the 0th half frame and the 1st half frame, and it only takes 10ms to complete the cell search.
[0263] As can be seen from the above example, by frequency division multiplexing between the resource locations of the nodes and transforming different node combinations in the time domain to send SS / PBCH blocks at the same time domain location, more candidate locations of SS / PBCH blocks can be supported, and fast measurement of multiple nodes can be achieved while avoiding interference between signals.
[0264] According to a communication method provided in an embodiment of the present application, the first resource location where the first node sends the first signal is frequency-division multiplexed with the second resource location where the second node sends the second signal, and the first resource location is associated with the identifier of the first node, and the second resource location is associated with the identifier of the second node, thereby realizing rapid measurement of multiple nodes and avoiding interference between signals.
[0265] The above embodiments respectively describe the time division multiplexing and frequency division multiplexing schemes between multiple nodes. The following embodiments will describe how time and frequency division multiplexing can also be used between multiple nodes to further reduce the measurement delay between multiple nodes and avoid interference between signals.
[0266] The first signal, the second signal, the third signal and the fourth signal described in the following embodiments are all described using the SS / PBCH block as an example. Of course, the present application does not limit this and other signals may also be used.
[0267] FIG18 is a flow chart of another communication method provided in an embodiment of the present application. Exemplarily, the method may include the following steps:
[0268] S1801. The first node determines a first resource location.
[0269] As described in the background technology, the SS / PBCH block can be used for cell search, measurement for mobility management, etc. In this embodiment, the SS / PBCH block can be divided into two categories: one for cell search, and the other for inter-node discovery or measurement (inter-node discovery and measurements). Hereinafter, the description is based on inter-node measurement, which can be replaced by inter-node discovery, or, inter-node discovery and measurement.
[0270] The first node transmits an SS / PBCH block at a first resource location for a cell search of a UE served by the first node, and the second node transmits an SS / PBCH block at a second resource location for a cell search of a UE served by the second node. When a node transmits an SS / PBCH block for a cell search, there is no need to consider the problem of unmeasurable inter-node communication. Therefore, the first resource location and the second resource location can be frequency-division multiplexed.
[0271] When the first resource location and the second resource location are frequency-division multiplexed, the determination of their resource locations can be referenced to the description of the embodiment shown in FIG11 and will not be repeated here. However, unlike the embodiment shown in FIG11 , there is no need to consider the issue of transforming different node combinations in the time domain between nodes. The first resource location and the second resource location have the same time domain location. S1802. The first node sends a first signal at the first resource location.
[0272] The first signal is used for cell search, and the UE served by the first node receives the first signal and completes the cell search.
[0273] S1803. The second node determines a second resource location and sends a second signal at the second resource location.
[0274] The second signal is used for cell search, and the UE served by the second node receives the second signal and completes the cell search.
[0275] S1804. The first node determines the location of the third resource.
[0276] The first node may further send SS / PBCH blocks to enable mutual measurement between nodes.
[0277] For example, in this embodiment, the second node may be the next-hop node of the first node, and the second node may receive the SS / PBCH block sent by the first node and perform measurements. Therefore, the third resource location and the fourth resource location may be time-division multiplexed, with the fourth resource location being used by the second node to transmit the fourth signal. The third resource location is associated with the identifier of the first node, and the fourth resource location is associated with the identifier of the second node.
[0278] The node identifier, such as the identifier of the first node or the second node, may be a node identifier or a physical cell identifier (PCI).
[0279] When the third resource location and the fourth resource location are time-division multiplexed, the determination of their resource locations may refer to the description of the embodiments or examples shown in FIG. 7 to FIG. 10 , and will not be repeated here.
[0280] S1805. The first node sends a third signal at a third resource location.
[0281] S1806. The second node determines a fourth resource location and sends a fourth signal at the fourth resource location.
[0282] Among them, the SS / PBCH block used for cell search, that is, SSB, the half-frame offset of SSB can be based on the node identification, the number of nodes N that support orthogonality in the frequency domain f,cell and the number of SSBs used for cell search in each half frame L1, that is, the number of nodes N that are orthogonal to the node identification and frequency domain support f,cell Associated with the number of SSBs used for cell search in each half frame L1, or the node identifier, the number of nodes N that support orthogonality in the frequency domain f,cell And the function of the number of SSBs used for cell search in each half frame L1, for example, the half-frame offset of SSB can be expressed as The SSB index can be based on the node identification and the number of nodes N that support orthogonality in the frequency domain. f,cell , the number of SSBs used for cell search in each half frame L1, that is, the number of nodes N that are orthogonal to the node identification and frequency domain support f,cell , the number of SSBs used for cell search in each half frame L1 is associated, or, the node identifier, the number of nodes N that support orthogonality in the frequency domain f,cell And the function of the number of SSBs L1 used for cell search in each half frame, for example, SSB index can be expressed as The SSB center frequency position can be based on the cell identifier, for example, it can be expressed as PCI%N f,cell .
[0283] The SSB used for mutual measurement between nodes, the half-frame offset of the SSB can be based on the node identification, the number of SSBs used for cell search in each half-frame L1, the number of candidate SSBs in each half-frame L max , that is, the node identifier, the number of SSBs used for cell search in each half frame L1, the number of candidate SSBs in each half frame L max Associated, or, for the node identifier, the number of SSBs used for cell search in each half frame L1, the number of candidate SSBs in each half frame Lmax For example, the half-frame offset of SSB can be expressed as The SSB index can be based on the node identity, the number of SSBs used for cell search in each half frame L1, the number of candidate SSBs in each half frame L max , that is, the node identifier, the number of SSBs used for cell search in each half frame L1, the number of candidate SSBs in each half frame L max Associated, or, for the node identifier, the number of SSBs used for cell search in each half frame L1, the number of candidate SSBs in each half frame L max function, such as SSB index can be expressed as PCI% (L max -L1)+1 or
[0284] Among them, for example, L max It is determined based on the time domain position of the SS / PBCH block defined by the protocol, the subframe format of the current system configuration, or the uplink and downlink ratio of the current system configuration; or it is a predefined or configured value.
[0285] The solution of this embodiment is further described in detail below through several examples:
[0286] As shown in Figure 19, it is a schematic diagram of an example of time-frequency orthogonal transmission of SS / PBCH blocks provided in an embodiment of the present application. Each SS / PBCH block occupies 20 RBs of frequency domain resources. Taking 100M system bandwidth and 30kHz SCS as an example, the system broadband supports SS / PBCH blocks of up to 13 nodes for frequency division orthogonality. In the time domain, assuming that the current system is an operator spectrum, but the protocol's position specification for SS / PBCH blocks in non-operator spectrum can be used, taking 30kHz SCS as an example, the position of the first symbol in the SS / PBCH block candidate position within every 5ms is {2,8}+14·nn=0,1,2,3,4,5,6,7,8,9. If the current system is an operator spectrum, the SS / PBCH block can be sent at the above position. Similarly, where D slot supports 2 SS / PBCH blocks and S slot supports 1 SS / PBCH block, under the TDD 2:3 time slot ratio, there are a maximum of 6 SS / PBCH block candidate positions within 5ms.
[0287] Among them, within 5ms, 10 nodes (nodes 0 to 9) can each send an SS / PBCH block for cell search. For example, the SS / PBCH block sent by node 0 is at the position of SSB index 0 in the frequency domain f0 and time domain, the SS / PBCH block sent by node 1 is at the position of SSB index 0 in the frequency domain f1 and time domain, and so on. The SS / PBCH block sent by node 9 is at the position of SSB index 0 in the frequency domain f9 and time domain. Therefore, the period of the SS / PBCH block used for cell search is 5ms, and the offset of the half frame where the node resource position is located in the SS / PBCH block period is The index of the SS / PBCH block in the half frame is The center frequency position of each SS / PBCH block is PCI%10.
[0288] The number of candidate positions of SS / PBCH blocks in a half frame determined based on the time domain position of the SS / PBCH blocks defined by the protocol, the subframe format of the current system configuration, or the uplink and downlink ratio of the current system configuration within 5ms is 6, that is, L max =6, then it supports 5 nodes, that is, L max -L1=6-1=5, each node sends an SS / PBCH block once for mutual measurement between nodes, supporting mutual measurement between 10 nodes with a period of 10ms. That is, the period of the SS / PBCH block is configured to be 10ms, including 2 half-frames. Within this 10ms, the time-frequency domain positions of each node sending SS / PBCH are staggered according to their respective node identifiers: the offset of the half-frame where the node resource position is located within the period of the SS / PBCH block is The index of the SS / PBCH block within a half-frame is PCI%(6-1)+1; the center frequency position of each SS / PBCH block is the same. Therefore, mutual measurement between 10 nodes can be supported. Specifically, nodes 0, 1, ..., and 4 transmit SS / PBCH blocks at SSB index 1, SSB index 2, ..., and SSB index 5 in the 0th half-frame, respectively; nodes 5, 6, ..., and 9 transmit SS / PBCH blocks at SSB index 1, SSB index 2, ..., and SSB index 5 in the 1st half-frame, respectively.
[0289] To support large-scale node networking, Figure 20 shows a schematic diagram of an example of time-frequency orthogonal transmission of SS / PBCH blocks provided in an embodiment of the present application. This example uses a 30kHz SCS and the position of the first symbol in the SS / PBCH block candidate position within every 5ms as {2,8}+14·nn=0,1,2,3,4,5,6,7,8,9. Within 5ms, 24 nodes (nodes 0 to 23) can be supported to send SS / PBCH blocks once for cell search: for example, the SS / PBCH block sent by node 0 is at the position of SSB index 0 in the frequency domain f0 and the time domain, the SS / PBCH block sent by node 1 is at the position of SSB index 0 in the frequency domain f1 and the time domain, and so on. The SS / PBCH block sent by node 7 is at the position of SSB index 0 in the frequency domain f7 and the time domain; the SS / PBCH block sent by node 8 is at the position of SSB index 2 in the frequency domain f0 and the time domain, the SS / PBCH block sent by node 9 is at the position of SSB index 2 in the frequency domain f1 and the time domain, and so on. The SS / PBCH block sent by node 15 is at the position of SSB index 2 in the frequency domain f7 and the time domain, the SS / PBCH block sent by node 16 is at the position of SSB index 4 in the frequency domain f0 and the time domain, and the SS / PBCH block sent by node 17 is at the position of SSB index 1 in the frequency domain f1 and the time domain. 4, and so on. The SS / PBCH block sent by node 23 is at position f7 in the frequency domain and at position SSB index 4 in the time domain.
[0290] The number of candidate positions of SS / PBCH blocks within a half frame determined based on the configuration within 5ms is 6, i.e., L max =6, then it supports 3 nodes, namely L max - L1 = 6 - 3 = 3, each node sends an SS / PBCH block once for mutual measurement between nodes.
[0291] If the maximum number of nodes in the network is 96, then within 20ms, all 96 nodes can send a SS / PBCH block for cell search. The offset of the half frame where the node resource location is located within the SS / PBCH block period is That is, 4 half-frames are required for 96 nodes to send SS / PBCH blocks once for cell search, and each half-frame can support 24 nodes to send SS / PBCH blocks once for cell search; the index of the SS / PBCH block in the half-frame is The center frequency position of each SS / PBCH block is PCI%8.
[0292] Within 160ms, 96 nodes are supported to send SS / PBCH blocks once for mutual measurement between nodes. The measurement period between 96 nodes is 160ms. That is, the period of SS / PBCH block is 160ms, including 32 half-frames. Within this 160ms, the time-frequency domain positions of SS / PBCH sent by each node are staggered according to their respective node identifications: the offset of the half-frame where the node resource position is located within the period of SS / PBCH block is The index of the SS / PBCH block in the half frame is (PCI%(6-3))×2+1; the center frequency position of each SS / PBCH block is the same. Therefore, mutual measurement between 160 nodes can be supported. Specifically, node 0, node 1, and node 2 send SS / PBCH blocks at SSB index 1, SSB index 3, and SSB index 5 in the 0th half frame respectively; node 3, node 4, and node 5 send SS / PBCH blocks at SSB index 1, SSB index 3, and SSB index 5 in the 1st half frame respectively; and so on; node 93, node 94, and node 95 send SS / PBCH blocks at SSB index 1, SSB index 3, and SSB index 5 in the 31st half frame respectively.
[0293] According to a communication method provided in an embodiment of the present application, SS / PBCH blocks are sent orthogonally in frequency division between multiple nodes for cell search, thereby improving resource utilization; SS / PBCH blocks are sent orthogonally in time division between multiple nodes for mutual measurement between nodes, which can avoid interference from neighboring cell signals during SS / PBCH block measurement and reduce the delay of multi-node measurement.
[0294] In this application, "sending information to... (for example, the first node)" or the related illustrations in the accompanying drawings can be understood as the destination end of the information being the first node. It can include sending information to the first node directly or indirectly. "Receiving information from... (for example, the first node)" or "receiving information from... (for example, the first node)", or the related illustrations in the accompanying drawings can be understood as the source end of the information being the first node, which can include receiving information from the first node directly or indirectly. The information may be processed as necessary between the source end and the destination end of the information transmission, such as format changes, etc., but the destination end can understand the valid information from the source end. Similar expressions in this application can be understood similarly and will not be repeated here.
[0295] The communication method provided by the embodiment of the present application is described in detail above. It is understandable that the present application uses the first node and the second node as the execution subject of the interactive schematic as an example for illustration, but the present application does not limit the execution subject of the interactive schematic. For example, the first node in the method provided by the present application may also be a chip, a chip system, or a processor applied to the first node, or a logical node, a logical module, or software that can implement all or part of the first node; the second node in the method provided by the present application may also be a chip, a chip system, or a processor applied to the second node, or a logical node, a logical module, or software that can implement all or part of the functions of the second node.
[0296] It can be understood that in the above embodiments, the methods and / or steps implemented by the first node can also be implemented by components (such as chips or circuits) that can be used for the first node; the methods and / or steps implemented by the second node can also be implemented by components (such as chips or circuits) that can be used for the second node.
[0297] The above description mainly describes the solutions provided by the embodiments of the present application from the perspective of interaction between various nodes. Accordingly, the embodiments of the present application also provide a communication device, which is used to implement the various methods described above. The communication device can be the first node in the above method embodiments, or a component that can be used for the first node; alternatively, the communication device can be the second node in the above method embodiments, or a component that can be used for the second node. It will be understood that in order to implement the above functions, the communication device includes hardware structures and / or software modules corresponding to performing each function. Those skilled in the art will readily appreciate that, in combination with the various exemplary units and algorithm steps described in the embodiments disclosed herein, the present application can be implemented in hardware or a combination of hardware and computer software. Whether a function is implemented in hardware or in a hardware-driven manner by computer software depends on the specific application and design constraints of the technical solution. Professionals and technicians may use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.
[0298] In the embodiment of the present application, the functional modules of the communication device can be divided according to the above method embodiment. For example, each functional module can be divided according to each function, or two or more functions can be integrated into one processing unit. The above integrated modules can be implemented in the form of hardware or in the form of software functional modules. It should be noted that the division of modules in the embodiment of the present application is schematic and is only a logical functional division. In actual implementation, there may be other division methods.
[0299] Based on the same concept of the above communication method, the present application also provides the following communication device:
[0300] As shown in FIG21 , a schematic diagram of the structure of a communication device provided in an embodiment of the present application is shown. The communication device 2100 includes a transceiver unit 2101 and a processing unit 2102; wherein:
[0301] When the communication device is used to implement the function of the first node in the above-mentioned method embodiment, the processing unit 2102 is used to perform the operation of S701 in the embodiment as shown in Figure 7, and the transceiver unit 2101 is used to perform the operation of the first node in S702 in the embodiment as shown in Figure 7; or, the processing unit 2102 is used to perform the operation of the first node in S1101 in the embodiment as shown in Figure 11, and the transceiver unit 2101 is used to perform the operation of the first node in S1102 in the embodiment as shown in Figure 11; or, the processing unit 2102 is used to perform the operations of S1801 and S1804 in the embodiment as shown in Figure 18, and the transceiver unit 2101 is used to perform the operations of the first node in S1802 and S1805 in the embodiment as shown in Figure 18.
[0302] When the communication device is used to implement the function of the second node in the above-mentioned method embodiment, the transceiver unit 2101 is used to perform the operation of the second node in S702 in the embodiment as shown in Figure 7, and the processing unit 2102 is used to perform the operation of S703 in the embodiment as shown in Figure 7; or, the processing unit 2102 is used to perform the operation of S1103 in the embodiment as shown in Figure 11; or, the processing unit 2102 is used to perform the processing operation of the second node in S1803 and S1806 in the embodiment as shown in Figure 18, and the transceiver unit 2101 is used to perform the receiving operation of the second node in S1802 and S1805 and the sending operation of the second node in S1803 and S1806 in the embodiment as shown in Figure 18.
[0303] For the specific implementation of the above-mentioned transceiver unit 2101 and the processing unit 2102, reference may be made to the description in the above-mentioned method embodiment.
[0304] As shown in Figure 22, a schematic diagram of the structure of another communication device provided in an embodiment of the present application is shown. The communication device 2200 includes a processing circuit 2201, which includes one or more processors, or a processing portion of one or more processors. The processing circuit is used to perform the processing operations of the first node or the second node in the aforementioned method embodiment.
[0305] Optionally, the communication device 2200 may further include a memory 2203 (indicated by a dotted line in the figure). The memory 2203 is used to store instructions executed by the processing circuit 2201, or to store input data required by the processing circuit 2201 to execute instructions, or to store data generated after the processing circuit 2201 executes instructions. The memory 2203 may be located within the processing circuit or outside the processing circuit.
[0306] Optionally, the communication device 2200 may further include a transceiver circuit 2202 (indicated by a dashed line in the figure), and the processing circuit 2201 and the transceiver circuit 2202 are coupled to each other. It is understood that the transceiver circuit 2202 may be a transceiver, such as when the transceiver circuit 2202 is located in a communication device, such as a network device, or an interface circuit, such as when the transceiver circuit 2202 is located in a chip or module for the communication device. The processing circuit 2201 is used to implement the functions of the processing unit 2102 in the embodiment shown in FIG. 21 , and the transceiver circuit 2202 is used to implement the functions of the transceiver unit 2101 in the embodiment shown in FIG. 21 .
[0307] When the communication device is a chip implemented in the first node, the chip implements the functions of the first node in the method embodiment. The chip receives information from other modules (such as a radio frequency module or antenna) in the first node, where the information is sent from the second node to the first node; or the chip sends information to other modules (such as a radio frequency module or antenna) in the first node, where the information is sent from the first node to the second node.
[0308] When the communication device is a chip implemented in the second node, the chip implements the functions of the second node in the method embodiment. The chip receives information from other modules (such as a radio frequency module or antenna) in the second node, where the information is sent from the first node to the second node; or the chip sends information to other modules (such as a radio frequency module or antenna) in the second node, where the information is sent from the second node to the first node.
[0309] In addition, it should be noted that the aforementioned transceiver unit and / or processing unit may be implemented through virtual modules, for example, the processing unit may be implemented through a software function unit or a virtual device, and the transceiver unit may be implemented through a software function or a virtual device. Alternatively, the processing unit or transceiver unit may also be implemented through a physical device, for example, if the device is implemented using a chip / chip circuit, the transceiver unit may be an input / output circuit and / or a communication interface, performing input operations (corresponding to the aforementioned receiving operations) and output operations (corresponding to the aforementioned sending operations); the processing unit is an integrated processor or microprocessor or integrated circuit.
[0310] The division of modules in this application is illustrative and represents only a logical functional division. In actual implementation, other division methods may be used. Furthermore, the functional modules in the examples of this application may be integrated into a single processor, exist physically as separate modules, or two or more modules may be integrated into a single module. The aforementioned integrated modules may be implemented in either hardware or software functional modules.
[0311] It is understood that the processor in the embodiments of the present application may be a central processing unit (CPU), or may be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field programmable gate arrays (FPGA), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. The general-purpose processor may be a microprocessor or any conventional processor.
[0312] An embodiment of the present application further provides a computer-readable storage medium, in which a computer program or instruction is stored. When the computer program or instruction is executed, the method in the above embodiment is implemented.
[0313] An embodiment of the present application further provides a computer program product comprising instructions, which, when executed on a computer, enables the computer to execute the method in the above embodiment.
[0314] An embodiment of the present application also provides a communication system, including the above-mentioned communication device.
[0315] The present application also provides a circuit, which is coupled to a memory and is used to execute the method shown in the above embodiment. The circuit may include a chip circuit.
[0316] When the above-mentioned communication device is a module applied to a base station, the base station module implements the functions of the base station in the above-mentioned method embodiment. The base station module receives information from other modules in the base station (such as a radio frequency module or an antenna), and the information is sent by the first node to the base station; or, the base station module sends information to other modules in the base station (such as a radio frequency module or an antenna), and the information is sent by the base station to the first node. The base station module here can be a baseband chip of a base station, or a CU, DU or other module, or a device under an open radio access network (O-RAN) architecture, such as an open CU, open DU or other devices.
[0317] It should be noted that the above units or one or more of the units can be implemented by software, hardware, or a combination of the two. When any of the above units or units is implemented by software, the software exists in the form of computer program instructions and is stored in a memory, and a processor can be used to execute the program instructions and implement the above method flow.
[0318] In this application, a processor may be a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, or all or part of the circuitry in the aforementioned devices used to implement processing functions, which may implement or execute the various methods, steps, and logic block diagrams disclosed in this application. A general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the methods disclosed in this application may be directly implemented as being executed by a hardware processor, or may be executed by a combination of hardware and software modules in the processor.
[0319] When the above units or units are implemented in hardware, the hardware can be any one or any combination of a CPU, a general process unit (GPU), a microprocessor, a digital signal processing (DSP) chip, a microcontroller unit (MCU), an artificial intelligence processor, an ASIC, a system on a chip (SoC), an FPGA, a programmable logic device (PLD), a dedicated digital circuit, a hardware accelerator or a non-integrated discrete device, which can run the necessary software or not rely on the software to execute the above method flow.
[0320] Optionally, an embodiment of the present application further provides a chip system, comprising: at least one processor and an interface, wherein the at least one processor is coupled to a memory via the interface, and when the at least one processor executes a computer program or instruction in the memory, the chip system executes the method in any of the above method embodiments. Optionally, the chip system may be composed of a chip, or may include a chip and other discrete devices, which is not specifically limited in the embodiments of the present application.
[0321] The memory in the present application may also be a circuit or any other device capable of implementing a storage function for storing program instructions and / or data. A memory is any other medium that can be used to carry or store a desired program code in the form of an instruction or data structure and can be accessed by a computer, but is not limited thereto. For example, the memory may be a non-volatile memory, such as a digital versatile disc (DVD), a hard disk drive (HDD), or a solid-state drive (SSD), or a volatile memory, such as a random-access memory (RAM).
[0322] It should be understood that in the description of this application, unless otherwise specified, " / " indicates that the objects associated with each other are in an "or" relationship. For example, A / B can mean A or B; where A and B can be singular or plural. Also, in the description of this application, unless otherwise specified, "multiple" means two or more than two. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, or c can mean: a, b, c, ab, ac, bc, or abc, where a, b, and c can be single or plural. In addition, to facilitate the clear description of the technical solutions of the embodiments of this application, in the embodiments of this application, words such as "first" and "second" are used to distinguish between identical or similar items with substantially the same functions and effects. Those skilled in the art will understand that words such as "first" and "second" do not limit the quantity or execution order, and words such as "first" and "second" do not necessarily mean different. At the same time, in the embodiments of this application, words such as "exemplary" or "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design described as "exemplary" or "for example" in the embodiments of this application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Rather, the use of words such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner to facilitate understanding.
[0323] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using a software program, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the process or function described in the embodiment of the present application is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions can be transmitted from one website, computer, server or data center to another website, computer, server or data center via wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means.
[0324] Although the present application is described herein in conjunction with various embodiments, in the process of implementing the claimed application, those skilled in the art can understand and implement other changes to the disclosed embodiments by reviewing the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other components or steps, and "a" or "an" does not exclude multiple situations. A single processor or other unit can implement several functions listed in the claims. Certain measures are recorded in different dependent claims, but this does not mean that these measures cannot be combined to produce good results.
[0325] It is understood that the various numbers used in the embodiments of this application are merely for ease of description and are not intended to limit the scope of the embodiments of this application. The order of the sequence numbers of the above-mentioned processes does not necessarily imply a specific order of execution; the order of execution of the processes should be determined by their functions and inherent logic.
[0326] In the above embodiments, the description of each embodiment has its own focus. For parts that are not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.
[0327] The components in the device of the embodiment of the present application can be merged, divided, or deleted according to actual needs. Those skilled in the art can combine or combine the different embodiments and features of the different embodiments described in this specification.
[0328] In this application, under the premise of no logical contradiction, the examples can reference each other, for example, the methods and / or terms between method embodiments can reference each other, for example, the functions and / or terms between device embodiments can reference each other, for example, the functions and / or terms between device examples and method examples can reference each other.
Claims
1. A communication method, characterized in that: The method is performed by a first node or a chip or a circuit used for the first node, and includes: Determine a first resource position for the first node to send a first signal, the first resource position is time-division multiplexed and / or frequency-division multiplexed with a second resource position, the second resource position is used for the second node to send a second signal, the first resource position is associated with an identifier of the first node, and the second resource position is associated with an identifier of the second node; The first signal is sent at the first resource location.
2. The method according to claim 1, characterized in that The second resource position is time-division multiplexed with the first resource position, and the first signal and the second signal are used for cell search.
3. The method according to claim 1 or 2, characterized in that The second resource location is time division multiplexed with the first resource location, and the method further includes: receiving the second signal at the second resource location.
4. The method according to claim 1, characterized in that The second resource position is frequency-division multiplexed with the first resource position, the first signal and the second signal are used for cell search, and the method further includes: A third signal is sent at a third resource location, wherein the third signal is used for the first node and the second node to measure each other, the third resource location is time-division multiplexed with a fourth resource location, the fourth resource location is used for the second node to send a fourth signal, the third resource location is associated with an identifier of the first node, and the fourth resource location is associated with an identifier of the second node.
5. A communication method, characterized in that: The method is performed by a second node or a chip or a circuit for the second node, and includes: Determine a second resource position for the second node to send a second signal, the second resource position is time-division multiplexed with the first resource position, the first resource position is used for the first node to send the first signal, the first resource position and the second resource position are located in a half frame, the first resource position is associated with an identifier of the first node, and the second resource position is associated with an identifier of the second node; receiving the first signal at the first resource location; The second signal is sent at the second resource location.
6. The method according to claim 5, characterized in that The second resource position is time-division multiplexed with the first resource position, and the first signal and the second signal are used for cell search.
7. A communication method, characterized in that: The method is performed by a second node or a chip or a circuit for the second node, and includes: Determine a second resource location for the second node to send a second signal, the second resource location is frequency-division multiplexed with a first resource location, the first resource location is used for the first node to send a first signal, the first resource location is associated with an identifier of the first node, and the second resource location is associated with an identifier of the second node; The second signal is sent at the second resource location.
8. The method according to claim 7, characterized in that The second resource position is time-division multiplexed with the first resource position, and the first signal and the second signal are used for cell search.
9. The method according to any one of claims 1 to 8, characterized in that The second resource position is frequency-division multiplexed with the first resource position, and the first signal and the second signal are used for cell search and mutual measurement between nodes.
10. The method according to any one of claims 1 to 9, characterized in that The first resource position is associated with an offset of a half-frame where the first resource position is located within a period of the first signal and an index of the first signal within the half-frame, wherein the period includes at least one half-frame.
11. The method according to claim 10, characterized in that The first resource position is time-division multiplexed with the second resource position, and an offset of a half-frame where the first resource position is located within a period of the first signal is associated with an identifier of the first node and a number of candidate positions of the first signal within the half-frame; The index of the first signal in the half frame is associated with the identifier of the first node and the number of candidate positions of the first signal in the half frame.
12. The method according to claim 11, characterized in that An offset of the half frame where the first resource position is located within the period of the first signal, an identifier of the first node, and a number of candidate positions of the first signal in the half frame satisfy a first functional relationship; The index of the first signal in the half frame and the identifier of the first node, as well as the number of candidate positions of the first signal in the half frame satisfy a second functional relationship.
13. The method according to claim 11 or 12, characterized in that: or Among them, L max is the number of candidate positions of the first signal in the half frame, / represents division, Indicates rounding down; The index of the first signal in the half frame = the identifier of the first node % L max or (the first node's identifier + m)% L max ,% means remainder; Wherein, m is a natural number or an integer.
14. The method according to any one of claims 1 to 8, characterized in that The first resource position and the second resource position are frequency-division multiplexed, and an offset of a half-frame where the first resource position is located within a period of the first signal is associated with an identifier of the first node, a first parameter, a second parameter, a number of times the first signal currently being sent has been repeatedly sent within the period, and a number of candidate positions of the first signal within the half-frame; The index of the first signal in the half frame is associated with the identifier of the first node, the first parameter, the second parameter, the number of times the first signal currently being sent has been repeatedly sent in the period, and the number of candidate positions of the first signal in the half frame; The first parameter is predefined or configured, or is based on a predefined or configured third parameter, and the third parameter is an identifier of a plurality of nodes; The second parameter is predefined, or configured, or is based on a predefined or configured fourth parameter, the fourth parameter being system bandwidth.
15. The method according to claim 14, characterized in that The offset of the half frame where the first resource position is located within the period of the first signal satisfies a third functional relationship with the identifier of the first node, the first parameter, the second parameter, the number of times the first signal currently being sent has been repeatedly sent within the period, and the number of candidate positions of the first signal in the half frame; The index of the first signal within the half frame satisfies a fourth functional relationship with the identifier of the first node, the first parameter, the second parameter, the number of times the first signal currently being sent has been repeatedly sent within the period, and the number of candidate positions of the first signal within the half frame.
16. The method according to claim 14 or 15, characterized in that or or Wherein, r is the number of times the first signal currently being sent has been repeatedly sent within the period, and N cell is the total number of nodes, the N f,cell is the number of nodes supporting orthogonality in the frequency domain, the L max is the number of candidate positions of the first signal in the half frame, m is a natural number or an integer, and / represents division. Indicates rounding down. Indicates rounding up, and % indicates remainder.
17. The method according to any one of claims 14 to 16, characterized in that In different half frames within the cycle, there is at least one different second node among the plurality of second nodes frequency-division multiplexing with the first node.
18. The method according to any one of claims 1 to 17, characterized in that The number of candidate positions of the first signal within the half frame is associated with at least one of the carrier frequency and the subcarrier spacing, or is predefined or configured.
19. The method according to any one of claims 1 to 18, characterized in that The index of the first symbol in the candidate position of the first signal in the half frame is at least one of the following indexes: {2, 6, 10}+14*n; Wherein, when the subcarrier spacing corresponding to the first signal is 15kHz, n=0, 1, 2, 3, 4; When the subcarrier spacing corresponding to the first signal is 30 kHz, n=0, 1, 2, 3, 4, 5, 6, 7, 8, 9; When the subcarrier spacing corresponding to the first signal is 60 kHz, n=0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19; When the subcarrier spacing corresponding to the first signal is 120 kHz, n=0, 1, 2, 3, 4, ..., 39; When the subcarrier spacing corresponding to the first signal is 240 kHz, n=0, 1, 2, 3, 4,, ..., 79; When the subcarrier spacing corresponding to the first signal is 480 kHz, n=0, 1, 2, 3, 4, ..., 159; When the subcarrier spacing corresponding to the first signal is 960kHz, n=0,1,2,3,4,,…,319.
20. The method according to any one of claims 1 to 18, characterized in that The index of the first symbol in the candidate position of the first signal in the half frame is at least one of the following indices: {4}+4*n; Wherein, when the subcarrier spacing corresponding to the first signal is 15kHz, n=0, 1, 2, 3, 4, ..., 15; When the subcarrier spacing corresponding to the first signal is 30 kHz, n=0, 1, 2, 3, 4, ..., 33; When the subcarrier spacing corresponding to the first signal is 60 kHz, n=0, 1, 2, 3, 4, ..., 68; When the subcarrier spacing corresponding to the first signal is 120 kHz, n=0, 1, 2, 3, 4, ..., 138; When the subcarrier spacing corresponding to the first signal is 240 kHz, n=0, 1, 2, 3, 4, ..., 278; When the subcarrier spacing corresponding to the first signal is 480 kHz, n=0, 1, 2, 3, 4, ..., 558; When the subcarrier spacing corresponding to the first signal is 960kHz, n=0,1,2,3,4,…,1118.
21. The method according to any one of claims 1 to 18, characterized in that The index of the first symbol in the candidate position of the first signal in the half frame is at least one of the following indices: {2}+4*n; Wherein, when the subcarrier spacing corresponding to the first signal is 15kHz, n=0, 1, 2, 3, 4, ..., 16; When the subcarrier spacing corresponding to the first signal is 30 kHz, n=0, 1, 2, 3, 4, ..., 33; When the subcarrier spacing corresponding to the first signal is 60 kHz, n=0, 1, 2, 3, 4, ..., 68; When the subcarrier spacing corresponding to the first signal is 120 kHz, n=0, 1, 2, 3, 4, ..., 138; When the subcarrier spacing corresponding to the first signal is 240 kHz, n=0, 1, 2, 3, 4, ..., 278; When the subcarrier spacing corresponding to the first signal is 480 kHz, n=0, 1, 2, 3, 4, ..., 558; When the subcarrier spacing corresponding to the first signal is 960kHz, n=0,1,2,3,4,…,1118.
22. A communication device, characterized in that: The apparatus comprises means for performing the method of any one of claims 1-21.
23. A communication device, characterized in that: include: A processor, configured to execute a program stored in a memory, wherein when the program is executed, the device executes a method as claimed in any one of claims 1 to 21.
24. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program or instruction, and when the computer program or instruction is executed by a computer, the method according to any one of claims 1 to 21 is implemented.
25. A computer program product, characterized in that When a computer reads and executes the computer program product, the computer is enabled to execute the method according to any one of claims 1 to 21.
Citation Information
Patent Citations
Communication method, device and system and storage medium
CN119922569A
Techniques and apparatuses for configuring resources for synchronization in a wireless backhaul network
CN110720192A
System and method for control signaling
CN111201733A
Communication method and communication device
CN115104263A
Communication method and communication device
CN115942486A