WO2020191745A1 - Timing alignment method and device - Google Patents

Abstract

Provided in the present application are a timing alignment method and device, the method comprising: a relay node receiving first information and second information, the first information being used to indicate a first timing advance N_CTA, the second information being used to indicate a second timing advance TA, the second timing advance TA being used to determine the timing advance of uplink transmission by a relay node parent link relative to downlink reception, and the first timing advance N_CTA being a timing advance adjustment value; and according to the first timing advance N_CTA, the second timing advance TA and at least one preset timing offset N_{CTA_offset}, the relay node determining the downlink transmission timing advance t of the relay node. The present application can achieve the sending or receiving of a parent link and a child link at the same time within the same time period so as to achieve a frequency division multiplexing resource allocation mode.

Description

Method and device for timing alignment Technical field

This application relates to the field of communications, and more specifically, to a method and device for timing alignment.

Background technique

The deployment of base stations in overseas power markets is sparse, and about 10% of terminal devices cannot be directly connected to the network. Additional relay devices need to be deployed to enable power terminals to access the network through multi-hop. The wireless multi-hop technology is not the communication between the base station and the user equipment in the traditional sense, but the indirect communication between the base station and the user equipment is realized by means of one or more relay devices. Among them, the main feature of the relay device is The direct transmission path in the traditional sense can be divided into multiple short paths to transmit information. Both long term evolution (LTE) and new radio (NR) communication systems have their own multi-hop technologies, such as D2D relay in LTE and integrated access backhaul in NR (integrated access and backhaul, IAB) technology.

The evolved LTE discrete spectrum aggregation (eLTE-DSA) commercial solution helps global power companies build the "last mile" neural network of the power grid. Compared with traditional communication solutions, this solution can provide energy customers with higher rates , Lower latency, more terminal connections, and a wide range of access solutions with lower power consumption. The design of the eLTE frame structure is significantly different from the frame structure in LTE and NR. The above two types of multi-hop technologies cannot be directly applied to the eLTE-DSA multi-hop network. At present, in the eLTE-DSA multi-hop network, how to realize that the relay node simultaneously transmits or receives data of the parent link and the child link at the same time, so as to realize frequency division multiplexing (FDM) There is no specific timing solution for resource allocation.

Summary of the invention

The present application provides a method and device for timing alignment, which can achieve simultaneous transmission or reception of a parent link and a child link at the same time, thereby implementing a frequency division multiplexing resource allocation mode.

In a first aspect, a timing alignment method is provided, the method includes: a relay node receives first information and second information, the first information is used to indicate a first timing advance N _CTA , and the second information is used to indicate The second timing advance TA, the second timing advance TA is used to determine the timing advance of the uplink transmission relative to the downlink reception of the parent link of the relay node, the first timing advance N _CTA is the timing advance adjustment value; the relay The node determines the downlink transmission timing advance T of the relay node according to the first timing advance N _CTA , the second timing advance TA and at least one preset timing offset N _{CTA_offset} .

The embodiment of the application introduces the preset N _{CTA_offset} value, so that the relay node of eLTE-DSA can simultaneously send or receive the parent link and the child link at the same time, thereby realizing the frequency division multiplexing resource allocation method. Effectively realize the technical effects such as the alignment of the sending and receiving time of the same node, the alignment of frame boundaries and frame numbers at different levels, and minimize the timing synchronization system error and network interference.

Optionally, the first information and the second information may be sent to the relay node together through the same message, or may be sent to the relay node separately through two different messages, which is not limited in this application.

Optionally, the first information and/or the second information may be carried in a radio resource control message.

Optionally, the first information and/or the second information may be carried in a system message.

Optionally, a sum operation may be performed on the first timing advance N _CTA and the second timing advance TA, and the sum of the two is sent to the relay node.

Optionally, the parent node sends the first information and the second information to the relay node.

Optionally, the base station may also send the first information and the second information to the second node.

Optionally, the first information and the second information may be sent to the relay node by different devices. For example, one of the above two (for example, the first information) may be sent by the base station to the second node, and the other (for example, the second information) may be sent by the parent node to the relay node.

With reference to the first aspect, in some implementations of the first aspect, determining the downlink transmission timing advance T of the relay node includes: determining the downlink transmission timing advance T of the relay node according to the following formula: T=TA/ 2+N _CTA -N _{CTA_offset} .

With reference to the first aspect, in some implementations of the first aspect, at least one timing offset N _{CTA_offset} is a plurality of timing offsets N _{CTA_offset} , the method further includes: the relay node receives third information, and the third information It is used to indicate the target timing offset N _{CTA_offset} among the multiple timing offsets N _{CTA_offset} ; determining the downlink transmission timing advance T of the relay node includes: the relay node according to the first timing advance N _CTA , The second timing advance TA and the target timing offset N _{CTA_offset} determine the downlink transmission timing advance T. In the embodiment of the present application, different N _{CTA_offset} values used in different scenarios are designed at the same time, which can be freely selected in different scenarios, thereby avoiding the problem of frame number misalignment.

With reference to the first aspect, in some implementations of the first aspect, the absolute value of each of the at least one timing offset N _{CTA_offset} is less than or equal to the length of each transmission time interval.

With reference to the first aspect, in some implementations of the first aspect, the absolute value of each of the at least one timing offset N _{CTA_offset} is less than or equal to the length of the uplink time domain resource in each transmission time interval, and/ Or, the absolute value of each of the at least one timing offset N _{CTA_offset} is less than or equal to the length of the downlink time domain resource in each transmission time interval.

With reference to the first aspect, in some implementations of the first aspect, at least one timing offset N _{CTA_offset} includes X and Y, where the sum of the absolute value of X and the absolute value of Y is equal to the length of each transmission time interval .

With reference to the first aspect, in some implementations of the first aspect, the values of X and Y are: X, X=a+bc, where a is the length of downlink time domain resources in each transmission time interval, and b is The length of the guard interval between the downlink and uplink time domain resources in each transmission time interval, c is the difference between the start position of the uplink time domain resource allocated in the radio frame and the start position of the time domain resource used to transmit the uplink resource The time offset between N _TA-offset ; Y, Y=XZ, where Z is the number of Ts in each transmission time interval.

With reference to the first aspect, in some implementations of the first aspect, at least one timing offset N _{CTA_offset} is a plurality of timing offsets N _{CTA_offset} , and the method further includes: determining a plurality of timing offsets according to the hop information of the relay node The target timing offset N _{CTA_offset} in the timing offset N _{CTA_offset} ; determining the downlink transmission timing advance T of the relay node includes: the relay node according to the first timing advance N _CTA and the second timing advance TA and the target timing offset N _{CTA_offset} determine the downlink transmission timing advance T.

With reference to the first aspect, in some implementations of the first aspect, the method further includes: the relay node receives fourth information sent by the parent node; and the relay node determines the hop of the relay node according to the fourth information.数信息。 Number information.

