Data compression and transmission method, and apparatus, device and storage medium

Abstract

A data compression and transmission method, and an apparatus, a device and a storage medium. The method comprises: performing n compressions on first data, so as to obtain n pieces of compressed information and position indication information corresponding to at least one piece of compressed information, n being an integer greater than 1, wherein during an (i+1)-th compression, data compression is performed on at least one of M data units of an i-th piece of second data, so as to obtain an (i+1)-th piece of compressed information, the i-th piece of second data is determined on the basis of the difference between the first data and first data which is recovered from a first piece of compressed information, the first piece of compressed information is obtained by means of compressing the first data during a first compression, position indication information corresponding to the (i+1)-th piece of compressed information is used for indicating the position of the at least one data unit among the M data units, and the n pieces of compressed information obtained by means of the n compressions performed on the first data are more conducive to accurate recovery of the first data, thereby reducing compression loss and achieving high-reliability compressed transmission.

Description

Data compression transmission method, device, equipment and storage medium

[0001] The present application claims priority to the Chinese patent application No. 202411317359.1, filed on September 19, 2024, and entitled "Data compression transmission method, device, equipment and storage medium", the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

[0002] The present application relates to the field of communication technology, and in particular to a data compression transmission method, device, equipment and storage medium. BACKGROUND

[0003] In some communication scenarios, the amount of data transmitted between communication devices is large, such as point cloud data, artificial intelligence (AI) data, channel state information, radio frequency map (RF map), etc. In this case, the sender can compress the data to be transmitted based on a compression algorithm and then transmit it, and the receiver reconstructs the data based on the received compressed information, thereby saving transmission resources and reducing transmission delay.

[0004] However, due to the limitations of the compression algorithm, there is often a large difference between the reconstructed data and the original data at the receiving end, resulting in a large compression loss. Therefore, how to reduce the compression loss during data compression transmission and achieve high-reliability compression transmission is a problem to be solved. SUMMARY

[0005] The data compression transmission method, device, equipment and storage medium provided by the embodiments of the present application are to reduce the compression loss during data compression transmission, and to achieve high-reliability compression transmission.

[0006] In a first aspect, the present application provides a data compression transmission method. The method can be executed by a first communication device. In the absence of special description, the first communication device in the present application can refer to the communication device itself (for example, a network device, a terminal device), a component in the communication device (for example, a processor, a chip, or a chip system, etc.), or a logic module or software capable of realizing all or part of the functions of the communication device.

[0007] In the method, the first communication device compresses the first data n times to obtain n compressed information and position indication information corresponding to each compressed information, n being an integer greater than 1, wherein at least one data unit in M data units of the i-th second data is compressed to obtain the i+1-th compressed information at the i+1-th compression, i being a positive integer, the i-th second data being determined based on a difference between the first data and the first data recovered from the 1st compressed information, the 1st compressed information being obtained by compressing the first data at the 1st compression, and the position indication information corresponding to the i+1-th compressed information being used to indicate a position of the at least one data unit in the M data units, the n compressed information obtained by compressing the first data n times being more conducive to accurately recovering the first data, thereby reducing compression loss and achieving high-reliability compression transmission.

[0008] As an example, in the i+1-th compression, the at least one data unit in the M data units can be determined based on a difference between each data unit in the M data units and data recovered from the compressed information of the data unit, i.e., based on the reconstruction accuracy of each data unit, for example, at least one data unit with lower reconstruction accuracy is determined from the M data units. Thus, incremental compression transmission is performed on the data unit with lower reconstruction accuracy to improve the reconstruction accuracy of the first data.

[0009] As a second example, in the i+1-th compression, the at least one data unit in the M data units can be determined based on data importance of the M data units, for example, at least one data unit with higher data importance is determined from the M data units. Thus, the reconstruction accuracy of the data unit with higher data importance is improved.

[0010] In the above first example, the difference between each data unit and the data recovered from the compressed information of the data unit can be quantified by a first parameter; similarly, in the above second example, the data importance of each data unit can be quantified by a first parameter.

[0011] For example, the first communication device can sequentially send the n compressed information in the compression order, in which case the transmission overhead of the compressed information sent each time is smaller, and it is more suitable for scenarios where transmission overhead is limited.

[0012] For example, at least part of the compression in the n times of compression can be implemented based on a dictionary learning technique, i.e., the to-be-compressed data is expressed by basis information, so as to obtain compressed information including coefficient information. For example, the i+1th compression, the i+1th compressed information includes: basis information and coefficient information, or coefficient information. Wherein, the basis information can be used to express the i th second data or one or more data units in the i th second data, and the coefficient information includes the expression coefficient of at least one sub-information in the basis information to the i th second data.

[0013] For example, the first communication device can send or receive the first indication information, so that the basis information corresponding to each compressed information indicated by the first indication information is used to synchronize the basis information between the sending end and the receiving end of the data compression transmission, so as to facilitate the recovery of the first data.

[0014] Optionally, the basis information corresponding to each compressed information in the n times of compression includes: sub-information of the basis information and / or size of the basis information.

[0015] For example, the basis information corresponding to the i+1th compressed information can be obtained based on the i th second data and / or at least one third data, wherein the at least one third data is obtained by data conversion of the i th second data. In this way, the basis information is determined based on the incremental data, so that the basis information in the incremental compression process can better express the corresponding to-be-compressed data.

[0016] In the above example, in order to enrich the incremental data and further obtain basis information that can more accurately express the to-be-compressed data, the conversion mode of the third data can include at least one of the following:

[0017] Transposing the i th second data into a matrix;

[0018] Splitting or merging each data unit of the i th second data; or,

[0019] Adjusting the order of the data units in the i th second data.

[0020] For example, the first communication device can send or receive the second indication information, so that the sending end and the receiving end of the data compression transmission can be synchronized for the conversion mode of the third data indicated by the second indication information.

[0021] In a second aspect, the present application provides a data compression transmission method. The method can be executed by a second communication device. In the case where no special description is made, the second communication device in the present application can refer to the communication device itself (for example, a network device, a terminal device), can be a component (for example, a processor, a chip, or a chip system, etc.) in the communication device, or can be a logic module or software capable of realizing all or part of the function of the communication device.

[0022] The method comprises: receiving, by the second communication device, n compressed information of the first data and position indication information corresponding to the at least one compressed information, n being an integer greater than 1; wherein the (i+1)th compressed information is obtained by compressing at least one data unit in M data units of the ith second data, i being a positive integer, the ith second data being determined based on a difference between the first data and the first data recovered from the 1st compressed information, the 1st compressed information being obtained by compressing the first data at the 1st time, and the position indication information corresponding to the (i+1)th compressed information being used to indicate a position of the at least one data unit in the M data units, and then the first data is recovered based on the n compressed information and the position indication information.

[0023] In a possible implementation, the at least one data unit is determined based on a first parameter; wherein the first parameter is used to indicate a difference between each data unit in the second data and the compressed information of the data unit; or the first parameter is used to indicate data importance of each data unit in the second data.

[0024] In a possible implementation, the second communication device receives the n compressed information of the first data, comprising: the second communication device receives the n compressed information sent in a compression order.

[0025] In a possible implementation, the (i+1)th compressed information comprises: base information and coefficient information, or the coefficient information; the base information is used to express the ith second data, and the coefficient information comprises an expression coefficient of at least one sub-information in the base information to the ith second data.

[0026] In a possible implementation, the method further comprises: receiving, by the second communication device, first indication information, or sending the first indication information, the first indication information being used to indicate the base information corresponding to each compressed information in the n compressed information.

[0027] In a possible implementation, the base information corresponding to each compressed information in the n compressed information comprises: a sub-information of the base information and / or a size of the base information.

[0028] In a possible implementation, the base information corresponding to the (i+1)th compressed information is obtained based on the ith second data and / or at least one third data, the at least one third data being obtained by data conversion of the ith second data.

[0029] In a possible implementation, the conversion mode of the third data comprises at least one of the following:

