Communication method and apparatus

Abstract

A communication method and apparatus, which are conducive to reducing the probability of data-packet unpacking errors and improving the transmission performance. The method comprises: a first RAN node indicating by means of first information an application moment of a first compression mode and / or a first quantization bit width to a second RAN node, such that on the basis of the indication from the first RAN node, the second RAN node can apply the first compression mode and / or the first quantization bit width at the application moment, and the first RAN node also applies the first compression mode and / or the first quantization bit width at the application moment, such that the first RAN node and the second RAN node make the applications of the first compression mode and / or the first quantization bit width be aligned at the same moment (application moment).

Description

Communication method and apparatus

[0001] The present application claims priority from the Chinese patent application No. 202411030405.X filed on July 29, 2024, and entitled "Communication method and apparatus", the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

[0002] Embodiments of the present application relate to the field of communication, in particular to a communication method and apparatus. BACKGROUND

[0003] In a mobile communication scenario, when a base station in a radio access network (RAN) is deployed in a manner of upper layer splitting, the base station can be regarded as being composed of a central unit (CU) and a distributed unit (DU), and the CU and the DU perform information interaction through a backhaul link. Further, in an open RAN (O-RAN or ORAN), the DU can be further split into an open distributed unit (O-DU) and an open radio unit (O-RU), the O-RU and the O-DU are connected through an optical fiber, and the O-RU and the O-DU perform information interaction through a fronthaul link.

[0004] With the growth of mobile data, the data transmitted on the fronthaul link is increasing, but the capacity of the fronthaul link is limited, therefore, the protocol supports reducing the size of the data packet on the fronthaul link to reduce the bandwidth occupied by the data packet. At present, the ways to reduce the bandwidth occupied by the data packet on the fronthaul link mainly include two ways of compressing the data packet and reducing the quantization bit width of the data packet.

[0005] However, in actual application, when the compression manner or the quantization bit width of the data packet changes, the devices at both ends of the fronthaul link are prone to packet error. SUMMARY

[0006] The present application provides a communication method and apparatus, which reduces the probability of packet error and improves transmission performance.

[0007] In a first aspect, a communication method is provided. The method can be performed by a first RAN node, a module (e.g., a processor, a chip, or a chip system) applied to the first RAN node, or a logic node, a logic module, or software that can implement all or part of the functions of the first RAN node. The first RAN node can be an entity that implements a baseband processing function (e.g., a DU) or an entity that implements a radio frequency transceiver function (e.g., an RU). The method includes: sending first information to a second RAN node, the first information being used to determine an application time of a first parameter, the first parameter including a first compression mode and / or a first quantization bit width; and applying the first parameter at the application time.

[0008] Based on the above scheme, the first RAN node can indicate the application time of the first compression mode and / or the first quantization bit width to the second RAN node, so that the second RAN node can apply the first compression mode and / or the first quantization bit width at the application time according to the indication of the first RAN node, and the first RAN node also applies the compression mode and / or the quantization bit width at the application time. Therefore, the first RAN node and the second RAN node align the application of the first compression mode and / or the first quantization bit width to the same time (application time), and further make the first RAN node and the second RAN node maintain consistency of the quantization bit width and / or the compression mode at all times during the change of the compression mode and / or the quantization bit width, that is, align the used compression mode and / or quantization bit width, thereby avoiding the inconsistency of the quantization bit width and / or the compression mode used by the first RAN node and the second RAN node, leading to incorrect unpacking of the received data packet by the first RAN node and the second RAN node, reducing the probability of unpacking error, and improving the transmission performance.

[0009] In a possible design, the first information includes the application time; or the first information includes a first timestamp, and the application time is later than the first timestamp; or the first information includes the first timestamp and a first time length, and the first time length is a time interval between the application time and the first timestamp.

[0010] Based on this scheme, the second RAN node can accurately obtain the application time of the first parameter, and further make the first RAN node and the second RAN node start applying the first parameter from the same time.

[0011] In a possible design, the first information includes a first data packet number, and the data packet corresponding to the first data packet number starts to apply the first parameter; or the first information includes a second data packet number, and the data packet starting to apply the first parameter is later than the data packet corresponding to the second data packet number; or the first information includes the second data packet number and a first value, the data packet corresponding to the first data packet number starts to apply the first parameter, and the first value is a difference between the second data packet number and the first data packet number.

[0012] Based on the scheme, the second RAN node can accurately acquire from which data packet to start processing and applying the first parameter, and thus the first RAN node and the second RAN node can start applying the first parameter from processing the same data packet, so that the first RAN node and the second RAN node can adopt the same quantization bit width and / or compression manner when processing the same data packet.

[0013] In a possible design, the communication method further includes: receiving response information of the first information from the second RAN node; and starting to unpack using the first parameter from a time when the response information arrives.

[0014] Based on the scheme, the first RAN node starts to unpack using the first parameter at the time when the response information arrives, which is beneficial to reducing the total time delay of applying the first parameter.

[0015] In a possible design, the communication method further includes: receiving response information of the first information from the second RAN node, the response information including indication information of a first time; and starting to unpack using the first parameter from the first time.

[0016] Based on the scheme, the first RAN node starts to unpack using the first parameter at the first time, so that the second RAN node can directly send, to the first RAN node, data packets generated according to the old quantization bit width and / or compression manner in the time period between sending the response information and the first time, without discarding all the data packets generated according to the old quantization bit width and / or compression manner, thereby reducing the data processing load of the second RAN node when updating the quantization bit width and / or compression manner.

[0017] In a possible design, the response information includes the first time; or the response information includes a second timestamp, the first time being later than the second timestamp; or the response information includes the second timestamp and a second time length, the second time length being a time interval between the first time and the second timestamp.

[0018] Based on the scheme, the first RAN node can accurately acquire the time to start unpacking using the first parameter, so that the first RAN node can start unpacking using the first parameter when the second RAN node starts to generate data packets using the first parameter, thereby ensuring that the parameter applied by the first RAN node for unpacking and the parameter applied by the second RAN node for generating data packets are consistent in time.

[0019] In a possible design, the response information includes a third packet number, and a packet corresponding to the third packet number starts to be generated using the first parameter; or the response information includes a fourth packet number, and a packet generated using the first parameter is later than a packet corresponding to the fourth packet number; or the response information includes the fourth packet number and a second value, and a packet corresponding to the third packet number starts to be generated using the first parameter, and the second value is a difference between the third packet number and the fourth packet number.

[0020] Based on this scheme, the first RAN node can accurately obtain a packet starting to be generated using the first parameter, so that the first RAN node starts to generate a first packet using the first parameter, which is the same as a first packet generated by the second RAN node using the first parameter.

[0021] In a possible design, the communication method further includes: sending, to the second radio access network node, second information, where the second information indicates that the first access network node has applied the first compression manner and / or the first quantization bit width.

[0022] Based on this scheme, the second RAN node can further verify the parameter applied by the first RAN node, and facilitate the second RAN node to verify whether the currently applied parameter is the same as the parameter of the first RAN node.

[0023] In a possible design, the second radio access network node is a distributed unit (DU) or a radio frequency unit (RU).

[0024] In a possible design, the sending, to the second radio access network node, of the first information includes: receiving the first information from a third radio access network node, where the third radio access network node is a centralized unit (CU); and sending, to the second radio access network node, the first information, where the second radio access network node is an RU.

[0025] Based on this scheme, the first information is from the third RAN node, and the first RAN node mainly sends the first information to the second RAN node, and the control of the time when the first parameter is applied is implemented by the third RAN node, thereby reducing the requirement on physical resource occupation and computing capability of the first RAN node in the process of updating the quantization bit width and / or the compression manner.

[0026] In a possible design, the communication method further includes: sending, to the third radio access network node, third information, where the third information indicates a data transmission load between the first radio access network node and the second radio access network node, and the data transmission load is used to determine the first parameter.

[0027] Based on this scheme, it is beneficial for the third RAN node to accurately set the first parameter applied by the first RAN node and the second RAN node.

[0028] In a second aspect, a communication method is provided. The method can be performed by a second RAN node, or by a module (e.g., a processor, a chip, or a chip system, etc.) applied to the second RAN node, or by a logical node, a logical module, or software that can implement all or part of the functions of the second RAN node. The second RAN node can be an entity that implements baseband processing functions (e.g., a DU), or can also be a protocol layer entity that implements radio frequency transceiver functions (e.g., an RU). The method includes: receiving first information from a first RAN node, the first information being used to determine an application time of a first parameter, the first parameter including a first compression mode and / or a first quantization bit width; and applying the first parameter at the application time.

[0029] In a possible design, the first information includes the application time; or the first information includes a first time stamp, the application time being later than the first time stamp; or the first information includes the first time stamp and a first time length, the first time length being a time interval between the application time and the first time stamp.

[0030] In a possible design, the first information includes a first data packet number, a data packet corresponding to the first data packet number being the data packet at which the first parameter starts to be applied; or the first information includes a second data packet number, a data packet later than a data packet corresponding to the second data packet number being the data packet at which the first parameter starts to be applied; or the first information includes the second data packet number and a first value, the data packet corresponding to the first data packet number being the data packet at which the first parameter starts to be applied, and the first value being a difference between the second data packet number and the first data packet number.

[0031] In a possible design, the communication method further includes: sending, to the first RAN node, response information of the first information, the response information including indication information of the first time; and generating data packets using the first parameter starting from the first time.

[0032] In a possible design, the communication method further includes: sending, to the first RAN node, response information of the first information; and generating data packets using the first parameter starting from a time of sending the response information.

[0033] In a possible design, the response information includes the first time; or the response information includes a second time stamp, the first time being later than the second time stamp; or the response information includes the second time stamp and a second time length, the second time length being a time interval between the first time and the second time stamp.

[0034] In a possible design, the response information includes a third packet number, and the data packet corresponding to the third packet number is generated using the first parameter; or the response information includes a fourth packet number, and the data packet generated using the first parameter is later than the data packet corresponding to the fourth packet number; or the response information includes the fourth packet number and a second value, and the data packet corresponding to the third packet number is generated using the first parameter, and the second value is a difference between the third packet number and the fourth packet number.

[0035] In a possible design, the communication method further includes: receiving second information from the first radio access network node, where the second information indicates that the first radio access network node has applied the first compression manner and / or the first quantization bit width.

[0036] The communication apparatus in the third aspect and any of the possible implementation manners can be used to implement the communication method in the first aspect and any of the possible implementation manners.

[0037] The third aspect provides a communication apparatus for implementing various methods. The communication apparatus includes modules, units, or means corresponding to the methods, which can be implemented by hardware, software, or by executing corresponding software by hardware. The hardware or software includes one or more modules or units corresponding to the functions.

[0038] In some possible designs, the communication apparatus can include a processing module and a transceiver module. The processing module can be used to implement the processing functions in any of the aspects and any of the possible implementation manners. The transceiver module can include a receiving module and a sending module, which are used to implement the receiving functions and the sending functions in any of the aspects and any of the possible implementation manners.

[0039] In some possible designs, the transceiver module can be composed of a transceiver circuit, a transceiver, a transceiver, or a communication interface.

[0040] The fourth aspect provides a communication apparatus, including: a processor and a memory; the memory is used to store computer instructions, when the processor executes the instructions, to make the communication apparatus execute the method in any of the aspects.

[0041] The fifth aspect provides a communication apparatus, including: a processor and a communication interface; the communication interface is used to communicate with modules outside the communication apparatus; the processor is used to execute computer programs or instructions, to make the communication apparatus execute the method in any of the aspects.

[0042] In a sixth aspect, a communication apparatus is provided, which comprises at least one processor; the processor is configured to execute computer programs or instructions stored in a memory, so as to enable the communication apparatus to perform the method of any one of the first aspect to the fifth aspect. The memory can be coupled with the processor, or can be independent of the processor.

[0043] In a seventh aspect, a communication apparatus (e.g., which can be a chip or a chip system) is provided, which comprises a processor configured to implement the functions of any one of the first aspect to the sixth aspect.

[0044] In some possible designs, the communication apparatus comprises a memory configured to store necessary programs and data.

[0045] In some possible designs, when the apparatus is a chip system, the apparatus can be composed of a chip, or can comprise a chip and other discrete components.