With reference to the first aspect, in some implementations of the first aspect, the relay node determines the hop count information of the relay node according to the fourth information, including: if the fourth information does not include the hop count information of the parent node , The relay node is determined to be the next hop of the base station; if the fourth information includes the hop number information of the parent node, the hop number of the relay node is determined according to the hop number information of the parent node information.

Binding a first aspect, certain implementations of the first aspect, determining the plurality of timing offset of the target _N CTA_offset _N CTA_offset timing offset information comprising the number of hops:

Where the number of hops is the odd-hop relay nodes or even-hop timing offset is determined based on the plurality of _N CTA_offset target amount of timing offset _N CTA_offset.

Optionally, the fourth information may further include parity information of the hop count of the parent node, and the parity information of the relay node may be determined according to the parity information of the parent node.

Optionally, the fourth information may indicate the number of hops of the relay node in the multi-hop system.

Optionally, the fourth information may indicate whether the relay node is an odd hop or an even hop in a multi-hop system.

With reference to the first aspect, in some implementations of the first aspect, the third information is carried in at least one of the following messages: radio resource control messages, broadcast messages, and system messages.

With reference to the first aspect, in some implementations of the first aspect, the fourth information is carried in at least one of the following messages: radio resource control messages, broadcast messages, and system messages.

With reference to the first aspect, in some implementations of the first aspect, at least one of the first information and the second information is sent by the parent node or the base station of the relay node.

In the second aspect, a timing alignment device is provided, and the device has the function of implementing the method in the first aspect and any possible implementation manners thereof. The function can be realized by hardware, or by hardware executing corresponding software. The hardware or software includes one or more units corresponding to the above functions.

In the third aspect, this application provides a network device including a processor and a memory. The memory is used to store a computer program, and the processor is used to call and run the computer program stored in the memory, so that the network device executes the first aspect or the method in any possible implementation of the first aspect.

Optionally, the network device further includes a communication interface. The communication interface may be a transceiver or an input/output interface.

In a fourth aspect, the present application provides a computer-readable storage medium. The computer-readable storage medium stores computer instructions. When the computer instructions run on the computer, the computer executes the first aspect or any possible implementation of the first aspect. The method in the way.

In a fifth aspect, this application provides a chip including a processor. The processor is used to read and execute a computer program stored in the memory to execute the first aspect or the method in any possible implementation manner of the first aspect.

Optionally, the chip further includes a memory, and the memory and the processor are connected to the memory through a circuit or wire, and the memory is used to store a computer program.

Further optionally, the chip further includes a communication interface.

In a sixth aspect, this application also provides a computer program product. The computer program product includes computer program code. When the computer program code runs on a computer, the computer executes the first aspect or any possible implementation of the first aspect. Method in.

In a seventh aspect, the present application also provides a communication system, the system includes a relay node, and the relay node executes the foregoing first aspect or any one of the possible methods of the first aspect.

Description of the drawings

Fig. 1 is a schematic diagram of a wireless multi-hop network applicable to the technical solution of the present application.

Fig. 2 is a partial schematic diagram of a wireless multi-hop network applicable to the technical solution of the present application.

Figure 3 is a schematic diagram of the timing analysis of the downlink transmission of the IAB node in the NR system.

FIG. 4 is a schematic diagram of an example of the frame structure of eLTE-DSA.

Fig. 5 is a schematic flowchart of an example of a timing alignment method.

Fig. 6 is a schematic diagram of the downlink transmission timing analysis of the relay node provided by the present application.

FIG. 7 is an analysis diagram of an example of the downlink transmission timing of a relay node provided by the present application in eLTE-DSA.

FIG. 8 is an analysis diagram of another example of the downlink transmission timing of the relay node provided by the present application in eLTE-DSA.

Fig. 9 is a schematic flowchart of another example of a timing alignment method.

Fig. 10 is a schematic flowchart of another example of a timing alignment method.

Fig. 11 is a schematic structural block diagram of a timing alignment device provided by the present application.

Fig. 12 is a schematic structural diagram of a network device provided by the present application.

detailed description

The technical solution in this application will be described below in conjunction with the drawings.

The names of all nodes and messages in this application are only names set for the convenience of description. The names in the actual network may be different, and it should not be understood that this application limits the names of various nodes and messages. On the contrary, any name that has the same or similar function as the node or message used in this application is regarded as a method or equivalent replacement of this application, and is within the protection scope of this application, and will not be repeated hereafter.

The communication systems mentioned in the embodiments of this application include but are not limited to: narrowband-internet of things (NB-IoT) systems, wireless local access network (WLAN) systems, and long-term evolution (long term evolution, LTE) systems, fifth generation mobile networks (5th generation wireless systems, 5G) or post 5G communication systems, such as new radio (NR) systems, device to device (device to device, D2D) Communication system, etc.

Referring to FIG. 1, FIG. 1 is a schematic diagram of a wireless multi-hop network applicable to the technical solution of the present application. As shown in Figure 1, a multi-hop network includes at least one base station 100, and one or more terminal devices (terminal) 101, one or more relay nodes (RN) 110 served by the base station 100, and One or more terminal devices 111 served by the relay node 110. In Figure 1, the base station 100 and the relay node 110 are connected through a wireless link 113, the base station 100 and the terminal device 101 it serves are connected through the wireless link 102, and the relay node 110 and the terminal device 111 it serves are connected through a wireless link. Link 112 is connected.

The base station 100 includes, but is not limited to: evolved node B (evolved node base, eNB), radio network controller (RNC), node B (node B, NB), base station controller (base station controller, BSC) , Base transceiver station (base transceiver station, BTS), home base station (home evolved NodeB, or home node B, HNB), baseband unit (baseband Unit, BBU), evolved (evolved LTE, eLTE) base station, NR base station (next generation node B, gNB) etc.

Terminal equipment includes but is not limited to: user equipment (UE), mobile station, access terminal, user unit, user station, mobile station, remote station, remote terminal, mobile equipment, terminal, wireless communication equipment, user agent, Station (ST), cell phone, cordless phone, session initiation protocol (SIP) phone, wireless local loop (wireless local loop, WLL) station in wireless local area network (wireless local access network, WLAN) Personal digital assistant (PDA), handheld devices with wireless communication functions, computing devices, other processing devices connected to wireless modems, in-vehicle devices, wearable devices, mobile stations in the future 5G network, and public Any of the terminal devices in the public land mobile network (PLMN) network.

The relay node of the present application may be one of the above-mentioned base stations or terminal devices with a forwarding function, or may be an independent device form. For example, the relay node of the present application may also be called a transmission and reception point, a relaying TRP, etc. In the NR system, the relay node may be called an IAB node.

The multi-hop network shown in FIG. 1 may also include multiple other relay nodes, for example, the relay node 120 and the relay node 130. The relay node 120 is connected to the relay node 110 through a wireless link 123 to access the network. The relay node 130 is connected to the relay node 110 through a wireless link 133 to access the network. The relay node 120 serves one or more terminal devices 121 through the wireless link 122, and the relay node 130 serves one or more terminal devices 131 through the wireless link 132.