[0030] transposing a matrix on the ith second data;

[0031] splitting or merging each data unit of the ith second data; or,

[0032] adjusting the order of the data units in the ith second data.

[0033] In a possible implementation, the method further includes: receiving, by the second communication device, second indication information, or transmitting the second indication information, the second indication information being used to indicate the conversion mode of each third data.

[0034] In a third aspect, the present application provides a communication device, including a module for executing the method in the first aspect or any possible implementation, or a module for executing the method in the second aspect or any possible implementation.

[0035] In a fourth aspect, the present application provides a communication device, including a processor for executing the method in the first aspect, the second aspect or any possible implementation by running a computer program or by a logic circuit.

[0036] In a possible implementation, the communication device further includes a memory for storing the computer program.

[0037] In a possible implementation, the communication device further includes a communication interface for inputting and outputting signals.

[0038] In a fifth aspect, the present application provides a chip, including a processor for calling and running computer instructions from a memory, so that a device installed with the chip executes the method in the first aspect, the second aspect or any possible implementation.

[0039] In a sixth aspect, the present application provides a communication system, including a first communication device for executing the method in the first aspect or any possible implementation, and a second communication device for executing the method in the second aspect or any possible implementation.

[0040] In a seventh aspect, the present application provides a computer readable storage medium for storing computer program instructions, the computer program instructions causing a computer to execute the method in the first aspect, the second aspect or any possible implementation.

[0041] In an eighth aspect, the present application provides a computer program for causing a computer to execute the method in the first aspect, the second aspect or any possible implementation.

[0042] In a ninth aspect, the present application provides a computer program product including computer program instructions for causing a computer to execute the method in the first aspect, the second aspect or any possible implementation.

[0043] The beneficial effects of the above-mentioned second aspect to ninth aspect and possible implementation manners can refer to the beneficial effects of the above-mentioned first aspect and possible implementation manners of the first aspect, which will not be repeated here. BRIEF DESCRIPTION OF DRAWINGS

[0044] FIG. 1 is a schematic diagram of an architecture of a mobile communication system to which embodiments of the present application are applied.

[0045] FIG. 2 is a schematic diagram of a dictionary learning framework provided by an embodiment of the present application.

[0046] FIG. 3 is a schematic diagram of an interaction flow of a data compression transmission method provided by an embodiment of the present application.

[0047] FIG. 4 is a schematic diagram of an iterative compression provided by an embodiment of the present application.

[0048] FIG. 5 is a schematic diagram of an interaction flow of another data compression transmission method provided by an embodiment of the present application.

[0049] FIG. 6 is a schematic diagram of data conversion provided by an embodiment of the present application.

[0050] FIG. 7 is a schematic block diagram of a communication apparatus provided by an embodiment of the present application.

[0051] FIG. 8 is another schematic block diagram of a communication apparatus provided by an embodiment of the present application. DETAILED DESCRIPTION

[0052] The technical solutions in the present application will be described below with reference to the accompanying drawings.

[0053] FIG. 1 is a schematic diagram of an architecture of a mobile communication system to which embodiments of the present application are applied. As shown in FIG. 1, the mobile communication system includes a core network device 110, a network device 120, and at least one terminal device (such as terminal device 130 and terminal device 140 in FIG. 1). The terminal device is connected to the network device in a wireless manner, and the network device is connected to the core network device in a wireless or wired manner. The core network device and the network device can be independent and different physical devices, can be integrated into the same physical device with the functions of the core network device and the logical functions of the network device, or can be a physical device integrated with part of the functions of the core network device and part of the functions of the network device. The terminal device can be fixed or mobile. FIG. 1 is only a schematic diagram, and the communication system can further include other network devices, such as wireless relay devices and wireless backhaul devices, which are not shown in FIG. 1. Embodiments of the present application do not limit the number of core network devices, network devices, and terminal devices included in the mobile communication system.

[0054] In the embodiments of the present application, the network device can be any device with wireless transceiving function. The network device includes but is not limited to: an evolved Node B (eNB), a home base station (for example, a home evolved NodeB or a home Node B (HNB)), a baseband unit (BBU), an access point (AP) in a wireless fidelity (WiFi) system, a wireless relay node, a wireless backhaul node, a transmission point (TP) or a transmission and reception point (TRP), and can also be a mobile switching center and a device in device-to-device (D2D) communication, vehicle-to-everything (V2X) communication, machine-to-machine (M2M) communication, unmanned aerial vehicle communication, and the like, a network device in a non-terrestrial network (NTN) communication system (that is, can be deployed on a high-altitude platform, a satellite, a high-altitude aircraft), a gNB in a 5th generation (5G) mobile communication system, one or a group of antenna panels (including multiple antenna panels) of a base station in a 5G system, or a network node constituting a gNB or a transmission point, such as a BBU or a distributed unit (DU), and the like. The embodiments of the present application do not make specific limitations thereto.

[0055] In some deployments, the gNB can include a centralized unit (CU) and a DU. The CU and the DU respectively implement part of the functions of the gNB, and the CU and the DU can communicate through an F1 interface. The gNB can also include an active antenna unit (AAU). The AAU can implement part of the physical layer processing function, the radio frequency processing function and the related function of the active antenna.

[0056] It can be understood that the network device can be a device including one or more of a CU node, a DU node and an AAU node. In addition, the CU can be divided into a network device in a radio access network (RAN) or a network device in a core network (CN), and the present application does not make limitations thereto.

[0057] In the embodiments of the present application, the terminal device can also be referred to as a user equipment (UE), an access terminal, a subscriber unit, a subscriber station, a mobile station, a mobile, a remote station, a remote terminal, a mobile device, a user terminal, a terminal, a wireless communication device, a user agent, or a user device.

[0058] The terminal device can be a device that provides voice / data connectivity to a user, such as a handheld device with wireless connectivity, a vehicle-mounted device, and the like. Currently, some examples of terminals can be: a mobile phone, a tablet computer, a computer with wireless transceiver function (such as a notebook computer, a palm computer, and the like), a drone, a customer-premises equipment (CPE), a smart point of sale (POS) machine, a mobile internet device (MID), a virtual reality (VR) device, an augmented reality (AR) device, a wireless terminal in industrial control, a wireless terminal in self driving, a wireless terminal in remote medical, a wireless terminal in smart grid, a wireless terminal in transportation safety, a wireless terminal in smart city, a wireless terminal in smart home, a cellular phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a handheld device with wireless communication function, a computing device, or other processing device connected to a wireless modem, a vehicle-mounted device, a wearable device, a terminal device in a 5G network, or a terminal device in a system evolved after 5G, and the like.

[0059] The network device and the terminal device can communicate through a licensed spectrum, an unlicensed spectrum, or both. The network device and the terminal device can communicate through a spectrum below 6 GHz, a spectrum above 6 GHz, or both. Embodiments of the present application do not limit the spectrum used by the network device and the terminal device.

[0060] It should be understood that the present application does not limit the specific forms of the network device and the terminal device.

[0061] The communication method provided by the present application can be applied to various communication systems, such as a Long Term Evolution (LTE) system, a 5G mobile communication system, and a mobile communication system evolved after 5G. The 5G mobile communication system or the future communication system can include non-standalone (NSA) and / or standalone (SA).

[0062] The communication method provided by the present application can also be applied to machine type communication (MTC), Long Term Evolution-machine (LTE-M), device to device (D2D) network, machine to machine (M2M) network, internet of things (IoT) network, or other networks.

[0063] The goal of dictionary learning is to extract the essential features of a thing and realize dimensionality reduction of the information of the thing, so as to reduce the interference of unimportant information of the thing on the definition of the thing. When data compression is performed based on the dictionary learning technology, a dictionary of source data (or original data) is first obtained, which can also be called a base. The dictionary includes the essential features of the source data, and the source data is expressed based on the dictionary. The expression can be understood as the description of the source data by the dictionary based on the weight, so that the projection of the source data under the dictionary is sparse, thereby achieving the effect of data compression. The dictionary learning is exemplarily described below in combination with FIG. 2.