[0046] It can be understood that the communication apparatus provided in the third aspect to the seventh aspect can be the first RAN node in the first aspect, or can be a module or unit (e.g., a chip or a chip system or a circuit) corresponding to the first RAN node performing the method / operation / step / action described in the first aspect, or can be a module or unit capable of being used in conjunction with the first RAN node, or can also be a logic node, a logic module or software capable of implementing all or part of the functions of the first RAN node; or the communication apparatus can be the second RAN node in the second aspect, or can be a module or unit (e.g., a chip or a chip system or a circuit) corresponding to the second RAN node performing the method / operation / step / action described in the second aspect, or can be a module or unit capable of being used in conjunction with the second RAN node, or can also be a logic node, a logic module or software capable of implementing all or part of the functions of the second RAN node.

[0047] It can be understood that, when the communication apparatus in any one of the fourth aspect to the seventh aspect is a chip, the sending action / function of the communication apparatus can be understood as outputting information, and the receiving action / function of the communication apparatus can be understood as inputting information.

[0048] In an eighth aspect, a computer readable storage medium is provided, which stores computer programs or instructions, when the computer programs or instructions are run on a communication apparatus, enable the communication apparatus to perform the method of any one of the first aspect to the sixth aspect.

[0049] In a ninth aspect, a computer program product is provided, which comprises instructions, when the instructions are run on a communication apparatus, enable the communication apparatus to perform the method of any one of the first aspect to the sixth aspect.

[0050] In a tenth aspect, a communication system is provided, which includes a first RAN node and a second RAN node. The first RAN node is configured to perform the method of any possible design of the first aspect, and the second RAN node is configured to perform the method of any possible design of the second aspect.

[0051] The technical effects brought by any of the designs of the third aspect to the tenth aspect can be referred to the technical effects brought by different designs of the first aspect and the second aspect, which will not be repeated here. BRIEF DESCRIPTION OF DRAWINGS

[0052] FIG. 1 is a schematic diagram of an architecture of a radio access network provided in the present disclosure;

[0053] FIG. 2 is a schematic diagram of a protocol stack architecture of a base station provided in the present disclosure;

[0054] FIG. 3 is a schematic diagram of an architecture of a communication system provided in the present disclosure;

[0055] FIG. 4 is a schematic diagram of a flow of a communication method provided in the present disclosure;

[0056] FIG. 5 is a schematic diagram of a first parameter taking effect timing provided in the present disclosure;

[0057] FIG. 6 is a schematic diagram of another first parameter taking effect timing provided in the present disclosure;

[0058] FIG. 7 is a schematic diagram of a quantization bit width lookup table provided in the present disclosure;

[0059] FIG. 8 is a schematic diagram of a flow of another communication method provided in the present disclosure;

[0060] FIG. 9 is a schematic diagram of another first parameter taking effect timing provided in the present disclosure;

[0061] FIGS. 10-12 are schematic diagrams of structures of communication apparatuses provided in the present disclosure. DETAILED DESCRIPTION

[0062] In the description of the present disclosure, unless otherwise specified, “ / ” represents an “or” relationship between the associated objects, for example, A / B can represent A or B; “and / or” in the present disclosure is only a description of the associated relationship of the associated objects, which means that there can be three relationships, for example, A and / or B, which means that there are three cases of A alone, A and B together, and B alone, where A and B can be singular or plural.

[0063] In the description of the present application, "a plurality of" means two or more than two, unless otherwise specified. "At least one of the following" or similar expressions means any combination of the items, including any combination of single or multiple items. For example, at least one of a, b, or c can mean a, b, c, a-b, a-c, b-c, or a-b-c, where a, b, and c can be single or multiple.

[0064] In addition, in order to facilitate the clear description of the technical solutions of the embodiments of the present application, in the embodiments of the present application, "first", "second" and the like are used to distinguish the same items or similar items with basically the same function and role. Those skilled in the art can understand that "first", "second" and the like do not limit the quantity and execution order, and "first", "second" and the like do not necessarily mean different.

[0065] In the embodiments of the present application, the words "exemplary" or "for example" are used to mean serving as an example, instance, or illustration. Any embodiment or design presented as "exemplary" or "for example" in the embodiments of the present application should not be construed as being more preferred or advantageous than other embodiments or design solutions. Rather, the use of the words "exemplary" or "for example" is intended to present concepts in a concrete manner, facilitating understanding.

[0066] It can be understood that the "embodiments" mentioned throughout the specification mean that the specific features, structures or characteristics related to the embodiments are included in at least one embodiment of the present application. Therefore, the various embodiments throughout the specification do not necessarily refer to the same embodiment. In addition, these specific features, structures or characteristics can be combined in one or more embodiments in any suitable manner. It can be understood that in various embodiments of the present application, the size of the sequence number of each process does not mean the execution order, and the execution order of each process should be determined by its function and inherent logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0067] It can be understood that in the present application, "when" and "if" both refer to making corresponding processing under certain objective circumstances, not limited to time, and do not require judgment actions when implementing, nor mean that there are other limitations.

[0068] It can be understood that some optional features in the embodiments of the present application can be implemented independently in some scenarios without relying on other features, such as the scheme currently based on, to solve the corresponding technical problems and achieve the corresponding effects. In some scenarios, it can also be combined with other features according to demand. Correspondingly, the devices given in the embodiments of the present application can also realize these features or functions, which will not be described here.

[0069] In the present application, the same or similar parts among various embodiments can be mutually referred to, unless otherwise specified. In various embodiments of the present application, the terms and / or descriptions of different embodiments are consistent, and can be mutually referred to, unless otherwise specified and logically conflicted. The technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationship. The implementation manners of the present application described below do not constitute a limitation on the protection scope of the present application.

[0070] In order to facilitate the understanding of the technical solutions of the embodiments of the present application, first, a brief introduction of the related technologies of the present application is given as follows.

[0071] 1. A fourth-generation (4G) base station (eNodeB):

[0072] In a 4G communication system, in the process of base station deployment, the base station is usually split into a baseband processing unit (BBU) and a remote radio unit (RRU) by means of bottom-layer splitting, and the BBU is connected with one or more RRUs through optical fibers, metal wiring or microwave links, etc.

[0073] Among them, the BBU is mainly used to realize the upper-layer centralized processing function of the baseband signal, and the RRU is mainly used to realize the functions of receiving and transmitting the baseband signal, and modulating and demodulating the radio frequency signal, data processing, power amplification, etc. The RRU is closer to the transceiver antenna than the BBU, so the feeder loss of the RRU is smaller, and the RRU can also be called a radio unit (RU).

[0074] Under this base station deployment mode, the BBU can highly centrally process the baseband signal, so that the computing resources of the base station can be centrally deployed, making the utilization rate of the computing resources of the base station higher and the deployment cost lower. However, this base station deployment mode has a large demand for the Fronthaul link bandwidth between the BBU and the RU, and the deployment cost of optical fibers is higher.

[0075] 2. A fifth-generation (5G) base station (gNodeB, gNB):

[0076] In a 5G communication system, in the process of base station deployment, the base station is usually split into a central unit (CU) and a distributed unit (DU) by means of upper-layer splitting, and the Midhaul link between the CU and the DU has a lower demand for network bandwidth.

[0077] The overall architecture of a 5G radio access network (also referred to as NG-RAN, next generation radio access network) in a 5G communication system is shown in FIG. 1. The gNB in the radio access network is connected to the core network (5G core, 5GC) through an NG interface, and the gNB is composed of a gNB-CU and a gNB-DU.

[0078] The function split between the CU and the DU in the gNB adopts a static split manner, and is fixedly divided according to the function granularity of the protocol stack. Among them, the media access control (MAC) layer, the radio link control (RLC) layer and the physical (PHY) layer are located in the DU, and the service data adaptation protocol (SDAP) layer, the packet data convergence protocol (PDCP) layer and the radio resource control (RRC) layer are located in the CU.

[0079] Among them, the RRC layer is used to implement air interface radio resources and air interface connection control, and belongs to the control plane (CP) protocol; the SDAP layer is used to implement the mapping between the quality of service flow (QoS) flow and the data radio bearer (DRB), and belongs to the user plane (UP) protocol. The QoS flow is a service data flow with quality of service requirements; the RLC is a sublayer of air interface layer 2, and is used to provide transparent data transmission and non-acknowledgment mode and acknowledgment mode data transmission; the MAC layer is also a sublayer of air interface layer 2, and is used to control and connect the physical medium of the physical layer; and the PHY layer is used to transmit bits or bit groups on the physical medium, such as including encoding and decoding of transmitted and received information.

[0080] In the case of CU / DU separation in the gNB and control plane / user plane separation in the CU, the protocol stack architecture of the gNB can refer to (a) in FIG. 2. The protocol stack in the base station includes an air interface user plane protocol stack and an air interface control plane protocol stack.

[0081] The CU includes a CU-control plane unit (CU-CP) and a CU-user plane unit (CU-UP), both of which include a PDCP layer, an RRC layer is located above the PDCP layer in the CU-CP unit, and an SDAP layer is located above the PDCP layer in the CU-UP unit. The CU-UP unit is connected to the DU through an F1-U interface, and the CU-UP unit and the DU form an air interface user plane protocol stack. The CU-CP unit is connected to the DU through an F1-C interface, and the CU-CP unit and the DU form an air interface control plane protocol stack.

[0082] In an open access network (open RAN, O-RAN, or ORAN), as shown in (b) of FIG. 2, the DU can be further split into an open distributed unit (O-DU) and an open radio unit (O-RU). One O-DU can be connected to one or more O-RUs through an optical fiber. The interface between the O-RU and the O-DU is a fronthaul interface, that is, the link between the O-RU and the O-DU is a fronthaul link.

[0083] The O-DU has a baseband processing function and is mainly used for high-layer protocol functions such as data encryption and integrity protection, and also has a physical layer high-layer processing function. The O-RU is used to implement a physical layer bottom-layer signal processing function and is mainly used for transmitting and receiving radio frequency signals.

[0084] As shown in (c) and (d) of FIG. 2, the function split between the O-RU and the O-DU has two types, type A and type B. The difference between the type A split mode and the type B split mode is that the type A split mode splits the precoding function into the O-DU, while the type B split mode splits the precoding function into the O-RU. That is, in the type A split mode, the O-RU does not support precoding, and in the type B split mode, the O-RU supports precoding.

[0085] It can be understood that in different systems, entities implementing the same or similar protocol functions can have different names, but those skilled in the art can understand their meanings. For example, in a RAN system, the centralized unit is called CU, the distributed unit is called DU, and the radio unit is called RU, while in an ORAN system, the centralized unit is called O-CU (open CU), and similarly, the distributed unit is called O-DU (open DU), and the radio unit is called O-RU (open radio unit). For the convenience of description, the CU, DU, and RU are described in the subsequent description. The CU in the embodiments described below can be replaced or understood as O-CU, and the DU can be replaced or understood as O-DU.

[0086] Compared with the base station deployment manner in the 4G communication system, the bandwidth pressure and deployment cost of the fronthaul link in the 5G communication system are significantly reduced. However, with the growth of mobile data, the data transmitted on the fronthaul link is also growing, and the data capacity of the fronthaul link is limited, so the protocol supports compressing the data on the fronthaul link to reduce the bandwidth requirement of the fronthaul link. At present, the bandwidth requirement of the fronthaul link is usually reduced from two aspects, one is to compress the data packet, and the other is to reduce the quantization bit width corresponding to the data packet. Usually, the DU can indicate the compression manner of the data packet and the quantization bit width corresponding to the data packet to the RU.

[0087] In the current base station deployment scheme, when the compression manner and / or the quantization bit width of the data packet used in the fronthaul link change due to the change of traffic volume, and the DU and the RU change the compression manner and / or the quantization bit width through the indication information, due to the influence of the transmission delay of the indication information, the DU and the RU are prone to have inconsistent compression manner and / or quantization bit width (i.e., the compression manner and / or the quantization bit width are not aligned), which further causes the DU and the RU to have data packet unpacking errors, and affects the data transmission quality of the fronthaul link.

