CN113905399A

CN113905399A - Time delay processing method, equipment, device and medium

Info

Publication number: CN113905399A
Application number: CN202010642576.3A
Authority: CN
Inventors: 李响; 闫小刚; 苏鑫; 段然
Original assignee: China Mobile Communications Group Co Ltd; China Mobile Communications Ltd Research Institute
Current assignee: China Mobile Communications Group Co Ltd; China Mobile Communications Ltd Research Institute
Priority date: 2020-07-06
Filing date: 2020-07-06
Publication date: 2022-01-07

Abstract

The invention discloses a time delay processing method, a device and a medium, comprising the following steps: the extension unit processes the time delay parameter at one side of the northbound node according to an evolved common public radio interface, wherein the northbound node is a baseband processing unit or a previous-stage extension unit connected with the extension unit; and processing the time delay parameter at one side of the southbound node according to a common public radio interface, wherein the southbound node is a radio remote unit connected with an extension unit. A baseband processing unit acquires a time delay processing capability parameter of a cascade expansion unit; the baseband processing unit sets the total delay of the link of the common public radio interface according to the delay processing capability parameter. By adopting the invention, a feasible scheme can be provided aiming at the defect that the current open connection standard can not meet the base station time delay management parameters under the mixed architecture; technical parameters meeting the time delay management requirements of the base station under the hybrid architecture are formulated.

Description

Time delay processing method, equipment, device and medium

Technical Field

The present invention relates to the field of wireless communications technologies, and in particular, to a method, a device, an apparatus, and a medium for processing a delay.

Background

In a 5G NR (New Radio) wireless communication network, a distributed and extended indoor pico-base station includes three main parts, namely a BBU (BaseBand processing Unit), an extension Unit HUB, and a Radio Remote Unit RRU (Radio Remote Unit). The BBU realizes data return, physical layer software and high-level protocol stack processing functions, a BBU fronthaul interface is connected with the RRU through an extension unit, and the RRU converts a digital signal into an air interface wireless signal and sends the air interface wireless signal to the mobile phone terminal. The Interface between the BBU and the RRU is a forward Interface, and forward Interface protocols such as CPRI (Common Public Radio Interface) and eCPRI (evolved CPRI) may be used. According to the physical layer segmentation and interface protocol adopted by the forward interface, a HUB is taken as an intermediate node, and a hybrid architecture (hereinafter referred to as a hybrid architecture) exists, wherein the hybrid architecture is used for realizing 7-2x segmentation of all eCPRI interfaces, 8 segmentation of all CPRI interfaces and HUB conversion to convert a BBU eCPRI interface, namely, the Option7-2x, to the CPRI interface, namely, the Option8 segmentation to connect RRU. The Option7-2x segmentation divides the physical layer into a High-phy (High-level physical layer) and a Low-phy (Low-level physical layer), and the implementation positions of the protocol processing functions of the Low-phy physical layer of the three architectures are respectively in RRU, BBU and Hub units. In the forwarding function of the base station unit, it is necessary to manage the time delay of the forwarding path to ensure the time synchronization between the BBU and the RRU, and further ensure that the air interface synchronization is normal.

The full eCPRI interface Option7-2x segmentation and the full CPRI interface Option8 segmentation have the open interface standard approved by the industry, and the time delay definition process is mature.

The deficiency of the prior art is that the forward pass Option7-2x conversion Option8 hybrid architecture combines two cut-and-forward interfaces, and adds low-phy processing of HUB, and the HUB also needs to perform a downlink data copy process and an uplink data merge process. The delay definition schemes of the eCPRI interface Option7-2x segmentation and the CPRI interface Option8 segmentation are only suitable for the technical characteristics of the time delay definition schemes, cannot meet the requirements of a mixed architecture, and need to be formulated to meet the requirements of a new architecture.

Disclosure of Invention

The invention provides a time delay processing method, equipment, a device and a medium, which are used for providing a time delay processing scheme meeting the requirements of a hybrid architecture.

The invention provides the following technical scheme:

a latency processing method, comprising:

the HUB processes the time delay parameter at one side of a northbound node according to the eCPRI, wherein the northbound node is a BBU (base band unit) or a superior HUB connected with the HUB;

and the HUB processes the time delay parameter at one side of the southbound node according to the CPRI, wherein the southbound node is the RRU connected with the HUB.

In implementation, T34_ max satisfies the following relationship:

T34_max≥T34_1_max+T_Comb(HUB#1)+T34_2_max；

wherein, T34_1_ max is the maximum transmission delay between HUB #1 and BBU, and T34_2_ max is the maximum transmission delay between HUB #2 and HUB # 1;

t _ Comb is the HUB uplink merging processing time delay and is reported through a management plane;

t34_ max is the maximum uplink transmission delay between the BBU and the final-stage HUB.

In implementation, if N HUB cascades exist, the forwarding delay satisfies the following relationship:

n is a positive integer greater than 1.

In implementation, the latest time of the UL user plane data sent by the HUB to the northbound node does not exceed Ta3_ prime _ max, and Ta3_ prime _ max satisfies the following relationship:

Ta3_prime_max(HUB#1)≤Ta4_max-T34_1_max；

wherein Ta3_ prime _ max (HUB # n) is the maximum copy or merge processing latency of HUB # n on the southbound cascade port, n is the number of stages of HUB;

ta4_ max is the BBU sending or receiving window maximum time difference;

t34_1_ max is the maximum transmission delay between HUB #1 and BBU.

In implementation, if there are N HUB cascades, Ta3_ prime _ max satisfies the following relationship:

in implementation, the time for the HUB to wait for the merging processing is equal to or longer than the time for receiving all UL data, and T _ Waiting (HUB #1) satisfies the following relationship:

T_Waiting(HUB#1)＝Ta3_prime_max(HUB#1)-T_Comb(HUB#1)；

wherein Ta3_ prime _ max (HUB #1) -T _ Comb (HUB #1) ≧ TBa3_ max + T34_2_ max;

wherein, T _ Waiting (HUB # n) is the copy or merge processing delay of HUB # n on the southbound cascade port, and n is the HUB stage number;

ta3_ prime _ max (HUB #1) is the maximum copy or merge processing latency of HUB #1 on the southbound cascade port;

TBa3_ max is the maximum equivalent delay of HUB #2 and RRU on the U plane;

when n is 1, T34_ n _ max is the maximum transmission delay between HUB #1 and BBU; when N is 2, …, N, T34_ N _ max is the maximum transmission delay between HUB # N and HUB # N-1, and N is the number of HUB cascades.

In practice, if there are N HUB cascades, T _ watching (HUB # N) satisfies the following relationship:

wherein the content of the first and second substances,

in an implementation, the delay parameter includes one or a combination of the following parameters:

the downlink data Copy time delay T-Copy;

merging the uplink data by a time delay T-Comb;

a downlink processing time delay TBDelayDL;

the uplink processing time delay TBDelayUL;

and (4) time delay of uplink and downlink data loop of a connection point of the HUB and the RRU.

In an implementation, the method further comprises the following steps:

and providing the delay processing capability parameter of the cascade HUB to the BBU, so that the BBU can set the total time delay of the CPRI link.

In an implementation, the method further comprises the following steps:

and measuring the network transmission delay of the CPRI link, and providing the network transmission delay of the CPRI link for the BBU.

In an implementation, the method further comprises the following steps:

and calculating copy or merging processing delay of the HUB #1 on the southbound cascade port and sending the copy or merging processing delay to the BBU.

A latency processing method, comprising:

the BBU acquires a time delay processing capacity parameter of the cascade HUB;

and the BBU sets the total time delay of the CPRI link according to the time delay processing capacity parameter.

In an implementation, the method further comprises the following steps:

after acquiring the CPRI link network transmission delay from the HUB, the BBU determines the latest time point T3a _ prime _ max of the northbound merged data, wherein Ta3_ prime _ max is the maximum copy/merge processing delay of the HUB on the southbound cascade port.

In implementation, after acquiring the CPRI link network transmission delay from the HUB, the BBU determines the latest time point T3a _ prime _ max of the data after northbound merging, including:

the BBU acquires the network transmission delay of the CPRI link;

calculating T12_3, T12_2, T34_1 and T34_2 delays by the BBU, wherein T12_3 is CPRI optical fiber delay, T12_2 is transmission delay between HUB #1 and HUB #2, T34_1 is transmission delay between HUB #1 and the BBU, and T34_2 is transmission delay between HUB #2 and the BBU;

the BBU measures the time delay of a HUB #1eCPRI one-way link;

measuring HUB #2eCPRI link time delay by the BBU;

the BBU calculates and obtains eCPRI link delay T12_1, T12_2, T34_1 and T34_2, wherein T12_1 is transmission delay between HUB #1 and BBU, T12_2 is transmission delay between HUB #1 and HUB #2, T34_1 is transmission delay between HUB #1 and BBU, and T34_2 is transmission delay between HUB #2 and BBU;

after the BBU calculates T3a _ prime _ max, the BBU is sent to HUB #1 so that HUB #1 serves as the latest time point for north data merging.

In an implementation, the method further comprises the following steps:

the BBU configures T3a _ prime _ max to HUB # 1.

In an implementation, the method further comprises the following steps:

and the BBU configures time delay compensation for the RRU.

A HUB, comprising:

a processor for reading the program in the memory, performing the following processes:

processing a time delay parameter at one side of a northbound node according to eCPRI, wherein the northbound node is a BBU (building base Unit) or a superior HUB (HUB) connected with the HUB;

processing the time delay parameter at one side of a southbound node according to CPRI, wherein the southbound node is an RRU connected with a HUB;

a transceiver for receiving and transmitting data under the control of the processor.

In implementation, T34_ max satisfies the following relationship:

T34_max≥T34_1_max+T_Comb(HUB#1)+T34_2_max；

n is a positive integer greater than 1.

Ta3_prime_max(HUB#1)≤Ta4_max-T34_1_max；

ta4_ max is the BBU sending or receiving window maximum time difference;

t34_1_ max is the maximum transmission delay between HUB #1 and BBU.

in practice, the HUB waits for the combining process for a time equal to or longer than the time it receives all UL data,

t _ Waiting (HUB #1) satisfies the following relationship:

T_Waiting(HUB#1)＝Ta3_prime_max(HUB#1)-T_Comb(HUB#1)；

TBa3_ max is the maximum equivalent delay of HUB #2 and RRU on the U plane;

wherein the content of the first and second substances,

the downlink data Copy time delay T-Copy;

merging the uplink data by a time delay T-Comb;

a downlink processing time delay TBDelayDL;

the uplink processing time delay TBDelayUL;

In an implementation, the method further comprises the following steps:

A HUB, comprising:

the northbound processing module is used for processing the time delay parameter at one side of a northbound node according to the eCPRI, wherein the northbound node is a BBU (building base Unit) or a last-stage HUB (HUB) connected with the HUB;

and the southbound processing module is used for processing the time delay parameter at one side of the southbound node according to the CPRI, wherein the southbound node is the RRU connected with the HUB.

In practice, the northbound processing module is further configured to process T34_ max according to the following relationship:

T34_max≥T34_1_max+T_Comb(HUB#1)+T34_2_max；

n is a positive integer greater than 1.

In an implementation, the northbound processing module is further configured to send the merged UL user plane data to the northbound node with the latest time not exceeding Ta3_ prime _ max, and Ta3_ prime _ max satisfies the following relationship:

Ta3_prime_max(HUB#1)≤Ta4_max-T34_1_max；

wherein Ta3_ prime _ max (HUB #1) is the maximum copy or merge processing latency of HUB #1 on the southbound cascade port;

ta4_ max is the BBU sending or receiving window maximum time difference;

t34_1_ max is the maximum transmission delay between HUB #1 and BBU.

in an implementation, the southbound processing module is further configured to wait for the merging processing time to be greater than or equal to the time for receiving all UL data, and T _ Waiting (HUB #1) satisfies the following relationship:

T_Waiting(HUB#1)＝Ta3_prime_max(HUB#1)-T_Comb(HUB#1)；

TBa3_ max is the maximum equivalent delay of HUB #2 and RRU on the U plane;

wherein the content of the first and second substances,

the downlink data Copy time delay T-Copy;

merging the uplink data by a time delay T-Comb;

a downlink processing time delay TBDelayDL;

the uplink processing time delay TBDelayUL;

time delay T14 for uplink and downlink data loop at the HUB and RRU connection point.

In an implementation, the method further comprises the following steps:

and the measurement module is used for measuring the CPRI link network transmission delay and providing the CPRI link network transmission delay for the BBU.

In an implementation, the method further comprises the following steps:

and the calculation module is used for calculating the copy or combination processing delay of the HUB #1 on the southbound cascade port and then sending the copy or combination processing delay to the BBU.

A BBU, comprising:

acquiring a time delay processing capacity parameter of the cascade HUB;

setting the total time delay of the CPRI link according to the time delay processing capacity parameter;

In an implementation, the method further comprises the following steps:

and after the transmission delay of the CPRI link network is acquired from the HUB, determining the latest time point T3a _ prime _ max of the data after the northbound combination, wherein Ta3_ prime _ max is the maximum copy/combination processing delay of the HUB on the southbound cascade port.

In implementation, after acquiring the CPRI link network transmission delay from the HUB, determining the latest time point T3a _ prime _ max of the data after northbound merging, includes:

the BBU acquires the network transmission delay of the CPRI link;

the BBU measures the time delay of a HUB #1eCPRI one-way link;

measuring HUB #2eCPRI link time delay by the BBU;

In an implementation, the method further comprises the following steps:

t3a _ prime _ max is configured for HUB # 1.

In an implementation, the method further comprises the following steps:

and configuring time delay compensation for the RRU.

A BBU, comprising:

the acquisition module is used for acquiring the time delay processing capacity parameter of the cascade HUB;

and the processing module is used for setting the total time delay of the CPRI link according to the time delay processing capacity parameter.

In an implementation, the processing module is further configured to obtain, from the HUB, a transmission delay of the CPRI link network, and determine a latest time point T3a _ prime _ max of the northbound merged data, where Ta3_ prime _ max is a maximum copy/merge processing delay of the HUB on the southbound cascade port.

In an implementation, the processing module is further configured to, after acquiring the CPRI link network transmission delay from the HUB, determine that the data latest time point T3a _ prime _ max after the northbound is determined, include:

acquiring the transmission delay of a CPRI link network;

calculating T12_3, T12_2, T34_1 and T34_2 delays, wherein T12_3 is CPRI optical fiber delay, T12_2 is transmission delay between HUB #1 and HUB #2, T34_1 is transmission delay between HUB #1 and BBU, and T34_2 is transmission delay between HUB #2 and BBU;

measuring the time delay of a HUB #1eCPRI unidirectional link;

measuring HUB #2eCPRI link time delay;

calculating eCPRI link delay T12_1, T12_2, T34_1 and T34_2, wherein T12_1 is transmission delay between HUB #1 and BBU, T12_2 is transmission delay between HUB #1 and HUB #2, T34_1 is transmission delay between HUB #1 and BBU, and T34_2 is transmission delay between HUB #2 and BBU;

after T3a _ prime _ max is calculated, the BBU is sent to HUB #1 so that HUB #1 serves as the latest point in time for northbound data to merge.

In an implementation, the method further comprises the following steps:

and the configuration module is used for configuring T3a _ prime _ max to HUB # 1.

In implementation, the configuration module is further configured to configure the BBU for the RRU with delay compensation.

A computer-readable storage medium storing a computer program for executing the above-described time delay processing method.

The invention has the following beneficial effects:

in the technical scheme provided by the embodiment of the invention, because the HUB processes the time delay parameter at one side of the northbound node according to the eCPRI and processes the time delay parameter at one side of the southbound node according to the CPRI, a feasible scheme can be provided for the defect that the current open access standard cannot meet the time delay management parameter of the base station under the mixed architecture; technical parameters meeting the time delay management requirements of the base station under the hybrid architecture are formulated.

Drawings

The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the invention and not to limit the invention. In the drawings:

fig. 1 is a schematic flow chart of an implementation of a HUB-side delay processing method according to an embodiment of the present invention;

FIG. 2 is a diagram illustrating the definition of delay reference points and delay parameters according to an embodiment of the present invention;

FIG. 3 is a schematic diagram of uplink U-plane (IQ) data timing sequence according to an embodiment of the present invention;

FIG. 4 is a schematic diagram of a downlink U-plane (IQ) data timing sequence according to an embodiment of the present invention;

FIG. 5 is a schematic diagram of an implementation route of a delay processing method on a BBU according to an embodiment of the present invention;

fig. 6 is a schematic flow chart of an implementation of a delay management method according to an embodiment of the present invention;

FIG. 7 is a schematic view of a HUB structure according to an embodiment of the present invention;

FIG. 8 is a schematic view of HUB structure II according to an embodiment of the present invention;

FIG. 9 is a schematic view of the BBU structure in an embodiment of the present invention;

FIG. 10 is a schematic diagram of BBU structure two in the embodiment of the present invention.

Detailed Description

The following describes embodiments of the present invention with reference to the drawings.

In the description process, the implementation of the HUB, BBU and RRU sides will be described separately, and then examples of their cooperative implementation will be given to better understand the implementation of the scheme given in the embodiments of the present invention. Such description does not mean that they must be implemented in cooperation or separately, and in fact, when they are implemented separately, they each solve the problem on one side thereof, and when they are used in combination, they achieve better technical effects.

The scheme meets the network structure of a HUB cascade mode and meets the processing of extra time delay brought by uplink data combination and downlink data copying of a shared cell.

In the scheme, a time delay reference point is set and a time delay parameter corresponding to the reference point is given. Furthermore, a processing scheme for implementing the time delay parameter among the BBU, the extended unit HUB and the remote unit RRU is also provided.

Fig. 1 is a schematic flow chart of an implementation of a HUB-side delay processing method, as shown in the figure, the method may include:

step 101, the HUB processes a time delay parameter at one side of a northbound node according to eCPRI, wherein the northbound node is a BBU (building base Unit) or a superior HUB connected with the HUB;

and 102, the HUB processes the time delay parameter at one side of the southbound node according to the CPRI, wherein the southbound node is the RRU connected with the HUB.

Specifically, firstly, the parameters of the relative delay of the HUB in the extension unit are defined.

Since the 7-2 × 8 forwarding network introduces an extension unit HUB, the delay parameters for the HUB can be defined as follows:

setting and defining a downlink data Copy time delay T-Copy for a time delay parameter of an extension unit HUB;

setting and defining uplink data merging time delay T-Comb for the time delay parameter of the extension unit HUB;

defining TBDelayDL for the downlink processing time delay of the extension unit;

defining TBDelayUL for the uplink processing time delay of the extension unit;

and the time delay T14 of uplink and downlink data loop at the connection point of the extension unit HUB and the radio frequency unit RRU.

Based on the above definition of the delay parameter for the HUB, the hybrid forwarding network uses the extension unit HUB as a demarcation point, and then:

all northbound nodes (the HUB northbound is only connected with a BBU or a superior HUB) delay parameter management utilizes eCPRI delay definition;

the time delay parameter management of the south node (particularly the RRU connected in the south direction of the HUB) utilizes CPRI time delay definition.

Then, the definition of the time delay of the unicom eccri segment and the CPRI segment by using the HUB as a connection point can be described by the following embodiments.

Firstly, defining the time delay of a forwarding interface.

1. Setting a time delay reference point and defining parameters.

Fig. 2 is a schematic diagram illustrating the definition of the delay reference point and the delay parameter, as shown in the figure, taking 2-stage HUB cascade as an example, the delay reference point is shown by a dashed circle.

Table 1 gives the definition and description of the northbound delay parameters (northbound, that is, the eccri segment) of the BBU and HUB #1, HUB #1 and HUB #2 based on the hybrid forwarding network baseband extension unit and HUB #2 in fig. 2, and for the management of the delay parameters, the notification can be interactively performed among the BBU, HUB and RRU through management plane messages.

Table 1: hybrid forwarding network 7-2x segment delay parameter definition

Table 2 shows the delay parameters of the hybrid forwarding network in segment 8 (segment 8, i.e. CPRI segment). The delay parameters may also be exchanged between the HUB and the RRU using management plane messages.

Table 2: hybrid forwarding network to 8-segment delay parameter definition

2. Delay parameter relationship specification

Table 3 shows a delay parameter calculation method under a 7-2 × 8 architecture of the hybrid forwarding network, which provides a basis for a delay definition process.

Table 3: time delay parameter calculation method

Uplink and downlink time delay design of second-pass and forward-pass mixed architecture

The following timing relationships are exemplified by U-plane data transmission.

Fig. 3 is a schematic timing diagram of uplink U-plane (IQ) data, and as shown in the figure, in the uplink delay design, UL delay model parameters are as shown in fig. 3, and the design manner for establishing the timing relationship may be as follows:

1. introducing the cascaded HUB does not change the total time delay from the BBU to the RRU, and then designing T34_ max to satisfy the following relationship:

T34_max≥T34_1_max+T_Comb(HUB#1)+T34_2_max；

the T _ Comb is the uplink merging processing time delay of all the HUBs and is reported through the management plane, and the T _ Comb is the uplink merging processing time delay of all the HUBs;

The method is popularized to the condition that N HUB cascades exist in the forwarding network,

wherein: n is a positive integer greater than 1.

Specifically, for T34_ max, in order to enable the BBU to normally receive uplink data, the BBU is finally reflected in the uplink delay of T34, and if T34_ max is greater than or equal to the delay of the level below the uplink delay and the uplink combining delay, the BBU can receive the uplink data within the window.

For reporting through the management plane, reporting on the management plane, i.e. on the network management path, is currently used.

2. The latest time of UL U-plane data sent by the HUB to the northbound node for merging does not exceed Ta3_ prime _ max, and then Ta3_ prime _ max is designed to meet the following conditions:

Ta3_prime_max(HUB#1)≤Ta4_max-T34_1_max；

ta4_ max is the BBU sending or receiving window maximum time difference;

t34_1_ max is the maximum transmission delay between HUB #1 and BBU.

Generalizing to the case that N HUB cascades exist in the forwarding network, Ta3_ prime _ max satisfies the following relationship:

here, HUB # n refers to n-stage HUBs in the cascade HUB.

3. If the time for the HUB to wait for the merging process is greater than or equal to the time for receiving all UL data, T _ Waiting (HUB #1) is designed to satisfy the following relationship:

T_Waiting(HUB#1)＝Ta3_prime_max(HUB#1)-T_Comb(HUB#1)；

TBa3_ max is the maximum equivalent delay of HUB #2 and RRU on the U plane;

Generalizing to the case that N HUB cascades exist in the fronthaul network, T _ Waiting (HUB # N) satisfies the following relationship:

wherein the content of the first and second substances,

specifically, for T _ Waiting, the Waiting time Waiting for the HUB is the latest sending time-the time delay for processing uplink combining by itself, and the Waiting time (transmission delay + processing delay) can guarantee that data can be collected.

After extending to n stages, the HUB waits for the combining process for a time equal to or longer than the time for receiving all UL data.

And fourthly, designing downlink time delay.

Fig. 4 is a schematic diagram of downlink U-plane (IQ) data timing, and as shown in the figure, the conditions for establishing the DL timing relationship are as follows:

the maximum transmission time delay of the uplink and the downlink is equal, namely:

T12_max＝T34_max

T12_i_max＝T34_i_max(i＝1～N)

and fifthly, managing the forward transmission delay.

1. And (5) forward transmission delay management process.

Fig. 5 is a schematic diagram of an implementation route of the delay processing method on the BBU, as shown in the figure, the implementation route may include:

step 501, a BBU acquires a time delay processing capacity parameter of a cascade HUB;

and step 502, the BBU sets the total time delay of the CPRI link according to the time delay processing capacity parameter.

In the implementation, the method can further comprise the following steps:

after obtaining the CPRI link network transmission delay T14 delay from the HUB, the BBU determines the latest time point T3a _ prime _ max of the northbound merged data, where Ta3_ prime _ max is the maximum copy/merge processing delay of the HUB on the southbound cascade port.

In implementation, after acquiring the CPRI link network transmission delay T14 from the HUB, the BBU determines the latest time point T3a _ prime _ max of the northbound merged data, including:

the BBU acquires the network transmission delay of the CPRI link;

the BBU measures the time delay of a HUB #1eCPRI one-way link;

measuring HUB #2eCPRI link time delay by the BBU;

The above can be advanced to n stages according to a formula in a specific implementation, and 2 stages are schematic illustrations.

Among them, for example: the BBUs can calculate T12_ n, T12_2, T34_1, T34_ n delays, where T12_ n is CPRI fiber delay, T12_ n is transmission delay between HUB #1 and nth stage HUB, T34_1 is transmission delay between HUB #1 and BBU, and T34_ n is transmission delay between HUB # n and BBU;

the BBUs calculate to obtain eCPRI link delay T12_1, T12_2, T34_1, and T34_ n, where T12_1 is transmission delay between HUB #1 and BBU, T12_2 is downlink transmission delay between HUB1 and 2 nd-stage HUB2, T34_1 is uplink transmission delay between BBU and HUB #1, and T34_ n is uplink transmission delay between HUB1 and nth-stage HUB 2.

In the implementation, the method can further comprise the following steps:

the BBU configures T3a _ prime _ max to the first-stage HUB # 1.

In the implementation, the method can further comprise the following steps:

and the BBU configures delay compensation T _ Cal _ DL/UL for the RRU.

Specifically, T is the time delay, Cal is the calculation, DL/UL refers to the uplink and downlink, and the letter itself has no extra meaning, and in the example, it is merely a mark and does not represent a limitation.

In the implementation, the method can further comprise the following steps:

Specifically, T-waiting is calculated and used for BBU to configure time delay compensation for the RRU; t _ Waiting is the copy or merge processing latency of HUB #1 on the southbound cascade port.

Specifically, based on the above delay parameter definition, the delay calculation formula, and the uplink and downlink time analysis, when the delay processing of the mixed fronthaul 7-2 × to 8 architecture is performed, the delay management process may be based on NETCOFN and YANG mechanisms, and fig. 6 is a schematic implementation process diagram of the delay management method, as shown in the figure, the following steps may be performed:

1. the BBU acquires delay processing capability parameters T _ Copy, T _ Comb, TBDelayDL/UL, T _ Cal _ DL/UL _ max, Toffset, T2a and Ta3 of the cascaded HUB;

2. based on the time delay capability parameters, the BBU sets the total time delay T _ CPRI of the CPRI link;

3. HUB #2 measures time delay of a CPRI link T14 of the HUB and the RRU;

4. BBU obtains T14 time delay;

5. BBU calculates T12_3, T12_2, T34_1 and T34_2 time delay;

6. the BBU measures the time delay of a first-stage HUB #1eCPRI one-way link;

measuring HUB #2eCPRI link time delay by the BBU;

7. the BBU calculates and obtains eCPRI link time delays T12_1, T12_2, T34_1 and T34_ 2;

8. calculating a sending window and a receiving window;

9. calculating T3a _ prime _ max;

after the BBU calculates T3a _ prime _ max, the BBU sends the BBU to HUB #1 so that the HUB #1 is used as the latest time point for merging the northbound data;

10. configuring a timing window parameter T3a _ prime _ max;

BBU configures T3a _ prime _ max to first-stage HUB # 1;

11. HUB #1 calculates Twaiting;

12. and the BBU configures delay compensation T _ Cal _ DL/UL for the RRU.

Based on the same inventive concept, the embodiment of the present invention further provides a base station side device, a user equipment, and a long term evolution multi-carrier upgrade system in the long term evolution multi-carrier upgrade system, and because the principle of solving the problem of these devices is similar to the method for dynamically allocating the reserved resource of the uplink control channel in the long term evolution multi-carrier upgrade system, the implementation of these devices can refer to the implementation of the method, and the repeated parts are not described again.

When the technical scheme provided by the embodiment of the invention is implemented, the implementation can be carried out as follows.

FIG. 7 is a schematic diagram of a HUB structure, as shown, the HUB includes:

the processor 700, which is used to read the program in the memory 720, executes the following processes:

a transceiver 710 for receiving and transmitting data under the control of the processor 700.

In implementation, T34_ max satisfies the following relationship:

T34_max≥T34_1_max+T_Comb(HUB#1)+T34_2_max；

n is a positive integer greater than 1.

Ta3_prime_max(HUB#1)≤Ta4_max-T34_1_max；

ta4_ max is the BBU sending or receiving window maximum time difference;

t34_1_ max is the maximum transmission delay between HUB #1 and BBU.

T_Waiting(HUB#1)＝Ta3_prime_max(HUB#1)-T_Comb(HUB#1)；

TBa3_ max is the maximum equivalent delay of HUB #2 and RRU on the U plane;

when n is 1, T34_ n _ max is the maximum transmission delay between HUB #1 and BBU; when N is 2, …, N, T34_ N _ max is the maximum transmission delay between HUB # N and HUB # N-T _ Comb1, and N is the number of HUB cascades.

wherein the content of the first and second substances,

the downlink data Copy time delay T-Copy;

merging the uplink data by a time delay T-Comb;

a downlink processing time delay TBDelayDL;

the uplink processing time delay TBDelayUL;

In an implementation, the method further comprises the following steps:

Where in fig. 7, the bus architecture may include any number of interconnected buses and bridges, with various circuits being linked together, particularly one or more processors represented by processor 700 and memory represented by memory 720. The bus architecture may also link together various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. The bus interface provides an interface. The transceiver 710 may be a number of elements including a transmitter and a receiver that provide a means for communicating with various other apparatus over a transmission medium. The processor 700 is responsible for managing the bus architecture and general processing, and the memory 720 may store data used by the processor 700 in performing operations.

FIG. 8 is a schematic diagram of a HUB structure II, as shown, the HUB includes:

a northbound processing module 801, configured to process the delay parameter at one side of a northbound node according to the eccri, where the northbound node is a BBU or a last-stage HUB connected to the HUB;

and a southbound processing module 802, configured to process the delay parameter at one side of a southbound node according to the CPRI, where the southbound node is an RRU connected to the HUB.

T34_max≥T34_1_max+T_Comb(HUB#1)+T34_2_max；

n is a positive integer greater than 1.

Ta3_prime_max(HUB#1)≤Ta4_max-T34_1_max；

ta4_ max is the BBU sending or receiving window maximum time difference;

t34_1_ max is the maximum transmission delay between HUB #1 and BBU.

T_Waiting(HUB#1)＝Ta3_prime_max(HUB#1)-T_Comb(HUB#1)；

TBa3_ max is the maximum equivalent delay of HUB #2 and RRU on the U plane;

wherein the content of the first and second substances,

the downlink data Copy time delay T-Copy;

merging the uplink data by a time delay T-Comb;

a downlink processing time delay TBDelayDL;

the uplink processing time delay TBDelayUL;

In an implementation, the method further comprises the following steps:

For convenience of description, each part of the above-described apparatus is separately described as being functionally divided into various modules or units. Of course, the functionality of the various modules or units may be implemented in the same one or more pieces of software or hardware in practicing the invention.

FIG. 9 is a schematic view of a BBU configuration, as shown, the BBU includes:

a processor 900 for reading the program in the memory 920, executing the following processes:

acquiring a time delay processing capacity parameter of the cascade HUB;

a transceiver 910 for receiving and transmitting data under the control of the processor 900.

In an implementation, the method further comprises the following steps:

the BBU acquires the network transmission delay of the CPRI link;

the BBU measures the time delay of a HUB #1eCPRI one-way link;

measuring HUB #2eCPRI link time delay by the BBU;

In an implementation, the method further comprises the following steps:

t3a _ prime _ max is configured for HUB # 1.

In an implementation, the method further comprises the following steps:

and configuring time delay compensation for the RRU.

In fig. 9, among other things, the bus architecture may include any number of interconnected buses and bridges, with one or more processors, represented by processor 900, and various circuits, represented by memory 920, being linked together. The bus architecture may also link together various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. The bus interface provides an interface. The transceiver 910 may be a number of elements including a transmitter and a receiver that provide a means for communicating with various other apparatus over a transmission medium. The processor 900 is responsible for managing the bus architecture and general processing, and the memory 920 may store data used by the processor 900 in performing operations.

FIG. 10 is a schematic view of a BBU configuration two, as shown, the BBU includes:

an obtaining module 1001, configured to obtain a delay processing capability parameter of the cascaded HUB;

the processing module 1002 is configured to set a total time delay of the CPRI link according to the time delay processing capability parameter.

acquiring the transmission delay of a CPRI link network;

measuring the time delay of a HUB #1eCPRI unidirectional link;

measuring HUB #2eCPRI link time delay;

In an implementation, the method further comprises the following steps:

The invention also provides a computer readable storage medium, which stores a computer program for executing the time delay processing method.

See in particular the implementation of the delay processing methods on the HUB and BBU.

In summary, the embodiment of the present invention provides a base station delay processing scheme based on an eccri between a BBU and a HUB and based on a CPRI forward transmission protocol between the HUB and an RRU under a forward transmission hybrid architecture, where 7-2 × to 8. Specifically provided is:

a time delay calculation mode after an extension unit is introduced under a mixed forward-transmission networking architecture;

delay parameters after introduction of the extension unit HUB: T-Copy, T-Comb, TBDelayUL, TBDelayDL, T14;

designing 1, 2 and 3 according to the uplink time delay defined by the new mechanism;

designing 1 according to downlink time delay defined by a new mechanism;

a delay processing mode after an extension unit is introduced under a hybrid architecture;

and introducing a HUB delay processing mode after an extension unit under the hybrid architecture.

The scheme provides a feasible scheme aiming at the defect that the current open connection standard can not meet the base station time delay management parameters under the mixed architecture; technical parameters meeting the time delay management requirements of the base station under the hybrid architecture are formulated.

As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, optical storage, and the like) having computer-usable program code embodied therein.

The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.

Claims

1. A method for processing delay, comprising:

the method comprises the following steps that an extension unit HUB processes a time delay parameter at one side of a northbound node according to an evolved universal public radio interface eCPRI, wherein the northbound node is a baseband processing unit BBU or a superior HUB connected with the HUB;

and the HUB processes the time delay parameter at one side of the southbound node according to a common public radio interface CPRI, wherein the southbound node is a radio remote unit RRU connected with the HUB.

2. The method of claim 1, wherein T34_ max satisfies the following relationship:

T34_max≥T34_1_max+T_Comb(HUB#1)+T34_2_max；

3. The method according to claim 2, wherein if there are N HUB cascades, T34_ max satisfies the following relationship:

n is a positive integer greater than 1.

4. The method of claim 1 wherein the UL user plane data sent by the HUB to the northbound node for merging does not exceed Ta3_ prime _ max at the latest, Ta3_ prime _ max satisfying the following relationship:

Ta3_prime_max(HUB#1)≤Ta4_max-T34_1_max；

wherein, Ta3_ prime _ max (HUB # n) is the maximum copy or merge processing delay of HUB # n on the southbound cascade port, and n is the number of stages of HUB;

ta4_ max is the BBU sending or receiving window maximum time difference;

when n is 1, T34_1_ max is the maximum transmission delay between HUB #1 and BBU; when N is 2, …, N, T34_ N _ max is the maximum transmission delay between HUB # N and HUB # N-1.

5. The method of claim 4, wherein Ta3_ prime _ max satisfies the following relationship if there are N HUB cascades:

6. the method of claim 1, wherein the time for the HUB to wait for the combining process is greater than or equal to the time for receiving all the uplink UL data, and T _ Waiting (HUB #1) satisfies the following relationship:

T_Waiting(HUB#1)＝Ta3_prime_max(HUB#1)-T_Comb(HUB#1)；

TBa3_ max is the maximum equivalent delay of HUB #2 and RRU on the U plane;

when n is 1, T34_ n _ max is the maximum transmission delay between HUB #1 and BBU; when N is 2, …, N, T34_ N _ max is the maximum transmission delay between HUB # N and HUB # N-1, and N is the number of stages in the HUB cascade.

7. The method of claim 6, wherein if there are N HUB cascades, T _ watching (HUB # N) satisfies the following relationship:

wherein the content of the first and second substances,

8. the method of claim 1, wherein the delay parameter comprises one or a combination of the following parameters:

the downlink data Copy time delay T-Copy;

merging the uplink data by a time delay T-Comb;

a downlink processing time delay TBDelayDL;

the uplink processing time delay TBDelayUL;

9. The method of any of claims 1 to 8, further comprising:

10. The method of any of claims 1 to 8, further comprising:

11. The method of any of claims 1 to 8, further comprising:

12. A method for processing delay, comprising:

the BBU acquires a time delay processing capacity parameter of the cascade HUB;

13. The method of claim 12, further comprising:

14. The method of claim 13, wherein the BBU obtaining CPRI link network transmission delays from the HUB and determining the northbound merged data latest time point T3a _ prime _ max, comprises:

the BBU acquires the network transmission delay of the CPRI link;

the BBU measures the time delay of a HUB #1eCPRI one-way link;

measuring HUB #2eCPRI link time delay by the BBU;

15. The method of claim 12, further comprising:

the BBU configures T3a _ prime _ max to HUB # 1.

16. The method of claim 12, further comprising:

and the BBU configures time delay compensation for the RRU.

17. A HUB, comprising:

18. A HUB, comprising:

19. A BBU, comprising:

acquiring a time delay processing capacity parameter of the cascade HUB;

20. A BBU, comprising:

21. A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program for executing the method of any one of claims 1 to 16.