[0064] FIG. 2 is a schematic diagram of a dictionary learning framework according to an embodiment of the present application. As shown in FIG. 2, the source data Y can be represented by an R-row-by-C-column matrix, and thus the source data can also be referred to as a source matrix. Through a numerical iteration process of dictionary learning, a dictionary matrix D of the source data Y is obtained. The dictionary matrix D, also referred to as a base, can be an R-row-by-C'-column matrix, and each column in the dictionary matrix D can be referred to as a base vector. The dictionary matrix D includes the characteristics of the source data, for example, the characteristics of the source data are expressed by the base vectors.

[0065] In the process of data compression, any column (e.g., the cl column) in the source matrix can be expressed by the base vectors in the dictionary matrix and the weights of the base vectors. As shown in FIG. 2, each element in the sparse vector corresponds to a base vector in the dictionary matrix D, and the value of each element is the weight (or coefficient) of the corresponding base vector for expressing the cl column of the source matrix. The first element with a non-zero coefficient in the sparse vector corresponds to a base vector that has expressiveness for the cl column of the source matrix, and the second element with a zero coefficient corresponds to a base vector that has no expressiveness for the cl column of the source matrix. The sparse vectors for expressing each column of the source matrix can form a sparse matrix. The more second elements in the sparse matrix, the less resource occupied by the information with low relevance to the target task. The sparsity of the sparse matrix is considered to be better, and the source data Y can be expressed by the elements with expressiveness in the sparse matrix, so that the storage resource and transmission resource can be reduced while having good expressiveness for the source data Y, that is, the compression ratio of the data compression based on the dictionary learning technology is higher and the data loss is smaller.

[0066] It should be understood that the second element in the embodiments of the present application can also be a non-zero element satisfying a threshold constraint, for example, the absolute value of the second element is less than or equal to a capability threshold. The present application does not limit the value of the capability threshold, which can be adjusted according to the applied business scenario.

[0067] In the process of data reconstruction, the reconstructed data is an approximation of the product of the dictionary matrix D and the sparse vector x, which can be expressed as: In the case that the source matrix Y is relatively dispersed, it is difficult to obtain a good dictionary to make the sparse vector have good sparsity, and thus a large error exists between the reconstructed data and the source data, that is, the reconstruction error (or compression loss).

[0068] The information obtained by the projection of the source data under the dictionary in the form of a matrix (i.e., a sparse matrix) is only an exemplary description, and the present application does not limit the data form of the information obtained by the projection of the source data under the dictionary, for example, it can also be a numerical sequence. In the following, the elements with expressiveness in the sparse matrix are summarized by coefficient information.

[0069] The above examples are only described by taking the dictionary (or basis) in the form of vector as an example, but the data form of the dictionary (or basis) is not limited in the application, for example, it can also be a numerical sequence, and for the sake of unity, the basis information is used to express the dictionary (or basis) in the following description, and the basis information can include the dictionary (or basis), or can be understood as a generalization of various data forms of the dictionary (or basis).

[0070] The above examples are only described by taking the data compression based on the dictionary learning technology as an example, but the application is not limited to this. For example, the data compression can also be realized based on low-rank approximation, or the data compression realized based on quantization and / or entropy coding, etc. No matter which data compression mode exists the above technical problems.

[0071] The low-rank approximation can effectively reduce the storage and calculation complexity of data by representing a high-dimensional matrix as the product of two or more low-dimensional matrices. The application does not limit the algorithm used for low-rank approximation, for example, the compression processing of low-rank approximation can be realized by singular value decomposition (SVD) or orthogonal triangular (QR) decomposition, etc. For example, in the process of data compression, singular value decomposition is performed on the data to be compressed to obtain left singular value vector U, singular value matrix Σ and right singular value vector V T , and the singular values larger than a certain threshold are reserved to realize data compression. In the process of data reconstruction, the data is reconstructed based on the reserved singular values and the corresponding singular value vectors, and there is also a large reconstruction error.

[0072] Other data compression modes, such as data compression realized based on quantization and / or entropy coding, also have the problem of large reconstruction error, which will not be described one by one. In view of this technical problem, the data compression transmission method provided by the application considers that the source data is compressed in multiple stages to obtain multiple compression information, and the data is reconstructed based on the multiple compression information to reduce the reconstruction error, that is, to reduce the compression loss, so as to realize high-reliability compression transmission.

[0073] The embodiments of the application can solve the problem of large reconstruction error caused by the data compression algorithm by compressing the source data in multiple stages, and can also be used to solve the problem that the transmission overhead is still large after data compression.

[0074] The source data can be referred to as original data or data to be compressed. In the embodiments of the present application, the data to be compressed is also referred to as data to be transmitted, because the embodiments of the present application are to compress and transmit data. For the sake of unity, the data to be compressed is referred to as data to be compressed hereinafter. In the embodiments of the present application, the data to be compressed can be first data, and the data to be compressed in different stages can be different when the first data is compressed in multiple stages. For example, in the (i+1)th stage of compression, the data to be compressed can be second data determined based on the first data.

[0075] In the embodiments of the present application, the reconstructed first data can be expressed as recovered first data or constructed first data. For the sake of convenience, the order of the words is exchanged, and the meaning is the same. For example, the first data is recovered or the first data is constructed. For the sake of unity, the first data is recovered or the first data is recovered hereinafter.

[0076] It should also be understood that the present application does not limit the data compression transmission scenario. For example, data compression transmission can be performed in the communication scenarios of uplink transmission, downlink transmission or sidelink transmission.

[0077] In the embodiments of the present application, the same items or similar items with the same functions and effects are distinguished by the words "first, second, …". The order and the number of signals are not limited. Those skilled in the art can understand that the words "first, second, …" do not limit the number and execution order, and the words "first, second, …" do not necessarily mean different. In addition to distinguishing different data, different parameters, indication information, etc. can also be distinguished.

[0078] The communication method provided by the embodiments of the present application will be described below with reference to the accompanying drawings.

[0079] The method provided by the embodiments of the present application will be described below with reference to the accompanying drawings. The method provided by the embodiments of the present application is applied to uplink transmission, the first communication device can be any terminal device in the communication system shown in FIG. 1, such as terminal device 130 or terminal device 140, and the second communication device can be network device 120 in the communication system shown in FIG. 1. The method provided by the embodiments of the present application is applied to downlink transmission, the first communication device can be network device 120 in the communication system shown in FIG. 1, and the second communication device can be any terminal device in the communication system shown in FIG. 1, such as terminal device 130 or terminal device 140. The method provided by the embodiments of the present application is applied to sidelink transmission, the first communication device and the second communication device can be any two terminal devices in the communication system shown in FIG. 1, such as terminal device 130 and terminal device 140.

[0080] It should also be understood that the above-mentioned communication device should not be limited to the execution subject of the method provided by the embodiments of the present application. As long as the program running the code of the method provided by the embodiments of the present application can execute the method provided by the embodiments of the present application, it can be the execution subject of the method provided by the embodiments of the present application. For example, any of the above-mentioned communication devices can be implemented as a terminal device or as a component in a terminal device, such as a chip, a chip system or other functional modules capable of invoking and executing programs; any of the above-mentioned communication devices can be implemented as a network device or as a component in a network device, such as a chip, a chip system or other functional modules capable of invoking and executing programs.

[0081] FIG. 3 is an interaction flow diagram of a data compression transmission method provided by the embodiments of the present application. In combination with FIG. 3, the method 200 includes the following or all processes:

[0082] S210, the first communication device compresses the first data to be compressed n times to obtain n compressed information and position indication information corresponding to at least one compressed information, n is an integer greater than 1.

[0083] S220, the first communication device sends the n compressed information and the position indication information corresponding to at least one compressed information to the second communication device. Correspondingly, the second communication device receives the n compressed information and the position indication information corresponding to at least one compressed information from the first communication device.

[0084] S230, the second communication device recovers the first data based on the n compressed information and the position indication information corresponding to at least one compressed information.