[0088] Based on this, the embodiment of the present application provides a communication method, the first RAN node indicates the application time of the first compression manner and / or the first quantization bit width to the second RAN node through the first information, the second RAN node can apply the first compression manner and / or the first quantization bit width at the application time according to the indication of the first RAN node, and the first RAN node also applies the compression manner and / or the quantization bit width at the application time, so that the first RAN node and the second RAN node both start to process the data packet based on the first compression manner and / or the first quantization bit width from the application time. That is, the first RAN node and the second RAN node align the application of the first compression manner and / or the first quantization bit width to the same time (application time), and further make the first RAN node and the second RAN node keep the consistency of the quantization bit width and / or the compression manner in the process of changing the compression manner and / or the quantization bit width, that is, align the used compression manner and / or quantization bit width, and further avoid the inconsistent quantization bit width and / or compression manner used by the first RAN node and the second RAN node, which causes the first RAN node and the second RAN node to unpack the received data packet incorrectly, reduces the probability of unpacking error, and improves the transmission performance.

[0089] The technical solutions of the embodiments of the present application can be applied to various communication systems, which can be a third generation partnership project (3GPP) communication system, for example, a long term evolution (LTE) system, a 4th generation (4G) system, a new radio (NR) system, a 5G system, a system of mixed networking of LTE and 5G, a non-terrestrial network (NTN), or other future communication systems. The communication system can also be a non-3GPP communication system, which is not limited.

[0090] It should be noted that the above communication system to which the present application is applicable is only an example, and the communication system to which the present application is applicable is not limited to this. The communication system provided by the present application does not cause any limitation to the solutions of the present application, and is uniformly described herein. The following will not be described again.

[0091] As shown in FIG. 3, a possible and non-limiting communication system can include a first radio access network (RAN) node 301 and a second RAN node 302. The first RAN node 301 and the second RAN node 302 are network side devices with wireless communication functions, used to assist terminals to realize network access.

[0092] The first RAN node and the second RAN node can be nodes in an O-RAN. For example, the first RAN node 301 and the second RAN node 302 are connected through a front link.

[0093] Optionally, one of the first RAN node 301 and the second RAN node 302 is an entity for realizing baseband processing function, such as a DU, and the other is an entity for realizing radio frequency signal transceiving function, such as an RU.

[0094] For example, the first RAN node 301 is an RU, and the second RAN node 302 is a DU, or the first RAN node 301 is a DU, and the second RAN node 302 is an RU.

[0095] Optionally, the communication system can further include a third RAN node 303 and a terminal 304, and the first RAN node 301, the second RAN node 302 and the third RAN node 303 can be entities for realizing different functions in an O-RAN, respectively. For example, the third RAN node is a CU.

[0096] In addition, in FIG. 3, the first RAN node 301 is connected with the third RAN node 303, and the second RAN node is connected with the terminal 304, that is, the first RAN node 301 is a DU, and the second RAN node 302 is a RU, which is taken as an example for description. In the case that the second RAN node 302 is connected with the third RAN node 303, and the first RAN node 301 is connected with the terminal 304, the first RAN node 301 is a RU, and the second RAN node is a DU.

[0097] Any of the CU, the DU and the RU in the present application can be implemented by a software module, a hardware module, or a combination of the software module and the hardware module.

[0098] Optionally, the terminal can also be referred to as a terminal device, a user equipment (UE), a mobile station, a mobile terminal, etc. The terminal can be widely applied to various scenarios, such as a device-to-device (D2D) communication system, a vehicle to everything (V2X) communication system, a machine-type communication (MTC) system, an internet of things (IOT) system, virtual reality, augmented reality, industrial control, automatic driving, remote medical treatment, a smart grid, smart furniture, smart office, smart wear, smart transportation, smart city, etc. The terminal can be a mobile phone, a tablet computer, a computer with wireless transceiving function, wearable equipment, a vehicle, a drone, a helicopter, an airplane, a ship, a robot, a mechanical arm, smart home equipment, etc. Embodiments of the present application do not limit the device form of the terminal.

[0099] It should be noted that the communication system described in the embodiments of the present application is for more clearly illustrating the technical solutions of the embodiments of the present application, and does not constitute a limitation on the technical solutions provided by the embodiments of the present application. It can be known by those skilled in the art that, with the evolution of network architecture and the appearance of new business scenarios, the technical solutions provided by the embodiments of the present application are also applicable to similar technical problems.

[0100] The communication method provided by the embodiments of the present application will be described below by taking the interaction between the first RAN node and the second RAN node in the communication system shown in FIG. 3 as an example. It should be noted that in the following embodiments of the present application, the names of messages, the names of parameters, or the names of information between the first RAN node and the second RAN node are only examples, and in other embodiments, they can also be other names, and the method provided by the present application does not make a specific limitation on this.

[0101] It can be understood that, in the embodiments of the present application, the first RAN node and the second RAN node can perform part or all of the steps in the embodiments of the present application, and these steps or operations are only examples, and the embodiments of the present application can also perform other operations or variations of various operations. In addition, various steps can be performed in different orders as presented in the embodiments of the present application, and it is possible that not all operations in the embodiments of the present application are performed.

[0102] It can be understood that, in the embodiments of the present application, the first RAN node and the second RAN node are taken as an example to illustrate the execution subject of the interaction, but the present application does not limit the execution subject of the interaction. For example, the method performed by the first RAN node in the present application can also be performed by a module (such as a chip, a chip system, or a processor) applied to the first RAN node, and can also be realized by a logical node, a logical module or software capable of realizing all or part of the functions of the first RAN node. The method performed by the second RAN node in the present application can also be performed by a module (such as a chip, a chip system, or a processor) applied to the second RAN node, and can also be realized by a logical node, a logical module or software capable of realizing all or part of the functions of the second RAN node.

[0103] In addition, "sending information" in the present application can be understood as one device sending information to another device, or can also be understood as one logical module in a device sending information to another logical module. For example, "the first RAN node sending information" can be understood as the first RAN node sending information to another device (such as the second RAN node), or can be understood as a logical module 1 (such as a processing module) in the first RAN node sending information to a logical module 2 (such as a transceiver module) in the first RAN node.

[0104] "Receiving information" in the present application can be understood as one device receiving information from another device, or can also be understood as one logical module in a device receiving information from another logical module. For example, "the second RAN node receiving information" can be understood as the second RAN node receiving information from another device (such as the first RAN node), or can be understood as a logical module 1 (such as a processing module) in the second RAN node receiving information from a logical module 2 (such as a transceiver module) in the second RAN node.

[0105] In the present application, "sending information to (e.g. a terminal)" or the related illustration in the drawings can be understood as that the destination of the information is the second RAN node. It can include directly or indirectly sending information to the second RAN node. "Receiving information from (e.g. a first RAN node)" or "receiving information sent by (e.g. a first RAN node)" or "receiving information sent by (e.g. a first RAN node)", or the related illustration in the drawings can be understood as that the source of the information is the first RAN node, and it can include directly or indirectly receiving information from the first RAN node. The information can be processed between the source and the destination of the information sending, such as format change, etc., but the destination can understand the effective information from the source. Similar expressions in the present application can be understood similarly, and will not be repeated here.

[0106] Referring to FIG. 4, a flow chart of a communication method provided by an embodiment of the present application is shown, which can include the following steps:

[0107] S401, the first RAN node sends first information to the second RAN node. Correspondingly, the second RAN node receives the first information from the first RAN node. The first information is used to determine the application time of the first parameter, and the first parameter includes the first compression mode and / or the first quantization bit width.

[0108] Exemplarily, the first parameter can be understood as a parameter identifying the data packet processing mode, or can be understood as a parameter used in the process of processing data packets by using a specific data packet processing mode. Correspondingly, the first information can be understood as the indication information of the update time of the data packet processing mode, or can be understood as the indication information of the application time of the new data packet processing mode.

[0109] Exemplarily, the first information can be carried by the control plane message between the first RAN node and the second RAN node, and the second RAN node parses the control plane message to obtain the first information; or the first information can also be contained in the packet header of the data packet sent by the first RAN node to the second RAN node, and the second RAN node obtains the first information in the process of unpacking.

[0110] For example, taking the first RAN node as a DU, the second RAN node as an RU, and the first parameter as a first quantization bit width as an example, after the first RAN node (DU) determines that the quantization bit width of the data packet needs to be updated to the first quantization bit width, the first RAN node (DU) can send first information to the second RAN node (RU) through a control message of an enhanced control plane radio interface (eCPRI), to indicate the effective time of the updated quantization bit width (the first quantization bit width) of the RU. Alternatively, the DU encapsulates the first information in the message header of a downlink data packet, and sends the downlink data packet carrying the first information to the RU.

[0111] In the embodiments of the present application, the downlink data packet can be understood as a data packet flowing from the DU to the RU, and correspondingly, the uplink data packet can be understood as a data packet flowing from the RU to the DU. In addition, the downlink data packet can also have other names, such as a data packet in a first transmission direction, and correspondingly, the uplink data packet can also have other names, such as a data packet in a second transmission direction. The first transmission direction is a data transmission direction from the DU to the RU, and the second transmission direction is a data transmission direction from the RU to the DU.

[0112] As a possible implementation, the first parameter can be understood as a target parameter used by the first RAN node and the second RAN node to process the data packet in a subsequent data interaction process, or it can also be understood as a target parameter used by the first RAN node and the second RAN node to process the data packet after adjusting the data packet processing method.

[0113] For example, the first compression method can be understood as a data packet compression method used by the first RAN node and the second RAN node in the compression process of the data packet after adjusting the data packet processing method, or it can also be understood as a data packet compression method used by the first RAN node and the second RAN node to unpack the received data packet after adjusting the data packet processing method, that is, the received data packet is unpacked as a data packet compressed by the first compression method after adjusting the data packet processing method.

[0114] The first quantization bit width can be understood as a quantization bit width used by the first RAN node and the second RAN node in the process of generating the data packet after adjusting the data packet processing method, or it can also be understood as a quantization bit width used by the first RAN node and the second RAN node to unpack the received data packet after adjusting the data packet processing method, that is, the received data packet is unpacked as a data packet generated according to the first quantization bit width after adjusting the data packet processing method.

[0115] The application time of the first parameter can be understood as a time when the first parameter starts to take effect, or an effective time of the first parameter; or can be understood as a starting time when the first parameter is used as a parameter in processing the data packet. Processing the data packet using the first parameter includes generating the data packet according to the first parameter and unpacking the data packet as the data packet generated according to the first parameter.

[0116] Optionally, the first RAN node is a DU, and the second RAN node is an RU, or the first RAN node is an RU, and the second RAN node is a DU.

[0117] S402, the first RAN node and the second RAN node apply the first parameter at the application time.

[0118] The application of the first parameter at the application time can be understood as that, from the application time, the first parameter is used as a parameter in processing the data packet. That is, from the application time, the data packet is generated using the first parameter (or at the application time, the data packet generated using the first parameter can be sent), and / or the received data packet can be unpacked according to the first parameter (that is, the received data packet can be unpacked as the data packet generated using the first parameter).

[0119] It should be noted that the application of the first parameter by the first RAN node at the application time does not limit that the first RAN node must generate the data packet or unpack using the first parameter at the application time. Similarly, the application of the first parameter by the second RAN node at the application time does not limit that the second RAN node must generate the data packet or unpack using the first parameter at the application time.

[0120] As a possible implementation, after the application time, each of the first RAN node and the second RAN node can start to generate the data packet sent to the other RAN node according to the first parameter, and the first RAN node and the second RAN node can unpack the received data packet as the data packet generated according to the first parameter after receiving the data packet from the other party.

[0121] As another possible implementation, after the application time, each of the first RAN node and the second RAN node can start to send the data packet generated according to the first parameter to the other RAN node, and the first RAN node and the second RAN node can unpack the received data packet as the data packet generated according to the first parameter after receiving the data packet from the other party. The data packet generated according to the first parameter and sent after the application time can be generated according to the first parameter before the application time, or can be generated after the application time.

[0122] It is worth mentioning that in the case that the first RAN node is a DU and the second RAN node is an RU, the data packet sent by the first RAN node to the second RAN node can be referred to as a downlink data packet; in the case that the first RAN node is an RU and the second RAN node is a DU, the data packet sent by the first RAN node to the second RAN node can be referred to as an uplink data packet.