In the multi-hop network shown in Figure 1, a relay node is connected to an upper-level node. However, in the future relay system, in order to improve the reliability of the wireless backhaul link, a relay node, such as 120, can have multiple upper-level nodes serving a relay node at the same time, as shown in the relay in Figure 1. The node 130 may also be connected to the relay node 120 via a wireless link 134, that is, both the relay node 110 and the relay node 120 are regarded as the upper node of the relay node 130. In Figure 1, the wireless links 102, 112, 122, 132, 113, 123, 133, 134 may be bidirectional links, including uplink and downlink transmission links.

The wireless multi-hop network suitable for the technical solution of the present application will be further introduced below in conjunction with FIG. 2. Fig. 2 shows a partial schematic diagram of a wireless multi-hop network applicable to the technical solution of the present application.

In Figure 2, there are three relay nodes, namely the first node, the second node, and the third node. The first node is located at the upper level of the second node. The first node can be called the second node. The parent node (or referred to as the superior node) of, the wireless link between the first node and the second node is called the parent link of the second node. The third node is located at the next level of the second node. The third node can be called a child node of the second node (or called a lower-level node), and the wireless link between the third node and the second node can be called The child link of the second node. In addition, the foregoing first node may also be a base station, and the foregoing third node may also be a terminal device. As a possible way of existence, the foregoing first node, second node, and third node may be IAB nodes.

Figure 3 shows a schematic diagram of the timing analysis of the downlink transmission of the IAB node in the NR system. In order to facilitate the understanding of the technical solutions of the present application, the relevant content of the multi-hop technology in the LTE and NR communication systems will be introduced below in conjunction with FIGS. 2 and 3.

Taking the NR communication system as an example, in order to minimize network interference, it is necessary to align the downlink transmission time of the IAB nodes. For example, the downlink transmission time of the first node to the second node and the second node to the third node may be aligned. Under this premise, the first node can send a timing advance N _CTA to the second node. As shown in Figure 3, the downlink transmission timing advance of the second node is TA/2+N _CTA relative to the downlink reception timing. Among them, TA can be used to determine the timing advance of the uplink transmission of the parent link of the second node relative to the downlink reception. The generation of TA is caused by the transmission delay, and the value of the value is different from that between the first node and the second node. The physical distance is related, the greater the distance between the two, the greater the TA value. N _CTA is the timing advance adjustment value. In Figure 3, Ts represents the basic time unit, Ts=1/(15000*2048) second.

Fig. 4 shows a schematic diagram of a type of frame structure in eLTE-DSA.

In Figure 4, each eLTE-DSA radio frame has a length of 10 milliseconds (ms) and includes 5 time slots with a length of 2 ms, of which time slots slot#0 and slot#1 are allocated for the downlink (downlink, DL) transmission, slot#3, slot#4 are allocated for uplink (uplink, UL) transmission, between the allocated downlink resources and uplink resources is a special time slot slot#2, where special The time slot structure includes downlink pilot time slot (DwPTS), guard time slot GAP between uplink and downlink, and uplink pilot time slot (UpPTS).

Among them, the time slots slot#0 and slot#1 are used for downlink transmission, the time length of slot#0 and slot#1 is 240Ts, and the time length of the special time slot slot#2 including the downlink pilot time slot is 20Ts, so it can It is learned that the time length used for downlink transmission in each transmission time interval (TTI) is 240Ts+20Ts=260Ts. Similarly, time slots slot#3 and slot#4 are used for uplink transmission, where slot#4 used for uplink transmission is divided into UpPTS with time length T _UL =60T _s =4/3ms and time length T _GAP = 40T _s = 2/3ms GAP, so the time length used for uplink transmission in slot#3 and slot#4 is 240Ts-40Ts=200Ts, in addition, the time length of the uplink pilot time slot in the special time slot is 60Ts, The total time length used for uplink transmission in the first TTI is 200Ts+60Ts=260Ts.

For the IAB node of eLTE-DSA, in the resource allocation mode of frequency division multiplexing, the parent link and the child link need to be sent or received at the same time at the same time. It can be seen from the frame structure of Figure 4 that if The direct application of the method of aligning the downlink transmission timing of the IAB node in the NR to achieve the above effect will cause the indication value to be too large and waste signaling overhead.

The embodiment of the present application provides a method for timing alignment, which can realize that a relay node simultaneously transmits or receives data of a parent link and a child link at the same time, thereby realizing a frequency division multiplexing resource allocation mode.

FIG. 5 shows a schematic flowchart of a method 200 for timing alignment. The method 200 includes steps 210-240. The method 200 will be described below in conjunction with FIG. 5.

In the method 200, the first node, the second node, and the third node may be IAB nodes, the first node is the parent node of the second node, and the third node is the child node of the second node, where the first node may also It is a base station, and the third node may also be a terminal device, which will not be described in detail below.

In step 210, the second node receives first information sent by the first node, where the first information is used to indicate the first timing advance N _CTA .

In step 220, the second node receives second information sent by the first node, where the second information is used to indicate the second timing advance TA.

Wherein, the second timing advance TA is a timing advance that can be used to determine the uplink transmission of the parent link of the second node relative to the downlink reception. The first timing advance N _CTA is the timing advance adjustment amount.

The receiving point can control the time when the sent signal reaches the receiving point through TA to ensure that the receiving point can receive the signal more accurately. Different sending points have different distances to the same receiving point and different signal propagation times. The receiving point can configure different TAs for the above different sending points to control the time for each sending point to reach the receiving point.

Optionally, the first node may send the first information and the second information together to the second node through the same message, or may send to the second node separately through two different messages, which is not limited in this application .

Optionally, the first node may also perform a summation operation on the first timing advance N _CTA and the second timing advance TA, and send the sum of the two to the second node.

Optionally, the first information and/or the second information may be carried in a radio resource control (Radio Resource Control, RRC) message.

Optionally, the first information and/or the second information may be carried in a system message.

In addition, in steps 210 and 220, it is an optional step for the first node to send the first information and the second information to the second node. In other embodiments, the base station may also send the first information and the second information to the second node. To the second node, for example, a base station higher than the first node may send the first information and the second information to the second node through the first node or other nodes, and the first information and the second information may carry In the RRC message sent by the base station.

Optionally, the first information and the second information may be sent to the second node by different devices. For example, one of the above two (for example, the first information) may be sent by the base station to the second node, and the other (for example, the second information) may be sent by the first node to the second node.

In step 230, the second node determines the downlink transmission timing advance T of the second node according to the first timing advance N _CTA , the second timing advance TA and the preset timing offset N _{CTA_offset} .