[0085] The present application does not limit the data type of the first data to be transmitted, for example, the first data can be point cloud data, AI data, CSI, etc. in the above examples.

[0086] The present application does not limit the compression method used in the data compression process, for example, the above-mentioned compression method based on dictionary learning technology, the compression method based on low rank approximation, or the compression method based on quantization and / or entropy coding. It should be understood that the above-mentioned n times compression or can be expressed as n order compression, in different order compression process, the compression method used can be the same or different, and in one order compression, one or more compression methods can be used, which is not limited by the present application.

[0087] In S210, the n compressions performed by the first communication device on the first data can be performed sequentially, or iteratively. That is, the result of each compression is used as the input for the next compression. As a first example, the compression information obtained from each compression can be used to determine the data to be compressed in the next compression, achieving iterative compression. As a second example, the compression algorithm (such as base information or parameters) is updated simultaneously with the compression information obtained from each compression, and the updated compression algorithm is used in the next compression, achieving iterative compression. As a third example, combining the first and second examples, compression information is obtained and the compression algorithm is updated each time, the data to be compressed in the next compression is determined based on this compression information, and the updated compression algorithm is used in the next compression, thereby achieving iterative compression.

[0088] Referring to Figure 4, in the first compression, the first communication device can compress the first data W1 to obtain the first compressed information S1. Further, the first communication device recovers the first data based on the first data W1 and the first compressed information S1. The difference between them determines the first second data W2, such as the second data. Furthermore, in the second compression, the first communication device compresses the first second data W2 to obtain the second compressed information S2. The first communication device can recover the first second data based on the first second data W2 and the first second compressed information S2. The difference between them determines the second second data W3, such as

[0089] It should be understood that the embodiments of this application may include at least the first compression and the second compression described above.

[0090] Referring to Figure 4, after the second compression, the third to nth compressions are similar to the second compression. The following explanation uses the (i+1)th compression as an example, where i is a positive integer. When i equals 1, the (i+1)th compression represents the aforementioned second compression. In the (i+1)th compression, the first communication device can process the i-th second data W... i+1 Compress the data to obtain the (i+1)th compressed information S. i+1 The i-th second data can be based on the (i-1)-th second data W i and the i-th compressed information S i The (i-1)th second data point recovered The differences between them are determined. Further, the first communication device can determine the differences based on the i-th second data W. i+1 And the compressed information S of the (i+1)th generation i+1 The i-th second data recovered The difference between them determines the (i+1)th second data Wi+2 As shown in FIG. 4, the first communication device can determine the first data based on the first data and the first compression information. Similarly, until the first communication device compresses the first data n times, n pieces of compression information, such as S1 to Sn, are obtained. n .

[0091] For convenience of description, the (i+1)th compression is taken as an example for description below, and the compression of the remaining stages from the 2nd to the nth compression can be referred to the implementation of the (i+1)th compression.

[0092] In the example shown in FIG. 4, the (i+1)th second data is determined based on the difference between the ith second data and the second data recovered from the (i+1)th compression information, and the ith second data is determined based on the difference between the (i-1)th second data and the second data recovered from the ith compression information, and so on until the 1st second data is determined based on the difference between the first data and the first data recovered from the 1st compression information. Therefore, each second data can be summarized as being determined based on the difference between the first data and the first data recovered from the 1st compression information. The difference between the data can be, for example, the residual between the data. It can be understood that the second data can be a kind of reconstruction error data or compression loss data, or in other words, the second data can represent the reconstruction error or compression loss when the first data is compressed.

[0093] As shown in the example of FIG. 4, in the n-time compression process, the 1st compression can be compression of the first data, and the 2nd to the nth compression can be compression of different second data, that is, iterative compression of the first data, or in other words, incremental compression of the first data. Therefore, the second data can also be referred to as incremental data. In this case, the n-time compression can include one initial compression and at least one incremental compression.

[0094] Optionally, in each incremental compression, the first communication device can determine whether to perform the current incremental compression based on the reconstruction error of the last incremental compression. For example, in the (i+1)th compression, the first communication device can recover the first data based on the first i compression information, and determine the reconstruction error based on the difference between the first data and the recovered first data. When the reconstruction error is greater than or equal to the first error threshold, the (i+1)th compression is performed, and when the reconstruction error is less than the first error threshold, the (i+1)th compression is not performed.

[0095] In the incremental compression process of the above example, each compression is performed on the reconstruction error data generated by the last compression, but the present application is not limited thereto. For example, in the (i+1)th compression, the compression can be performed based on the reconstruction error data generated by the jth compression, where j is a positive integer less than i+1. For example, in the (i+1)th compression, the ith second data W i+1The first data W1may be determined based on a difference between the first data W1and the first data recovered from the first compression information S1 when j is equal to 1, or the ith second data W i+1 may be determined based on a difference between the j-1th second data W j and the j-1th second data recovered from the jth compression information S j .

[0096] In the n times of compression, the process of recovering the original data based on the compression information, such as recovering the first data based on the first compression information, recovering the first second data based on the second compression information, recovering the ith second data based on the (i+1)th compression information, and so on, can be implemented by the first communication device through decompression.

[0097] In some embodiments, in order to reduce the transmission resource overhead, the first communication device can perform data screening on the data to be compressed in at least one of the n times of compression, for example, performing compression transmission on part of the data units in the data to be compressed. The present application does not limit the division manner of the data units. For example, when the first data is a matrix, each row of data in the first data can be a data unit, or each column of data in the first data can be a data unit; for example, when the first data is a numerical sequence, the first data can be divided into data units according to the data amount, such as 5 bits of data as a data unit; for example, the same type or same dimension data in the first data can be a data unit.

[0098] For example, the first communication device can perform data compression on at least one data unit of the M data units of the ith second data. The M data units can be all data units in the ith second data.

[0099] In different stages of the incremental compression process, the division manner of the data units can be the same or different, which is not limited by the present application. For example, referring to FIG. 4, in the second compression, the first second data W1to be compressed includes M1rows of data, such as I (1,0) to I (1,M1) , the first communication device can perform data compression on m1rows of data, such as I (1,1) , I (1,2) , I (1,4) ……I (1,M1) , in the (i+1)th compression, the ith second data W i+1 to be compressed includes M i columns of data, such as I (i,0) to I (i,Mi) , the first communication device can perform data compression on the ith second data W​i+1 m in the i-th second data i Column data, such as data units I (i,0) , I (i,1) , I (i,3) …, is compressed.

[0100] Optionally, for the first data, partial data units can also be compressed and transmitted.

[0101] In a compression process, the first communication device can compress m i data units of the i-th second data, the m i data units being partial or all of M data units of the i-th second data.

[0102] In the first example, the first communication device can determine m i data units with large reconstruction errors from the M data units of the i-th second data. Optionally, the reconstruction error can be quantified by the first parameter. For example, the first communication device can determine the reconstruction error of each data unit in the M data units according to the difference between the data unit and the data recovered from the compression information of the data unit, and determine whether the data unit participates in the compressed transmission, i.e., whether it belongs to the m i data units, based on the reconstruction error. In one example, the m i data units can be m i data units of the M data units with the first parameter greater than or equal to a second error threshold; in another example, the m i data units can be the first m i data units of the M data units arranged in descending order of reconstruction error. The second error threshold and / or the number of data units m i may be preset to the first communication device, or agreed by the protocol, or configured by the network device, which is not limited in the present application.

[0103] In the second example, the first communication device can determine m i data units with high data importance from the M data units of the i-th second data. Optionally, the data importance can be quantified by the first parameter. For example, when the data to be compressed is AI data, the data of the layers with high importance in the model has high importance, in which case different layers can be set with corresponding parameter values to indicate the corresponding importance. In one example, the m i data units can be m i data units of the M data units with the first parameter greater than or equal to an importance threshold; in another example, the m iThe data unit can be the first m data units arranged in descending order of importance. i There are m data units. Among them, the importance threshold and / or the number of data units is m. i It may be pre-installed in the first communication device, or be agreed upon by a protocol, or be configured by the network device; this application does not limit this.