[0123] Based on the above scheme, the first RAN node indicates the application time of the first compression manner and / or the first quantization bit width to the second RAN node through the first information, and the second RAN node can apply the first compression manner and / or the first quantization bit width at the application time according to the indication of the first RAN node. The first RAN node also applies the compression manner and / or the quantization bit width at the application time, so that the first RAN node and the second RAN node both start to process the data packet based on the first compression manner and / or the first quantization bit width from the application time. That is, the first RAN node and the second RAN node align the application of the first compression manner and / or the first quantization bit width to the same time (application time), and further make the first RAN node and the second RAN node maintain the consistency of the quantization bit width and / or the compression manner at all times in the process of changing the compression manner and / or the quantization bit width, that is, align the used compression manner and / or quantization bit width, and further avoid the inconsistency of the quantization bit width and / or the compression manner used by the first RAN node and the second RAN node, which leads to the error unpacking of the received data packet by the first RAN node and the second RAN node, reduces the probability of unpacking error, and improves the transmission performance.

[0124] The overall flow of the communication method provided by the present application is described above, and the specific implementation of each step is introduced below.

[0125] In a possible implementation, the application time is a time point with a definite position on a time axis. In this case, the first information can include the following three implementation manners:

[0126] Manner 1: The first information includes the application time.

[0127] That is, after determining the application time of the first parameter, the first RAN node can directly send the application time as the first information to the second RAN node, or send the application time through a specified field of the first information to the second RAN node, and the second RAN node directly parses the first information to obtain the application time of the first parameter.

[0128] The application time can be represented by a system time or can be represented by a time stamp, for example. The system time can be understood as an internal time of a communication system in which the first RAN node and the second RAN node are located. For example, the system time can be universal time coordinated (UTC).

[0129] In a second possible implementation, the first information includes a first time stamp.

[0130] That is, after determining the application time of the first parameter, the first RAN node can send the first time stamp used to determine the application time to the second RAN node in the first information. After obtaining the first time stamp from the first information, the second RAN node can determine the application time of the first parameter according to the first time stamp.

[0131] As a possible implementation, the application time is a system time corresponding to the first time stamp, or the application time is the first time stamp.

[0132] For example, after obtaining the first time stamp, the second RAN node can obtain a system time corresponding to the first time stamp as the application time if the application time is represented by a system time. Or, the second RAN node can directly take the first time stamp as the application time if the application time is represented by a time stamp.

[0133] As another possible implementation, in the case where the first information includes the first time stamp, the application time is a time point that is separated from the first time stamp by a preset time length. For example, if the application time is represented by a time stamp, the application time can be a time stamp that is separated from the first time stamp by a preset time length. Or, if the application time is represented by a system time, the application time can be a time point that is separated from a time point corresponding to the first time stamp by a preset time length.

[0134] For example, after obtaining the first time stamp, the second RAN node can obtain, as the application time, a time point that is separated from a system time corresponding to the first time stamp by a preset time length if the application time is represented by a system time. Or, the second RAN node can obtain, as the application time, a time stamp that is separated from the first time stamp by a preset time length if the application time is represented by a time stamp.

[0135] The preset time length can be predefined, or can be determined by the second RAN node according to a transmission delay between the first RAN node and the second RAN node. The preset time length being predefined can be understood as the preset time length being agreed by the first RAN node and the second RAN node in advance, or can be understood as the preset time length being configured by the first RAN node for the second RAN node in advance, or can be understood as the preset time length being predefined by a protocol.

[0136] Optionally, in the case where the preset time length is determined by the second RAN node, the second RAN node can also send the determined preset time length to the first RAN node, or the first RAN node can determine the preset time length by using the same preset time length determination manner as the second RAN node, so that the first RAN node and the second RAN node keep consistent understanding of the application time.

[0137] Optionally, in the case where the preset time length is determined by the second RAN node, the second RAN node can also send the determined preset time length to the first RAN node, or the first RAN node can determine the preset time length by using the same preset time length determination manner as the second RAN node, so that the first RAN node and the second RAN node keep consistent understanding of the application time.

[0138] Optionally, in the case where the preset time length is determined by the second RAN node, the second RAN node can also send the determined preset time length to the first RAN node, or the first RAN node can determine the preset time length by using the same preset time length determination manner as the second RAN node, so that the first RAN node and the second RAN node keep consistent understanding of the application time.

[0139] That is, after determining the application time of the first parameter, the first RAN node can send the first time stamp and the first time length used to determine the application time in the first information to the second RAN node, and after obtaining the first time stamp and the first time length by analyzing the first information, the second RAN node can determine the application time of the first parameter according to the first time stamp and the first time length.

[0140] For example, after analyzing the first time stamp and the first time length, in the case where the application time is represented by a system time, the second RAN node can take the time after the system time corresponding to the first time stamp by the first time length as the application time, or in the case where the application time is represented by a time stamp, the second RAN node can take the time stamp after the first time stamp and having a time interval of the first time length from the first time stamp as the application time.

[0141] Optionally, in the case where the preset time length is determined by the second RAN node, the second RAN node can also send the determined preset time length to the first RAN node, or the first RAN node can determine the preset time length by using the same preset time length determination manner as the second RAN node, so that the first RAN node and the second RAN node keep consistent understanding of the application time.

[0142] Based on the above scheme, in the case that the application time or the information having the correlation with the application time is contained in the first information, the second RAN node can accurately obtain the application time of the first parameter indicated by the first RAN node, and then facilitate the first RAN node and the second RAN node to postpone the application of the first parameter to the same time (application time), so as to ensure that the first RAN node and the second RAN node can also keep consistent in the compression mode and / or quantization bit width (or in other words, can also align the quantization bit width and / or compression mode) during the process of updating the compression mode and / or quantization bit width, and reduce the probability of packet error.

[0143] In another possible implementation, the application time can also be understood as a time satisfying a preset condition, and the specific position of the time on the time axis is not clear.

[0144] For example, the application time can be understood as the time when the first RAN node and the second RAN node start processing a specific data packet (i.e., a data packet with a specific number), that is, the first RAN node and the second RAN node start to apply the first parameter from processing the specific data packet. Alternatively, the application time can also be understood as the time when the first RAN node and the second RAN node finish processing the data packet with the specific number, that is, the first RAN node and the second RAN node start to apply the first parameter after finishing processing the specific data packet.

[0145] In the case that the application time is the time satisfying the preset condition, for the first RAN node and the second RAN node, the first parameter application time of the first RAN node and the first parameter application time of the second RAN node can be inconsistent in the position on the time axis.

[0146] For example, the application time is the time when the first RAN node and the second RAN node start processing a specific data packet (denoted as data packet L), that is, the first RAN node and the second RAN node start to apply the first parameter to process the data packet from processing the data packet L.

[0147] In the case that the data packet L is a data packet sent by the first RAN node to the second RAN node, the first RAN node starts to apply the first parameter from generating the data packet L, and the first parameter application time of the first RAN node is the time when the generation of the data packet L starts; the second RAN node starts to apply the first parameter from unpacking the data packet L, and the first parameter application time of the second RAN node is the time when the data packet L is received, or the time when the unpacking of the data packet L starts.

[0148] Correspondingly, in the case that the data packet L is a data packet sent by the second RAN node to the first RAN node, the first RAN node applies the first parameter from the moment of unpacking the data packet L, and the first parameter of the first RAN node is applied at the moment of receiving the data packet L or the moment of starting to unpack the data packet L; the second RAN node applies the first parameter from the moment of generating the data packet L, and the first parameter of the second RAN node is applied at the moment of starting to generate the data packet L.

[0149] In the case that the application moment is the moment of satisfying the preset condition, the first information can include the following three implementation manners:

[0150] Manner 1: the first information includes a first data packet number. The first RAN node and the second RAN node start to apply the first parameter to the data packet corresponding to the first data packet number.

[0151] That is, the first RAN node determines the first data packet number, sends the first data packet number to the second RAN node as the first information, or sends the first data packet number to the second RAN node through a designated field of the first information. After receiving the first information, the second RAN node directly parses the first information to obtain the first data packet number, and starts to apply the first parameter to the data packet corresponding to the first data packet number.

[0152] Manner 2: the first information includes a second data packet number. The data packet corresponding to which the first RAN node and the second RAN node start to apply the first parameter is later than the second data packet number.

[0153] That is, after determining the data packet to be processed starting from which the first parameter is applied, the first RAN node can send the second data packet number associated with the data packet number of the data packet to the second RAN node in the first information, or send the second data packet number to the second RAN node as the first information. After parsing the first information to obtain the second data packet number, the second RAN node determines the data packet to be processed starting from which the first parameter is applied according to the association between the second data packet number and the data packet number of the data packet, and starts to apply the first parameter to the data packet.

[0154] For example, the data packet number of the data packet to be processed starting from which the first parameter is applied is located after the second data packet number, and the difference between the data packet number of the data packet and the second data packet number is a first preset value. After parsing the second data packet number, the second RAN node can determine the data packet number having a difference of the first preset value from the second data packet number among the data packet numbers after the second data packet number according to the second data packet number and the first preset value, and starts to apply the first parameter to the data packet corresponding to the data packet number.

[0155] The first preset value can be predefined or determined by the second RAN node according to the transmission delay between the first RAN node and the second RAN node. The first preset value being predefined can mean that the first preset value is agreed by the first RAN node and the second RAN node in advance, or that the first preset value is configured by the first RAN node for the second RAN node in advance, or that the first preset value is predefined by a protocol.

[0156] In addition, when the first preset value is determined by the second RAN node, the second RAN node can also send the first preset value to the first RAN node, or the first RAN node can obtain the first preset value in the same way as the second RAN node, so that the first RAN node and the second RAN node have the same understanding of the data packet number corresponding to the data packet pair to which the first parameter is applied.

[0157] In mode 3, the first information includes the second data packet number and the first value. The first RAN node and the second RAN node apply the first parameter to the data packet corresponding to the first data packet number. The first value is the difference between the second data packet number and the first data packet number.

[0158] That is, after the first RAN node determines to apply the first parameter to the data packet corresponding to the first data packet number, the first RAN node can send the second data packet number associated with the first data packet number and the first value in the first information to the second RAN node. After the second RAN node obtains the second data packet number and the first value by analyzing the first information, the second RAN node determines the first data packet number according to the second data packet number and the first value, and applies the first parameter to the data packet corresponding to the first data packet number.

[0159] For example, the first data packet number is located after the second data packet number, for example, the data packet corresponding to the first data packet number is the fifth, seventh or tenth data packet after the data packet corresponding to the second data packet number.

[0160] The first value can be predefined, or determined by the first RAN node according to the transmission delay between the first RAN node and the second RAN node, or determined by the second RAN node according to the transmission delay between the first RAN node and the second RAN node and sent to the first RAN node. The first value being predefined can mean that the first value is agreed by the first RAN node and the second RAN node in advance, or that the first value is predefined by a protocol.

[0161] Based on the above scheme, in the case that the first information contains information related to the data packet starting to apply the first parameter, the second RAN node can accurately acquire the data packet starting to apply the first parameter processing, which is beneficial for the first RAN node and the second RAN node to apply the first parameter starting from processing the same data packet (the data packet corresponding to the first data packet number), and ensures that the first RAN node and the second RAN node can use the same compression mode and / or quantization bit width in the process of updating the compression mode and / or quantization bit width, thereby reducing the probability of packet error.

[0162] In a possible implementation, after step S401, the second RAN node sends response information of the first information to the first RAN node, and the second RAN node generates the data packet using the first parameter starting from the sending time of the response information. Correspondingly, the first RAN node receives the response information of the first information from the second RAN node, and the first RAN node starts to unpack using the first parameter starting from the arrival time of the response information.

[0163] For example, the response information of the first information can be an acknowledge character (ACK) sent by the second RAN node to the first RAN node, or can also be an ACK with an extended field.

[0164] Optionally, the sending time and / or the arrival time of the response information is earlier than the application time indicated by the first information.

[0165] In the case that the second RAN node generates the data packet using the first parameter starting from the sending time of the response information, it can be understood that the second RAN node generates the data packet using the first parameter starting from the sending time of the response information, or uses the first parameter as the parameter applied in the process of generating the data packet. Alternatively, it can also be understood that the second RAN node uses the first parameter as the parameter applied in the process of generating the data packet starting from the sending time of the response information.