Specifically, referring to the related introduction of Fig. 3 above, in order to achieve the alignment of the downlink transmission time of nodes at different levels, the downlink transmission timing of the second node is TA/2+N _CTA ahead of the downlink reception timing. However, considering To meet the resource allocation method of frequency division multiplexing, that is, in order to make the second node send the parent link and the child link at the same time, or simultaneously receive the parent link and the child link, the parent of the second node On the premise that the downlink transmission timing received by the link is fixed, the downlink transmission timing of the second node can be further adjusted, so that the time domain resources used by the second node's child link for downlink transmission and the parent link are used for The time domain resources sent upstream are aligned in time.

Based on the above analysis, on the basis that the downlink transmission timing of the second node is TA/2+N _CTA ahead of the downlink reception timing, the downlink transmission timing advance of the second node can continue to be adjusted, for example, based on the parent of the second node The receiving timing of the link is the reference point, and the downlink sending timing is continuously adjusted forward or backward, so that the second node simultaneously sends or receives the parent link and the child link at the same time. Fig. 6 shows a schematic diagram of the downlink transmission timing analysis of the relay node provided by the present application. As shown in FIG. 6, taking the receiving timing of the parent link of the second node as a reference point, the downlink transmission timing advance T of the second node can be calculated by the following formula: T=TA/2+N _CTA -N _{CTA_offset} .

Among them, N _{CTA_offset} is preset by the system. The value of N _{CTA_offset depends} on the amount of adjustment and whether it is adjusted forward or backward. The value can be positive, negative, or 0.

In addition, the value of N _{CTA_offset} can also be greater than the value of TA/2+N _CTA , that is, the timing advance T can be positive or negative. When T is a positive value, it indicates that the second node The downlink transmission timing is ahead of the downlink reception timing of the second node (that is, ahead of the reference point). When T is a negative value, it means that the downlink transmission timing of the second node is behind the downlink reception timing of the second node.

Optionally, the absolute value of the timing offset N _{CTA_offset} may be less than or equal to the length of each transmission time interval.

Optionally, the absolute value of the timing offset N _{CTA_offset} may be less than or equal to the length of the uplink time domain resource in each transmission time interval, and/or the absolute value of the timing offset N _{CTA_offset} may be less than or equal to each transmission The length of the downlink time domain resource in the time interval.

Optionally, the timing offset N _{CTA_offset} may be X or Y, where the sum of the absolute value of X and the absolute value of Y may be equal to the length of each transmission time interval.

Based on the above analysis, the value of N _{CTA_offset} can be different according to different frame structures. In order to realize the simultaneous sending and receiving behavior of the parent link and the child link of the second node, the value of X can be further limited, for example, X=a+bc, where a is the downlink time domain resource in each transmission time interval B is the length of the guard interval between downlink and uplink time domain resources in each transmission time interval, c is the starting position of the allocated uplink time domain resources in the radio frame and the time domain used to transmit the uplink resources The time offset N _TA-offset between the starting positions of the resources.

In addition, the value of Y can be further limited, for example, Y=X-Z, where Z is the number of Ts in each transmission time interval.

Taking the frame structure of eLTE-DSA as an example, combined with the aforementioned analysis of Figure 4, it can be seen that in eLTE-DSA, the length of each TTI is 600Ts, and the length of downlink time domain resources in each TTI is 260Ts. The length of the guard interval (GAP) between the downlink and uplink time domain resources is 40Ts. In eLTE-DSA, the start position of the uplink time domain resources allocated for each frame is the 300th Ts. Regardless of the presence of TA, the start position of the time domain resources used to transmit the uplink resources is the 320th Ts. The value of N _TA-offset (ie c) is -20. Therefore, for the eLTE-DSA frame structure, the value of X is 320 and the value of Y is -280.

Fig. 7 and Fig. 8 show schematic analysis diagrams of examples of the downlink transmission timing of the relay node provided by the present application in eLTE-DSA. In eLTE-DSA, taking the receiving timing of the parent link of the second node as a reference point, the downlink sending timing advance of the second node is T=TA/2+N _CTA -320, or T=TA/2+N _CTA +280. That is, based on the timing advance TA/2+N _CTA , the downlink transmission timing can continue to be shifted back 320Ts, or 280Ts forward (backward or forward half-frame length), so that the second node can be The data transmission or reception of the parent link and the child link are performed at the same time, so as to realize the resource allocation mode of frequency division multiplexing.

In summary, for the second node, only one value of N _{CTA_offset} may be preset, such as X or Y, and the downlink transmission timing advance T of the second node may be determined according to the X or Y.

Similarly, for the first node and the third node, corresponding N _{CTA_offset} can also be preset, such as X or Y, and the downlink transmission timing advance T of the first node and the third node can be determined according to the X or Y.

However, in order to meet the requirement of frame number alignment as much as possible (the total offset is within one TTI), thereby reducing the generation of problems such as network transmission interference, two adjacent nodes in a multi-hop system can be offset in different directions. Specifically, the N _{CTA_offset} of the second node can be set to 320, that is, the downlink transmission timing advance of the second node T=TA/2+N _CTA -320 (at this time T is a negative value), and on this basis, Set the N _{CTA_offset} of the third node to -280, that is, the downlink transmission timing advance of the third node T=TA/2+N _CTA +280 (at this time, T is a positive value), which can ensure the alignment of frame numbers.

In addition, in order to meet application scenarios of other resource allocation methods such as time division multiplexing (TDM), the value of N _{CTA_offset} may also be 0.

In other words, for a multi-hop system, the N _{CTA_offset} value of the relay node in the frequency division multiplexing resource allocation mode can be preset to X or Y, and the N _{CTA_offset} of the relay node in the time division multiplexing resource allocation mode _{CTA_offset} is set to 0.

In addition, it should be understood that, in order to meet some special requirements, the value of N _{CTA_offset} of the relay node in the time division multiplexing resource allocation mode may also be preset to X or Y, which is not limited in this application.

In step 240, the second node may perform data transmission with the third node according to the downlink transmission timing advance T.

It should be understood that the above description only uses the second node as an example to illustrate the process of determining the downlink transmission timing advance T. For other nodes in the multi-hop system, such as the first node and the second node, the corresponding downlink transmission timing The above method for determining the advance amount T is also applicable.

The above description mainly describes the timing alignment method provided by this application from the perspective of the second node. The processing procedures of the first node and the third node have a corresponding relationship with the processing procedures of the second node. For example, the second node starts from the first node. Receiving the first information means that the first node sends the first information to the second node. Therefore, even if the processing procedures of the first node and the third node are not clearly stated in some places above, those skilled in the art can clearly understand the processing procedures of the first node and the third node based on the processing procedures of the second node.

The embodiment of the application introduces the preset N _{CTA_offset} value, so that the relay node of eLTE-DSA can simultaneously send or receive the parent link and the child link at the same time, thereby realizing the frequency division multiplexing resource allocation method. Effectively realize the technical effects such as the alignment of the sending and receiving time of the same node, the alignment of frame boundaries and frame numbers at different levels, and minimize the timing synchronization system error and network interference. In addition, the embodiments of the present application design different N _{CTA_offset} values used in different scenarios at the same time, thereby avoiding the problem of frame number misalignment.