[0104] In addition to the two examples mentioned above, m i The data units can also be randomly selected, or m i Each data unit can be determined from M data units according to a preset rule. For example, the preset rule stipulates that odd or even rows of data constitute m. i Each data unit, for example, a preset rule defines before / after m. i Column data composition m i The data units, etc., are not limited in this application. The preset rules may be preset in the first communication device, agreed upon by a protocol, or configured by the network device; this application does not limit these provisions.

[0105] In some embodiments, when the first data is compressed n times, in at least one of the compressions, in addition to obtaining the compression information of this compression, position indication information corresponding to the compression information can also be obtained. For example, in the (i+1)th compression, at least one data unit among the M data units of the i-th second data is compressed to obtain the (i+1)-th compression information and the position indication information corresponding to the (i+1)-th compression information. The position indication information is used to indicate the position of the at least one data unit to be compressed in the M data units.

[0106] This application does not limit the method of indicating location information. Two possible examples are provided below:

[0107] Example 1: The location indication information may include a bitmap, where each bit in the bitmap corresponds to a data unit in the data to be compressed. When the bit is a first value, the corresponding data unit is the data unit that needs to be compressed and transmitted; when the bit is a second value, the corresponding data unit is the data unit that does not need to be compressed and transmitted. This application does not limit the first and second values; for example, the first value can be 0 and the second value can be 1, or the first value can be 1 and the second value can be 0.

[0108] For example, referring to Figure 4, in the second compression, the first second data W1 to be compressed includes M1 rows of data, such as I (1,0) to I (1,M1) The first communication device can communicate with the m1th row of data in the M1th row, such as I (1,1) I (1,2) I (1,4) ...I(1,M1) Data compression is performed. In this case, the location indication information can be [0,1,1,0,1,0,…,1]; in the (i+1)th compression, the i-th second data W to be compressed i+1 Including M i Column data, such as I (i,0) to I (i,Mi) The first communication device can communicate with the i-th second data W i+1 m i Column data, such as data unit I (i,0) I (i,1) I (i,3) ...and perform data compression. In this case, the location indication information can be [1,1,0,1,0,...,0].

[0109] Example 2: The position indication information may include indication information for each data unit that needs to be compressed and transmitted in the data to be compressed, such as the identifier or index of the data unit. For example, referring to Figure 4, in the second compression, the position indication information may indicate [1,2,4,…,M1], and in the (i+1)th compression, the position indication information may indicate [0,1,3,…].

[0110] For example, each of the n compressed information pieces corresponds to a position indication information to indicate which data units in the data to be compressed participate in the compression and transmission during the compression process; or, some of the compressed information pieces in the n compressed information pieces have corresponding position indication information. For example, when compressing some data units in the data to be compressed, the corresponding position indication information indicates the position of the data units participating in the compression and transmission in the data to be compressed during the compression process. When compressing all data units in the data to be compressed, no indication is given.

[0111] In some embodiments, the location indication information corresponding to different compressed information may be different. In other embodiments, at least two of the n compressed information may reuse the same location indication information, thereby reducing the transmission overhead of the location indication information.

[0112] Optionally, at least part of the compression process in the n compressions can be implemented based on dictionary learning techniques, that is, by expressing the data to be compressed through base information, thereby obtaining compressed information including coefficient information. Taking the (i+1)th compression as an example, the (i+1)th compression information includes: base information and coefficient information, or coefficient information. The base information can be used to express the i-th second data or one or more data units of the i-th second data, and the coefficient information includes the expression coefficients of at least one sub-information in the base information for the i-th second data.

[0113] Optionally, the compression information obtained by using the base information to express the to-be-compressed data for data compression can further comprise information indicating a position of at least one sub-information expressing the to-be-compressed data in the base information, so as to facilitate the receiving end to determine the at least one sub-information and further more accurately recover the to-be-compressed data.

[0114] It should be understood that when the i+1th compression information does not comprise the base information, the base information can be preset, or agreed by protocol, or configured by other communication devices.

[0115] In the above embodiment, the first communication device and the second communication device can synchronize the first indication information, which can indicate one or more base information corresponding to each compression information expressed by the base information. Referring to S310 and S320 in the method 300 shown in FIG. 5.

[0116] In S310, the second communication device sends the above-mentioned first indication information to the first communication device, and correspondingly, the first communication device receives the first indication information from the second communication device.

[0117] In S320, the first communication device sends the above-mentioned first indication information to the second communication device, and correspondingly, the second communication device receives the first indication information from the first communication device.

[0118] It should be understood that the above-mentioned S310 and S320 can be executed alternatively, or S310 and S320 can be both executed, in which case, the base information indicated by the second communication device to the first communication device each time of compression can be a preset base information (such as a base information determined based on prior experience), the base information indicated by the first communication device to the second communication device each time of compression can be an actually used base information, and the base information indicated in S310 and the base information indicated in S320 can be the same or different, which is not limited in the present application.

[0119] Optionally, when the first indication information indicates each base information, the first indication information can indicate a sub-information of the base information and / or a size of the base information, and the size of the base information can comprise a number of rows and / or a number of columns of the base information.

[0120] In some embodiments, in order to enable the base information in the incremental compression process to better express the corresponding data to be compressed, the base information can be trained based on the incremental data. For example, in the i+1th compression, the first communication device can determine the base information used in the i+1th compression based on the ith second data, and then perform data compression on the ith second data based on the base information to obtain the i+1th compressed information. In this example, the ith second data can be regarded as a training sample of the base information. The present application does not limit the specific implementation of training the base information based on the training sample, for example, the training sample can be taken as input, and the optimized base information can be obtained through iterative learning.

[0121] In order to further improve the expression ability of the base information to the data to be compressed in the incremental compression, the base information can be optimized with higher intensity by enriching the training sample. For example, when training the base information used in the i+1th compression, the ith second data can be converted to obtain at least one third data, and the converted at least one third data or the ith second data and the at least one third data can be taken as a training sample. The above data conversion (referred to as conversion) can also be referred to as data reshaping (or simply reshaping).

[0122] The data conversion mode will be described below with reference to FIG. 6.

[0123] Implementation mode one: the ith second data W i+1 is converted by matrix transposition to obtain the third data Referring to (a) of FIG. 6, W i+1 is an H-row-by-L-column matrix, and the third data obtained by matrix transposition is which is an L-row-by-H-column matrix.

[0124] Implementation mode two: each data unit of the ith second data is split or merged. In one example of the implementation mode two, the first communication device can split at least part of the row and / or column data in the ith second data; in another example of the implementation mode two, the first communication device can merge at least part of the row and / or column data in the ith second data; in another example of the implementation mode three, the first communication device can split part of the row and / or column data in the ith second data and merge another part of the row and / or column data; in another example of the implementation mode three, the first communication device can sequentially perform the splitting of at least part of the row and / or column data and the merging of at least part of the row and / or column data in the order.

[0125] Referring to (b) of FIG. 6, the i-th second data is split into a matrix with P rows and Q columns, where P is less than H and Q is greater than L. In addition to the splitting shown in FIG. 6, each row of the i-th second data can also be split, or at least one row and / or at least one column of the i-th second data can be combined to obtain third data.

[0126] In a third implementation, the order of data units in the i-th second data is adjusted. For example, the order of each data unit in the i-th second data can be adjusted, such as by swapping (or exchanging) the order of every two adjacent data units, e.g., swapping the order of the first and second data units, the third and fourth data units, and so on, in the i-th second data; or the order of some data units in the i-th second data can be adjusted, such as by swapping the order of data units with high similarity, and so on.

[0127] Optionally, the at least one third data determined based on the i-th second data can include third data determined based on some or all of the above data conversion manners. It can be understood that the above three implementations can be combined with each other to achieve more diverse data conversion, so as to increase the diversity of the training samples.