[0166] In the case that the first RAN node starts to unpack using the first parameter starting from the arrival time of the response information, it can be understood that the first RAN node starts to unpack using the first parameter starting from the arrival time of the response information, or uses the first parameter as the parameter applied in the process of unpacking (i.e., unpacks the received data packet as the data packet generated according to the first parameter). Alternatively, it can also be understood that the first RAN node uses the first parameter to unpack starting from the arrival time of the response information in the case of unpacking.

[0167] For example, referring to FIG. 5, the first RAN node is a DU, the second RAN node is an RU, the first parameter includes a first quantization bit width, and the application time of the first information is denoted as T. After receiving the first information from the first RAN node, the second RAN node (RU) sends response information ACK of the first information to the first RAN node (DU), and uses the first quantization bit width as the quantization bit width used in the process of generating a data packet since the sending time of the ACK (denoted as t1). After receiving the ACK from the RU, the DU uses the first quantization bit width as the quantization bit width of the data packet from the RU since the arrival time of the ACK (denoted as t2), and unpacks the data packet from the RU.

[0168] That is, the DU generates a data packet sent to the RU according to a historical quantization bit width before T, and generates a data packet sent to the RU according to the first quantization bit width after T; the DU unpacks a data packet from the RU according to the historical quantization bit width before t2, and unpacks a data packet from the RU according to the first quantization bit width after t2. The RU unpacks a data packet from the DU according to the historical quantization bit width before T, and unpacks a data packet from the DU according to the first quantization bit width after T; the RU generates a data packet sent to the DU according to the historical quantization bit width before t1, and generates a data packet sent to the DU according to the first quantization bit width after t1.

[0169] The historical quantization bit width can be understood as a quantization bit width applied by the first RAN node and the second RAN node before the application of the first parameter (or before step S401).

[0170] Optionally, after the application time, in the case that there are historical data packets in the second RAN node, the second RAN node can discard the historical data packets, and re-quantize data according to the first quantization bit width to generate new data packets and send the new data packets to the first RAN node. The historical data packets can be understood as data packets generated by the second RAN node according to the historical quantization bit width and not sent to the first RAN node.

[0171] The above embodiment is an example in which the first parameter includes the first quantization bit width. In the case that the first parameter includes a first compression mode or the first parameter includes the first compression mode and the first quantization bit width, the scheme in which the second RAN node generates a data packet using the first parameter since the sending time of the response information is similar to that in the above embodiment, and will not be described again.

[0172] Based on the above scheme, the first RAN node starts to apply the first parameter to unpack after receiving the response information, and the second RAN node starts to apply the first parameter to generate a data packet or unpack after sending the response information, so that the quantization bit width and / or compression mode adopted by the first RAN node and the second RAN node before the second RAN node sends the response information and after the first RAN node receives the response information can remain consistent, and the total time length of the first RAN node and the second RAN node aligning the quantization bit width and / or the compression mode is ensured as much as possible, thereby reducing the probability of unpacking errors of the first RAN node and the second RAN node. In addition, the first RAN node and the second RAN node start to apply the first parameter to generate a data packet or unpack before the application time, so that the delay of the first RAN node and the second RAN node applying the first parameter is reduced, which is beneficial to reduce the total delay in the process of the first RAN node and the second RAN node applying the first parameter.

[0173] In another possible implementation, after step S401, the second RAN node sends response information of the first information to the first RAN node, and the second RAN node starts to generate a data packet using the first parameter from the first time. Correspondingly, the first RAN node receives the response information of the first information from the second RAN node, and the first RAN node starts to unpack using the first parameter from the first time.

[0174] The response information includes indication information used to indicate the first time.

[0175] For example, the indication information of the first time can be a timestamp corresponding to the first time, a data packet number corresponding to the first time, a time interval with the first time, or a method of determining the first time, etc. Wherein, the first interval can be predefined, or it can also be determined by the second RAN node according to the number of historical data packets, for example, the ratio of the first interval to the number of historical data packets is J, J is a positive number less than or equal to 1, or the first interval includes several predefined values, and each predefined value corresponds to a historical data packet number.

[0176] The meaning of the historical data packet can refer to the related description in the foregoing embodiments. The first interval can be predefined, which can be understood as that the first interval is predefined by the first RAN node and the second RAN node; or the first interval is configured by the first RAN node for the second RAN node; or the first interval is predefined by the protocol.

[0177] Optionally, the indication information of the first time can be carried in a specified field in the response information, or can be carried in an extension field added to the response information.

[0178] Optionally, the first time is later than a sending time of the response information. That is, the first time is a certain time after the sending time of the response information, or the system time corresponding to the first time is later than the system time corresponding to the sending time of the response information.

[0179] Optionally, the first time can be a time with a definite position on a time axis, or the first time can be a time satisfying a preset condition, and the position of the time on the time axis is not definite.

[0180] In a possible implementation, the first time is a time with a definite position on a time axis, and the response information can include the following three possible implementation manners:

[0181] Manner 1: The response information includes the first time.

[0182] That is, after determining the first time at which the first parameter can be used to generate the data packet, the second RAN node can directly carry the first time in the ACK and send the first time to the first RAN node. The first RAN node can obtain the first time by analyzing the ACK, and start to use the first parameter to unpack the data packet from the second RAN node from the first time.

[0183] For example, the first time can be represented by a system time or a timestamp. The meaning of the system time can be referred to the related description in the foregoing embodiments, and will not be described herein.

[0184] Manner 2: The response information includes a second timestamp.

[0185] That is, after determining the first time at which the first parameter can be used to generate the data packet, the second RAN node can carry the second timestamp used to determine the first time in the response information and send the second timestamp to the first RAN node. After obtaining the second timestamp by analyzing the response information, the first RAN node can determine the first time by itself according to the first timestamp.

[0186] As a possible implementation, the first time is a system time corresponding to the second timestamp, or the first time is the second timestamp.

[0187] As another possible implementation, in the case where the response information includes the second timestamp, the first time is a time interval of a specified duration from the second timestamp. For example, in the case where the first time is represented by a timestamp, the first time can be a timestamp with a time interval of a specified duration from the second timestamp, or in the case where the first time is represented by a system time, the first time can be a time with a time interval of a specified duration from the time corresponding to the second timestamp in the system time.

[0188] In the above embodiments, the specific manner of determining the first time according to the second timestamp is similar to the manner of determining the application time according to the first timestamp in the foregoing embodiments, and reference can be made to the related description in the foregoing embodiments, which will not be described herein again.

[0189] The specified duration can be predefined, or the specified duration can be determined by the second RAN node according to the number of historical data packets in the second RAN node. The meaning of the historical data packets can be referred to the related description in the foregoing embodiments. The specified duration can be predefined, which can be understood as that the specified duration is agreed by the first RAN node and the second RAN node in advance, or the specified duration can be understood as that the specified duration is configured by the first RAN node for the second RAN node in advance, or the specified duration can be understood as that the specified duration is predefined by a protocol.

[0190] Optionally, in the case that the specified duration is determined by the second RAN node according to the number of historical data packets, the second RAN node can further send the determined specified duration to the first RAN node, or the second RAN node can send the number of historical data packets to the first RAN node, and the first RAN node determines the specified duration by using the same manner as the second RAN node, so that the first RAN node and the second RAN node keep consistent understanding of the first time.

[0191] Option 3: the response information includes the second timestamp and the second duration.

[0192] The second duration is the time interval between the first time and the second timestamp.

[0193] That is, after the second RAN node determines the first time at which the first parameter can be used to generate data packets, the second RAN node can send the second timestamp and the second duration used to determine the first time to the first RAN node in the response information, and the first RAN node determines the first time according to the second timestamp and the second duration after parsing the response information to obtain the second timestamp and the second duration.

[0194] In the above embodiments, the manner of determining the first time according to the second timestamp and the second duration is similar to the manner of determining the application time according to the first timestamp and the first duration in the foregoing embodiments, and reference can be made to the related description in the foregoing embodiments, which will not be described herein again.

[0195] The second duration can be determined by the second RAN node according to the number of historical data packets in the second RAN node. The meaning of the historical data packets can be referred to the related description in the foregoing embodiments. Alternatively, the second duration can be predefined by a protocol, or the second duration can be configured by the first RAN node for the second RAN node in advance.

[0196] Based on the above scheme, in the case that the response information contains the related information of the first time point, the first RAN node can accurately obtain the time at which the second RAN node starts to generate data packets using the first parameter, and thus facilitate the first RAN node to start to unpack the data packets from the second RAN node according to the first parameter at the same time, ensure that the quantization bit width and / or compression mode adopted by the first RAN node and the second RAN node can always remain consistent, and the first RAN node and the second RAN node start to use the first parameter at the first time point, which is beneficial to reduce the total time delay of the first RAN node and the second RAN node in applying the first parameter. In addition, the second RAN node and the first RAN node start to use the first parameter at the first time point, and in the time period from when the second RAN node sends the response information to the first time point, the first RAN node and the second RAN node still use the old quantization bit width and / or compression mode to process data packets, so that the first RAN node and the second RAN node do not need to discard all data packets generated according to the old quantization bit width and / or compression mode, and the data packet processing pressure of the first RAN node and the second RAN node in updating the quantization bit width and / or compression mode is reduced.

[0197] In another possible implementation, the first time point is a time point satisfying a preset condition, and the specific position of the time point on the time axis is not definite.

[0198] For example, the first time point can be understood as a time point at which the first RAN node and the second RAN node start to process a specific data packet (i.e., a data packet with a specific number). That is, the second RAN node starts to generate data packets using the first parameter from the generation of the specific data packet, and the first RAN node starts to unpack using the first parameter from the unpacking of the specific data packet. Alternatively, the application time point can also be understood as a time point at which the first RAN node and the second RAN node finish processing the specific data packet. That is, the second RAN node starts to generate data packets using the first parameter after the generation of the data packet of the specific data packet, and the first RAN node starts to unpack using the first parameter after the unpacking of the specific data packet is completed.

[0199] In the case that the first time point is a time point satisfying a preset condition, the first time point corresponding to the first RAN node and the first time point corresponding to the second RAN node can be inconsistent in position on the time axis.

[0200] For example, the first time is the time when the first RAN node and the second RAN node start processing a data packet (denoted as data packet L) of a specific data packet number. For the second RAN node, the second RAN node starts generating the data packet using the first parameter from generating the data packet L, and the time when the second RAN node uses the first parameter is the time when the data packet L starts to be generated; for the first RAN node, the first RAN node starts to unpack the data packet L using the first parameter from unpacking the data packet L, and the time when the first RAN node unpacks using the first parameter is the time when the data packet L is received or the time when the first RAN node starts to unpack the data packet L.

[0201] In the case where the first time is the time when the preset condition is met, the response information can include the following three possible implementation manners:

[0202] Manner 1: the response information includes a third data packet number. The second RAN node starts to generate the data packet using the first parameter from the data packet corresponding to the third data packet number, and the first RAN node starts to unpack using the first parameter from the data packet corresponding to the third data packet number.

[0203] That is, the second RAN node determines to generate the data packet using the first parameter from the data packet corresponding to the third data packet number, and sends the third data packet number in the response information to the first RAN node. The first RAN node directly parses the response information to obtain the third data packet number after receiving the response information, and starts to unpack the data packet from the second RAN node using the first parameter from the data packet corresponding to the third data packet number.

[0204] Manner 2: the response information includes a fourth data packet number, the data packet corresponding to which the second RAN node starts to generate using the first parameter is later than the fourth data packet number, and the data packet corresponding to which the first RAN node starts to unpack using the first parameter is later than the fourth data packet number.

[0205] That is, the second RAN node determines to generate the data packet using the first parameter from the data packet (denoted as data packet A), and sends the fourth data packet number associated with the data packet number of the data packet A in the response information to the first RAN node. The first RAN node parses the response information to obtain the fourth data packet number, determines the data packet number of the data packet A based on the association between the data packet number of the fourth data packet number and the data packet number of the data packet A, and starts to unpack the data packet from the second RAN node using the first parameter from the data packet A.

[0206] For example, the data packet A corresponds to a data packet number after the fourth data packet number, and the difference between the data packet number corresponding to the data packet and the fourth data packet number is the second preset value. After the fourth data packet number is parsed, the first RAN node can determine the data packet number corresponding to the fourth data packet number and the second preset value in the data packet number after the fourth data packet number, and take the data packet number as the data packet number of the data packet A, and use the first parameter to unpack the data packet from the second RAN node starting from the data packet A.