FIG. 9 shows a schematic flowchart of a method 300 for timing alignment. It can also realize that the relay node simultaneously sends or receives data of the parent link and the child link at the same time, thereby realizing the resource allocation mode of frequency division multiplexing. The method 300 includes steps 310-340. The method 300 will be described below with reference to FIG. 9.

Similarly, in the method 300, the first node, the second node, and the third node may be IAB nodes, the first node is the parent node of the second node, and the third node is the child node of the second node. The node may also be a base station, and the third node may also be a terminal device, which will not be described in detail below.

In step 310, the second node receives the first information sent by the first node, where the first information is used to indicate the first timing advance N _CTA .

In step 320, the second node receives second information sent by the first node, where the second information is used to indicate the second timing advance TA.

In step 321, the second node receives the third message sent by the first node, the third node information indicating a plurality of preset timing offset target amount of _N CTA_offset timing offset _N CTA_offset.

In step 330, the second node determines the downlink transmission timing advance T of the second node according to the first timing advance N _CTA , the second timing advance TA and the target timing offset N _{CTA_offset} .

In step 340, the second node may perform data transmission with the third node according to the downlink transmission timing advance T.

The above steps 310, 320, 330, and 340 can be understood with reference to the steps 210, 220, 230, and 240 in the method 200, and only the differences are explained here.

Specifically, with respect to the foregoing embodiment, the second node in this embodiment is preset with multiple timing offsets N _{CTA_offset} . For example, multiple timing offsets N _{CTA_offset} may include X and Y mentioned in the foregoing embodiment. , One or more of 0.

In addition, the value principle of each of the multiple timing offsets N _{CTA_offset} preset by the second node of this embodiment is the same as that in the foregoing embodiment, and can be understood according to the relevant content recorded in the foregoing embodiment. No longer.

The first node may transmit third information, the third information is used to target a plurality of timing offset amount _N CTA_offset timing offset _N CTA_offset instruction, the second node may be N _CTA according to a first timing advance, The second timing advance TA and the target timing offset N _{CTA_offset} determine the downlink transmission timing advance T of the second node.

Wherein, the third information may be carried in a radio resource control message.

Optionally, the third information may also be carried in a system message or a broadcast message.

In addition, in step 321, it is an optional step that the first node sends the third information to the second node. In other embodiments, the base station may also send the third information to the second node, for example, The base station higher than the first node sends the third information to the second node through the first node or other nodes, and the third information may be carried in the RRC message sent by the base station.

Similarly, the first information, the second information, and the third information may be sent by the same device, or may be sent to the second node by different devices, which is not limited in this application.

For example, the first information may be sent by the base station to the second node, and the second information and the third information may be sent by the first node to the second node.

For another example, the first information, the second information, and the third information may all be sent by the first node to the second node.

For another example, the third information may be sent by the base station to the second node, and the first information and the second information may be sent by the first node to the second node.

The third timing offset information of a plurality of target timing offset of _N CTA_offset _N CTA_offset instruction, may be performed to display an indication of the manner, in accordance with a predetermined protocol or system, a string of specific code, or a bit的0 or 1.

For example, a string of specific codes #1 can be used to indicate multiple timing offsets N _{CTA_offset} X, code #2 can be used to indicate multiple timing offsets N _{CTA_offset} Y can be code #3 to indicate multiple timing offsets N _{CTA_offset} is 0.

It is also possible to indicate only X and Y, and when the indicating code is the default, it means that the indicated value is 0. For example, one bit of "0" can be used to indicate X, one bit of "1" to indicate Y, and the default is to indicate 0.

The target timing offset N _{CTA_offset} indicated by the third information may be determined according to different resource allocation modes and/or different levels.

If the target timing offset N _{CTA_offset of} a certain level is incorrect, the total timing advance (offset) between adjacent nodes (or between levels) may be greater than the length of one TTI.

For example, if the target timing offset N _{CTA_offset} of the first node is 320, the downlink transmission timing advance of the first node T ₁ =TA ₁ /2+N _CTA1 -320, the timing offset of the second node The value of N _{CTA_offset} is also 320, and the downlink transmission timing advance of the second node T ₂ =TA ₂ /2+N _CTA2 -320, then the total timing advance T _1-2 =TA ₁ /2+N _CTA1 + TA ₂ /2+N _CTA2 -640, if the sum of TA ₁ /2+N _CTA1 + TA ₂ /2+N _CTA2 is less than 40, then the total timing advance will exceed 600Ts, that is, the total timing advance If the length is greater than one TTI, the system frame numbers between different nodes in a cell cannot be aligned at this time.

Therefore, if the first node downlink sends the timing advance T=TA/2+N _CTA -320 (that is, the value of N _{CTA_offset} is X=320), at this time, in order to prevent the total timing advance from exceeding the length of one TTI, the first The node may determine that the target timing offset N _{CTA_offset} indicated by the third information is Y, that is, -280.

The method for the second node to determine the downlink transmission timing advance T of the second node according to the first timing advance N _CTA , the second timing advance TA and the target timing offset N _{CTA_offset} can refer to the related description in the foregoing method 200. I will not repeat them here.

In the embodiment of the present application, the second node presets multiple timing offsets N _{CTA_offset} . The upper-level node or the base station can give flexible instructions to the second node according to different resource allocation methods and different levels. A timing offset N _{CTA_offset} indicated by the three pieces of information determines the downlink transmission timing advance T, so that the relay device can effectively perform frequency division multiplexing on resources and ensure the alignment of frame numbers in the network.

FIG. 10 shows a schematic flowchart of a method 400 for timing alignment. It can also realize that the relay node simultaneously sends or receives data of the parent link and the child link at the same time, thereby realizing the resource allocation mode of frequency division multiplexing. The method 400 includes steps 410-440. The method 400 will be described below with reference to FIG. 10.

Similarly, in the method 400, the first node, the second node, and the third node may be IAB nodes, the first node is the parent node of the second node, and the third node is the child node of the second node. The node may also be a base station, and the third node may also be a terminal device, which will not be described in detail below.

In step 410, the second node receives first information sent by the first node, where the first information is used to indicate a first timing advance N _CTA .

In step 420, the second node receives second information sent by the first node, where the second information is used to indicate the second timing advance TA.

In step 422, the second node according to information of the second node hop number, determining a target node a plurality of predetermined timing offsets _N CTA_offset timing offset _N CTA_offset.

In step 430, the second node determines the downlink transmission timing advance T of the second node according to the first timing advance N _CTA , the second timing advance TA and the target timing offset N _{CTA_offset} .

In step 440, the second node may perform data transmission with the third node according to the downlink transmission timing advance T.

The above steps 410, 420, 430, and 440 can be understood with reference to steps 210, 220, 230, and 240 in the method 200 and 310, 320, 330, and 340 in the method 300, and only the differences are explained here.

Specifically, compared to the method 300 provided in the foregoing embodiment, in this embodiment, the first node or base station is not required to display instructions (that is, the third information is not required), and the preset multiple information can be determined by itself according to its own hop count information. The target timing offset N _{CTA_offset} in the timing offset N _{CTA_offset} .