[0128] In the above embodiments, the second indication information can be synchronized between the first communication device and the second communication device, and the second indication information is used to indicate the conversion manner of each third data. For example, the first communication device can send the above second indication information to the second communication device, and correspondingly, the second communication device receives the second indication information from the first communication device; or the second communication device can send the above second indication information to the first communication device, and correspondingly, the first communication device receives the second indication information from the second communication device. It should be understood that the first communication device sending the second indication information to the second communication device and the second communication device sending the second indication information to the first communication device can be performed alternatively or simultaneously. For example, the second communication device can indicate the conversion manner to the first communication device to configure the conversion manner, and the first communication device can indicate the conversion manner to the second communication device to synchronize the actual conversion manner.

[0129] It should be understood that the conversion manner of each third data can be the same or different, and if all the third data are determined based on the same conversion manner, the second indication information can indicate only one common conversion manner.

[0130] For example, the present application does not limit the indication manner of the second indication information. For example, the second indication information can indicate the conversion manner based on Table 1.

[0131] Table 1

[0132] Optionally, the second indication information indicates the corresponding data conversion mode, and further indicates a conversion parameter in the conversion mode. For example, when the second indication information indicates that the ith second data is split or merged by row, the second indication information further indicates the rows to be split and / or the rows to be merged. For another example, when the second indication information indicates that the ith second data is modulated in sequence, the second indication information further indicates a sequence adjustment manner and / or the rows and / or columns involved in the sequence adjustment.

[0133] It should be further understood that the second indication information indicates part or all of the contents, which can be preset in the first communication device, or agreed by a protocol, or configured by another communication device, and the present application does not limit this.

[0134] In the above S220, the first communication device sends n compressed information and position indication information corresponding to at least one compressed information to the second communication device to realize the compressed transmission of the first data. The n compressed information can be transmitted together or independently, and the present application does not limit this. When the n compressed information is transmitted independently, the present application does not limit the transmission order of the n compressed information. For example, the first communication device can send the obtained compressed information after each compression. In this case, the transmission overhead of each transmitted compressed information is small, and it is more suitable for the scene where the transmission overhead is limited. Similarly, the position indication information corresponding to at least one compressed information can be transmitted together with the corresponding compressed information or independently, and the present application does not limit this.

[0135] In the above S230, after receiving the n compressed information and the position indication information corresponding to at least one compressed information, the second communication device can decompress each compressed information to recover the first data. For example, referring to FIG. 4, the second communication device can decompress the n compressed information S1-Sn based on the position indication information corresponding to the n compressed information S1-Sn to recover the first data. n The recovered first data Optionally, during the independent transmission of the n compressed information, the first communication device can recover the first data based on part of the received compressed information, or can wait until the n compressed information is received to recover the first data, and the present application does not limit this. It should be understood that the decompression of the n compressed information by the second communication device is the inverse process of the n times compression of the first data by the first communication device.

[0136] Optionally, the recovered first data can be referred to as constructing the first data, reconstructing the first data, etc. The closer the recovered first data is to the first data before compression, the smaller the compression loss caused by the data compression transmission.

[0137] Any of the above indication information, such as the first indication information, the second indication information, and the position indication information, can be independent of each other, such as being sent after being respectively protocol encapsulated, or at least part of the indication information can be sent after being protocol encapsulated together.

[0138] Part or all of the thresholds involved in the embodiments of the present application, such as the first error threshold, the second error threshold, the importance threshold, or the capability threshold, can be preset, predetermined by a protocol, or configured by a network device, and the present application does not limit this.

[0139] Therefore, in the embodiments of the present application, the first communication device compresses the first data n times to obtain n compressed information and position indication information corresponding to at least one compressed information, n is an integer greater than 1, and data recovery based on the n compressed information of the first data and the position indication information corresponding to at least one compressed information can reduce compression loss, thereby realizing high-reliability compression transmission.

[0140] It can be understood that, in order to implement the functions in the above embodiments, the network device and the terminal include corresponding hardware structures and / or software modules for executing various functions. Those skilled in the art should easily realize that, in combination with the units and method steps of the examples described in the embodiments disclosed in the present application, the present application can be realized in the form of hardware or a combination of hardware and computer software. Whether a certain function is executed in the form of hardware or computer software driving hardware depends on the specific application scenario and design constraints of the technical solution.

[0141] FIG. 7 is a schematic block diagram of a communication device provided by an embodiment of the present application. In one possible implementation, the communication device 400 can include a module or unit corresponding to each of the methods executed by the first communication device or the second communication device in the above method embodiments, which can be a hardware circuit, software, or a combination of hardware circuit and software.

[0142] In one possible implementation, as shown in FIG. 7, the device 400 can include a transceiver module 410 and a processing module 420.

[0143] Optionally, the communication device 400 can correspond to the first communication device in the above method embodiments.

[0144] When the communication device 400 is configured to perform the method on the first communication device side, the processing module 420 can be configured to obtain n pieces of compressed information and position indication information corresponding to each piece of compressed information by compressing the first data to be compressed n times, where n is an integer greater than 1; in the (i+1)th compression in the n times of compression, at least one data unit in M data units of the i th second data is compressed to obtain the (i+1)th compressed information, where i is a positive integer, the i th second data is determined based on the difference between the first data and the first data recovered from the first compressed information, the first compressed information is obtained by compressing the first data in the first compression, and the position indication information corresponding to the (i+1)th compressed information is used to indicate the position of the at least one data unit in the M data units; and the transceiver module 410 can be configured to send the n pieces of compressed information and the position indication information corresponding to each piece of compressed information.

[0145] Optionally, the at least one data unit is determined based on a first parameter, where the first parameter is used to indicate the difference between each data unit in the second data and the data recovered from the compressed information of the data unit; or the first parameter is used to indicate the data importance of each data unit in the second data.

[0146] Optionally, the transceiver module 410 is specifically configured to send the n pieces of compressed information in sequence according to a compression order.

[0147] Optionally, the (i+1)th compressed information includes base information and coefficient information, or coefficient information; the base information is used to express the i th second data, and the coefficient information includes the expression coefficient of at least one sub-information in the base information to the i th second data.

[0148] Optionally, the transceiver module 410 is further configured to send or receive first indication information, where the first indication information is used to indicate the base information corresponding to each piece of compressed information in the n pieces of compressed information.

[0149] Optionally, the base information corresponding to each piece of compressed information in the n pieces of compressed information includes sub-information of the base information and / or the size of the base information.

[0150] Optionally, the base information corresponding to the (i+1)th compressed information is obtained based on the i th second data and / or at least one third data, where the at least one third data is obtained by data conversion on the i th second data.

[0151] Optionally, the conversion mode of the third data includes at least one of the following:

[0152] performing a transpose on a matrix of the ith second data;

[0153] performing splitting or merging on each data unit of the ith second data; or,

[0154] adjusting an order of data units in the ith second data.

[0155] Optionally, the transceiving module 410 is further configured to send or receive second indication information, the second indication information being used to indicate a conversion mode of each third data.

[0156] Optionally, the communication apparatus 400 can correspond to the second communication apparatus in the above method embodiments.

[0157] When the communication apparatus 400 is configured to perform the method of the second communication apparatus, the transceiving module 410 can be configured to receive n pieces of compression information of first data and position indication information corresponding to at least one piece of compression information, n being an integer greater than 1; the (i+1)th piece of compression information being obtained by compressing at least one data unit in M data units of the ith second data, i being a positive integer, the ith second data being determined based on a difference between the first data and the first data recovered from the 1st piece of compression information, the 1st piece of compression information being obtained by compressing the first data at the 1st time, and the position indication information corresponding to the (i+1)th piece of compression information being used to indicate a position of the at least one data unit in the M data units; and the processing module 420 is configured to recover the first data based on the n pieces of compression information and the position indication information.

[0158] Optionally, the at least one data unit is determined based on a first parameter, the first parameter being used to indicate a difference between each data unit in the second data and compression information of the data unit, or the first parameter being used to indicate data importance of each data unit in the second data.