[0207] The second preset value can be determined by the second RAN node according to the number of historical data packets in the second RAN node, and the meaning of the historical data packet can refer to the related description in the foregoing embodiments. Alternatively, the second preset value can also be pre-configured by the first RAN node for the second RAN node; or the second preset value can also be pre-defined by the protocol.

[0208] Alternatively, the second RAN node can also send the number of historical data packets in the second RAN node to the first RAN node, and the first RAN node obtains the second preset value in the same manner as the second RAN node, so that the first RAN node and the second RAN node have the same understanding of the data packet number corresponding to the data packet to which the first parameter is applied.

[0209] The response information includes the fourth data packet number and the second value. The second RAN node generates the data packet using the first parameter starting from the data packet corresponding to the third data packet number, and the first RAN node unpacks the data packet from the second RAN node using the first parameter starting from the data packet corresponding to the third data packet number. The second value is the difference between the fourth data packet number and the third data packet number.

[0210] That is, after the second RAN node determines to use the first parameter to generate the data packet starting from the data packet corresponding to the third data packet number, the fourth data packet number associated with the third data packet number and the second value can be carried in the response information and sent to the first RAN node. After the first RAN node parses the response information to obtain the fourth data packet number and the second value, the first RAN node determines the third data packet number according to the fourth data packet number and the second value, and applies the first parameter to unpack the data packet from the second RAN node starting from the data packet corresponding to the third data packet number.

[0211] In the above embodiments, the manner of determining the third data packet number according to the fourth data packet number and the second value is similar to the manner of determining the first data packet number according to the second data packet number and the first value in the foregoing embodiments, and thus is not described herein again.

[0212] The second value can be determined by the second RAN node according to the number of historical data packets in the second RAN node, and the historical data packet can refer to the related description in the foregoing embodiments. Alternatively, the second value can also be pre-configured by the first RAN node for the second RAN node. Alternatively, the second value can also be pre-defined by a protocol.

[0213] Based on the above scheme, in the case that the response information contains the related information of the first data packet generated by the second RAN node using the first parameter, the first RAN node can accurately obtain the first data packet generated by the second RAN node using the first parameter, which is beneficial for the first RAN node to unpack the data packets from the second RAN node according to the first parameter starting from the data packet, ensures that the quantization bit width and / or compression manner adopted by the first RAN node and the second RAN node when processing the same data packet remains consistent, and starting to use the first parameter before the application time is beneficial to reduce the total time delay of the first RAN node and the second RAN node applying the first parameter. In addition, the second RAN node and the first RAN node start to use the first parameter from processing the data packet corresponding to the third data packet number, and in the time period from the second RAN node sending the response information to starting to process the data packet corresponding to the third data packet number, the first RAN node and the second RAN node still adopt the old quantization bit width and / or compression manner to process the data packet, so that the first RAN node and the second RAN node do not need to discard all the data packets generated according to the old quantization bit width and / or compression manner, thereby reducing the data packet processing pressure of the first RAN node and the second RAN node when updating the quantization bit width and / or compression manner.

[0214] When the response information contains the indication information of the first time, the timing of the first RAN node and the second RAN node changing the quantization bit width and / or the compression manner can refer to FIG. 6.

[0215] After the second RAN node receives the first information from the first RAN node, the first RAN node and the second RAN node both set the application time of the first quantization bit width and / or the first compression manner at T1. After the second RAN node sends the response information to the first RAN node, the second RAN node sets the effective time of the second RAN node generating data packets using the first parameter as the first time (T2), and after the first RAN node receives the response information from the second RAN node, the first RAN node updates the effective time of the first RAN node unpacking data packets from the second RAN node using the first parameter as the first time (T2).

[0216] That is, the first RAN node generates the data packets sent to the first RAN node according to the historical parameters before T1 and generates the data packets sent to the first RAN node according to the first parameters after T1; and unpacks the data packets from the second RAN node according to the historical parameters before T2 and unpacks the data packets from the second RAN node according to the first parameters after T2. The second RAN node unpacks the data packets from the first RAN node according to the historical parameters before T1 and unpacks the data packets from the first RAN node according to the first parameters after T1; and generates the data packets sent to the first RAN node according to the historical parameters before T2 and generates the data packets sent to the first RAN node according to the first parameters after T2.

[0217] In a possible implementation, after step S402, the first RAN node sends the second information to the second RAN node. Correspondingly, the second RAN node receives the second information from the first RAN node.

[0218] The second information indicates that the first RAN node has applied the first compression manner and / or the first quantization bit width. Alternatively, the second information indicates that the first RAN node has updated or changed the compression manner and / or the quantization bit width.

[0219] For example, the second information can include an identifier indicating the quantization bit width currently applied by the first RAN node and / or an identifier indicating the compression manner currently applied by the first RAN node. Alternatively, the second information can also include a status identifier indicating that the first parameters have taken effect. For example, the second information can include one bit that can be set to two states, 0 and 1. When the bit is set to 1, it indicates that the first parameters have taken effect. When the bit is set to 0, it indicates that the first parameters have not taken effect. Alternatively, when the bit is set to 0, it indicates that the first parameters have taken effect. When the bit is set to 1, it indicates that the first parameters have not taken effect.

[0220] After receiving the second information, the second RAN node performs self-checking on the compression manner and / or the quantization bit width applied by itself, and directly applies the first parameters when the second RAN node does not apply the first parameters.

[0221] Optionally, the first RAN node can send the second information to the second RAN node at the application time, or the first RAN node can send the second information to the second RAN node after the application time and after receiving the first data packet from the second RAN node.

[0222] In another possible implementation, after step S402, the second RAN node sends second information to the first RAN node. Correspondingly, the first RAN node receives the second information from the second RAN node. The second information indicates that the second RAN node has applied the first compression manner and / or the first quantization bit width. Alternatively, the second information indicates that the second RAN node has updated or changed the compression manner and / or the quantization bit width.

[0223] In the above embodiments, the scheme in which the second RAN node sends the second information to the first RAN node is similar to the scheme in which the first RAN node sends the second information to the second RAN node, except that the sender and the receiver of the second information are different. The specific implementation can refer to the related description in the foregoing embodiments, which will not be described here.

[0224] In addition, the first RAN node and the second RAN node can also send the second information to each other at the application time or after the application time.

[0225] Based on the above scheme, after applying the first parameter, the first RAN node and the second RAN node inform each other that the first parameter has taken effect through the second information. After receiving the second information, the first RAN node and the second RAN node can apply the first parameter in time without applying the first parameter, which further reduces the probability that the first RAN node and the second RAN node have inconsistent quantization bit widths and / or compression manners.

[0226] In a possible implementation, before step S402, the first RAN node also sends indication information to the second RAN node, and the indication information is used to determine the first parameter.

[0227] The indication information can be explicit indication information of the first parameter or implicit indication information of the first parameter.

[0228] As a possible implementation, the indication information is explicit indication information of the first parameter. For example, the indication information can include the first compression manner and / or the first quantization bit width. Alternatively, the indication information can also include an identifier of the first compression manner and / or an identifier of the first quantization bit width. Alternatively, the indication information can also include an identifier of the first data packet processing mode, the compression manner of the first data packet processing mode is the first compression manner, and / or the quantization bit width in the first data packet processing mode is the first quantization bit width.

[0229] As another possible implementation, the indication information is implicit indication information of the first parameter. For example, the indication information can comprise a signal strength of the terminal. Alternatively, the indication information can comprise a number of air interface flows between the first RAN node and the second RAN node. Alternatively, the indication information can comprise a modulation and coding scheme (MCS) index.

[0230] For example, the indication information comprises a signal strength of the terminal. The signal strength of the terminal can be understood as a received strength of an uplink signal of the terminal connected with the first RAN node or the second RAN node. In the case that the indication information comprises the signal strength of the terminal, the second RAN node can calculate an air interface capacity or an air interface throughput between the first RAN node and the second RAN node according to the signal strength of the terminal, and then determine the quantization bit width and / or the compression mode indicated by the indication information according to the air interface capacity or the air interface throughput (i.e., determine the first quantization bit width and / or the first compression mode indicated by the indication information).

[0231] For another example, the indication information comprises an MCS index and / or a number of air interface flows. In the case that the indication information comprises the MCS index and / or the number of air interface flows, the second RAN node can query a predefined quantization bit width lookup table and / or a compression mode lookup table according to the MCS index and / or the number of air interface flows contained in the indication information, so as to determine the quantization bit width and / or the compression mode indicated by the indication information (i.e., determine the first quantization bit width and / or the first compression mode indicated by the indication information).

[0232] The predefined quantization bit width lookup table and / or the compression mode lookup table can be understood as being previously agreed by the first RAN node and the second RAN node, or being previously configured by the first RAN node for the second RAN node. The quantization bit width lookup table comprises a plurality of different quantization bit widths and a plurality of different MCS indexes and / or a plurality of different numbers of air interface flows, and the compression mode lookup table comprises a plurality of different compression modes and a plurality of different MCS indexes and / or a plurality of different numbers of air interface flows.

[0233] For example, in the case that the indication information comprises an MCS index and a number of air interface flows, and the first RAN node previously configures a quantization bit width lookup table for the second RAN node, the quantization bit width lookup table is as shown in FIG. 7. In the case that the MCS index in the indication information is 0 and the number of air interface flows is 2, the first quantization bit width indicated by the indication information is 8 bits, in the case that the MCS index in the indication information is 1 and the number of air interface flows is 4, the first quantization bit width indicated by the indication information is 10 bits, and so on.

[0234] For example, the indication information can be carried by a control message of the eCPRI.

[0235] Optionally, the first information and the indication information sent by the first RAN node to the second RAN node can be contained in different fields of the same control message or in different control messages. In the case of containing the first information and the indication information in the same control message, the application time and the first parameter can be indicated by one control message, which is beneficial to reducing the signaling overhead compared with the scheme of carrying the first information and the indication information by different messages respectively.

[0236] In a possible implementation, referring to FIG. 8, before step S401, the third RAN node sends the first information to the first RAN node. Correspondingly, the first RAN node receives the first information from the third RAN node.

[0237] For example, the first RAN node is a DU, the second RAN node is an RU, and the third RAN node is a CU; or the first RAN node is a DU, the second RAN node is an RU, and the third RAN node is a CU-CP.

[0238] That is, in step S401, the first RAN node sends the first information to the second RAN node after receiving the first information from the third RAN node. In this case, in the process of sending the first information to the second RAN node, the main role of the first RAN node is to send the first information of the third RAN node to the second RAN node, and the determination of the application time and the generation of the first information mentioned in the foregoing embodiments are all implemented by the third RAN node.

[0239] In the case that the first information is sent by the third RAN node and the response information sent by the second RAN node to the first RAN node includes the indication information of the first time, the timing of changing the quantization bit width and / or the compression mode of the first RAN node and the second RAN node can refer to FIG. 9.

[0240] The third RAN node sends the first information to the first RAN node at a first time (denoted as T1), the first RAN node sends the first information from the third RAN node to the second RAN node at a second time (denoted as T2), after receiving the first information from the first RAN node, the first RAN node and the second RAN node both set the application time of the first quantization bit width and / or the first compression mode as T. After sending the response information to the first RAN node, the second RAN node sets the effective time of generating the data packet using the first parameter as the first time (T3), after receiving the response information from the second RAN node, the first RAN node updates the effective time of unpacking the data packet from the second RAN node using the first parameter as the first time (T3).

[0241] That is, the first RAN node receives the first information at T1, generates the data packets sent to the first RAN node according to the historical parameters before T, and generates the data packets sent to the first RAN node according to the first parameters after T; the data packets from the second RAN node are unpacked according to the historical parameters before T3, and the data packets from the second RAN node are unpacked according to the first parameters after T3. The data packets from the first RAN node are unpacked according to the historical parameters before T by the second RAN node, and the data packets from the first RAN node are unpacked according to the first parameters after T; the data packets sent to the first RAN node are generated according to the historical parameters before T3, and the data packets sent to the first RAN node are generated according to the first parameters after T3.

[0242] Based on the above scheme, the first parameter application time of the first RAN node and the second RAN node is controlled by the first information from the third RAN node, which can make the first RAN node and the second RAN node align the first parameter application time as much as possible, and also reduce the physical resource occupation of the first RAN node in the process of aligning the first parameter application time.