For example, the second node can perform modulo two remainder operations on the number of hops (or stages) in the multi-hop system where it is located in accordance with the protocol or system regulations, and determine the target timing offset N _{CTA_offset} according to the remainder. . For example, when the remainder is 0, it can be determined that X in the multiple timing offsets N _{CTA_offset} is the target timing offset N _{CTA_offset} , and when the remainder is 1, it can be determined that Y in the multiple timing offsets N _{CTA_offset} is The target timing offset N _{CTA_offset} .

In other words, the second node can determine the target timing offset N _{CTA_offset} according to whether the number of hops in the multi-hop system it is in is an odd hop or an even hop. For example, when it is an odd hop, multiple timing offsets N can be determined _{CTA_offset} when the X (or Y) as the target timing offset N _{CTA_offset,} jump is even possible to determine a plurality of timing offset of N _{CTA_offset} Y (or X) as the target timing offset N _{CTA_offset.}

The protocol or system may specify the counting principle of the number of hops where the relay node is located in the multi-hop system. For example, the protocol or system may specify that the base station is the 0th hop, the first-level relay node that accesses the base station is the first hop, and the number of hops of the relay nodes of each subsequent level is increased by one in turn.

In addition, the protocol or system may also specify that the first-level relay node that accesses the base station is the 0th hop, and the number of hops of the relay nodes at each subsequent level is sequentially increased by 1.

The foregoing is only used for illustration, and the embodiment of the present application does not limit the counting principle of the number of hops where the relay node is located in the multi-hop system.

The embodiment of the application does not limit how the second node obtains the hop count information. In a possible implementation manner, the hop count information may be determined according to the fourth information sent by the first node.

Optionally, the method 400 further includes step 421. The setting of step 421 mainly considers how to determine the hop number information when the second node cannot know its own hop number information.

In step 421, the first node sends the fourth information to the second node.

Specifically, the fourth information may be carried in a system message sent by the first node, and the second node can determine the hop count information of the second node according to the fourth information.

In addition, the fourth information can also implicitly indicate that the second node determines the target timing offset N _{CTA_offset} according to the hop count information. For example, after receiving the fourth information, the second node voluntarily determines the hop number information according to the fourth information, and determines the target timing offset N _{CTA_offset} according to the hop number information.

Optionally, if the fourth information does not include the hop number information of the first node, it is determined that the second node is the next hop of the base station. Specifically, the system message sent by the base station may not include its own hop count information. If the fourth message (for example, a related system message) received by the second node does not include the hop count information, it can be determined that the message is sent by the base station. At this time, the second node can be determined as the next hop of the base station. For example, the second node can be determined as the 0th hop or the 1st hop according to a predetermined counting method.

If the fourth information includes the hop count information of the first node, the hop count information of the relay node is determined according to the hop count information of the first node. For example, 1 can be added to the hop count of the first node.

In addition, the fourth information may also include parity information of the hop count of the first node, and the parity information of the second node may be determined according to the parity information of the first node.

For example, the fourth information may indicate that the number of hops where the first node is located is an odd number, and the second node may determine that the number of hops where the second node is located is an even number hop according to the fourth information.

For another example, the fourth information may indicate that the number of hops where the first node is located is an even number, and the second node may determine that the number of hops where the second node is located is an odd number hop according to the fourth information.

Optionally, the fourth information may indicate the number of hops of the second node in the multi-hop system.

Optionally, the fourth information may indicate whether the second node is an odd hop or an even hop in the multi-hop system.

The method for the second node to determine the downlink transmission timing advance T of the second node according to the first timing advance N _CTA , the second timing advance TA and the target timing offset N _{CTA_offset} can refer to the related description in the foregoing method 200. I will not repeat them here.

Compared with the foregoing embodiments, the second node may determine the target timing offset N _{CTA_offset} according to its own hop count information, and determine the downlink transmission timing advance T according to the target timing offset N _{CTA_offset} . Under the premise that the second node does not know its own hop count information, the first node can send fourth information to the second node through a system message, the fourth information can determine the hop count information, and the fourth information can also implicitly indicate The second node determines the target timing offset N _{CTA_offset} .

The timing alignment method provided in this application has been described in detail above, and the timing alignment device provided in this application will be introduced below.

Referring to FIG. 11, FIG. 11 is a schematic structural block diagram of a timing alignment apparatus 500 provided in the present application. As shown in FIG. 11, the device 500 includes a processing unit 510 and a transceiver unit 520.

In a possible design, the device 500 may correspond to the second node in the above method embodiment. For example, it may be the second node, or a chip configured in the second node.

Specifically, the device 500 may correspond to the second node in the method according to the embodiment of the present application, and the device 500 may include a unit for executing the method executed by the second node in the methods in FIGS. 5, 9, and 10. In addition, each unit in the device 500 and other operations and/or functions described above are used to implement the corresponding processes of the methods in FIGS. 5, 9, and 10, respectively.

Wherein, when the device 500 is used to execute the methods in FIGS. 5, 9, and 10, the transceiving unit 510 can be used to perform the receiving and sending steps in the method, and the processing unit 520 can be used to perform related determining steps in the method.

The specific process for each unit to execute the foregoing corresponding steps has been described in the foregoing method embodiment, and is not repeated here for brevity.

Alternatively, the device 500 may be a chip or an integrated circuit.