[0159] Optionally, the transceiving module 410 is specifically configured to receive the n pieces of compression information sent in a compression order.

[0160] Optionally, the (i+1)th piece of compression information includes base information and coefficient information, or coefficient information, the base information being used to express the ith second data, and the coefficient information including an expression coefficient of at least one sub-information in the base information to the ith second data.

[0161] Optionally, the transceiving module 410 is further configured to receive or send first indication information, the first indication information being used to indicate base information corresponding to each piece of compression information in the n pieces of compression information.

[0162] Optionally, the base information corresponding to each of the n pieces of compressed information comprises: sub-information of the base information and / or a size of the base information.

[0163] Optionally, the base information corresponding to the (i+1)th piece of compressed information is obtained based on the ith second data and / or at least one third data, the at least one third data being obtained by data conversion on the ith second data.

[0164] Optionally, the conversion manner of the third data comprises at least one of the following:

[0165] transposing the ith second data in a matrix;

[0166] splitting or merging each data unit of the ith second data; or

[0167] adjusting an order of data units in the ith second data.

[0168] Optionally, the transceiver 410 is further configured to receive or send second indication information, the second indication information being used to indicate the conversion manner of each of the third data.

[0169] It should be understood that the specific processes performed by each module have been described in detail in the above method embodiments, and thus will not be described here again for the sake of brevity.

[0170] The transceiver 410 in the communication apparatus 400 can be implemented by a transceiver, for example, can correspond to the transceiver 520 in the communication apparatus 500 shown in FIG. 8, and the processing module 420 in the communication apparatus 400 can be implemented by at least one processor, for example, can correspond to the processor 510 in the communication apparatus 500 shown in FIG. 8.

[0171] When the communication apparatus 400 is a chip or a chip system configured in a communication device (such as a terminal device or a network device), the transceiver 410 in the communication apparatus 400 can be implemented by an input / output interface, a circuit, etc., and the processing module 420 in the communication apparatus 400 can be implemented by a processor, a microprocessor or an integrated circuit integrated on the chip or the chip system, etc.

[0172] FIG. 8 is another schematic block diagram of a communication apparatus according to an embodiment of the present application. As shown in FIG. 8, the communication apparatus 500 can comprise a processor 510. The processor 510 can be configured to perform the method performed by the first communication apparatus or the second communication apparatus in the above method embodiments.

[0173] In some possible implementation, the communication apparatus 500 can include a transceiver 520. The transceiver 520 can communicate with the processor 510 through an internal connection path. The processor 510 can control the transceiver 520 to send and / or receive signals.

[0174] In some possible implementation, the communication apparatus 500 can include a memory 530. The memory 530 can communicate with the processor 510 through an internal connection path. The memory 530 and the processor 510 can be integrated together or separately arranged. The memory 530 can also be a memory outside the apparatus. The memory 530 is configured to store instructions, and the processor 510 is configured to execute the instructions stored in the memory 530 to perform the method of the first communication apparatus or the second communication apparatus in the above method embodiments.

[0175] It should be understood that the communication apparatus 500 can correspond to the first communication apparatus or the second communication apparatus in the above method embodiments, and can be used to perform the steps and / or procedures performed by the first communication apparatus or the second communication apparatus in the above method embodiments. Optionally, the memory 530 can include a read-only memory and a random access memory, and provide instructions and data for the processor. Part of the memory can also include a non-volatile random access memory. The memory 530 can be a separate device or integrated in the processor 510. The processor 510 can be configured to execute the instructions stored in the memory 530, and when the processor 510 executes the instructions stored in the memory, the processor 510 is configured to perform the steps and / or procedures of the above method embodiments corresponding to the first communication apparatus or the second communication apparatus.

[0176] Optionally, the communication apparatus 500 is the first communication apparatus in the above embodiments.

[0177] Optionally, the communication apparatus 500 is the second communication apparatus in the above embodiments.

[0178] Optionally, the transceiver 520 can include a transmitter and a receiver. The transceiver 520 can further include an antenna, and the number of the antenna can be one or more. The processor 510 and the memory 530 and the transceiver 520 can be devices integrated on different chips. For example, the processor 510 and the memory 530 can be integrated in a baseband chip, and the transceiver 520 can be integrated in a radio frequency chip. The processor 510 and the memory 530 and the transceiver 520 can also be devices integrated on the same chip. The present application does not make any limitation in this regard.

[0179] Optionally, the communication apparatus 500 is a component, such as a chip, a chip system, etc., arranged in the first communication apparatus.

[0180] Optionally, the communication apparatus 500 is a component, such as a chip, a chip system, or the like, configured in the second communication apparatus.

[0181] The transceiver 520 can also be a communication interface, such as an input / output interface, a circuit, or the like. The transceiver 520 can be integrated with the processor 510 and the memory 530 in the same chip, such as a baseband chip.

[0182] The present application also provides a processing apparatus including at least one processor. The at least one processor executes a computer program or a logic circuit to cause the processing apparatus to perform the method performed by the first communication apparatus or the second communication apparatus in the above method embodiments. The processing apparatus can also include a memory for storing the computer program.

[0183] The present application embodiments also provide a processing apparatus including a processor and an input / output interface. The input / output interface is coupled to the processor. The input / output interface is configured to input and / or output information. The information includes at least one of instructions and data. The processor is configured to execute a computer program to cause the processing apparatus to perform the method performed by the first communication apparatus or the second communication apparatus in the above method embodiments.

[0184] The present application embodiments also provide a processing apparatus including a processor and a memory. The memory is configured to store a computer program. The processor is configured to call and execute the computer program from the memory to cause the processing apparatus to perform the method performed by the first communication apparatus or the second communication apparatus in the above method embodiments.

[0185] It should be understood that the above processing apparatus can be one or more chips. For example, the processing apparatus can be a field programmable gate array (FPGA), can be an application specific integrated circuit (ASIC), can be a system on chip (SoC), can be a central processor unit (CPU), can be a network processor (NP), can be a digital signal processor (DSP), can be a micro controller unit (MCU), can be a programmable logic device (PLD), or other integrated chip.

[0186] In the implementation process, the steps of the above method can be completed by the integrated logic circuit of hardware in the processor or the instruction in the form of software. The steps of the method disclosed in combination with the embodiments of the present application can be directly embodied as hardware processor execution completion, or executed by the combination of hardware and software modules in the processor. The software module can be located in the mature storage medium in the field, such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, register, etc. The storage medium is located in the memory, and the processor reads the information in the memory, and combines the hardware to complete the steps of the above method. To avoid repetition, it will not be described in detail here.

[0187] It should be noted that the processor in the embodiments of the present application can be an integrated circuit chip with signal processing capability. In the implementation process, the steps of the above method embodiments can be completed by the integrated logic circuit of hardware in the processor or the instruction in the form of software. The above processor can be a general processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component. The disclosed methods, steps and logic block diagrams in the embodiments of the present application can be implemented or executed. The general processor can be a microprocessor or the processor can also be any conventional processor. The steps of the method disclosed in combination with the embodiments of the present application can be directly embodied as hardware decoding processor execution completion, or executed by the combination of hardware and software modules in the decoding processor. The software module can be located in the mature storage medium in the field, such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, register, etc. The storage medium is located in the memory, and the processor reads the information in the memory, and combines the hardware to complete the steps of the above method.

[0188] It is to be appreciated that the memory in the embodiments of the application can be a volatile or non-volatile memory, or can include both volatile and non-volatile memory. The non-volatile memory can be read-only memory (ROM), programmable ROM (PROM), erasable PROM (EPROM), electrically EPROM (EEPROM), or flash memory. The volatile memory can be random access memory (RAM), which is used as external cache. By way of example, and not limitation, many forms of RAM are available, for example, static RAM (SRAM), dynamic RAM (DRAM), synchronous dynamic RAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), Synchlink DRAM (SLDRAM), and direct rambus RAM (DR RAM). It is to be appreciated that the memory described herein is intended to include, without being limited to, these and any other suitable types of memory.