[0243] In a possible implementation, before step S401, the third RAN node further sends the indication information of the first parameters to the first RAN node. Correspondingly, the first RAN node receives the indication information of the first parameters from the third RAN node.

[0244] For example, the first RAN node is a DU, the second RAN node is a RU, and the third RAN node is a CU; or the first RAN node is a DU, the second RAN node is a RU, and the third RAN node is a CU-CP.

[0245] That is, after receiving the indication information of the first parameters from the third RAN node, the first RAN node sends the indication information of the first parameters to the second RAN node. In this case, in the process of sending the indication information of the first parameters to the second RAN node, the main role of the first RAN node is to send the indication information of the first parameters of the third RAN node to the second RAN node, and the steps of determining the first parameters and generating the indication information of the first parameters in the foregoing embodiments are implemented by the third RAN node.

[0246] Based on the above scheme, the determination of the indication information of the first parameters is implemented by the third RAN node, and the first RAN node is mainly used to send the indication information of the first parameters to the second RAN node, without the need to determine the first parameters and generate the indication information of the first parameters by calculation, thereby reducing the calculation resource consumption of the first RAN node.

[0247] Further, before step S401, the first RAN node sends third information to the third RAN node. Correspondingly, the third RAN node receives the third information from the first RAN node.

[0248] The third information indicates a data transmission load between the first RAN node and the second RAN node, and the data transmission load is used to determine the first parameter. The data transmission load can be understood as a total amount of service data between the first RAN node and the second RAN node and / or a bandwidth occupancy rate of the fronthaul link.

[0249] For example, the third information can include the data transmission load between the first RAN node and the second RAN node, or the third information can include the data transmission load between the first RAN node and multiple second RAN nodes. The multiple second RAN nodes can be understood as all second RAN nodes connected to the first RAN node through the fronthaul link.

[0250] Controlling the compression mode and / or quantization bit width of the first RAN node and the second RAN node by the third RAN node can reduce the requirement for the computing capability of the first RAN node and the second RAN node in aligning the compression mode and / or quantization bit width of the first RAN node and the second RAN node.

[0251] Based on the scheme in the embodiments of the present application, the first RAN node indicates the application time of the first compression mode and / or the first quantization bit width to the second RAN node through the first information, and the second RAN node can apply the first compression mode and / or the first quantization bit width at the application time according to the indication of the first RAN node. The first RAN node also applies the compression mode and / or the quantization bit width at the application time, so that the first RAN node and the second RAN node both start to process the data packet based on the first compression mode and / or the first quantization bit width from the application time. That is, the first RAN node and the second RAN node align the application of the first compression mode and / or the first quantization bit width to the same time (application time), and further make the first RAN node and the second RAN node maintain the consistency of the quantization bit width and / or the compression mode at all times in the process of changing the compression mode and / or the quantization bit width, that is, align the used compression mode and / or quantization bit width, and further avoid the inconsistency of the quantization bit width and / or the compression mode used by the first RAN node and the second RAN node, which leads to the error unpacking of the received data packet by the first RAN node and the second RAN node, reduces the probability of unpacking error, and improves the transmission performance.

[0252] The above describes the method provided by the present application, and in addition, the present application also provides a communication device for implementing the functions described in the above method embodiments.

[0253] It should be noted that the communication apparatus includes hardware structure and / or software module corresponding to each function in order to realize the above functions. Those skilled in the art can easily understand that the units and algorithm steps of each example described in combination with the embodiments disclosed herein can be implemented in hardware or a combination of hardware and computer software. Whether a certain function is implemented in hardware or computer software driven hardware depends on a specific application and design constraint condition of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but the implementation should not be considered beyond the scope of the present application.

[0254] The embodiments of the present application can divide the functional modules of the communication apparatus according to the method embodiments described above. For example, each functional module can be divided according to each function, or two or more functions can be integrated into one processing module. The integrated module can be implemented in the form of hardware or software functional module. It should be noted that the division of the modules in the embodiments of the present application is illustrative, and is only a logical function division. There can be another division manner in actual implementation.

[0255] FIG. 10 shows a structural schematic diagram of a communication apparatus 100. The communication apparatus 100 includes a processing module 1001 and a transceiver module 1002. The communication apparatus 100 can be used to implement the functions of the first RAN node or the second RAN node.

[0256] In some embodiments, the communication apparatus 100 can further include a storage module (not shown in FIG. 10) for storing program instructions and data.

[0257] In some embodiments, the transceiver module 1002, also referred to as a transceiver unit, is used to implement the sending and / or receiving functions. The transceiver module 1002 can be composed of a transceiver circuit, a transceiver, a transceiver or a communication interface.

[0258] In some embodiments, the transceiver module 1002 can include a receiving module and a sending module, which are respectively used to perform the receiving and sending steps of the first RAN node or the second RAN node in the method embodiments described above, and / or to support other processes described herein; the processing module 1001 can be used to perform the processing steps of the first RAN node or the second RAN node in the method embodiments described above, and / or to support other processes described herein.

[0259] In a possible implementation, the transceiver 1002 is configured to receive response information of the first information from the second RAN node, and the processing module 1001 is configured to unpack using the first parameter from a time of arrival of the response information.

[0260] In a possible implementation, the transceiver 1002 is configured to receive response information of the first information from the second RAN node, and the processing module 1001 is configured to unpack using the first parameter from a time of arrival of the response information.

[0261] In a possible implementation, the transceiver 1002 is configured to send second information to the second RAN node, the second information indicating that the first RAN node has applied the first compression manner and / or the first quantization bit width.

[0262] In a possible implementation, the transceiver 1002 is configured to receive the first information from the third RAN node, and send the first information from the third RAN node to the second RAN node.

[0263] In a possible implementation, the transceiver 1002 is configured to send third information to the third RAN node, the third information indicating a data transmission load between the first RAN node and the second RAN node, the data transmission load being used to determine the first parameter.

[0264] In a possible implementation, the transceiver 1002 is configured to send response information of the first information to the first RAN node, and the processing module 1001 is configured to generate a data packet using the first parameter from a time of sending of the response information.

[0265] In a possible implementation, the transceiver 1002 is configured to send response information of the first information to the first RAN node, the response information including indication information of a first time; and the processing module 1001 is configured to generate a data packet using the first parameter from the first time.

[0266] In a possible implementation, the transceiver 1002 is configured to receive second information from the first RAN node, the second information indicating that the first RAN node has applied the first compression manner and / or the first quantization bit width.

[0267] All related content of each step involved in the above method embodiments can be referred to the function description of the corresponding functional module, which will not be repeated here.

[0268] In the present application, the communication apparatus 100 can be presented in the form of integrated division of various functional modules. The "module" here can refer to a specific application-specific integrated circuit (ASIC), a circuit, a processor and a memory executing one or more software or firmware programs, an integrated logic circuit, and / or other devices that can provide the above functions.

[0269] In some embodiments, when the communication apparatus 100 in FIG. 10 is a chip or a chip system, the functions / implementation processes of the transceiver module 1002 can be implemented through the input / output interface (or the communication interface) of the chip or the chip system, and the functions / implementation processes of the processing module 1001 can be implemented through the processor (or the processing circuit) of the chip or the chip system.

[0270] Since the communication apparatus 100 provided by the present embodiment can execute the above method, the technical effects that can be obtained thereby can refer to the above method embodiments, which will not be repeated here.

[0271] As a possible product form, the first RAN node or the second RAN node described in the embodiments of the present application can be implemented using one or more field programmable gate arrays (FPGAs), programmable logic devices (PLDs), controllers, state machines, gate logic, discrete hardware components, any other suitable circuitry, or any combination thereof capable of performing the various functions described throughout the present application.

[0272] As another possible product form, the first RAN node or the second RAN node described in the embodiments of the present application can be implemented by a general bus architecture. For ease of illustration, refer to FIG. 11, which is a structural schematic diagram of a communication apparatus 1100 provided by the embodiments of the present application, the communication apparatus 1100 comprising a processor 1101 and a transceiver 1102. The communication apparatus 1100 can be a first RAN node, or a chip or a chip system therein; or the communication apparatus 1100 can be a second RAN node, or a chip or a module therein. FIG. 11 only shows the main components of the communication apparatus 1100. In addition to the processor 1101 and the transceiver 1102, the communication apparatus can further comprise a memory 1103, and an input / output device (not shown in the figure).

[0273] Optionally, the processor 1101 is mainly configured to process communication protocols and communication data, and control the whole communication device, execute software programs, and process data of the software programs, so as to realize the methods provided in the above method embodiments. The memory 1103 is mainly configured to store software programs and data. The transceiver 1102 can include radio frequency circuitry and an antenna. The radio frequency circuitry is mainly configured to convert baseband signals and radio frequency signals, and process the radio frequency signals. The antenna is mainly configured to transceive radio frequency signals in the form of electromagnetic waves. Input and output devices, such as touch screens, display screens, keyboards, etc., are mainly configured to receive user input data and output data to users.

[0274] Optionally, the processor 1101, the transceiver 1102, and the memory 1103 can be connected through a communication bus.

[0275] When the communication device is powered on, the processor 1101 can read the software programs in the memory 1103, interpret and execute instructions of the software programs, and process data of the software programs. When it is necessary to send data wirelessly, the processor 1101 performs baseband processing on the data to be sent, and outputs the baseband signals to the radio frequency circuitry. The radio frequency circuitry performs radio frequency processing on the baseband signals, and transmits the radio frequency signals in the form of electromagnetic waves through the antenna. When data is transmitted to the communication device, the radio frequency circuitry receives the radio frequency signals through the antenna, converts the radio frequency signals into baseband signals, and outputs the baseband signals to the processor 1101. The processor 1101 converts the baseband signals into data and processes the data.

[0276] In another implementation, the radio frequency circuitry and the antenna can be arranged independently of the processor performing baseband processing, for example, in a distributed scenario, the radio frequency circuitry and the antenna can be arranged remotely from the communication device.

[0277] In some embodiments, in a hardware implementation, those skilled in the art can conceive that the above-mentioned communication device 100 can adopt the form of the communication device 1100 shown in FIG. 11.

[0278] As an example, the functions / implementation processes of the processing module 1001 in FIG. 10 can be realized by the processor 1101 in the communication device 1100 shown in FIG. 11 invoking computer execution instructions stored in the memory 1103. The functions / implementation processes of the transceiving module 1002 in FIG. 10 can be realized by the transceiver 1102 in the communication device 1100 shown in FIG. 11.

[0279] As yet another possible product form, the first RAN node or the second RAN node in the present application can adopt the constituent structure shown in FIG. 12, or include the components shown in FIG. 12. FIG. 12 is a constituent diagram of a communication apparatus 1200 provided in the present application, which can be the first RAN node or a chip or system on chip in the first RAN node; or can be the second RAN node or a module or chip or system on chip in the second RAN node.

[0280] As shown in FIG. 12, the communication apparatus 1200 includes at least one processor 1201, and at least one communication interface (only one communication interface 1204 is shown in FIG. 12 by way of example, and the processor 1201 is taken as an example for description). Optionally, the communication apparatus 1200 can further include a communication bus 1202 and a memory 1203.

[0281] The processor 1201 can be a general central processing unit (CPU), a general processor, a network processor (NP), a digital signal processor (DSP), a microprocessor, a microcontroller, a PLD, or any combination thereof. The processor 1201 can also be other apparatuses with processing functions, such as a circuit, a device, or a software module, without limitation.

[0282] The communication bus 1202 is used to connect different components in the communication apparatus 1200, so that different components can communicate. The communication bus 1202 can be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus, etc. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, only one thick line is shown in FIG. 12, but it does not mean that there is only one bus or only one type of bus.

[0283] The communication interface 1204 is used to communicate with other devices or communication networks. The communication interface 1204 can be a module, a circuit, a transceiver, or any apparatus capable of realizing communication by way of example. Optionally, the communication interface 1204 can also be an input / output interface located in the processor 1201, used to realize signal input and signal output of the processor.

[0284] The memory 1203 can be an apparatus with a storage function, used to store instructions and / or data. The instructions can be a computer program.