The chip described in the embodiment of the application may be a field-programmable gate array (FPGA), an application specific integrated circuit (ASIC), a system on chip (SoC), and a central Processor (central processor unit, CPU), network processor (Network Processor, NP), digital signal processing circuit (digital signal processor, DSP), can also be a microcontroller (microcontroller unit, MCU, programmable controller ( programmable logic device (PLD) or other integrated chips.

Optionally, the processing unit 510 may be a processor. The transceiver unit 510 may be composed of a receiving unit and a transmitting unit. The transceiver unit 520 may be a transceiver, and the transceiver may include a transmitter and a receiver, and has both receiving and transmitting functions. Optionally, the transceiver unit 510 may also be an input/output interface or an input/output circuit.

In another possible manner, the transceiver unit 520 may be a communication interface. For example, input and output interfaces, input interface circuits and output interface circuits.

It should be understood that the apparatus 500 may correspond to the second node in the timing alignment method embodiment provided in this application. The units included in the apparatus 500 are respectively used to implement corresponding operations and/or procedures performed by the second node in the method embodiments.

This application also provides a network device 1000, which is described below with reference to FIG. 12.

Referring to FIG. 12, FIG. 12 is a schematic structural diagram of a network device 1000 provided by the present application. The network device 1000 is used to implement the function of the second node in the method embodiment. As shown in FIG. 12, the network device 1000 includes an antenna 1101, a radio frequency device 1102, and a baseband device 1103. The antenna 1101 is connected to the radio frequency device 1102. In the downlink direction, the radio frequency device 1102 receives signals sent by other network devices through the antenna 1101, and sends the received signals to the baseband device 1103 for processing. In the uplink direction, the baseband device 1103 processes the signals that need to be sent to other network devices and sends them to the radio frequency device 1102. The radio frequency device 1102 processes the signals and sends them to other network devices via the antenna 1101.

The baseband device 1103 may include one or more processing units 11031. In addition, the baseband device 1103 may further include a storage unit 11032 and a communication interface 11033. The storage unit 11032 is used to store programs and data. The communication interface 11033 is used to exchange information with the radio frequency device 1102. The communication interface 11033 may be an input/output interface or an input/output circuit.

The network device 1000 in the above apparatus embodiment may completely correspond to the second node in the method embodiment, and the corresponding unit included in the network device 1000 is used to execute the corresponding steps performed by the second node in the method embodiment.

In addition, the present application provides a computer-readable storage medium. The computer-readable storage medium stores computer instructions. When the computer instructions run on the computer, the computer executes the corresponding operations performed by the second node in any method embodiment. And/or process.

This application also provides a computer program product. The computer program product includes computer program code. When the computer program code runs on a computer, the computer executes the corresponding operations performed by the second node in the embodiment of the method for indicating resources provided by this application. And/or process.

The present application also provides a communication system that includes at least a first node, a second node, and a third node, wherein the first node is used to perform the operations performed by the first node in FIG. 5, 9 or 10 and / Or processing, the second node is used to perform the operation and/or processing performed by the second node in Figure 5, 9 or 10, and the third node is used to perform the operation and/or processing performed by the third node in Figure 5, 9 or 10 /Or processing.

This application also provides a chip including a processor. The processor is used to call and run the computer program stored in the memory to execute the corresponding operation and/or process executed by the second node in the method embodiment for indicating resources provided in this application.

Optionally, the chip further includes a memory, and the memory is connected to the processor. The processor is used to read and execute the computer program in the memory.

Further optionally, the chip further includes a communication interface, and the processor is connected to the communication interface. The communication interface is used to receive signals and/or data that need to be processed, and the processor obtains the signals and/or data from the communication interface and processes them.

Optionally, the communication interface may be an input/output interface, which may specifically include an input interface and an output interface. Alternatively, the communication interface may be an input/output circuit, which may specifically include an input circuit and an output circuit.

The memory and the memory involved in the foregoing embodiment may be physically independent units, or the memory may also be integrated with the processor.

The device 500 described in the above device embodiments may be a chip on the baseband device 1103, and the chip includes at least one processing unit and an interface circuit. Among them, the processing element is used to execute each step of any method executed by the above network device (ie, the second node), and the interface circuit is used to communicate with other devices.

In one implementation, the unit for the network device to implement each step in the above method can be implemented in the form of a processing unit scheduler. For example, the processing unit 11031 calls a program stored in the storage unit 11032 to execute the method executed by the first IAB node in the above method embodiment. The storage unit 11032 can be the processing unit 11031 on the same chip, that is, an on-chip storage unit, or can be a storage element on a different chip from the processing unit 11031, that is, an off-chip storage unit.

In the above embodiments, the processor may be a central processing unit (CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more of them used to control the technology of the application Integrated circuits for program execution, etc. For example, the processor may be a digital signal processor device, a microprocessor device, an analog-to-digital converter, a digital-to-analog converter, etc. The processor can distribute control and signal processing functions of terminal devices or network devices among these devices according to their respective functions. In addition, the processor may have a function of operating one or more software programs, and the software programs may be stored in the memory. The functions of the processor can be realized by hardware, or by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above-mentioned functions.

The memory can be read-only memory (ROM), other types of static storage devices that can store static information and instructions, random access memory (RAM), or other types that can store information and instructions Dynamic storage devices can also be electrically erasable programmable read-only memory (EEPROM), compact disc read-only memory (CD-ROM), or other optical disk storage, optical disc storage ( Including compact discs, laser discs, optical discs, digital versatile discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, or can be used to carry or store desired program codes in the form of instructions or data structures and can Any other medium accessed by the computer, etc.

In the embodiments of the present application, "and/or" describes the association relationship of the associated objects, which means that there can be three kinds of relationships, for example, A and/or B, which can mean that A exists alone, A and B exist at the same time, and B exists alone. Happening. Among them, A and B can be singular or plural.

A person of ordinary skill in the art may be aware that, in combination with the examples described in the embodiments disclosed herein, the units can be implemented by electronic hardware or a combination of computer software and electronic hardware. Whether these functions are executed by hardware or software depends on the specific application and design constraint conditions of the technical solution. Professional technicians can use different methods for each specific application to achieve the described functions.

In the several embodiments provided in this application, it should be understood that the disclosed system, device, and method may be implemented in other ways. For example, the device embodiments described above are only illustrative. For example, the division of the units is only a logical function division, and there may be other divisions in actual implementation, for example, multiple units or components may be combined or may be Integrate into another system, or some features can be ignored or not implemented. In addition, the displayed or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, devices or units, and may be in electrical, mechanical or other forms.

The units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the objectives of the solutions of the embodiments.

In addition, the functional units in each embodiment of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit.

If the function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer readable storage medium. Based on this understanding, the technical solution of this application essentially or the part that contributes to the existing technology or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including Several instructions are used to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage media include: U disk, mobile hard disk, read-only memory (read-only memory, ROM), random access memory (random access memory, RAM), magnetic disk or optical disk and other media that can store program code .

The above are only specific implementations of this application, but the protection scope of this application is not limited to this. Any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed in this application. Should be covered within the scope of protection of this application. Therefore, the protection scope of this application should be subject to the protection scope of the claims.

Claims (29)

1. A timing alignment method is characterized in that it includes:

   The relay node receives first information and second information, where the first information is used to indicate a first timing advance N _CTA , and the second information is used to indicate a second timing advance TA, the second timing advance TA is used to determine the timing advance of uplink transmission relative to downlink reception of the parent link of the relay node, and the first timing advance N _CTA is a timing advance adjustment value;

   The relay node determines the downlink transmission timing advance T of the relay node according to the first timing advance N _CTA , the second timing advance TA and at least one preset timing offset N _{CTA_offset} .
2. The method according to claim 1, wherein the determining the downlink transmission timing advance T of the relay node comprises:

   The downlink transmission timing advance T of the relay node is determined according to the following formula: T=TA/2+N _CTA -N _{CTA_offset} .
3. The method according to claim 1 or 2, wherein the at least one timing offset N _{CTA_offset} is a plurality of timing offsets N _{CTA_offset} , and the method further comprises:

   The relay node receives third information, where the third information is used to indicate a target timing offset N _{CTA_offset} among the multiple timing offsets N _{CTA_offset} ;

   The determining the downlink transmission timing advance T of the relay node includes:

   The relay node determines the downlink transmission timing advance T according to the first timing advance N _CTA , the second timing advance TA and the target timing offset N _{CTA_offset} .
4. The method according to claim 1 or 2, wherein the at least one timing offset N _{CTA_offset} is a plurality of timing offsets N _{CTA_offset} , and the method further comprises:

   Determining a plurality of timing offset amount of the target _N CTA_offset timing offset according to the number _N CTA_offset hop information of the relay node;

   The determining the downlink transmission timing advance T of the relay node includes:

   The relay node determines the downlink transmission timing advance T according to the first timing advance N _CTA , the second timing advance TA and the target timing offset N _{CTA_offset} .
5. The method according to claim 4, wherein the method further comprises:

   The relay node receives the fourth information sent by the parent node;

   The relay node determines the hop count information of the relay node according to the fourth information.
6. The method of claim 5, wherein the relay node determining the hop count information of the relay node according to the fourth information comprises:

   If the fourth information does not include the hop count information of the parent node, determining that the relay node is the next hop of the base station;

   If the fourth information includes the hop count information of the parent node, the hop count information of the relay node is determined according to the hop count information of the parent node.
7. The method according to any one of claims 4-6, wherein said determining a plurality of timing offset of the target _N CTA_offset _N CTA_offset timing offset information comprising the number of hops:

   The hop number where the relay node is an odd or even-hop hop timing offset determined target amount of the plurality of _N CTA_offset timing offset _N CTA_offset.
8. The method according to claim 3 or 5, wherein the third information and the fourth information are carried in at least one of the following messages: radio resource control messages, broadcast messages, and system messages.
9. The method according to any one of claims 1-8, wherein at least one of the first information and the second information is sent by a parent node or a base station of the relay node.
10. The method according to any one of claims 1-9, wherein the absolute value of each of the at least one timing offset N _{CTA_offset} is less than or equal to the length of each transmission time interval.
11. The method according to any one of claims 1-10, wherein the absolute value of each of the at least one timing offset N _{CTA_offset} is less than or equal to the uplink time domain resource in each transmission time interval And/or, the absolute value of each of the at least one timing offset N _{CTA_offset} is less than or equal to the length of the downlink time domain resource in each transmission time interval.
12. The method according to any one of claims 1-11, wherein the at least one timing offset N _{CTA_offset} includes X and Y, wherein the sum of the absolute value of X and the absolute value of Y is equal to each The length of the transmission interval.
13. The method of claim 12, wherein the values of X and Y are:

    X, X=a+bc, where a is the length of the downlink time domain resource in each transmission time interval, b is the length of the guard interval between the downlink and uplink time domain resources in each transmission time interval, and c is the radio frame The time offset N _TA-offset between the start position of the uplink time domain resource allocated in and the start position of the time domain resource used to transmit the uplink resource;

    Y, Y=X-Z, where Z is the number of Ts in each transmission time interval.
14. A timing alignment device is characterized in that it comprises:

    The transceiver unit is configured to receive first information and second information, where the first information is used to indicate a first timing advance N _CTA , the second information is used to indicate a second timing advance TA, and the second timing The advance TA is used to determine the timing advance of the uplink transmission relative to the downlink reception of the parent link of the device, and the first timing advance N _CTA is a timing advance adjustment value;

    The processing unit is configured to determine the downlink transmission timing advance T of the device according to the first timing advance N _CTA , the second timing advance TA and at least one preset timing offset N _{CTA_offset} .
15. The device according to claim 14, wherein the processing unit is further configured to:

    The downlink transmission timing advance T of the device is determined according to the following formula: T=TA/2+N _CTA -N _{CTA_offset} .
16. The apparatus according to claim 14 or 15, wherein the at least one timing offset N _{CTA_offset} is a plurality of timing offsets N _{CTA_offset} , and the transceiver unit is further configured to:

    Receiving third information, where the third information is used to indicate a target timing offset N _{CTA_offset} among the multiple timing offsets N _{CTA_offset} ;

    The processing unit is also used for:

    The downlink transmission timing advance T is determined according to the first timing advance N _CTA , the second timing advance TA and the target timing offset N _{CTA_offset} .
17. The apparatus according to claim 14 or 15, wherein the at least one timing offset N _{CTA_offset} is a plurality of timing offsets N _{CTA_offset} , and the processing unit is further configured to:

    The number of hops to the determining means of said plurality of timing offset target amount of _N CTA_offset _N CTA_offset timing offset;

    The downlink transmission timing advance T is determined according to the first timing advance N _CTA , the second timing advance TA and the target timing offset N _{CTA_offset} .
18. The apparatus according to claim 17, wherein the transceiver unit is further configured to receive fourth information sent by the parent node;

    The processing unit is further configured to determine the hop count information of the device according to the fourth information.
19. The device according to claim 18, wherein the processing unit is further configured to:

    If the fourth information does not include the hop count information of the parent node, determining that the device is the next hop of the base station;

    If the fourth information includes the hop count information of the parent node, the hop count information of the device is determined according to the hop count information of the parent node.
20. The device according to any one of claims 17-19, wherein the processing unit is further configured to:

    The device is located to the hop number is odd or even-hop hop timing offset determined target amount of the plurality of _N CTA_offset timing offset _N CTA_offset.
21. The device according to claim 16 or 18, wherein the third information and the fourth information are carried in at least one of the following messages: radio resource control messages, broadcast messages, and system messages.
22. The device according to any one of claims 14-21, wherein at least one of the first information and the second information is sent by a parent node or a base station of the device.
23. The apparatus according to any one of claims 14-22, wherein the absolute value of each of the at least one timing offset N _{CTA_offset} is less than or equal to the length of each transmission time interval.
24. The apparatus according to any one of claims 14-23, wherein the absolute value of each of the at least one timing offset N _{CTA_offset} is less than or equal to the uplink time domain resource in each transmission time interval And/or, the absolute value of each of the at least one timing offset N _{CTA_offset} is less than or equal to the length of the downlink time domain resource in each transmission time interval.
25. The device according to any one of claims 14-24, wherein the at least one timing offset N _{CTA_offset} includes X and Y, wherein the sum of the absolute value of X and the absolute value of Y is equal to each The length of the transmission interval.
26. The device of claim 25, wherein the values of X and Y are:

    X, X=a+bc, where a is the length of the downlink time domain resource in each transmission time interval, b is the length of the guard interval between the downlink and uplink time domain resources in each transmission time interval, and c is the radio frame The time offset N _TA-offset between the start position of the uplink time domain resource allocated in and the start position of the time domain resource used to transmit the uplink resource;

    Y, Y=X-Z, where Z is the number of Ts in each transmission time interval.
27. A computer-readable storage medium, wherein the computer-readable storage medium stores computer instructions, and when the computer instructions run on a computer, the computer executes any one of claims 1-13. The method described.
28. A chip, characterized by comprising a memory and a processor, the memory is used to store a computer program, and the processor is used to read and execute the computer program stored in the memory to execute as claimed in claims 1-13 The method of any one of.
29. A communication system, characterized in that the system comprises a relay node, and the relay node executes the method according to any one of claims 1-13.

Images