[0189] According to the method provided in the embodiments of the application, the application further provides a computer program product, which comprises a computer program or a set of instructions, and when the computer program or the set of instructions run on a computer, the computer program or the set of instructions make the computer execute the method performed by the first communication device or the second communication device in the method embodiments.

[0190] According to the method provided in the embodiments of the application, the application further provides a computer readable storage medium, which stores a program, and when the program runs on a computer, the program makes the computer execute the method performed by the first communication device or the second communication device in the method embodiments.

[0191] According to the method provided in the embodiments of the application, the application further provides a communication system, which can comprise the first communication device or the second communication device described above.

[0192] As used in this description, the terms "component," "module," "system", and the like are intended to refer to a computer-related entity, either hardware, firmware, a combination of hardware and software, software, or software in execution. For example, a component can be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and / or a computer. By way of illustration, both an application running on a computing device and the computing device can be a component. One or more components can reside within a process and / or thread of execution and a component can be localized, partially localized, or distributed across two or more computers or other processing devices. Also, these components can execute from various computer readable media having various data structures stored thereon. The components can communicate by way of local and / or remote processes such as in accordance with a signal having one or more data packets (e.g., data from one component interacting with another component in a local system, distributed system, and / or across a network such as the Internet with other systems via the signal).

[0193] Those skilled in the art can clearly understand that the units and algorithm steps of the examples described in combination with the embodiments disclosed herein can be realized by electronic hardware or a combination of computer software and electronic hardware. Whether the functions are realized in hardware or software mode depends on the specific application and design constraints of the technical solution. The skilled person can use different methods to realize the described functions for each specific application, but such implementation should not be considered beyond the scope of the present application.

[0194] Those skilled in the art can clearly understand that, for the convenience and brevity of the 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 described here.

[0195] In several embodiments provided in the present application, it should be understood that the disclosed system, device and method can be realized by other ways. For example, the above-described device embodiments are only schematic, for example, the division of units is only a logical function division, and actual implementation can have another division manner, 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 coupling or direct coupling or communication connection between the shown or discussed mutual units can be indirect coupling or communication connection through some interfaces, devices or units, and can be electrical, mechanical or other forms.

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

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

[0198] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer readable storage medium. Based on this understanding, the part of the technical solutions of the present application that essentially contributes or the part of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes a plurality of instructions for causing a computer device (which can be a personal computer, a server, or a second communication device, etc.) to execute all or part of the steps of the embodiments of the present application. The aforementioned storage medium includes various media that can store program codes, such as a U disk, a mobile hard disk, a ROM, a RAM, a magnetic disk or an optical disk.

Claims

1. A data compression transmission method characterized by, The method comprises: performing n times of compression on the first data to obtain n compressed information and position indication information corresponding to at least one compressed information, n being an integer greater than 1; wherein, in the (i+1)th compression in the n times of compression, at least one data unit in M data units of the ith second data is compressed to obtain the (i+1)th compressed information, i being a positive integer, the ith second data being determined based on a difference between the first data and first data recovered from the 1st compressed information, the 1st compressed information being obtained by compressing the first data in the 1st compression, and the position indication information corresponding to the (i+1)th compressed information being used to indicate a position of the at least one data unit in the M data units; sending the n compressed information and the position indication information corresponding to the at least one compressed information.

2. The method of claim 1, wherein, The at least one data unit is determined based on a first parameter; wherein, the first parameter is used to indicate a difference between each data unit in the second data and data recovered from compressed information of the data unit; or the first parameter is used to indicate data importance of each data unit in the second data.

3. The method according to claim 1 or 2, characterized in that, The sending of the n compressed information comprises: sending the n compressed information in sequence according to a compression order.

4. The method according to any one of claims 1 to 3, characterized in that, The (i+1)th compressed information comprises base information and coefficient information, or coefficient information; the base information is used to express the ith second data, and the coefficient information comprises an expression coefficient of at least one sub-information in the base information to the ith second data.

5. The method of claim 4, wherein, The method further comprises: sending or receiving first indication information, the first indication information being used to indicate base information corresponding to each compressed information in the n compressed information.

6. The method according to claim 4 or 5, characterized in that, The base information corresponding to each compressed information in the n compressed information comprises sub-information of the base information and / or a size of the base information.

7. The method according to any one of claims 4 to 6, characterized in that, The base information corresponding to the (i+1)th compressed information is obtained based on the ith second data and / or at least one third data, the at least one third data being obtained by data conversion of the ith second data.

8. The method of claim 7, wherein, The conversion mode of the third data comprises at least one of the following: transposing a matrix of the ith second data; splitting or merging each data unit of the ith second data; or adjusting an order of data units in the ith second data.

9. The method of claim 8, wherein, The method further comprises: sending or receiving second indication information, the second indication information being used to indicate a conversion mode of each third data.

10. A data compression transmission method characterized by, The method comprises: receiving n compressed information of first data and position indication information corresponding to at least one compressed information, n being an integer greater than 1; wherein, The (i+1)th compressed information is compressed from at least one data unit of M data units of the ith second data, i is a positive integer, the ith second data is determined based on a difference between the first data and the first data recovered from the 1st compressed information, the 1st compressed information is obtained by compressing the first data at a 1st compression, and the position indication information corresponding to the (i+1)th compressed information is used to indicate a position of the at least one data unit in the M data units. The first data is recovered based on the n compressed information and the position indication information.

11. The method of claim 10, wherein, The at least one data unit is determined based on a first parameter; wherein, The first parameter is used to indicate a difference between each data unit in the second data and the compressed information of the data unit; or, The first parameter is used to indicate a data importance of each data unit in the second data.

12. The method according to claim 10 or 11, characterized in that, The receiving of the n compressed information of the first data comprises: The n compressed information is received in a compression order.

13. The method according to any one of claims 10 to 12, characterized in that, The (i+1)th compressed information comprises base information and coefficient information, or coefficient information; the base information is used to express the ith second data, and the coefficient information comprises an expression coefficient of at least one sub-information in the base information to the ith second data.

14. The method of claim 13, wherein, Further comprising: Receiving or sending first indication information, the first indication information is used to indicate base information corresponding to each compressed information in the n compressed information.

15. The method according to claim 13 or 14, characterized in that, The base information corresponding to each compressed information in the n compressed information comprises sub-information of the base information and / or a size of the base information.

16. The method according to any one of claims 13 to 15, characterized in that, The base information corresponding to the (i+1)th compressed information is obtained based on the ith second data and / or at least one third data, the at least one third data is obtained by data conversion of the ith second data.

17. The method of claim 16, wherein, The conversion mode of the third data comprises at least one of the following: Transposing a matrix of the ith second data; Splitting or merging each data unit of the ith second data; or Adjusting an order of data units in the ith second data.

18. The method of claim 17, wherein, Further comprising: Receiving or sending second indication information, the second indication information is used to indicate a conversion mode of each third data.

19. A communications device, characterized by A module for executing the method of any one of claims 1 to 10, or a module for executing the method of any one of claims 11 to 18.

20. A communications device, characterized by A processor for executing the method of any one of claims 1 to 18 by running a computer program or by a logic circuit. A first communication device for executing the method of any one of claims 1 to 10, and a second communication device for executing the method of any one of claims 11 to 18.

21. A communication system, characterized by A computer program for storing computer program instructions, the computer program instructions causing a computer to execute the method of any one of claims 1 to 18. A computer program for storing computer program instructions, the computer program instructions causing a computer to execute the method of any one of claims 1 to 18.

22. A computer-readable storage medium, characterized in that, A computer program for storing computer program instructions, the computer program instructions causing a computer to execute the method of any one of claims 1 to 18.

23. A computer program product, characterised in that, ​ 24. A chip, characterized by ​ a processor to call and run computer instructions from the memory, causing the device in which the chip is installed to perform the method of any of claims 1 to 18.

25. The chip of claim 24, wherein, Also included is the memory.

Images