[0285] Exemplarily, the memory 1203 can be a read-only memory (ROM) or other type of static storage device that can store static information and / or instructions that are not to be changed by the device, or a random access memory (RAM) or other type of dynamic storage device that can store information and / or instructions that are to be changed by the device. The memory 1203 can also be an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disk storage, a magnetic disk storage or other magnetic storage devices, etc., without limitation.

[0286] It should be noted that the memory 1203 can exist independently of the processor 1201, or can be integrated with the processor 1201. The memory 1203 can be located within the communication device 1200, or can be located outside the communication device 1200, without limitation. The processor 1201 can be used to execute instructions stored in the memory 1203 to implement the methods provided by the embodiments described below.

[0287] As an optional implementation, the communication device 1200 can further include an output device 1205 and an input device 1206. The output device 1205 communicates with the processor 1201 and can display information in various ways. For example, the output device 1205 can be a liquid crystal display (LCD), a light emitting diode (LED) display device, a cathode ray tube (CRT) display device, or a projector, etc. The input device 1206 communicates with the processor 1201 and can receive user input in various ways. For example, the input device 1206 can be a mouse, a keyboard, a touch screen device, a sensor device, etc.

[0288] In some embodiments, in a hardware implementation, those skilled in the art can conceive that the communication device 100 shown in FIG. 10 described above can take the form of the communication device 1200 shown in FIG. 12.

[0289] As an example, the function / implementation process of the processing module 1001 in FIG. 10 can be implemented by invoking the computer-executed instructions stored in the memory 1203 by the processor 1201 in the communication apparatus 1200 shown in FIG. 12. The function / implementation process of the transceiving module 1002 in FIG. 10 can be implemented by the communication interface 1204 in the communication apparatus 1200 shown in FIG. 12.

[0290] It should be noted that the structure shown in FIG. 12 does not constitute a specific limitation on the first RAN node or the second RAN node. For example, in some other embodiments of the present application, the first RAN node or the second RAN node can include more or fewer components than those shown, or combine certain components, or split certain components, or different arrangement of components. The components shown can be implemented in hardware, software, or a combination of software and hardware.

[0291] In some embodiments, the communication apparatus also includes a processor for implementing the method in any of the above method embodiments.

[0292] As a possible implementation, the communication apparatus also includes a memory. The memory is used to save necessary computer programs and data. The computer programs can include instructions, and the processor can invoke the instructions in the computer programs stored in the memory to instruct the communication apparatus to perform the method in any of the above method embodiments. Of course, the memory can also not be in the communication apparatus.

[0293] As another possible implementation, the communication apparatus also includes an interface circuit, which is a code / data read / write interface circuit, and is used to receive computer-executed instructions (stored in the memory, possibly directly from the memory, or possibly through other devices) and transmit them to the processor.

[0294] As yet another possible implementation, the communication apparatus also includes a communication interface, which is used to communicate with modules outside the communication apparatus.

[0295] It can be understood that the communication apparatus can be a chip or a chip system. When the communication apparatus is a chip system, it can be composed of a chip or include a chip and other discrete devices, and the embodiments of the present application do not make a specific limitation thereon.

[0296] The present application also provides a computer-readable storage medium having stored thereon a computer program or instructions, which, when executed by a computer, implement the functions of any of the above method embodiments.

[0297] The present application also provides a computer program product, which, when executed by a computer, implements the functions of any of the above method embodiments.

[0298] Those skilled in the art can understand that, for the convenience and brevity of description, the specific working processes of the above-described system, device and unit can refer to the corresponding processes in the foregoing method embodiments, which will not be repeated here.

[0299] It can be understood that the system, device and method described in the present application can also be implemented in other manners. For example, the described device embodiments are merely schematic, and the division of the units is merely a logical function division, and there can be another division manner in actual implementation. For example, a plurality of units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the displayed or discussed mutual couplings or direct couplings or communication connections can be indirect couplings or communication connections through some interfaces, devices or units, and can be electrical, mechanical or in other forms.

[0300] The units described as separate components can or can not be physically separate, that is, can be located in one place, or can be distributed on a plurality of network units. The components shown as units can or can not be physical units. Part or all of the units can be selected according to actual needs to achieve the purpose of the present embodiment.

[0301] In addition, each functional unit in each embodiment of the present application can be integrated in one processing unit, or each unit can be physically present separately, or two or more units can be integrated in one unit.

[0302] In the above embodiments, all or part of the embodiments can be implemented by software, hardware, firmware or any combination thereof. When implemented by software, all or part of the embodiments can be implemented in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of the present application are generated. The computer can be a general purpose computer, a special purpose computer, a computer network, or other programmable devices. The computer instructions can be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions can be transmitted from one website site, computer, server or data center to another website site, computer, server or data center through wired (such as coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (such as infrared, wireless, microwave, etc.) mode. The computer readable storage medium can be any available medium that can be accessed by a computer or include one or more data storage devices such as servers, data centers, etc. integrated with the medium. The available medium can be magnetic medium (such as floppy disk, hard disk, magnetic tape), optical medium (such as DVD), or semiconductor medium (such as solid state drive (SSD)) and the like. In the embodiments of the present application, the computer can include the device described above.

[0303] Although the present application is described herein in conjunction with various embodiments, it is understood that other variations of the disclosed embodiments can be understood and effected by those skilled in the art in practicing the claimed application, from an inspection of the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other elements or steps, and the indefinite articles "a" or "an" do not exclude a plurality. A single processor or other unit can fulfill the functions of several items recited in the claims. The mere fact that certain measures are recited in mutually different dependent claims does not indicate that a combination of these measures cannot be used to advantage.

[0304] Although the present application is described herein in conjunction with various embodiments, it is understood that other variations of the disclosed embodiments can be understood and effected by those skilled in the art in practicing the claimed application, from an inspection of the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other elements or steps, and the indefinite articles "a" or "an" do not exclude a plurality. A single processor or other unit can fulfill the functions of several items recited in the claims. The mere fact that certain measures are recited in mutually different dependent claims does not indicate that a combination of these measures cannot be used to advantage.

[0304] Although the present application is described herein in conjunction with various embodiments, it is understood that other variations of the disclosed embodiments can be understood and effected by those skilled in the art in practicing the claimed application, from an inspection of the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other elements or steps, and the indefinite articles "a" or "an" do not exclude a plurality. A single processor or other unit can fulfill the functions of several items recited in the claims. The mere fact that certain measures are recited in mutually different dependent claims does not indicate that a combination of these measures cannot be used to advantage.

Claims

1. A communication method characterized by comprising: The method comprises: receiving first information from a first radio access network node, the first information being used to determine an application time of a first parameter, the first parameter comprising a first compression mode and / or a first quantization bit width; applying the first parameter at the application time.

2. The method of claim 1, wherein, The first information comprises the application time; or, The first information comprises a first time stamp, the application time being later than the first time stamp; or, The first information comprises a first time stamp and a first time length, the first time length being a time interval between the application time and the first time stamp.

3. The method of claim 1, wherein, The first information comprises a first data packet number, the first parameter being applied starting from a data packet corresponding to the first data packet number; or, The first information comprises a second data packet number, a data packet generated using the first parameter being later than a data packet corresponding to the second data packet number; or, The first information comprises a second data packet number and a first value, the first parameter being applied starting from a data packet corresponding to the first data packet number, and the first value being a difference between the second data packet number and the first data packet number.

4. The method according to any one of claims 1 to 3, characterized in that, The method further comprises: sending response information of the first information to the first radio access network node; generating data packets using the first parameter starting from a time of sending the response information.

5. The method according to any one of claims 1 to 3, characterized in that, The method further comprises: sending response information of the first information to the first radio access network node, the response information comprising indication information of a first time; generating data packets using the first parameter starting from the first time.

6. The method of claim 5, wherein, The response information comprises the first time; or, The response information comprises a second time stamp, the first time being later than the second time stamp; or, The response information comprises a second time stamp and a second time length, the second time length being a time interval between the first time and the second time stamp.

7. The method of claim 5, wherein, The response information comprises a third data packet number, the third data packet number corresponding to a data packet starting from which data packets are generated using the first parameter; or, The response information comprises a fourth data packet number, a data packet generated using the first parameter being later than a data packet corresponding to the fourth data packet number; or, The response information comprises a fourth data packet number and a second value, the third data packet number corresponding to a data packet starting from which data packets are generated using the first parameter, and the second value being a difference between the third data packet number and the fourth data packet number.

8. The method according to any one of claims 1 to 7, characterized in that, The method further comprises: receiving second information from the first radio access network node, the second information indicating that the first radio access network node has applied the first compression mode and / or the first quantization bit width.

9. The method according to any one of claims 1 to 8, characterized in that, The first radio access network node is a distributed unit (DU) or a radio frequency unit (RU).

10. A communication method characterized by comprising: The method comprises: sending first information to a second radio access network node, the first information being used to determine an application time of a first parameter, the first parameter comprising a first compression mode and / or a first quantization bit width; applying the first parameter at the application time.

11. The method of claim 10, wherein, The first information comprises the application time; or, The first information comprises a first timestamp, and the application time is later than the first timestamp; or The first information comprises the first timestamp and a first time length, and the first time length is a time interval between the application time and the first timestamp.

12. The method of claim 10, wherein, The first information comprises a first data packet number, and the first parameter is applied starting from a data packet corresponding to the first data packet number; or The first information comprises a second data packet number, and a data packet starting to apply the first parameter is later than a data packet corresponding to the second data packet number; or The first information comprises a second data packet number and a first numerical value, and the first parameter is applied starting from a data packet corresponding to the first data packet number, and the first numerical value is a difference between the second data packet number and the first data packet number.

13. The method according to any one of claims 10 to 12, characterized in that, The method further comprises: receiving response information of the first information from the second radio access network node; starting to unpack using the first parameter from an arrival time of the response information.

14. The method according to any one of claims 10 to 12, characterized in that, The method further comprises: receiving response information of the first information from the second radio access network node, and the response information comprises indication information of a first time; starting to unpack using the first parameter from the first time.

15. The method of claim 14, wherein, The response information comprises the first time; or The response information comprises a second timestamp, and the first time is later than the second timestamp; or The response information comprises the second timestamp and a second time length, and the second time length is a time interval between the first time and the second timestamp.

16. The method of claim 14, wherein, The response information comprises a third data packet number, and the first parameter is used to start unpacking from a data packet corresponding to the third data packet number; or The response information comprises a fourth data packet number, and a data packet unpacked using the first parameter is later than a data packet corresponding to the fourth data packet number; or The response information comprises a fourth data packet number and a second numerical value, and the first parameter is used to start unpacking from a data packet corresponding to the third data packet number, and the second numerical value is a difference between the third data packet number and the fourth data packet number.

17. The method according to any one of claims 10 to 16, characterized in that, The method further comprises: sending second information to the second radio access network node, and the second information indicates that the first radio access network node has applied the first compression mode and / or the first quantization bit width.

18. The method according to any one of claims 10 to 17, characterized in that, The second radio access network node is a distributed unit (DU) or a radio frequency unit (RU).

19. The method according to any one of claims 10 to 17, characterized in that, Sending the first information to the second radio access network node comprises: receiving the first information from a third radio access network node, and the third radio access network node is a centralized unit (CU); sending the first information to the second radio access network node, and the second radio access network node is an RU.

20. The method of claim 19, wherein, The method further comprises: sending third information to the third radio access network node, and the third information indicates a data transmission load between the first radio access network node and the second radio access network node, and the data transmission load is used to determine the first parameter.

21. A communications device, characterized by The communication device comprises a processor; the processor is configured to run a computer program or instructions, so that the communication device performs the method according to any one of claims 1-9, or so that the communication device performs the method according to any one of claims 10-20.

22. A chip or chip system, characterized by The chip or chip system comprises a processor, which is coupled with a memory, and the memory is configured to store programs or instructions, when the programs or instructions are executed by the processor, so that the method according to any one of claims 1-9 is performed, or so that the method according to any one of claims 10-20 is performed.

23. A computer-readable storage medium, characterized in that, The computer readable storage medium stores computer instructions or programs, when the computer instructions or programs are run on a computer, so that the method according to any one of claims 1-9 is performed, or so that the method according to any one of claims 10-20 is performed.

24. A computer program product, characterised in that, The computer program product comprises computer instructions; when part or all of the computer instructions are run on a computer, so that the method according to any one of claims 1-9 is performed, or so that the method according to any one of claims 10-20 is performed.

Images