Data processing method, data processing device, storage medium and chip system
By introducing reference points and subspaces into the data space and utilizing the differences in data parameters for data compression, the problem of high transmission overhead in wireless communication is solved, and more efficient data transmission is achieved.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-09-06
- Publication Date
- 2026-03-10
AI Technical Summary
Existing data quantization methods result in significant transmission overhead in wireless communication, especially when dealing with 3D bounding box data.
By introducing reference points in the data space, data compression is performed based on these reference points. The data compression is achieved by utilizing the differences in the dimensions of the reference points and the data parameters, dividing the space into subspaces, and recovering the data through indicator information, thereby reducing the quantization range and quantization bits.
It improves data compression rate, reduces data transmission overhead, and enhances communication efficiency.
Smart Images

Figure CN121645349A_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of communications, and more particularly to a data processing method, a data processing device, a storage medium, and a chip system. Background Technology
[0002] With the continuous development of wireless communication technology, its application scenarios are increasing, and different scenarios bring more and more transmission overhead. For example, in next-generation wireless communication, a large amount of data (e.g., 3-dimensional (3D) frame data) may be generated for applications such as autonomous driving.
[0003] Current methods for data quantization, such as fixed quantization for data compression, divide the data range into several intervals based on the maximum and minimum values, with each interval mapped to a quantized value. However, this results in a large quantization range, low data compression efficiency, and significant transmission overhead. Summary of the Invention
[0004] This application provides a data processing method, a data processing apparatus, a storage medium, and a chip system to reduce transmission overhead.
[0005] Firstly, a data processing method is provided, which can be applied to a communication device. The communication device may be, for example, a first device, a component configured in the first device (such as a chip, chip system, processor, etc.), or a logic module or software capable of implementing all or part of the functions of the first device, etc. This application does not limit this. The first device is the sending end in the data compression and transmission process, and the second device mentioned below is the receiving end in the data compression and transmission process.
[0006] For example, the method includes: a first device compressing M first data to be compressed based on a reference point in a data space to obtain first compression information; sending the first compression information and first indication information, the first indication information being used to indicate: the positional relationship between the reference point and each first data in the data space and the reference point, or the positional relationship between each first data in the data space and the reference point.
[0007] Based on the above scheme, by compressing some or all parameters of each of the M first data points based on reference points in the data space, the data compression rate is improved and the data transmission overhead is reduced. Furthermore, when quantizing the M first data points, the quantization range of some or all parameters in the M data points can be reduced, correspondingly reducing the number of quantization bits for some or all parameters, thereby reducing data transmission overhead and improving communication efficiency.
[0008] In conjunction with the first aspect, in some possible implementations of the first aspect, the first dimension of the reference point corresponds to the first parameter in the first data, and the compression information of the first parameter in each piece of first data is determined based on the difference between the value of the first dimension of the reference point and the value of the first parameter.
[0009] One dimension of the reference point corresponds to one parameter of the first data. Thus, the first device can compress the data based on at least one dimension of the reference point for each parameter corresponding to the first data, thereby improving the data compression rate and reducing data transmission overhead.
[0010] In conjunction with the first aspect, in some possible implementations of the first aspect, the reference point is the center point of the first space in which the M first data are collected; or, the reference point is determined based on the first parameters of the M first data.
[0011] In conjunction with the first aspect, in some possible implementations of the first aspect, the dimension of the reference point is less than or equal to the number of parameters of the first data.
[0012] The smaller the dimension of the reference point, the lower the computational complexity of the first and second devices. This improves data compression and reduces data transmission overhead. Furthermore, when quantizing the M first data points, the quantization range of some or all parameters of the first data can be reduced, correspondingly reducing the number of quantization bits for some or all parameters, thereby reducing data transmission overhead and improving communication efficiency.
[0013] In conjunction with the first aspect, in some possible implementations of the first aspect, the data space includes multiple subspaces, which are determined based on the reference point; the first indication information includes indication information corresponding to each of the M first data, each indication information being used to indicate the subspace to which the corresponding first data belongs; or, the first indication information includes indication information corresponding to each of the multiple subspaces, each indication information being used to indicate the first data included in the corresponding subspace; or, the first indication information includes the number of first data in each subspace.
[0014] Each subspace includes different first data, meaning there is a correspondence between each first data and each subspace. The first device can compress the first parameter in each of the M first data based on the correspondence between each first data and its corresponding subspace, thereby improving the data compression rate and reducing data transmission overhead. The second device can reconstruct the M first data based on the correspondence between the M first data and multiple subspaces.
[0015] In conjunction with the first aspect, in some possible implementations of the first aspect, the method further includes: sending or receiving first configuration information, the first configuration information being used to indicate any one or more of the following: the dimension of the reference point; the reference point being the center point of a first space or the reference point being determined based on first parameters of M first data; and the indication form of the first indication information when the data space includes multiple subspaces.
[0016] It is understood that the multiple parameters indicated by the first configuration information may be predefined by the protocol, or preconfigured by the first device or the second device, or some parameters may be preconfigured by the first device and others by the second device, etc. This application does not limit this.
[0017] The aforementioned parameters help the first device compress the first parameter among the M first data points, improving the data compression ratio and reducing data transmission overhead. Thus, when quantizing and compressing the M first data points, the quantization range of the first parameter can be reduced, and the quantization bits of the first parameter can be decreased, thereby reducing transmission overhead. This also helps the second device recover, or reconstruct, the M first data points based on the various parameters.
[0018] In conjunction with the first aspect, in some possible implementations of the first aspect, the M first data include the i-th first data and the (i+1)-th first data, and the compression information of the second parameter in the (i+1)-th first data is determined based on the difference between the value of the second parameter in the i-th first data and the value of the second parameter in the (i+1)-th first data; the first indication information is also used to indicate the second parameter.
[0019] The second parameter is one of at least one parameters of the first data. The first device can replace the original data of the second parameter in one of the two adjacent first data based on the difference in the second parameter, and so on. In this way, the data compression ratio can be improved and the data transmission overhead can be reduced. Furthermore, when compressing the M first data, the quantization range of the second parameter in the M first data can be reduced, thereby reducing the number of quantization bits used to quantize the second parameter in the first data, and thus reducing the data overhead.
[0020] In conjunction with the first aspect, in some possible implementations of the first aspect, the value of the second parameter in the i-th first data is less than the value of the second parameter in the (i+1)-th first data.
[0021] The difference between the value of the second parameter in the (i+1)th first data piece and the value of the second parameter in the ith first data piece is used to replace the value of the second parameter in the (i+1)th first data piece. This process is repeated iteratively from back to front according to the order of the M first data pieces, with the value of the first parameter in the first data piece being the smallest and remaining unchanged. This improves the data compression ratio and reduces data transmission overhead. Furthermore, when compressing the M first data pieces, the quantization range of the second parameter in the M first data pieces can be reduced, thereby reducing the number of quantization bits used to quantize the second parameter in the first data pieces, and thus reducing data overhead.
[0022] In conjunction with the first aspect, in some possible implementations of the first aspect, the data space includes multiple subspaces, the i-th first data is the first data in the first subspace with the smallest value of the second parameter, and the (i+1)-th first data is the first data in the second subspace with the smallest value of the second parameter; the first indication information is also used to indicate the order of the multiple subspaces.
[0023] The first device can divide the data space into multiple subspaces based on at least one dimension of the reference point. Each subspace includes different first data, and the first data with the smallest second parameter in each subspace is determined as the first reference data for each subspace. For example, the i-th first data is the first reference data for the first subspace, and the (i+1)-th first data is the first reference data for the second subspace.
[0024] The first device can sort multiple subspaces based on the second parameter in the first reference data in each subspace. For example, the first subspace and the second subspace are two sorted adjacent subspaces. The difference between the second parameter in the first reference data of the first subspace and the second parameter in the first reference data of the second subspace can be used to replace the original data of the second parameter in one of the two first reference data, and so on.
[0025] This improves the data compression rate and reduces data transmission overhead. Furthermore, when compressing the M first data data, the quantization boundary of the second parameter of some of the M first data data can be reduced, thereby reducing the quantization bits of the second parameter and thus reducing data transmission overhead.
[0026] In conjunction with the first aspect, in some possible implementations of the first aspect, each first data includes N parameters; the second parameter is determined based on the priority of the N parameters, or the second parameter is determined based on the data range of the N parameters.
[0027] The first device can, based on the data range of N parameters of the first data, prioritize the dimension corresponding to the parameter with a larger data range, or in other words, a sparser data distribution, as the dimension of the reference point, i.e., the second parameter. The first device can prioritize data compression of the second parameter in the first data, thereby improving the data compression ratio of the second parameter and reducing data transmission overhead. Furthermore, when compressing the M first data, the quantization boundary of the second parameter can be reduced, thereby reducing the quantization bits of the second parameter and further reducing data transmission overhead.
[0028] In conjunction with the first aspect, in some possible implementations of the first aspect, the method further includes: sending or receiving second configuration information, the second configuration information being used to indicate that the second parameter is determined based on the priority of the N parameters, or that the second parameter is determined based on the data range of the N parameters.
[0029] It is understood that the second configuration information may be predefined by the protocol, or it may be pre-configured by the first or second device, etc. This application does not limit it in this regard.
[0030] The second configuration information helps the first device compress the second parameter in the M first data sets. This improves the compression ratio of the second parameter and reduces data transmission overhead. Furthermore, during quantization compression of the M first data sets, the quantization range of the second parameter can be reduced, decreasing the number of quantization bits and thus reducing transmission overhead. It also helps the second device decompress the second parameter of the received first compressed information based on the second configuration information, thereby recovering the M first data sets.
[0031] In conjunction with the first aspect, in some possible implementations of the first aspect, the data compression of M first data to be compressed based on a reference point in the data space to obtain first compression information includes: performing data transformation on the M first data to be compressed based on the reference point to obtain at least one second data, each second data including at least one parameter of the first data; compressing the second data based on the quantization bits of each second data to obtain the first compression information, the quantization bits being determined based on the maximum and minimum values of each parameter among the at least one parameter in the corresponding second data; the first indication information is also used to indicate at least one of the following: at least one parameter corresponding to each second data, the minimum value of each of the at least two parameters included in each second data, the quantization boundary or quantization bits of each second data.
[0032] The first device can compress some or all parameters in each first data point based on a reference point. It can then further divide at least one parameter from each first data point into a group to form second data, meaning each second data point includes at least one parameter from the first data point, thereby obtaining second compressed information. This improves the data compression rate and reduces data transmission overhead. Furthermore, when quantizing and compressing the M first data points, the quantization range of some or all parameters in each first data point is reduced.
[0033] The first device can compress data based on the quantization bits of each second data in the further second compression information to obtain the first compression information, wherein the quantization bits of each second data are different. This can improve the data compression ratio and reduce data transmission overhead. Furthermore, when quantizing and compressing multiple second data, the quantization range of each second data can be reduced, and the quantization bits of at least one parameter included in each second data can be decreased, thereby reducing data transmission overhead.
[0034] In conjunction with the first aspect, in some possible implementations of the first aspect, the second data includes at least two third data, each third data including a third parameter of each of the M first data, and the similarity between the at least two third data is greater than or equal to a preset value.
[0035] If the data ranges of at least two parameters of the first data are similar, the first device can divide the at least two parameters into a group to form the second data, that is, each second data includes at least two parameters of the first data.
[0036] Thus, the first device can align the quantization ranges of at least two parameters included in each second data point based on the minimum value of each parameter included in the second data point, thereby determining the quantization range of each second data point. In other words, different parameters included in each second data point can use a unified quantization range. This reduces the quantization range of each second data point, decreases the number of quantization bits of at least one parameter included in each second data point, and thus reduces data transmission overhead.
[0037] In conjunction with the first aspect, in some possible implementations of the first aspect, the method further includes: sending or receiving third configuration information, the third configuration information being used to indicate one or more of the following: the second data includes a parameter of each of the M first data, or the second data includes at least two third data, each of the third data including a parameter of each of the M first data, the similarity between the at least two third data being greater than or equal to a preset value; and indicating whether to indicate the quantization bits of each second data.
[0038] It is understood that the parameters indicated by the third configuration information may be predefined by the protocol, or preconfigured by the first or second device, or some parameters may be preconfigured by the first device and others by the second device, etc. This application does not limit this.
[0039] The aforementioned parameters help the first device group the first data based on different parameters, and align the quantization range of each group with the quantization range of the different dimensions of data included in each group, meaning that the different dimensions of data included in each group adopt a unified quantization range. Thus, when quantizing and compressing the first data, the quantization range of the M pieces of first data in different groups can be reduced, decreasing the quantization bits and thereby reducing transmission overhead. It also helps the second device decompress the compressed data of the M pieces of first data based on the aforementioned parameters, thereby reconstructing the M pieces of first data.
[0040] Secondly, a data processing method is provided, which can be applied to a communication device. The communication device may be, for example, a second device, a component configured in the second device (such as a chip, chip system, processor, etc.), or a logic module or software capable of implementing all or part of the functions of the second device, etc. This application does not limit this aspect.
[0041] For example, the method includes: receiving first compression information and first indication information, the first indication information being used to indicate the positional relationship between a reference point in the data space and each of the M first data to be compressed and the reference point in the data space, or the positional relationship between each of the first data and the reference point in the data space, the first compression information being obtained by compressing the M first data to be compressed based on the reference point; and recovering the M first data based on the first compression information and the first indication information.
[0042] Based on the above scheme, by compressing some or all parameters of each of the M first data points based on reference points in the data space, the data compression rate is improved and the data transmission overhead is reduced. Furthermore, when quantizing the M first data points, the quantization range of some or all parameters in the M data points can be reduced, correspondingly reducing the number of quantization bits, thereby reducing data transmission overhead and improving communication efficiency. The second device can recover the M first data points based on the received first compression information and first indication information.
[0043] In conjunction with the second aspect, in some possible implementations of the second aspect, the first dimension of the reference point corresponds to the first parameter in the first data, and the compression information of the first parameter in each piece of first data is determined based on the difference between the value of the first dimension of the reference point and the value of the first parameter.
[0044] In conjunction with the second aspect, in some possible implementations of the second aspect, the reference point is the center point of the first space, in which the M first data are collected; or, the reference point is determined based on the first parameters of the M first data.
[0045] In conjunction with the second aspect, in some possible implementations of the second aspect, the dimension of the reference point is less than or equal to the number of parameters of the first data.
[0046] In conjunction with the second aspect, in some possible implementations of the second aspect, the data space includes multiple subspaces, which are determined based on the reference point; the first indication information includes indication information corresponding to each of the M first data, each indication information being used to indicate the subspace to which the corresponding first data belongs; or, the first indication information includes indication information corresponding to each of the multiple subspaces, each indication information being used to indicate the first data included in the corresponding subspace; or, the first indication information includes the number of first data in each subspace.
[0047] In conjunction with the second aspect, in some possible implementations of the second aspect, the method further includes: sending or receiving first configuration information, the first configuration information being used to indicate any one or more of the following: the dimension of the reference point; the reference point being the center point of a first space or the reference point being determined based on first parameters of M first data; and the indication form of the first indication information when the data space includes multiple subspaces.
[0048] In conjunction with the second aspect, in some possible implementations of the second aspect, the M first data include the i-th first data and the (i+1)-th first data, and the compression information of the second parameter in the (i+1)-th first data is determined based on the difference between the value of the second parameter in the i-th first data and the value of the second parameter in the (i+1)-th first data; the first indication information is also used to indicate the second parameter.
[0049] In conjunction with the second aspect, in some possible implementations of the second aspect, the value of the second parameter in the i-th first data is less than the value of the second parameter in the (i+1)-th first data.
[0050] In conjunction with the second aspect, in some possible implementations of the second aspect, the data space includes multiple subspaces, the i-th first data is the first data in the first subspace with the smallest value of the second parameter, and the (i+1)-th first data is the first data in the second subspace with the smallest value of the second parameter; the first indication information is also used to indicate the order of the multiple subspaces.
[0051] In conjunction with the second aspect, in some possible implementations of the second aspect, each first data includes N parameters; the second parameter is determined based on the priority of the N parameters, or the second parameter is determined based on the data range of the N parameters.
[0052] In conjunction with the second aspect, in some possible implementations of the second aspect, the method further includes: sending or receiving second configuration information, the second configuration information being used to indicate that the second parameter is determined based on the priority of the N parameters, or that the first parameter is determined based on the data range of the N parameters.
[0053] In conjunction with the second aspect, in some possible implementations of the second aspect, recovering the M first data based on the first compression information and the first indication information includes: recovering at least one second data based on the first compression information and the quantization bits of each second data, each second data including at least one parameter of the first data, the quantization bits being determined based on the maximum and minimum values of each parameter in the corresponding second data; recovering the M first data based on the at least one second data and a reference point; the first indication information is further used to indicate at least one of the following: at least one parameter corresponding to each second data, the minimum value of each of the at least two parameters included in each second data, the quantization boundary or quantization bits of each second data.
[0054] In conjunction with the second aspect, in some possible implementations of the second aspect, the second data includes at least two third data, each third data including a parameter of each of the M first data, and the similarity between the at least two third data is greater than or equal to a preset value.
[0055] In conjunction with the second aspect, in some possible implementations of the second aspect, the method further includes: sending or receiving third configuration information, the third configuration information being used to indicate one or more of the following: the second data includes a parameter of each of the M first data, or the second data includes at least two third data, each third data including a third parameter of each of the M first data, the similarity between the at least two third data being greater than or equal to a preset value; and indicating whether to indicate the quantization bits of each second data.
[0056] For details regarding the same content in the second aspect as in the first aspect, please refer to the detailed explanation in the first aspect; further elaboration will not be repeated here.
[0057] Thirdly, a data processing method is provided, which can be applied to a communication device. The communication device may be, for example, a first device, a component configured in the first device (such as a chip, chip system, processor, etc.), or a logic module or software capable of implementing all or part of the functions of the first device, etc. This application does not limit this aspect.
[0058] For example, the method includes: compressing M first data to obtain second compression information, wherein the M first data includes an i-th first data and an (i+1)-th first data, and the compression information of a second parameter in the (i+1)-th first data is determined based on the difference between the value of the second parameter in the i-th first data and the value of the second parameter in the (i+1)-th first data; and sending the second compression information and a second indication information, wherein the second indication information is used to indicate the second parameter.
[0059] Based on the above scheme, the first device determines the second parameter from the N parameters of the first data. Based on the difference between the second parameters of two adjacent first data items in the sequence of M first data items, the second parameter in one of the first data items is compressed, thereby improving the data compression rate and reducing data transmission overhead. Furthermore, when quantizing the M first data items, the quantization range of the second parameter in the M first data items can be reduced, allowing for a decrease in the number of quantization bits during quantization, thus reducing data transmission overhead.
[0060] Fourthly, a data processing method is provided, which can be applied to a communication device. The communication device may be, for example, a second device, a component configured in the second device (such as a chip, chip system, processor, etc.), or a logic module or software capable of implementing all or part of the functions of the second device, etc. This application does not limit this aspect.
[0061] For example, the method includes: receiving second compression information and second indication information, the second indication information being used to indicate a second parameter, M first data including an i-th first data and an (i+1)-th first data, the compression information of the second parameter in the (i+1)-th first data being determined based on the difference between the value of the second parameter in the i-th first data and the value of the second parameter in the (i+1)-th first data, the second compression information being obtained by compressing the M first data; and recovering the M first data based on the second compression information and the second indication information.
[0062] Based on the above scheme, by determining the second parameter from the N parameters of the first data, and compressing the second parameter in one of the first data based on the difference between the second parameters of two adjacent first data in the order of M first data, the data compression rate can be improved and the data transmission overhead reduced. Furthermore, when quantizing the M first data, the quantization range of the second parameter in the M first data can be reduced, which correspondingly reduces the number of quantization bits, thereby reducing the data transmission overhead.
[0063] In conjunction with the third or fourth aspect, in some possible implementations of the third or fourth aspect, the value of the second parameter in the i-th first data is less than the value of the second parameter in the (i+1)-th first data.
[0064] In conjunction with the third or fourth aspect, in some possible implementations of the third or fourth aspect, the data space includes multiple subspaces, the i-th first data is the first data with the smallest value of the second parameter in the first subspace, the (i+1)-th first data is the first data with the smallest value of the second parameter in the second subspace; the second indication information is also used to indicate the order of the multiple subspaces.
[0065] In conjunction with the third or fourth aspect, in some possible implementations of the third or fourth aspect, each first data includes N parameters; the second parameter is determined based on the priority of the N parameters, or the second parameter is determined based on the data range of the N parameters.
[0066] In conjunction with the third or fourth aspect, in some possible implementations of the third or fourth aspect, the method further includes: sending or receiving second configuration information, the second configuration information being used to indicate that the second parameter is determined based on the priority of the N parameters, or that the second parameter is determined based on the data range of the N parameters.
[0067] For details regarding the content in the third or fourth aspect that is the same as in the first aspect, please refer to the detailed explanation in the first aspect; it will not be repeated here.
[0068] Fifthly, a data processing method is provided, which can be applied to a communication device. The communication device may be, for example, a first device, a component configured in the first device (such as a chip, chip system, processor, etc.), or a logic module or software capable of implementing all or part of the functions of the first device, etc. This application does not limit the scope of the application.
[0069] For example, the method includes: compressing the second data based on the quantization bits of each second data to obtain third compression information, the second data including at least one parameter of each of M first data, the quantization bits of the second data being determined based on the maximum and minimum values of the at least one parameter included in the second data; sending the third compression information and third indication information, the third indication information being used to indicate at least one of the following: at least one parameter corresponding to each second data, the minimum value of each of the at least two parameters included in each second data, the quantization boundary and / or quantization bits of each second data.
[0070] Based on the above scheme, by dividing the parameters of the first data into different second data, each second data including at least one parameter of the first data, and compressing the second data based on the quantization bits of the at least one parameter included in each second data group, the quantization range of the M first data can be further reduced. Furthermore, by determining the quantization bits of each second data based on its quantization range, the number of quantization bits can be further reduced, thereby reducing data transmission overhead.
[0071] Sixthly, a data processing method is provided, which can be applied to a communication device. The communication device may be, for example, a second device, a component configured in the second device (such as a chip, chip system, processor, etc.), or a logic module or software capable of implementing all or part of the functions of the second device, etc. This application does not limit this aspect.
[0072] For example, the method includes: receiving third compression information and third indication information, the third indication information indicating at least one of the following: at least one parameter corresponding to each second data, the minimum value of each parameter among at least two parameters included in each second data, the quantization boundary and / or quantization bits of each second data, the second data including at least one parameter of each of M first data, the quantization bits of the second data being determined based on the maximum and minimum values of each parameter among at least one parameter included in the second data, the third compression information being obtained by compressing the second data based on the quantization bits of each second data; and recovering the M first data based on the third compression information and the third indication information.
[0073] Based on the above scheme, by dividing the parameters of the first data into different second data, each second data including at least one parameter of the first data, and compressing the second data based on the quantization bits of the at least one parameter included in each second data group, the second device can recover the M first data based on the received third compression information and third indication information. In this way, the quantization range of the M first data can be further reduced, and by determining the quantization bits of each second data based on the quantization range of each second data, the quantization bits can be further reduced, thereby reducing data transmission overhead.
[0074] In conjunction with the fifth or sixth aspect, in some possible implementations of the fifth or sixth aspect, the second data includes at least two third data, each third data including a parameter of each of the M first data, and the similarity between the at least two third data is greater than or equal to a preset value.
[0075] In conjunction with the fifth or sixth aspect, in some possible implementations of the fifth or sixth aspect, the method further includes: sending or receiving third configuration information for indicating one or more of the following: the second data includes a parameter of each of the M first data, or the second data includes at least two third data, each third data including a third parameter of each of the M first data, the similarity between the at least two third data being greater than or equal to a preset value; and indicating whether to indicate the quantization bits of each second data.
[0076] For details regarding the content in the fifth or sixth aspect that is the same as in the first aspect, please refer to the detailed explanation in the first aspect; it will not be repeated here.
[0077] In a seventh aspect, this application provides a communication device, including modules or units for implementing the methods of the first, third, or fifth aspects and any possible implementation of the first, third, or fifth aspects. Specifically, the modules, units, or means can be implemented in software, in hardware, or in a combination of software and hardware.
[0078] Eighthly, this application provides a communication device including one or more processors for executing a computer program (also referred to as code or instructions) in a memory, such that the communication device implements the communication methods of the first, third, or fifth aspects and any possible implementation of the first, third, or fifth aspects.
[0079] Optionally, the device further includes a memory for storing computer programs and data. The memory is coupled to the processor, which, when executing the computer program stored in the memory, can implement the methods described in the first, third, or fifth aspects above.
[0080] Optionally, the device further includes a communication interface for communicating with other devices. For example, the communication interface may be a transceiver, circuit, bus, module, or other type of communication interface.
[0081] For example, the apparatus in the seventh or eighth aspect is a first device, or a component of the first device, such as a chip, a chip system, a processor, etc.
[0082] Ninthly, this application provides a chip system including at least one processor for supporting the implementation of the functions involved in the first, third, or fifth aspects and any possible implementation of the first, third, or fifth aspects, such as processing information involved in the above methods.
[0083] In one possible design, the chip system also includes a memory for storing computer programs and data, which may be located inside or outside the processor.
[0084] The chip system can consist of chips or include chips and other discrete components.
[0085] In one possible design, the chip system also includes a power supply circuit for supplying power to the chip system.
[0086] In a tenth aspect, this application provides a communication device, including modules or units for implementing the methods of the second, fourth, or sixth aspects and any possible implementation of the second, fourth, or sixth aspects. Specifically, the modules, units, or means may be implemented in software, in hardware, or in a combination of software and hardware.
[0087] In one aspect, this application provides a communication device including one or more processors, the one or more processors being configured to execute a computer program (also referred to as code or instructions) in a memory, such that the communication device implements the communication methods of the second aspect, the fourth aspect, or the sixth aspect, and any possible implementation of the second aspect, the fourth aspect, or the sixth aspect.
[0088] Optionally, the apparatus further includes a memory for storing computer programs and data. The memory is coupled to the processor, which, when executing the computer program stored in the memory, can implement the methods described in the second, fourth, or sixth aspects above.
[0089] Optionally, the device further includes a communication interface for communicating with other devices. For example, the communication interface may be a transceiver, circuit, bus, module, or other type of communication interface.
[0090] For example, the apparatus in the seventh or eighth aspect is a second device, or a component of a second device, such as a chip, a chip system, a processor, etc.
[0091] In a twelfth aspect, this application provides a chip system including at least one processor for supporting the implementation of the functions involved in the second, fourth, or sixth aspects and any possible implementation of the second, fourth, or sixth aspects, such as processing information involved in the above methods.
[0092] In one possible design, the chip system also includes a memory for storing computer programs and data, which may be located inside or outside the processor.
[0093] The chip system can consist of chips or include chips and other discrete components.
[0094] In one possible design, the chip system also includes a power supply circuit for supplying power to the chip system.
[0095] In a thirteenth aspect, this application provides a computer-readable storage medium including a computer program that, when run on a computer, causes the computer to implement the methods of the first to sixth aspects and any possible implementation of the first to sixth aspects.
[0096] In a fourteenth aspect, this application provides a computer program product comprising: a computer program that, when run, causes a computer to perform the methods of the first to sixth aspects and any possible implementation thereof.
[0097] In a fifteenth aspect, embodiments of this application provide a system including the aforementioned first device and second device.
[0098] The seventh to fifteenth aspects of this application correspond to the technical solutions of the first to sixth aspects of this application. The beneficial effects achieved by each aspect and the corresponding feasible implementation are similar, and will not be repeated here. Attached Figure Description
[0099] Figure 1 This is a schematic diagram of 3D frame data represented by cylinders and cones according to an embodiment of this application;
[0100] Figure 2This is a schematic diagram of the architecture applicable to the communication system provided in this application;
[0101] Figure 3 This is a schematic flowchart of the data processing method provided in the embodiments of this application;
[0102] Figure 4 This is a schematic diagram illustrating the division of a data space into multiple subspaces based on a reference point, provided in an embodiment of this application.
[0103] Figure 5 This is a schematic diagram illustrating different arrangements of the first data provided in the embodiments of this application;
[0104] Figure 6 This is a schematic diagram illustrating the three sequences provided in the embodiments of this application;
[0105] Figure 7 This is a schematic diagram illustrating the grouping of first data based on the data range of parameters according to an embodiment of this application;
[0106] Figure 8 This is a schematic diagram illustrating the acquisition of data range based on the maximum and minimum values of parameters provided in an embodiment of this application;
[0107] Figure 9 This is a schematic diagram of the partitioning module provided in an embodiment of this application;
[0108] Figure 10 This is a schematic diagram of the sorting module provided in an embodiment of this application;
[0109] Figure 11 This is a schematic diagram of the dynamic quantization module provided in an embodiment of this application;
[0110] Figure 12 This is a schematic diagram illustrating the data processing using different combinations of modules provided in the embodiments of this application;
[0111] Figure 13 This is another illustrative flowchart of the data processing method provided in the embodiments of this application;
[0112] Figure 14 This is another illustrative flowchart of the data processing method provided in the embodiments of this application;
[0113] Figure 15 This is a simulation diagram illustrating the quantization of the first data based on different quantization methods proposed in the embodiments of this application;
[0114] Figure 16 This is a schematic diagram of the device provided in the embodiments of this application;
[0115] Figure 17 This is another schematic block diagram of the device provided in the embodiments of this application;
[0116] Figure 18 This is a schematic diagram of the structure of the terminal device provided in the embodiments of this application;
[0117] Figure 19 This is a schematic diagram of the network device provided in the embodiments of this application. Detailed Implementation
[0118] The technical solution provided in this application will now be described in conjunction with the accompanying drawings.
[0119] To facilitate understanding of the embodiments of this application, the following points are explained first:
[0120] First, to facilitate a clear description of the technical solutions in the embodiments of this application, the terms "first" and "second" are used in the embodiments of this application to distinguish identical or similar items with essentially the same function and effect. For example, the first instruction information and the second instruction information are only used to distinguish the specific content of the instruction, and do not limit their order or the number of signaling. Those skilled in the art will understand that the terms "first" and "second" do not limit the quantity or execution order, and the terms "first" and "second" are not necessarily different.
[0121] Second, in the embodiments of this application, "sending" and "receiving" indicate the direction of signal transmission. Communication between different devices can refer to direct communication between different devices (i.e., without the need for relaying or forwarding by other devices), or communication between different devices through other devices (i.e., requiring relaying or forwarding by other devices), or communication between a functional unit within a device and another functional unit. That is to say, "sending information to the second device" in this application can be understood as the destination of the information being the second device, and can include sending information directly or indirectly to the second device. "Receiving information from... (the first device)" can be understood as the source of the information being the first device, and "receiving information from the first device" can be understood as the source of the information being the first device, and can include receiving information directly or indirectly from the first device. Information may undergo necessary processing between the source and destination of information transmission, such as format changes, digital-to-analog conversion, etc., but the destination can understand the valid information from the source. Similar expressions in this application can be understood in a similar way, and will not be repeated here.
[0122] Third, in the embodiments of this application, "at least one" refers to one or more, and "more than one" refers to two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, or B alone, where A and B can be singular or plural. The character " / " generally indicates that the preceding and following related objects are in an "or" relationship. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, or c can represent: a; b; c; a and b; a and c; b and c; or a and b and c. Here, a, b, and c can be single or multiple.
[0123] Fourth, in the embodiments of this application, "when," "if," and "if" all refer to the device making corresponding processing under certain objective circumstances, and are not limited to a time, nor do they require the device to make a judgment action when it is implemented, nor do they mean that there are other limitations.
[0124] Fifth, the correspondences shown in the tables of this application are merely examples and should not be construed as limiting the scope of this application. The content in each table is only illustrative and can be configured with other content; this application does not limit this. When configuring these correspondences, it is not necessarily required to configure all the correspondences shown in each table. For example, the correspondences shown in some rows may not be configured. For another example, some columns may be replaced with other forms. Furthermore, appropriate modifications and adjustments can be made to the tables shown herein, such as splitting, merging, etc.
[0125] In addition, tables are only one possible form of correspondence. In specific implementations, other data structures can also be used, such as arrays, queues, containers, stacks, linear lists, pointers, linked lists, trees, graphs, structures, classes, heaps, hash tables, or hash tables.
[0126] Sixth, in this application, the indication includes explicit indication (also known as direct indication) and implicit indication (also known as indirect indication). Explicit indication information A means including information A; implicit indication information A means indicating information A through the correspondence between information A and information B, and direct indication information B. The correspondence between information A and information B can be predefined, pre-stored, pre-burned, or pre-configured; or it can refer to indicating information A through information B and preset rules.
[0127] To better understand the methods provided in the embodiments of this application, the terms involved in this application will be briefly explained below.
[0128] 3D bounding box data: Dimensions are M×N, where M represents the number of 3D bounding boxes and N represents the dimension or parameters of each 3D bounding box. 3D bounding box data can be represented in different formats.
[0129] Format 1: Representing 3D bounding box data based on a center point and its range. Each 3D bounding box can be represented as: That is, each 3D bounding box has nine parameters. Among them, x, y, and z represent the coordinates of the center position o of the 3D bounding box; l, w, and h represent the length, width, and height of the 3D bounding box, or they can also represent half of the length, width, and height of the 3D bounding box; α, θ, ... These represent the roll angle, pitch angle, and yaw angle of the 3D frame data, respectively.
[0130] Understandably, when the roll and pitch angles are set to default (i.e., pre-configured or pre-defined), the 3D frame data can also be represented as... That is, each 3D bounding box data is seven-dimensional data, or has seven parameters. Alternatively, the 3D bounding box data can also be data with more or fewer dimensions, which is not limited in this application.
[0131] Form 2: 3D bounding box data is represented by multiple vertices. Each 3D bounding box can be represented as: {x1, y1, z1, x2, y2, z2, x3, y3, z3}, which means the coordinates of the three vertices v1, v2, and v3 of the 3D bounding box.
[0132] Form 3: Representing 3D frame data based on cylindrical frames, conical frames, etc. Figure 1 This is a schematic diagram of 3D frame data represented by cylinders and cones according to an embodiment of this application.
[0133] in, Figure 1 (a) in the example represents 3D bounding box data in the form of a cube. The 3D bounding box data can be represented based on the coordinates of the cube's center point o, the cube's length 2l (or l), width 2w (or w), height 2h (or h), the coordinates of the cube's three vertices v1, v2, v3, and the pitch angle θ of the 3D bounding box data.
[0134] Figure 1 (b) in the example represents 3D bounding box data in the form of a cylinder. The 3D bounding box data can be represented based on the coordinates of the center point o of the cylinder, the radius r (or diameter 2r) of the cylinder, and the height 2l (or l) of the cylinder.
[0135] By acquiring a large amount of point cloud data through perception, processing the point cloud data, and extracting 3D bounding boxes, 3D bounding box data can be obtained; alternatively, 3D bounding box data can be obtained through existing artificial intelligence (AI) algorithms, etc. This application does not limit the scope of the application.
[0136] The technical solutions provided in this application can be applied to various communication systems, such as: Long Term Evolution (LTE) systems, LTE Frequency Division Duplex (FDD) systems, LTE Time Division Duplex (TDD) systems, sidelink (SL) communication systems, Universal Mobile Telecommunication System (UMTS), Worldwide Interoperability for Microwave Access (WiMAX) communication systems, 5th Generation (5G) mobile communication systems, or new radio access technology (NR). Among these, 5G mobile communication systems can include non-standalone (NSA) and / or standalone (SA) networking. The technical solutions provided in this application can also be applied to future communication systems, such as 6th Generation (6G) mobile communication systems. This application does not limit these applications.
[0137] The network system architecture provided in this application mainly includes: terminal equipment and radio access network (RAN) equipment.
[0138] Terminal equipment can be any device or module that accesses the aforementioned communication system and possesses corresponding communication functions. Terminal equipment can also be referred to as user equipment (UE), terminal, user device, access terminal, user unit, user station, mobile station, mobile station (MS), remote station, remote terminal, mobile device, user terminal, terminal unit, terminal station, terminal device, wireless communication equipment, user agent, or user device. Terminals typically contain communication modules, circuits, or chips that perform the corresponding communication functions. They may also be configured with program instructions for performing these functions.
[0139] For example, the terminal in this application embodiment can be a mobile phone, a personal digital assistant (PDA) computer, a laptop computer, a tablet computer, a drone, a computer with wireless transceiver capabilities, a machine type communication (MTC) terminal, a virtual reality (VR) terminal, an augmented reality (AR) terminal, an Internet of Things (IoT) terminal, a wireless terminal in industrial control, a wireless terminal in self-driving, a wireless terminal in remote medical care, a wireless terminal in a smart grid, a wireless terminal in transportation safety, a wireless terminal in a smart city, a wireless terminal in a smart home (e.g., game consoles, smart TVs, smart speakers, smart refrigerators, and fitness equipment), a transport vehicle with wireless communication capabilities, a communication module, or a roadside unit (RSU) with terminal capabilities.
[0140] Radio access network (RAN) equipment, also known as RAN nodes, access network devices, or network equipment, is a component of a communication system. It consists of devices or modules that enable wireless access for terminals and possess corresponding communication functions. RAN equipment typically includes communication modules, circuits, or chips that perform these functions. It can also be configured with program instructions and corresponding program commands for executing these communication functions.
[0141] In one possible scenario, a RAN node can be a base station, an evolved NodeB (eNodeB), an access point (AP), a transmission reception point (TRP), a next-generation NodeB (gNB), a next-generation base station in a 6G mobile communication system, a base station in a future mobile communication system, or an access node in a wireless fidelity (Wi-Fi) system. A RAN node can be a macro base station, a relay node, a donor node, or a radio controller in a CRAN scenario. Optionally, a RAN node can also be a server, wearable device, vehicle, or in-vehicle equipment. For example, the access network equipment in vehicle-to-everything (V2X) technology can be a roadside unit (RSU).
[0142] In another possible scenario, multiple RAN nodes collaborate to assist the terminal in achieving wireless access, with different RAN nodes each implementing a portion of the base station's functions. For example, RAN nodes can be central units (CUs), distributed units (DUs), CU-control plane (CPs), CU-user plane (UPs), or radio units (RUs), etc. CUs and DUs can be set up separately or included in the same network element, such as a baseband unit (BBU). RUs can be included in radio frequency equipment or radio frequency units, such as remote radio units (RRUs), active antenna units (AAUs), or remote radio heads (RRHs).
[0143] In different systems, CU (or CU-CP and CU-UP), DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an ORAN system, CU can also be called O-CU (open CU), DU can also be called O-DU, CU-CP can also be called O-CU-CP, CU-UP can also be called O-CU-UP, and RU can also be called O-RU. For ease of description, this application uses CU, CU-CP, CU-UP, DU, and RU as examples. Any of the units among CU (or CU-CP, CU-UP), DU, and RU in this application can be implemented through software modules, hardware modules, or a combination of software and hardware modules.
[0144] In the embodiments of this application, the terminal and the wireless access network device can be hardware devices, or software functions running on dedicated hardware. Software functions running on general-purpose hardware, for example, are virtualization functions instantiated on a platform (e.g., a cloud platform), or are entities that include dedicated or general-purpose hardware devices and software functions. This application does not limit the specific form of the terminal and the wireless access network device.
[0145] Figure 2 This is a schematic diagram of the architecture applicable to the communication system provided in this application. In scenarios where the first device and the second device interact, a large amount of 3D bounding box data may be generated. This 3D bounding box data can be applied to scenarios such as autonomous driving. The first device can be, for example, a terminal, and the second device can be, for example, a base station. In this case, the first device can compress the 3D bounding box data to obtain compressed information, and then transmit the compressed information to the second device. Correspondingly, the second device can also compress the 3D bounding box data to obtain compressed information, and then transmit the compressed information to the first device, thereby reducing transmission overhead.
[0146] It is understood that the interaction of 3D frame data between the aforementioned terminal device and the base station could also be, for example, interaction between terminal devices based on 3D frame data, or interaction between base stations based on 3D frame data, and so on. The scenarios exemplified above are merely examples and should not be construed as limiting the scope of this application.
[0147] Currently, the first device can quantize M N-dimensional 3D bounding box data points based on a fixed quantization method. That is, the N parameters of the 3D bounding box data are used to construct a two-dimensional matrix, which is an N×M matrix, where M represents the number of 3D bounding box data points. The quantization interval of the 3D bounding box data is determined based on the maximum and minimum values in this matrix. Furthermore, the first device can divide this quantization interval into several intervals, each interval corresponding to a discrete value, mapping the value of each dimension to the corresponding discrete value.
[0148] However, when quantizing and compressing 3D bounding box data using a fixed quantization method, the data compression efficiency is low due to the large quantization range, resulting in significant transmission overhead.
[0149] For ease of understanding and explanation, the first data is used as an example to illustrate the 3D frame data in the embodiments of this application, and should not be construed as limiting this application in any way. The first data can be 3D frame data, or other data that is the same as or similar to 3D frame data. For example, the first data can be acquired by the first device based on perception, or it can be acquired based on AI algorithms, etc., and this application does not limit it in this regard.
[0150] In view of this, this application provides a method to improve the data compression ratio and reduce data transmission overhead by compressing some or all parameters of each of M first data based on reference points in the data space. Furthermore, when quantizing the M first data, the quantization range of some or all parameters in each of the M first data can be reduced. This reduces the number of quantization bits, thereby reducing data transmission overhead.
[0151] The methods provided in the embodiments of this application will now be described in detail with reference to several accompanying drawings.
[0152] Figure 3 This is a schematic flowchart of the data processing method provided in the embodiments of this application. Figure 3 The method provided in this application is described using the interaction between a first device and a second device as an example, but this should not be construed as limiting the application in any way. The first device can also be replaced by a component configured in the first device, such as a chip, chip system, processor, etc., or a logic module or software that can be used to implement some or all of the functions of the first device; the second device can also be replaced by a component configured in the second device, such as a chip, chip system, processor, etc., or a logic module or software that can be used to implement some or all of the functions of the second device.
[0153] Furthermore, the first device and the second device are distinguished and named according to the sending and receiving of data, which does not mean that the first device cannot be used for receiving, nor does it limit the second device to be used for sending.
[0154] In this context, the first device can be a network device and the second device can be a terminal device; or, the first device can be a terminal device and the second device can be a network device; or, the first device can be a terminal device and the second device can be a terminal device, etc., without limitation.
[0155] Figure 3The data processing method 300 shown may include steps 310 to 330. The various steps in method 300 are described in detail below.
[0156] In step 310, the first device compresses the M first data to be compressed based on reference points in the data space to obtain first compression information.
[0157] This data space can be measured based on multiple parameters, or in other words, it can be composed of multiple parameters, and it can cover the M first data points to be compressed. The number of parameters measuring this data space can be greater than or equal to the number of parameters for the M first data points to be compressed.
[0158] The M first data points to be compressed may each include at least one parameter. A parameter of a first data point can also be understood as the data of that first data point in a certain field. That is, each first data point includes at least one field, and each field represents one of the parameters of the first data point. The data in each field belongs to the same parameter, that is, each field includes the value of the same parameter. For example, the first data point may include N parameters, and these N parameters belong to N fields of the first data point, where N is a positive integer.
[0159] The M first data points to be compressed can be, for example, the M 3D bounding box data points as described above, and the N parameters of each first data point can be the N parameters of the 3D bounding box data points. For example, the first data points include 9 parameters, namely parameter x, parameter y, parameter z, parameter l, parameter w, parameter h, parameter α, parameter θ, and parameter φ.
[0160] The reference point includes at least one dimension, each dimension corresponding to a parameter of the first data. In other words, one dimension of the reference point corresponds to one parameter of the first data. For example, the x-dimensional of the reference point corresponds to the parameter x in the first data.
[0161] In the data space, the reference point can be understood as a one-dimensional or multi-dimensional vector, where each dimension corresponds to a parameter of the first data, or each dimension corresponds to a field of the first data.
[0162] The dimension of the reference point can be less than or equal to the number of parameters in the first data; that is, the dimension of the reference point is some or all of the number of parameters in the first data. For example, if the first data has N parameters, the dimension of the reference point is n, where n is less than or equal to N, i.e., n ≤ N. The smaller n is, the fewer the dimensions of the reference point, and the lower the computational complexity of the first device. The first device can determine at least one dimension of the reference point based on at least one parameter included in the first data.
[0163] For example, the first device can determine n parameters from the N parameters based on the sparsity or density of the data distribution of the N parameters of the M first data. The dimensions corresponding to the n parameters can be used as the dimensions of the reference point, that is, the dimensions of the reference point are the n dimensions. Among them, the data range of the sparsely distributed parameters is larger, and the data range of the densely distributed parameters is smaller. Therefore, compared with the densely distributed parameters, the first device can preferentially determine the dimensions corresponding to the sparsely distributed parameters as the dimensions of the reference point.
[0164] For example, N=9, n=2, meaning the first data includes 9 parameters. The reference point has a dimension of 2. Assume that the data distribution of parameters x and y in the first dataset is relatively sparse compared to the data distribution of other parameters. Therefore, the first device can determine the x-dimension corresponding to parameter x and the y-dimension corresponding to parameter y as the dimensions of the reference point.
[0165] One possible design is that the reference point is the center point of the first space, and the M first data are collected in the first space.
[0166] The first space can cover the M first data points, or the first device can collect the M first data points by sensing the first space. For example, the reference point can be the x- and y-dimensional values of the center point of the first space.
[0167] One possible design is that the reference point is determined based on the first parameters of M first data.
[0168] The first parameter of the first data is n of the N parameters of the first data, meaning that the reference point can be determined based on these n parameters of the M first data.
[0169] For example, the two dimensions of the reference point are x-dimensional and y-dimensional, that is, the reference point is p(p x p y ), where the parameter x of the i-th first data in the M first data is o. xi The parameter y is o yi , i≤M.
[0170] As an example, the average of the maximum and minimum values of the n parameters for each of the M first data points, which is also the midpoint value of the data range corresponding to each parameter, is the value of the reference point in the n dimensions corresponding to those n parameters. For example, the midpoint of parameter x, which is the center point of the M first data points, is p. x The midpoint of parameter y, which is the center point of the M first data points, is p. y That is, p x =[max(o x1 +ox2 +...+o xM )+min(o x1 +o x2 +...+o xM )] / 2, p y =[max(o y1 +o y2 +...+o yM )+min(o y1 +o y2 +...+o yM )] / 2.
[0171] In another example, the average of the n parameters of each of the M first data points is the value of the reference point in the n dimensions corresponding to those n parameters. For example, the average of parameter x of the M first data points is p. x The average value of the parameter y of the M first data points is p. y That is, p x =1 / M×(o x1 +o x2 +...+o xM ), p y =1 / M×(o y1 +o y2 +...+o yM ).
[0172] Another example: the median of each of the M first data points across the n dimensions is the value of the reference point across the n dimensions. For instance, the median of parameter x among the M first data points is the value of the reference point in the x-dimension, and the median of parameter y among the M first data points is the value of the reference point in the y-dimension. That is to say, o x1 o x2 ... o xM The median is p x o y1 o y2 ... o yM The median is p y .
[0173] Another example: the average of the n parameters of each of the M first data points, plus the first offset of each parameter, gives the reference point's value in the n dimensions corresponding to those n parameters. For instance, the average of parameter x of the M first data points plus the first offset of parameter x gives the reference point's value in the x-dimensional region, and the average of parameter y of the M first data points plus the first offset of parameter y gives the reference point's value in the y-dimensional region. In other words, p x =1 / M×(o x1 +o x2 +...+oxM )+C1,p y =1 / M×(o y1 +o y2 +...+o yM )+C2. Where C1 is the first offset of parameter x and C2 is the first offset of parameter y.
[0174] It is understood that the first offset of each parameter can be predefined by the protocol or preconfigured by the first or second device. The first offset of each parameter can be equal or unequal, positive or zero, negative, etc. This application does not limit this.
[0175] It should also be understood that the above methods for determining reference points are merely examples. Those skilled in the art can determine reference points by performing other mathematical transformations based on the center points of the M first data points, using the same or similar concepts. For the sake of brevity, these methods will not be listed further.
[0176] The reference point can be used to compress the M first data points to obtain the first compressed information.
[0177] In the embodiments of this application, the first device performs data compression on the M first data points based on a reference point; that is, it performs data transformation and quantization compression on the M first data points based on the reference point, thereby achieving data compression. In one understanding, performing data transformation on the M first data points based on a reference point to reduce the quantization range can also achieve a certain degree of data compression. This should not be construed as limiting this application in any way.
[0178] The first dimension of the reference point corresponds to the first parameter in the first data. The compression information of the first parameter in each piece of first data can be determined based on the difference between the value of the first dimension of the reference point and the value of the first parameter. The first parameter may include one or more parameters of the first data, and the corresponding first dimension may include one or more dimensions of the reference point.
[0179] For example, the first device can perform a numerical transformation on the first parameter of the M first data points based on a reference point to obtain the compression information of the first parameter in each first data point. This numerical transformation can, for example, involve calculating the absolute value of the difference between the first parameter of each of the M first data points and the value of the first dimension of the reference point, i.e., the absolute difference. The absolute difference of each first data point on the first parameter can be used to replace the original data of that first data point on the first parameter; the absolute difference of the first parameter of each first data point is the compression information of the first parameter of that first data point.
[0180] For example, when n = 2, the reference point p(p x p yThe first data point has two parameters, x and y. The absolute differences between the first data point and parameters x and y are respectively: |dx| = |x - p x |,|dy|=|y-p y |。 Where x and y are the parameters x and y of the first data, respectively. |dx| can be used to replace the original parameter x of the first data, and |dy| can be used to replace the original parameter y of the first data. That is, the compressed information of the parameter x of the first data is |dx|, and the compressed information of the parameter y of the first data is |dy|.
[0181] Compared to the quantization range of the first parameters of the original M first data points, or in other words, the quantization range of the first parameters of the first data points without numerical transformation, the quantization range of the first parameters of the first data points after numerical transformation is smaller. That is, the quantization range of the first parameters of the M first data points after numerical transformation at the reference point is smaller than the quantization range of the first parameters of the M first data points without numerical transformation at the reference point. In other words, the quantization range of the first parameters of the M first data points without numerical transformation at the reference point is larger than the quantization range of the first parameters of the M first data points after numerical transformation at the reference point. This reduces the number of quantization bits, thereby reducing transmission overhead.
[0182] In step 320, the first device sends the first compression information and the first indication information, the first indication information indicating either the positional relationship between the reference point and each first data point in the data space relative to the reference point, or the positional relationship between each first data point and the reference point in the data space. Correspondingly, the second device receives the first compression information and the first indication information.
[0183] The first device can divide the data space into multiple subspaces based on a reference point in the data space. That is, the data space includes multiple subspaces, and each subspace can be determined by the reference point.
[0184] For example, the first device can divide the data space into 2 n dimensions based on a reference point. n The M first data points are distributed in the 2 subspaces. n Within each subspace. That is, each subspace includes different first data, the 2 n The sum of the first data included in each subspace is M.
[0185] Figure 4This is a schematic diagram illustrating the division of a data space into multiple subspaces based on a reference point, as provided in an embodiment of this application. Taking M=13 and n=2 as an example, a reference point p is determined based on the parameters x and y of the center points of 13 first data points. The first device divides the data space into four subspaces based on the reference point p, denoted as the first subspace, the second subspace, the third subspace, and the fourth subspace. Specifically, the first subspace includes two first data points, the second subspace includes two first data points, the third subspace includes six first data points, and the fourth subspace includes three first data points. More specifically, the first subspace includes the first and second first data points, the second subspace includes the third and fourth first data points, the third subspace includes the fifth to tenth first data points, and the fourth subspace includes the eleventh to thirteenth first data points.
[0186] The first indication information is used to indicate: the positional relationship between the reference point and each first data point in the data space and the reference point, or the positional relationship between each first data point and the reference point in the data space. The positional relationship between each first data point and the reference point in the data space can have the following possible scenarios:
[0187] Case 1: The first indication information includes the indication information corresponding to each of the M first data, and each indication information is used to indicate the subspace to which the corresponding first data belongs.
[0188] Scenario 2: The first indication information includes indication information corresponding to each subspace in multiple subspaces, and each indication information is used to indicate the first data included in the corresponding subspace.
[0189] Scenario 3: The first indication information includes the number of first data in each subspace.
[0190] The following is based on Figure 4 Taking the four subspaces in the example, we will explain the three possible cases in detail.
[0191] For scenario one: The M first data items are arranged sequentially by index, with each first data item corresponding to a different subspace. The first indication information can sequentially indicate the subspace to which each first data item belongs. Arranging the first data items by index can also be called the original arrangement, that is, based on the original arrangement order of the M first data items, the subspace to which each of the M first data items belongs is indicated sequentially.
[0192] For example, the first subspace, the second subspace, the third subspace, and the fourth subspace are represented by "00", "01", "10", and "11", respectively. The first indication information indicates "00 00 01 01 10 10 10 10 10 10 11 11 11", which means that the subspace to which the first and second first data belong is the first subspace, the subspace to which the third and fourth first data belong is the second subspace, the subspace to which the fifth to tenth first data belong is the third subspace, and the subspace to which the eleventh to thirteenth first data belong is the fourth subspace.
[0193] For scenario two: The four subspaces are arranged sequentially according to the index, and each subspace includes different first data. The first indication information can sequentially indicate the first data included in each subspace.
[0194] For example, M = 13, meaning there are 13 first data items in total. The first device can represent the number of first data items included in a subspace based on 4 bits. Table 1 shows an example of the bit values and indices of the first data items in each subspace, or the bit values and the number of first data items in each subspace.
[0195] Table 1
[0196] Bit value Index / Number of the first data in the subspace Bit value Index / Number of the first data in the subspace 0000 0 1000 8 0001 1 1001 9 0010 2 1010 10 0011 3 1011 11 0100 4 1100 12 0101 5 1101 13 0110 6 1110 14 0111 7 1111 15
[0197] For example, the indication information corresponding to the first subspace is "0001 0010", indicating that the first subspace includes the first and second first data points; the indication information corresponding to the second subspace is "0011 0100", indicating that the second subspace includes the third and fourth first data points; the indication information corresponding to the third subspace is "0101 0110 0111 10001001 1010", indicating that the third subspace includes the fifth to tenth first data points; and the indication information corresponding to the fourth subspace is "1011 1100 1101", indicating that the fourth subspace includes the eleventh to thirteenth first data points. The first indication information can indicate the indication information corresponding to each of the above four subspaces.
[0198] It is understood that the four indication messages corresponding to the four subspaces can be sent through one first indication message, or through multiple first indication messages, etc., and this application does not limit this.
[0199] For scenario three: the M first data items are arranged sequentially according to the subspace indices, and each of the M first data items is contained in one of four subspaces, which are also arranged sequentially according to their indices. In this case, the first indication information can indicate the number of first data items included in each subspace.
[0200] For example, the first indication information indicates "0010 0010 0110 0011", which means that the first subspace includes 2 first data, the second subspace includes 2 first data, the third subspace includes 6 first data, and the fourth subspace includes 3 first data.
[0201] Figure 5 This is a schematic diagram of different arrangements of the first data provided in the embodiments of this application. Figure 5 (a) in the example arranges the 13 first data based on the subspace index, and the first information can sequentially indicate the index or number of first data included in each subspace; Figure 5 (b) in the example arranges the 13 first data based on the index of the 13 first data, and the first information can sequentially indicate the subspace to which each first data belongs.
[0202] In step 330, the second device recovers the M first data based on the first compression information and the first indication information.
[0203] The first device can obtain the positional relationship between each first data point and the reference point in the data space based on the division of the data space, that is, obtain the sign of the difference between the subspace to which each first data belongs in the first dimension.
[0204] like Figure 4 As shown, the difference in the x-dimensional space of the first subspace is dx < 0, and the difference in the y-dimensional space is dy > 0; the difference in the x-dimensional space of the second subspace is dx > 0, and the difference in the y-dimensional space is dy > 0; the difference in the x-dimensional space of the third subspace is dx < 0, and the difference in the y-dimensional space is dy < 0; the difference in the x-dimensional space of the fourth subspace is dx < 0, and the difference in the y-dimensional space is dy < 0. Where dx = x - p x dy = y - p y x and y are the parameters x and y of the first data, respectively, p x and p y These are the values of the reference point in the x and y dimensions, respectively.
[0205] One possibility is that the second device can recover the M first data points based on the reference point indicated by the first compression information and the first indication information, and the positional relationship between each first data point and the reference point in the data space.
[0206] The second device can determine the subspace to which each first data belongs based on the first indication information, and then determine the sign of the difference between each first data in the first dimension based on the subspace to which each first data belongs. The second device can recover the first parameter of the first data based on the absolute difference between each first data in the first dimension (i.e., the first compression information), the sign of the difference between each subspace in the first dimension (i.e., an example of the positional relationship between each first data and the reference point in the data space), and the reference point.
[0207] For example, the second device can base its data on the sign of the difference between the x and y dimensions of the subspace to which each of the first data belongs, that is, on the signs of dx and dy, |dx| and |dy|, and the reference point p(p). x p y Then, the parameters x and y of the first data can be recovered.
[0208] Another possibility is that the second device can recover the M first data points based on the first compression information and the first indication information indicating the positional relationship between each first data point and the reference point in the data space.
[0209] The M first data points are collected in a first space. The first device and the second device can pre-configure the first space, and the reference point can be determined based on the center point of the first space. In this case, the first indication information can indicate the positional relationship between each first data point and the reference point in the data space, without indicating the reference point. Thus, the M first data points can be recovered based on the first compression information, the first indication information, and the reference point determined based on the pre-configured center point of the first space.
[0210] Optionally, the first indication information is also used to indicate the quantization parameters of the M first data, the quantization parameters including the quantization range and quantization bits.
[0211] The first device can determine the quantization bits of the M first data based on the quantization range of the M first data. After performing absolute difference replacement on the first parameters of the M first data, the first device can also perform quantization compression on the M first data based on the quantization range and quantization bits of the M first data, denoted as Design 1. For example, the first device can perform quantization compression on the M first data based on the fixed quantization method described above, thereby obtaining first compressed information.
[0212] After receiving the first compressed information, the second device can perform operations such as inverse quantization and numerical transformation on the first compressed information based on the parameters indicated by the first information, and then recover the M first data.
[0213] It is understandable that each recovered first data point is the original first data point. approximation
[0214]
[0215] It should also be understood that the reference point indicated by the quantization parameter, the first compression information and the first indication information, as well as the positional relationship between each first data point and the reference point in the data space, can be sent to the second device simultaneously based on the same signaling, or can be sent to the second device separately based on different signaling, etc., and this application does not limit this.
[0216] Optionally, the method further includes: a first device sending or receiving first configuration information. The first configuration information is used to indicate one or more of the following parameters: the dimension of a reference point, whether the reference point is the center point of a first space, or when the reference point is determined based on the center points of M second spaces, or when the data space includes multiple subspaces; and the indication format of the first indication information. Accordingly, the second device receives or sends the first configuration information.
[0217] The first device can determine to divide the data space into 2 based on the dimensions of the reference point indicated by the second information. n The first device can process M pieces of first data into multiple subspaces, and can select n parameters from the N parameters of the first data to determine the n dimensions corresponding to the n parameters; it can also determine the reference point based on the reference point indicated by the first configuration information as the center point of the first space or based on the center points of M second spaces; it can also determine the correspondence between the M pieces of first data and the multiple subspaces based on the indication form of the first indication information indicated by the second configuration information, that is, to determine the subspace to which each piece of first data belongs, or to determine the positional relationship between the reference point and each piece of first data in the data space and the reference point. In other words, the first device can process the M pieces of first data based on the above parameters to obtain first compression information and first indication information.
[0218] The first configuration information can be determined by the first device, configured by the second device, or predefined by the protocol; this application does not limit this. In other words, all parameters in the first configuration information can be determined by the first device and sent to the second device, or determined by the second device and sent to the first device, or predefined by the protocol, or obtained through a combination of the aforementioned methods. For example, the first device determines some of them, and the second device determines another part; or the protocol predefines some of them, and the second device configures another part, and so on, without further listing.
[0219] Optionally, the M first data include the i-th first data and the (i+1)-th first data, and the compression information of the second parameter in the (i+1)-th first data is determined based on the difference between the value of the second parameter in the i-th first data and the value of the second parameter in the (i+1)-th first data.
[0220] The second parameter of the first data is one of the at least one parameters of the first data.
[0221] Example 1: The second parameter can be determined based on the priority of N parameters from the first data. In different application scenarios, the priority of different parameters varies, meaning their importance differs. For example, in autonomous driving applications, vehicles may make left or right turns; compared to other parameters, the yaw angle... The highest priority or greater importance is given to these. Therefore, the first device can determine the parameters. It was determined to be the second parameter.
[0222] Example 2: The second parameter can be determined based on the data range of the N parameters of the first data. The second parameter can be the parameter with the largest data range among the N parameters of the first data, and the data range of each parameter can be determined based on its maximum and minimum values. For example, the data range of parameter x is r1 = max(x) - min(x). Here, max(x) represents the maximum value of parameter x, and min(x) represents the minimum value of parameter x.
[0223] The second device can perform inverse quantization operations on the first compressed information based on the second parameter. One possible design for the second device to determine the second parameter is that the first device indicates the second parameter to the second device based on the first indication information; that is, the first indication information is also used to indicate the second parameter. Another possible design for the second device to determine the second parameter is that after the first device determines the second parameter, the second device can determine the second parameter based on predefined rules, such as a method based on dual-end synchronization priority. That is, both the first device and the second device can determine the second parameter based on synchronization, without needing to indicate the second parameter through the first indication information.
[0224] Optionally, the first indication information is also used to indicate the order of the M first data points. For example, when the number of first data points is large, i.e., when the value of M is large, the second device can accurately perform operations such as inverse quantization on the first compressed information based on the order of the M first data points indicated by the first indication information, thereby reconstructing the M first data points. In this way, errors can be avoided when reconstructing the M first data points due to the large amount of data.
[0225] The order of the M first data can be as follows:
[0226] The first possibility is that the order of the M first data is obtained by sorting the M first data based on the second parameter, based on the original arrangement order of the M first data, and is denoted as the first order.
[0227] For example, the M first data are obtained by processing the collected point cloud data. The original arrangement order of the M first data can be arranged according to the time sequence of data collection, or it can be arranged according to the relational position of the M first data in the data space, etc. This application does not limit this.
[0228] One possible design for this first order is to arrange the M first data points sequentially according to the ascending order of the second parameter in each first data point, and the resulting order of these M first data points is the first order. That is, the value of the second parameter in the i-th first data point is less than the value of the second parameter in the (i+1)-th first data point. In other words, the value of the second parameter in the first data point that appears earlier is less than the value of the second parameter in the first data point that appears later.
[0229] Another possible design for this first order is to arrange the M first data points sequentially according to the descending order of the second parameter in each first data point. The resulting order of these M first data points is the first order. That is, the value of the second parameter in the i-th first data point is greater than the value of the second parameter in the (i+1)-th first data point. In other words, the value of the second parameter of the first data point that appears earlier in the sequence is greater than the value of the second parameter of the first data point that appears later in the sequence.
[0230] Figure 6 This is a schematic diagram illustrating three possible sequences provided in the embodiments of this application. Wherein, Figure 6 Figure (a) illustrates a schematic diagram of obtaining the first order based on the original permutation order. The original permutation order of the 13 first data items shown in the figure can be arranged sequentially based on their indices, that is, the original permutation order of the 13 first data items is: the 1st first data item, the 2nd first data item, the 3rd first data item, ..., the 13th first data item. Based on the original permutation order of these 13 first data items, the first device sorts the 13 first data items according to the ascending order of the values of the second parameter in the first data items; the order of these 13 first data items is the first order.
[0231] The compression information of the second parameter in the (i+1)th first data among the M first data is determined based on the difference between the value of the second parameter in the i-th first data and the value of the second parameter in the (i+1)th first data.
[0232] For example, the compression information of the second parameter in the (i+1)th first data is obtained by performing a differential transformation based on the value of the second parameter in the i-th first data and the value of the second parameter in the (i+1)th first data.
[0233] Example 1: The second parameter is θ. The first order is obtained by arranging the M first data points sequentially according to the ascending order of the second parameter. Based on the first order, a difference transform is performed between any two adjacent first data points. The value of the second parameter in the Mth first data point is subtracted from the value of the second parameter in the (M-1)th first data point, and the difference is used to replace the value of the second parameter in the Mth first data point. This process is iterated until the value of the second parameter in the 2nd first data point is subtracted from the value of the second parameter in the 1st first data point, and the difference is used to replace the value of the second parameter in the 2nd first data point, while the value of the second parameter in the 1st first data point remains unchanged. In this way, the quantization range of the second parameter in the first data point can be reduced, thereby reducing the quantization bits.
[0234] Example 2: The second parameter is θ. The first order is obtained by arranging the M first data points in descending order of the second parameter. Based on this first order, a difference transform is performed between adjacent pairs of the M first data points. The value of the second parameter in the first first data point is subtracted from the value of the second parameter in the second first data point, and the difference is used to replace the value of the second parameter in the first first data point. This process is iterated until the value of the second parameter in the (M-1)th first data point is subtracted from the value of the second parameter in the Mth first data point, and the difference is used to replace the value of the second parameter in the (M-1)th first data point. The value of the second parameter in the Mth first data point remains unchanged. In this way, the quantization range of the second parameter in the first data points can be reduced, thereby reducing the quantization bits.
[0235] The second possibility is that the order of the M first data is obtained by sorting multiple subspaces based on the value of the second parameter in the first reference data of each subspace, denoted as the second order. In this case, the first indication information is also used to indicate the order of the multiple subspaces.
[0236] In this context, the first reference data for each subspace is the first data point in each subspace that has the largest or smallest value for the second parameter. That is, the first data point with the largest or smallest second parameter can be determined from at least one set of first data points included in each subspace, and this first data point is then defined as the first reference data for each subspace. In other words, the first reference data for each subspace is the first data point in each subspace that has the largest or smallest value for the second parameter.
[0237] As can be seen from step 310 above, the first device can divide the data space into 2 based on the reference point.n There are several subspaces, each containing different first data. In this case, a differential transformation can be performed on the second parameters in the first reference data of two adjacent subspaces based on this second order.
[0238] For example, the i-th first data is the first data in the first subspace with the smallest value of the second parameter, and the (i+1)-th first data is the first data in the second subspace with the smallest value of the second parameter. That is, the first reference data for the first subspace is the i-th first data, and the first reference data for the second subspace is the (i+1)-th first data. In this case, the compression information of the second parameter in the (i+1)-th first data can be determined based on the difference between the value of the second parameter in the i-th first data and the value of the second parameter in the (i+1)-th first data.
[0239] Example 1: The first reference data for each subspace can be the first data in each subspace with the smallest value of the second parameter. In this case, the different subspaces are sorted according to the ascending order of the values of the second parameter in the first reference data of each subspace, thus obtaining the second order. Following the second order, the values of the second parameter in the first reference data of adjacent subspaces are subtracted from each other, and the difference is used to replace the value of the second parameter in the later-ranked first reference data. That is, the value of the second parameter in the first reference data of the later-ranked subspace is subtracted from the value of the second parameter in the first reference data of the earlier-ranked subspace, and the difference is used to replace the value of the second parameter in the first reference data of the later-ranked subspace.
[0240] Figure 6 (b) is a schematic diagram of obtaining the second order based on the order between subspaces. The first device, based on the method described in step 310, divides the data space into four subspaces based on the x and y dimensions of the reference point. The first subspace includes the first and second first data points, the second subspace includes the third and fourth first data points, the third subspace includes the fifth to tenth first data points, and the fourth subspace includes the eleventh to thirteenth first data points. The first reference data point in each subspace can be the first data point with the smallest value of the second parameter in each subspace.
[0241] Taking θ as the second parameter as an example, in the first subspace, θ1 < θ2, and the first reference data in the first subspace is the first first data. Similarly, the first reference data in the second subspace is the third first data, the first reference data in the third subspace is the fifth first data, and the first reference data in the fourth subspace is the eleventh first data. The values of the second parameter in the first reference data of these four subspaces are θ1, θ3, θ5, and θ6, respectively. 11 And θ3 < θ 11Since θ5 < θ1, the order of these four subspaces from front to back is: second subspace, fourth subspace, third subspace, and first subspace. That is, the second order is: second subspace, fourth subspace, third subspace, and first subspace. For example, if the first to fourth subspaces are represented by "00", "01", "10", and "11" respectively, then the first indication information can also indicate "01 11 10 00" to indicate the order of these four subspaces.
[0242] Since θ3 < θ 11 Since θ5 < θ1, the values of the second parameter in the first reference data of two adjacent subspaces in these four subspaces are subjected to a difference transformation, that is, dθ1 = θ1 - θ5, where dθ1 is used to replace θ1; dθ2 = θ5 - θ 11 dθ2 is used to replace θ5; dθ3 = θ 11 -θ3, dθ3 are used to replace θ 11 θ3 remains unchanged.
[0243] Example 2: The first reference data for each subspace can be the first data in each subspace with the largest value of the second parameter. In this case, the different subspaces are sorted according to the descending order of the values of the second parameter in the first reference data of each subspace, thus obtaining the second order. Following the second order, the values of the second parameter in the first reference data of adjacent subspaces are subtracted from each other, and the difference is used to replace the value of the second parameter in the first reference data of the preceding subspace. That is, the value of the second parameter in the first reference data of the preceding subspace is subtracted from the value of the second parameter in the first reference data of the following subspace, and the difference is used to replace the value of the second parameter in the first reference data of the preceding subspace.
[0244] Taking θ as the second parameter as an example, in the first subspace, θ1 > θ2, and the first reference data of the first subspace is the first first data. Similarly, the first reference data of the second subspace is the third first data, the first reference data of the third subspace is the fifth first data, and the first reference data of the fourth subspace is the eleventh first data. The values of the second parameter for the first reference data of these four subspaces are θ1, θ3, θ5, and θ6, respectively. 11 And θ3>θ 11 Since θ5 > θ1, the order of these four subspaces is: second subspace, fourth subspace, third subspace, and first subspace. That is, the order of these four subspaces from front to back is: second subspace, fourth subspace, third subspace, and first subspace. For example, if the first to fourth subspaces are represented by "00", "01", "10", and "11" respectively, then the first indication information can also indicate "01 11 10 00" to indicate the order of these four subspaces.
[0245] Since θ3>θ 11 Since θ5 > θ1, the second parameter in the first reference data of two adjacent subspaces in these four subspaces undergoes a difference transformation, i.e., dθ1 = θ3 - θ 11 dθ1 is used to replace θ3; dθ2 = θ 11 -θ5, dθ2 are used to replace θ 11 dθ3 = θ5 - θ1, where dθ3 replaces θ5; θ1 remains unchanged.
[0246] It can be seen that the quantization range of the first reference data in the subspace after the differential transformation in the second order is smaller than the quantization range of the first reference data in the subspace without the differential transformation in the second order. That is, based on the above differential transformation, the quantization range of the second parameter in the first reference data (i.e., part of the first data) of each subspace can be reduced, thereby reducing the quantization bits of the first reference data in the second parameter and reducing transmission overhead.
[0247] The third possibility is that the order of the M first data is obtained by arranging the first data included in each subspace based on the value of the second parameter in each first data, based on the second order.
[0248] In other words, the order of the M first data is obtained by sorting at least one first data in each subspace based on the order of the different subspaces.
[0249] Example 1: The second order is obtained by sorting the different subspaces according to the values of the second parameter in the first reference data of each subspace from smallest to largest, and the first reference data of each subspace is the first data with the smallest second parameter in each subspace.
[0250] In this case, the first data in each subspace is arranged in ascending order of the second parameter in the first data to obtain the third order. That is, the value of the second parameter in the i-th first data in each subspace is less than the value of the second parameter in the (i+1)-th first data, or in other words, the value of the second parameter in the (i+1)-th first data in each subspace is greater than the value of the second parameter in the i-th first data.
[0251] The difference between the value of the second parameter in the (i+1)th first data in each subspace and the value of the second parameter in the ith first data is used to replace the value of the second parameter in the (i+1)th first data, and so on, so that the first reference data in each subspace remains unchanged.
[0252] Example 2: The second order is obtained by sorting the different subspaces according to the value of the second parameter in the first reference data of each subspace from largest to smallest, and the first reference data of each subspace is the first data with the largest second parameter in each subspace.
[0253] In this case, the first data in each subspace is arranged in descending order of the second parameter in the first data to obtain the third order. That is, the value of the second parameter in the i-th first data in each subspace is greater than the value of the second parameter in the (i+1)-th first data, or in other words, the value of the second parameter in the (i+1)-th first data in each subspace is less than the value of the second parameter in the i-th first data.
[0254] Based on the third order, the difference between two adjacent first data in each subspace is performed. The value of the second parameter in the i-th first data in each subspace is subtracted from the value of the second parameter in the (i+1)-th first data. The difference is used to replace the value of the second parameter in the i-th first data, and so on. The first reference data of each subspace remains unchanged.
[0255] Figure 6 (c) is a schematic diagram illustrating the third order based on the first data included within the subspace. Figure 6 Taking the order of the four subspaces shown in (b) as an example, we sort the first data in each of the four subspaces. In the second subspace, θ3 < θ4, correspondingly, the order of the first data in the second subspace from front to back is the third first data, then the fourth first data. Similarly, in the fourth subspace, θ... 11 <θ 12 <θ 13 Correspondingly, the order of the first data in the fourth subspace from front to back is the 11th first data, the 12th first data, and the 13th first data; in the third subspace, θ5 < θ6 < θ7 < θ8 < θ9 < θ 10 Correspondingly, the order of the first data in the third subspace from front to back is the 5th first data, the 6th first data, ..., the 10th first data; in the first subspace θ1 < θ2, correspondingly, the order of the first data in the first subspace from front to back is the 1st first data, the 2nd first data.
[0256] Regarding the arrangement order of the first data included in the above four subspaces, the third information indicates the arrangement order of the 13 first data included in the four subspaces by using the instruction "00110100 1011 11001101 0101 0110 0111 1000 1001 1010 0001 0010", with each four bits representing one first data.
[0257] Based on the third order, a difference transformation is performed on the values of the second parameters in the third and fourth first data points included in the second subspace, i.e., dθ1 = θ4 - θ3, where dθ1 replaces θ4; θ3 remains unchanged. Then, a difference transformation is performed on the values of the second parameters in adjacent pairs of the eleventh, twelfth, and thirteenth first data points included in the fourth subspace, i.e., dθ1 = θ4 - θ3. 13 -θ 12 dθ1 is used to replace θ 13 ;dθ2=θ 12 -θ 11 dθ2 is used to replace θ 12 ;θ 11 Remain unchanged. For the 5th to 10th first data points included in the third subspace, perform a difference transformation on the values of the second parameter between adjacent first data points, i.e., dθ1 = θ. 10 -θ9, dθ1 are used to replace θ 10 ; dθ2 = θ9 - θ8, dθ2 is used to replace θ9; dθ3 = θ8 - θ7, dθ3 is used to replace θ8; dθ4 = θ7 - θ6, dθ4 is used to replace θ7; dθ5 = θ6 - θ5, dθ5 is used to replace θ6; θ5 remains unchanged.
[0258] It can be seen that the quantization range of the first data in the subspace after the third differential transformation is smaller than the quantization range of the first data in the subspace without the third differential transformation. That is, based on the above differential transformation, the quantization range of the second parameter in the first data can be reduced, thereby reducing the number of quantization bits of the second parameter in the first data and reducing transmission overhead.
[0259] In the three possible cases mentioned above, the i-th first data and the (i+1)-th first data can be any two adjacent first data among the M first data, which are determined based on the order of the M first data.
[0260] Optionally, some or all of the two adjacent first data in the M first data can be compressed based on the difference between the second parameter in the i-th first data and the second parameter in the (i+1)-th first data to determine the compression information of the second parameter in the (i+1)-th first data, that is, to compress the data and obtain the first compression information.
[0261] It is understandable that the aforementioned first instruction information is also used to indicate the order of the M first data items, and there are several possible scenarios.
[0262] Scenario 1: The first instruction information is also used to indicate the aforementioned second order, that is, the first device can obtain the second order by sorting the different subspaces only.
[0263] Scenario 2: The first instruction information is also used to indicate the aforementioned third order, that is, the first device can obtain the third order by arranging only the first data included in each subspace.
[0264] Scenario 3: The first instruction information is also used to indicate the aforementioned second and third orders. That is, the first device can first sort the different subspaces to obtain the second order, and then sort the first data included in each subspace to obtain the third order.
[0265] Case 4: The first instruction information is also used to indicate the aforementioned second and third orders. That is, the first device can first sort the first data included in each subspace to obtain the third order, and then sort the different subspaces to obtain the second order.
[0266] For details regarding the four possible scenarios mentioned above, including sorting the first data within each subspace to obtain the arrangement order of the first data within each subspace (i.e., the third order), and arranging different subspaces to obtain the arrangement order between subspaces (i.e., the second order), please refer to the detailed explanations of the second and third orders mentioned above. They will not be repeated here.
[0267] For example, the second parameter is parameter θ, and the first device obtains the first information to be compressed after performing data transformation on each of the M first data. Further analysis of the first piece of information to be compressed The parameter θ is transformed again to obtain the second information to be compressed. Furthermore, the second information to be compressed can be quantized and compressed to obtain the first compressed information of the M first data. Alternatively, the first device can compress each of the M first data. The parameter θ is used to compress the data, that is, to perform data transformation and quantization compression on the parameter θ of M original data to be compressed, so as to obtain the first compressed information of the M first data.
[0268] Optionally, the first indication information is also used to indicate the quantization parameters of the M first data, the quantization parameters including the quantization range and quantization bits.
[0269] The first device can determine the quantization bits of the M first data based on the quantization range of the M first data. After differentially replacing the second parameters of the M first data, the first device can also perform quantization compression on the M first data based on the quantization range and quantization bits of the M first data, denoted as Design Two. For example, the first device can perform quantization compression on the M first data based on the fixed quantization method described above, thereby obtaining first compressed information.
[0270] After receiving the first compressed information, the second device can perform operations such as inverse quantization and numerical transformation on the first compressed information based on the parameters indicated by the first information, and then recover the M first data.
[0271] It is understandable that each recovered first data point is the original first data point. approximation
[0272]
[0273] Optionally, the method further includes: the first device sending or receiving second configuration information. The second configuration information is used to indicate that the second parameter is determined based on the priority of N parameters, or that the second parameter is determined based on the data range of the N parameters. Accordingly, the second device receives or sends the second configuration information.
[0274] Based on the second configuration information, the first device can select a second parameter from N parameters of the first data. Then, based on the selected second parameter, it can perform sorting and differential compression operations on the M pieces of first data to obtain first compressed information.
[0275] The second configuration information can be determined by the first device, configured by the second device, or predefined by the protocol; this application does not limit this. In other words, all parameters indicated by the second configuration information can be determined by the first device and sent to the second device, or determined by the second device and sent to the first device, or predefined by the protocol, or obtained through a combination of the aforementioned methods. For example, the first device determines some of them, and the second device determines another part; or the protocol predefines some of them, and the second device configures another part, and so on, without further listing.
[0276] Optionally, in step 310, the first device compresses the M first data points to be compressed based on reference points in the data space to obtain first compression information. The method further includes:
[0277] Step 1: The first device performs data transformation on the M first data to be compressed based on the reference point to obtain at least one second data, wherein at least one parameter in each first data is included in one second data.
[0278] Step two, the first device compresses the second data based on the quantization bits of each second data to obtain first compression information. The quantization bits are determined based on the maximum and minimum values of each parameter in at least one parameter of the corresponding second data.
[0279] In this case, the first indication information is also used to indicate at least one of the following: at least one parameter corresponding to each second data, the minimum value of each of the at least two parameters included in each second data, and the quantization boundary or quantization bit of each second data.
[0280] Accordingly, in step 330, the second device recovers the M first data based on the first compression information and the first indication information. The method further includes:
[0281] Step 3: Based on the first compression information and the quantization bits of each second data, recover at least one second data, wherein at least one parameter in each first data is included in a second data, and the quantization bits are determined based on the maximum and minimum values of each parameter in the corresponding second data.
[0282] Step four: Based on the at least one second data point and the reference point, recover the M first data points.
[0283] The following sections will provide a detailed explanation of the four steps mentioned above and the specific content of the first instruction information.
[0284] In step one, the first device performs data transformation on the M first data to be compressed based on a reference point to obtain at least one second data, wherein at least one parameter in each first data is included in a second data.
[0285] That is, the second compressed information includes at least one second data, and each second data includes at least one parameter of the first data.
[0286] One possibility is that each second data point includes one parameter of the first data point.
[0287] The first device can divide each parameter of the first data into a group, also known as static grouping, and each group of data is a second data. In other words, the first device can divide the first data with N parameters into N groups of data, and each group of data includes one parameter of the first data, that is, each second data includes one parameter of the first data.
[0288] For example, the first device can transmit first data with nine parameters. The data is divided into 9 groups (i.e., 9 second data points). For example, the first group of data (i.e., the first second data point) includes the parameter x of the first data point, the second group of data (i.e., the second second data point) includes the parameter y of the first data point, and so on.
[0289] Another possibility is that the second data includes at least two third data, each of which includes a parameter of each of the M first data, and the similarity between at least two third data is greater than or equal to a preset value.
[0290] In other words, each second data includes at least two parameters of the first data, and the similarity between the at least two parameters is greater than or equal to a preset value. The preset value may be, for example, predefined by the protocol, or preconfigured by the first or second device, etc. This application does not limit this.
[0291] For example, the first device can, based on the data range of each of the N parameters, use a clustering algorithm according to certain rules (such as Euclidean distance) to divide the first data with N parameters into multiple second data. Each second data includes at least two parameters of the first data. The data ranges of at least two parameters within each second data are approximately similar, or in other words, the similarity of the data ranges of at least two parameters within each second data is greater than or equal to a preset value; the data ranges of different parameters between different second data are different, or in other words, the similarity of the data ranges of different parameters between different second data is less than a preset value.
[0292] The data range for each parameter can be derived from its maximum and minimum values. For example, the difference between the maximum and minimum values of each parameter is its data range.
[0293] Figure 7 This is a schematic diagram illustrating the grouping of first data based on parameter-based data ranges according to an embodiment of this application. As shown in the figure, the first data... The data ranges of the nine parameters are represented as r1, r2, r3, r4, r5, r6, r7, r8, and r9, respectively. Taking parameter z as an example, the data range r3 of parameter z satisfies: r3 = max(z) - min(z). Here, max(z) represents the maximum value of parameter z, and min(z) represents the minimum value of parameter z.
[0294] After calculating the data range of each of the nine parameters in the first data set, clustering was used to divide the data of these nine parameters into four groups. The first group includes parameters |dx| and |dy|, the second group includes parameters z, l, w, and h, and the third group includes parameters α and dx. The fourth group includes the parameter dθ. That is, the first set of second data includes the parameters |dx| and |dy|, the second set includes the parameters z, l, w, and h, and the third set includes the parameters α and dθ. The fourth second data point includes the parameter dθ.
[0295] Optionally, the first indication information is also used to indicate at least one parameter corresponding to each second data.
[0296] For example, the first device divides the N parameters of the first data into H second data, or into H groups, where H is an integer less than or equal to N. The first device can indicate a bitmap using first indication information, or a high-radix value for indicating the bitmap, or an index for indicating the bitmap. The bitmap can include a × N bits, corresponding to the N parameters. The value of each a bit indicates the second data or group corresponding to a parameter, and the value of a satisfies: a is greater than or equal to... That is,
[0297] Table 2 shows an example of the correspondence.
[0298] Table 2
[0299] Bit value The i-th second data point / the i-th group of data 00 1 01 2 10 3 11 4
[0300] For example, the first data The nine parameters are divided into four second data points, each represented by two bits, indicating the second data corresponding to a parameter. The first indication information, a bitmap "00 00 01 01 01 01 10 11 10", shows the relationship between the nine parameters of the first data and the four second data points. This indicates that the first second data point includes parameters |dx| and |dy|, the second second data point includes parameters z, l, w, and h, and the third second data point includes parameters α and β. The fourth second data point includes the parameter dθ.
[0301] In step two, the first device compresses the second data based on the quantization bits of each second data to obtain first compression information. The quantization bits are determined based on the maximum and minimum values of each parameter in at least one parameter of the corresponding second data.
[0302] It is understandable that the data range or numerical range of each parameter can be determined based on its maximum and minimum values. The first device can process the quantization range of each parameter based on the maximum and minimum values of each parameter included in each second data set, thereby obtaining the data range for each dimension.
[0303] Taking the third second data point in the example above as an example, Figure 8 This is a schematic diagram illustrating the acquisition of data ranges based on the maximum and minimum values of parameters provided in an embodiment of this application. It can be seen that the values of parameter α are α1, α2, ..., α... k The maximum value of parameter α is α max The minimum value is α min The quantization range of parameter α is [α min α max Each value of the α parameter is subtracted from the minimum value α. min The data range of parameter α can be obtained as r α Among them, r α =r7=α max- α min .
[0304] Similarly, the parameters of the third second data can be obtained. Data range. Parameters The maximum value is Minimum value is parameter The quantization range is parameter Subtract the minimum value from each value Parameters can be obtained The data range is in,
[0305] The first device can further determine the quantization boundary of the group based on the data range of each parameter included in each second data set. For example, the first device can determine the quantization boundary based on the data range of parameter α and parameter... The data range determines the quantization boundary of the third second data, and the quantization boundary of the third second data is... The difference between the maximum and minimum values of the quantization boundary of the third second data point is:
[0306] The first device can determine the quantization bits of each second data based on the quantization boundary of each second data, and the quantization boundary of each second data can be determined based on the maximum and minimum values of each parameter among at least one parameter included in each second data. In other words, the quantization bits of each second data can be determined based on the maximum and minimum values of each parameter among at least one parameter included in the corresponding second data.
[0307] One possible implementation is that the first device can directly indicate the quantization bits of each second data. For example, if the first data is divided into four second data, the first device can indicate, through the first indication information, that the quantization bits of the first to fourth second data in the four second data are n1, n2, n3, and n4 respectively.
[0308] Another possible implementation is that the first device can determine the quantization bits of each second data based on a first predefined data range, a first predefined quantization bit, and the difference between the maximum and minimum values of the quantization boundaries of each second data. The first predefined data range and the first predefined quantization bit can be predefined by the protocol, preconfigured by the first and second devices, etc., and this application does not limit them in this regard.
[0309] For example, the quantization bits n of the i-th second data i satisfy:
[0310]
[0311] Where n0 represents the first predefined quantization bit, r0 represents the first predefined data range, and R i This represents the difference between the maximum and minimum values of the quantization boundary of the i-th second data point.
[0312] It is understandable that, in the case where each second data point includes a parameter of the first data point, R i This represents the data range of the i-th second data.
[0313] For example, the first device divides the N parameters of the first data into 4 second data, each second data including at least one parameter, where the value of i is: i∈{1,2,3,4}.
[0314] Optionally, a first predefined data range r0 and a first predefined quantization bit n0 can be predefined or preconfigured based on different precision protocols.
[0315] For example, as shown in Table 3, the same first predefined data range r0 can correspond to different first predefined quantization bits n0 under different precision normalized mean squared error (NMSE).
[0316] Table 3
[0317]
[0318]
[0319] For example, when the precision of NMSE is on the order of E-01, and the first predefined data range r0 is 100, the first predefined quantization bit n0 can be defined as 7, that is, one data can be quantized every 7 bits; when the precision of NMSE is on the order of E-02, and the first predefined data range r0 is 100, the first predefined quantization bit n0 can be defined as 8, that is, one data can be quantized every 8 bits.
[0320] It is understood that Table 3 is only an example. For example, different first predefined data ranges r0 and first predefined quantization bits n0 can be defined at other precisions, etc. This application does not limit this.
[0321] Optionally, the first indication information is also used to indicate the minimum value of each of the at least two parameters included in each of the second data.
[0322] Optionally, the first indication information is also used to indicate the quantization boundary and / or quantization bits of each second data.
[0323] One possibility is that each second data point includes a parameter of the first data point, in which case the quantization boundary of the second data point is determined based on the maximum and minimum values of the parameter included in the second data point.
[0324] In this case, the first indication information is used to indicate the quantization boundary of each second data, which is also used to indicate the maximum and minimum values of the parameters included in each second data.
[0325] Another possibility is that when each second data includes at least two parameters of the first data, the quantization boundary of the second data is aligned based on the maximum and minimum values of each parameter. That is, the minimum value (or left boundary) of the quantization boundary of each second data is zero, and the maximum value (or right boundary) of the quantization boundary of each second data is the data range of the parameter with the largest data range among the at least two parameters included in the second data.
[0326] In this case, the first indication information is used to indicate the minimum value of each of the at least two parameters included in each second data, and the quantization boundary of each second data. That is, the first indication information is also used to indicate the minimum value of each of the at least two parameters included in each second data, and the maximum value of the parameter with the largest data range among the at least two parameters included in each second data. The second device can determine the quantization boundary of each second data based on the parameters indicated by the first information for each second data.
[0327] The first device can perform quantization, compression, and other operations on each second data point based on its quantization boundary and quantization bits to obtain first compressed information. Correspondingly, after receiving the first indication information, the second device can perform dequantization on the first compressed information based on the quantization boundary and / or quantization bits indicated by the first indication information to obtain the values of N parameters. The value of each parameter can be added to the minimum value of each parameter indicated by the first indication information, thereby recovering the M first data points.
[0328] When each second data item includes a parameter of the first data item, the first device can determine the quantization boundary and quantization bits of each second data item based on the data range of the parameter included in the second data item, i.e., the maximum and minimum values of the parameter, and then perform quantization compression to obtain the first compressed information. After receiving the first indication information, the second device can reconstruct the M first data items by performing an inverse quantization operation on the first compressed information based on the quantization boundary and / or quantization bits of each second data item indicated by the first indication information.
[0329] In this case, the first indication information does not need to indicate the minimum value of each parameter. Accordingly, when the second device reconstructs the M first data, it does not need to add the minimum value of each parameter to the values of the N parameters obtained after the dequantization operation.
[0330] It is understandable that the recovered M first data points are approximations of the original M first data points.
[0331] Accordingly, optionally, in step three, the second device recovers at least one second data based on the first compression information and the quantization bits of each second data, each second data including at least one parameter of the first data, the quantization bits being determined based on the maximum and minimum values of each parameter in the corresponding second data.
[0332] The second device can perform dequantization based on each quantized bit of the second data, thereby recovering multiple second data.
[0333] For example, when each second data includes a parameter, the second device can recover at least one second data based on the quantization bits of each second data and the quantization boundaries of each second parameter indicated by the first indication information, that is, the maximum and minimum values of each parameter.
[0334] For example, when each second data includes at least two parameters, the second device can recover at least one second data based on the quantization bits of each second data and the minimum value of each of the at least two parameters included in each second data as indicated by the first information, and the maximum value of the parameter with the largest data range among the at least two parameters included in each second data.
[0335] Optionally, in step four, the second device recovers the M first data based on the at least one second data and the reference point.
[0336] The second device recovers the relevant content of the M first data based on the second compression information and the reference point. This is the same as or similar to the recovery of the relevant content of the M first data based on the first compression information and the first indication information by the second device in step 330. For details, please refer to the detailed content in step 330, which will not be repeated here.
[0337] Optionally, the method further includes: the first device sending or receiving third configuration information. The third configuration information is used to indicate one or more of the following: the second data includes a parameter for each of the M first data items; or the second data includes at least two third data items, each third data item including a third parameter for each of the M first data items, wherein the similarity between the at least two third data items is greater than or equal to a preset value; or, whether to indicate the quantization bits of each second data item. Accordingly, the second device receives or sends the third configuration information.
[0338] The third parameter is any one of the N parameters of the first data, and each third data includes a different third parameter.
[0339] When the third configuration information does not indicate the quantization bit of each second data, the quantization bit of each second data can be determined based on the maximum and minimum values of each parameter in the at least one parameter in the second data, that is, it can be determined based on the first predefined data range, the first predefined quantization bit, and the maximum value of the quantization boundary of each second data; when the third configuration information indicates the quantization bit of each second data, the quantization bit of each second data can be directly indicated based on the third configuration information.
[0340] The first device may, based on the second data indicated by the third configuration information, include one parameter of each of the M first data, or the second data includes at least two third data, divide the N parameters of the first data into different second data, and quantize and compress the second data based on the quantization bits of each second data to obtain the first compressed information.
[0341] The third configuration information can be determined by the first device, configured by the second device, or predefined by the protocol; this application does not limit this. In other words, all parameters indicated by the third configuration information can be determined by the first device and sent to the second device, or determined by the second device and sent to the first device, or predefined by the protocol, or obtained through a combination of the aforementioned methods. For example, the first device determines some of them, and the second device determines another part; or the protocol predefines some of them, and the second device configures another part, and so on, without further listing.
[0342] Based on the above technical solution, by compressing some or all parameters of each of the M first data points based on reference points in the data space, the data compression rate can be improved and the data transmission overhead reduced. Furthermore, when quantizing the M first data points, the quantization range of some or all parameters in the M data points can be reduced, correspondingly reducing the number of quantization bits, thereby reducing data transmission overhead and improving communication efficiency.
[0343] Furthermore, a second parameter is determined from the N parameters of the first data. Based on the difference between the second parameters of two adjacent first data points in the M first data points, the second parameter in one of the first data points is compressed, thereby improving the data compression rate and reducing data transmission overhead. Furthermore, when quantizing the M first data points, the quantization range of the second parameter in the M first data points can be reduced, correspondingly reducing the number of quantization bits, thereby reducing data transmission overhead.
[0344] Furthermore, after reducing the quantization range of some or all parameters of the M first data sets, the parameters of the first data sets are divided into different second data sets. Each second data set includes at least one parameter of the first data set. Data compression is then performed on the second data sets based on the quantization bits of the at least one parameter included in each second data set. In this way, the quantization range of the M first data sets can be further reduced, and the quantization bits of each second data set can be determined based on the quantization range of each second data set, which can further reduce the number of quantization bits and thus reduce data transmission overhead.
[0345] Modularizing the processing of the first data based on the first indication information in the aforementioned method 300 can lead to the following possible scenarios:
[0346] One possible scenario is that the first indication information is used to indicate the positional relationship between the reference point and each first data point in the data space relative to the reference point, or the positional relationship between each first data point and the reference point in the data space. In this case, the module that performs quantization and compression processing on the M first data points can be called a partitioning module, that is, it can divide the data space into different subspaces, or regions, based on the reference point.
[0347] Figure 9 This is a schematic diagram of the partitioning module provided in an embodiment of this application. It can be seen that the first device, based on the reference point indicated by the first indication information in the partitioning module, sets M first data... After performing data transformation on parameters x and y, the resulting information to be compressed is:
[0348] One possible scenario is that the first indication information is used to indicate the order of the M first data points. In this case, the module that performs quantization and compression processing on the M first data points can be called a sorting module, that is, it compresses the M first data points based on their order to obtain the first compression information.
[0349] Figure 10 This is a schematic diagram of the sorting module provided in an embodiment of this application. It can be seen that the first device sorts the M first data items according to the order of the M first data items indicated by the first indication information in the sorting module. After performing data transformation on the parameter θ, the first information to be compressed is obtained as follows:
[0350] One possible scenario is that the first indication information is used to indicate at least one of the following: at least one parameter corresponding to each second data point, the minimum value of each of the at least two parameters included in each second data point, or the quantization boundary or quantization bits of each second data point. In this case, the module that performs quantization and compression processing on the M first data points can be called a dynamic quantization module.
[0351] Figure 11 This is a schematic diagram of the dynamic quantization module provided in an embodiment of this application. It can be seen that the first device, based on the parameters indicated by the first indication information in the sorting module, processes M first pieces of information to be compressed. After data compression, the first compressed information is obtained.
[0352] It should be understood that the names of the above modules are merely examples and should not constitute any limitation on this application.
[0353] It should also be understood that the aforementioned partitioning module, sorting module, and dynamic quantization module can be used individually to compress the M first data points, or the three modules can be combined with each other, that is, some modules can be flexibly selected to compress the M first data points, etc. This application does not limit this.
[0354] For example, in Method 300, Design 1 uses the partitioning module alone to compress the M first data points; Design 2, for instance, combines the partitioning and sorting modules to process the quantization range of the M first data points. This balances data compression performance with the complexity of data compression.
[0355] Optionally, when the aforementioned partitioning module and sorting module are used alone, or when the partitioning module and sorting module are used in combination, after performing data transformation on the M first data based on the partitioning module and / or sorting module to obtain the information to be compressed, the information to be compressed can be further quantized and compressed based on the aforementioned fixed quantization method to obtain the first compressed information.
[0356] Figure 12 This is a schematic diagram illustrating the data processing using different module combinations provided in the embodiments of this application. Figure 12 (a) is a schematic diagram of how the partitioning module, sorting module and dynamic quantization module are used together to compress M first data to obtain the first compressed information; Figure 12 (b) in the diagram illustrates the first compressed information obtained after the partitioning module and the dynamic quantization module are used in combination to compress the M first data points. After receiving the first compressed information, the second device can perform operations such as inverse quantization and numerical transformation to recover the M first data points. It can be understood that the M first data points recovered by the second device are approximate values of the original M first data points.
[0357]
[0358] When different modules are used in combination, the method may optionally further include: a first device sending fourth indication information, which indicates the first indication information and the first compression information of each module. Correspondingly, a second device receives the fourth indication information.
[0359] It is understood that the first indication information of each module is one or more parameters indicated by the first indication information in the aforementioned method 300. For details, please refer to the relevant description of method 300, which will not be repeated here.
[0360] Optionally, the method further includes: a first device sending fourth configuration information. Correspondingly, a second device receiving the fourth configuration information. Alternatively, the second device sends the fourth configuration information, and correspondingly, the first device receives the fourth configuration information. The fourth configuration information is used to indicate a module, the module's configuration information, and a compression method, which includes: fixed quantization, or dynamic quantization.
[0361] The first device can determine, based on the modules indicated by the fourth configuration information, which modules to use for data compression of the M first data points, thereby obtaining the first compression information. Dynamic quantization is performed on the first data points using the dynamic quantization module. The configuration information of the modules refers to any one or more parameters indicated by the first, second, and third configuration information corresponding to the aforementioned three modules. For details, please refer to the relevant description of method 300, which will not be repeated here.
[0362] The following section will provide a detailed explanation by taking the sorting module and the dynamic quantization module as examples of processing M first data points separately.
[0363] Figure 13 This is another illustrative flowchart of the data processing method provided in the embodiments of this application. Figure 13 The method 1300 shown is based on Figure 3 Based on Method 300, this is another processing logic for the data processing method used independently by the sorting module. Method 1300 is based on Method 300 and is described in detail using the interaction between the first device and the second device as an example. The following description focuses on the steps that are different from those in Method 300. The explanations of the steps that are the same as those in Method 300 and the same terms can be found in the relevant descriptions above and will not be repeated here.
[0364] Figure 13 The data processing method 1300 shown may include steps 1310 to 1330. The various steps in method 1300 are described in detail below.
[0365] In step 1310, the first device compresses M first data to obtain second compression information. The M first data include the i-th first data and the (i+1)-th first data. The compression information of the second parameter in the (i+1)-th first data is determined based on the difference between the value of the second parameter in the i-th first data and the value of the second parameter in the (i+1)-th first data.
[0366] The second parameter is one of the N parameters of the first data. This second parameter can be determined based on the priority of the N parameters, or it can be determined based on the data range of the N parameters.
[0367] For details regarding the second parameter and the compression information of the (i+1)th first data based on the i-th first data and the (i+1)-th first data, please refer to the detailed explanation in method 300, which will not be repeated here.
[0368] For example, the second parameter is parameter θ, and M first data. After the data is transformed by the sorting module, the information to be compressed can be obtained. After the first device performs data transformation on the M first data points based on the second parameter, it can further quantize and compress the M first data points to obtain second compressed information. For example, the M first data points can be quantized and compressed based on the fixed quantization method described above. For details on quantizing and compressing the M first data points based on the fixed quantization method, please refer to the detailed explanation in method 300, which will not be repeated here.
[0369] It can be understood that after sequentially transforming the second parameter of each of the M first data points, the quantization range of the second parameter in those M first data points is smaller than the quantization range of the M first data points when the second parameter is compressed without sequentially transforming the M first data points. In other words, the quantization range of the second parameter in the first data points becomes smaller after sequentially transforming the M first data points. Therefore, when quantizing and compressing the M first data points, the quantization bits of the second parameter in the first data points can be reduced, thereby reducing data transmission overhead.
[0370] In step 1320, the first device sends the second compression information and the second indication information, the second indication information being used to indicate the order of the M first data items. Correspondingly, the second device receives the second compression information and the second indication information.
[0371] The first device can perform data transformation and quantization compression on the second parameter in each of the M first data based on the order of the M first data, thereby reducing the quantization range of the second parameter in the M first data and correspondingly reducing the quantization bits of the M first data, thereby reducing transmission overhead.
[0372] For details regarding the order of the M first data points, please refer to the detailed explanation in Method 300, which will not be repeated here.
[0373] In step 1330, the second device recovers the M first data based on the second compression information and the second indication information.
[0374] After receiving the second compressed information and the second indication information, the second device can perform operations such as inverse quantization and numerical transformation on the second compressed information based on the parameters indicated by the second indication information, thereby recovering the M first data points. In other words, it can reconstruct the M first data points.
[0375] It is understandable that the reconstructed M first data are approximations of the original M first data.
[0376] Optionally, the method further includes: the first device sending or receiving second configuration information. The second configuration information is used to indicate that the second parameter is determined based on the priority of N parameters, or that the second parameter is determined based on the data range of the N parameters. Accordingly, the second device receives or sends the second configuration information.
[0377] For details regarding the second configuration information, please refer to the detailed explanation in Method 300, which will not be repeated here.
[0378] Based on the above technical solution, a second parameter is determined from N parameters of the first data. Based on the difference between the second parameters of two adjacent first data points in M first data points, the second parameter in one of the first data points is compressed, thereby improving the data compression rate and reducing data transmission overhead. Furthermore, when quantizing the M first data points, the quantization range of the second parameter in the M first data points can be reduced, allowing for a decrease in the number of quantization bits during quantization, thus reducing data transmission overhead.
[0379] Figure 14 This is another illustrative flowchart of the data processing method provided in the embodiments of this application. Figure 14 The method 1400 shown is based on Figure 3 Based on Method 300, this is another processing logic for the data processing method used independently by the dynamic quantization module. Method 1400 is based on Method 300 and is described in detail using the interaction between the first device and the second device as an example. The following description focuses on the steps that are different from those in Method 300. The explanations of the steps that are the same as those in Method 300 and the same terms can be found in the relevant descriptions above and will not be repeated here.
[0380] Figure 14 The data processing method 1400 shown may include steps 1410 to 1430. The various steps in method 1400 are described in detail below.
[0381] In step 1410, the first device compresses the second data based on the quantization bits of each second data to obtain third compressed information. The second data includes at least one parameter of each of the M first data, and the quantization bits of the second data are determined based on the maximum and minimum values of the at least one parameter included in the second data.
[0382] Optionally, the third indication information is also used to indicate at least one parameter corresponding to each second data.
[0383] Optionally, the third indication information is also used to indicate the minimum value of each of the at least two parameters included in each second data.
[0384] For details regarding the third instruction information and the data compression of the M first data points by the first device based on the parameters indicated by the third instruction information to obtain the third compressed information, please refer to the detailed explanation in method 300, which will not be repeated here.
[0385] In step 1420, the first device sends the third compression information and the third indication information. Correspondingly, the second device receives the third compression information and the third indication information.
[0386] The third indication information is used to indicate at least one of the following: at least one parameter corresponding to each second data, the minimum value of each of the at least two parameters included in each second data, and the quantization boundary or quantization bit of each second data.
[0387] In step 1430, the second device recovers the M first data based on the third compression information and the third indication information.
[0388] After receiving the third compressed information and the third indication information, the second device can perform operations such as inverse quantization on the third compressed information based on the parameters indicated by the third indication information, thereby recovering M first data points, or reconstructing M first data points. It can be understood that the recovered M first data points are approximate values of the original M first data points.
[0389] Optionally, the method further includes: the first device sending third configuration information, and correspondingly, the second device receiving the third configuration information. Alternatively, the second device sends the third configuration information, and correspondingly, the first device receives the third configuration information.
[0390] The third configuration information is used to indicate one or more of the following: the second data includes a parameter of each of the M first data, or the second data includes at least two third data, each of the third data including a parameter of each of the M first data, and the similarity between the at least two third data is greater than or equal to a preset value; or, whether to indicate the quantization bits of each second data.
[0391] It is understood that the method of compressing the first data in method 300 by combining the dynamic quantization module with other modules is the same as the method of compressing the first data by using the dynamic quantization module alone in method 1400. For details on the data compression of the first data based on the third indication information and the third configuration information, please refer to the relevant description in method 300, which will not be repeated here.
[0392] Based on the above technical solution, by dividing the parameters of the first data into different second data, each second data including at least one parameter of the first data, and compressing the second data based on the quantization bits of the at least one parameter included in each second data group, the quantization range of the M first data can be further reduced. Furthermore, by determining the quantization bits of each second data based on its quantization range, the number of quantization bits can be further reduced, thereby reducing data transmission overhead.
[0393] Figure 15 This is a simulation diagram illustrating the quantization of first data based on different quantization methods proposed in this application. Taking 13 first data as an example, ① represents quantization compression of 13 first data based on a fixed quantization method, with a quantization bit range of 5 to 8 bits; ② represents quantization compression of 13 first data based on a dynamic quantization method (denoted as M3), with a quantization bit range of 1 to 8 bits; ③ represents quantization compression of 13 first data based on the original arrangement, sorting module (denoted as M2) and dynamic quantization module in the partitioning module (denoted as M1), with a quantization bit range of 1 to 8 bits; ④ represents quantization compression of 13 first data based on the partition arrangement, sorting module and dynamic quantization module in the partitioning module, with a quantization bit range of 1 to 8 bits.
[0394] Figure 15 (a) shows a simulation diagram of the first data based on the center point and range, that is, each first data point is represented as
[0395]
[0396] The horizontal axis represents the bitrate in bytes (B), and the vertical axis represents the NMSE (Number of Mean Sequences). Figure 15 As can be seen from (a) above, when the NMSE is the same, the bitrate of the method shown in ④ is 26% lower than that of the method shown in ① above; and the bitrate of the method shown in ④ is 14% lower than that of the method shown in ② above.
[0397] Figure 15 Figure (b) shows a simulation diagram illustrating the representation of the first data based on multiple vertex coordinates, where each piece of first data is represented as {x1, y1, z1, x2-x1, y2-y1, z2-z1, x3-x1, y3-y1, z3-z1}. The horizontal axis represents the bit rate in bits, and the vertical axis represents the NMSE (Number of Mean Squared Equations). Figure 15 As can be seen from (b) above, when the NMSE is the same, the bitrate of the method shown in ④ is reduced by 20% compared to the method shown in ① above; and the bitrate of the method shown in ④ is reduced by 8% compared to the method shown in ② above.
[0398] In summary, by processing the first data using the data processing method provided in this application embodiment, the quantization range of the first data can be reduced, thereby reducing the quantization bits and the data transmission overhead.
[0399] The methods provided in the embodiments of this application have been described in detail above with reference to several accompanying drawings. The apparatus provided in the embodiments of this application will now be described with reference to the accompanying drawings.
[0400] Figures 16 to 19 These are schematic block diagrams illustrating possible apparatuses provided for embodiments of this application. These apparatuses can be used to implement the functions of the first or second device in the above method embodiments, and thus also achieve the beneficial effects of the above method embodiments. In embodiments of this application, the apparatus may be as follows: Figure 3 , Figure 13 and Figure 14 The first or second device in the method embodiment shown may also be a component (such as a chip, chip system, processor, etc.) configured in the first or second device, or a logic module or software capable of implementing some or all of the functions of the first or second device.
[0401] The device provided in this application is as follows: Figure 16 As shown, the device 1600 includes a transceiver unit 1610 and a processing unit 1620.
[0402] One possible design is that device 1600 is used to achieve the above. Figure 3 The method embodiment shown illustrates the function of the first device. For example, the device 1600 may correspond to... Figure 3 The first device in the process.
[0403] For example, the processing unit 1620 is used to compress the M first data to be compressed based on the reference point in the data space to obtain first compression information; the transceiver unit 1610 is used to send the first compression information and the first indication information, the first indication information being used to indicate: the positional relationship between the reference point and each first data in the data space and the reference point, or the positional relationship between each first data in the data space and the reference point.
[0404] Optionally, the first dimension of the reference point corresponds to the first parameter in the first data, and the compression information of the first parameter in each piece of first data is determined based on the difference between the value of the first dimension of the reference point and the value of the first parameter.
[0405] Optionally, the reference point is the center point of the first space, in which the M first data are collected; or, the reference point is determined based on the first dimension of the M first data.
[0406] Optionally, the dimension of the reference point is less than or equal to the number of parameters of the first data.
[0407] Optionally, the data space includes multiple subspaces, which are determined based on the reference point; the first indication information includes indication information corresponding to each of the M first data, each indication information indicating the subspace to which the corresponding first data belongs; or, the first indication information includes indication information corresponding to each of the multiple subspaces, each indication information indicating the first data included in the corresponding subspace; or, the first indication information includes the number of first data in each subspace.
[0408] Optionally, the transceiver unit 1610 is further configured to send or receive first configuration information, which indicates any one or more of the following: the dimension of the reference point; the reference point being the center point of a first space or the reference point being determined based on first parameters of M first data; and the indication form of the first indication information when the data space includes multiple subspaces.
[0409] Optionally, the M first data include the i-th first data and the (i+1)-th first data, and the compression information of the second parameter in the (i+1)-th first data is determined based on the difference between the value of the second parameter in the i-th first data and the value of the second parameter in the (i+1)-th first data; the first indication information is also used to indicate the second parameter.
[0410] Optionally, the value of the second parameter in the i-th first data is less than the value of the second parameter in the (i+1)-th first data.
[0411] Optionally, the data space includes multiple subspaces, the i-th first data is the first data in the first subspace with the smallest value of the second parameter, and the (i+1)-th first data is the first data in the second subspace with the smallest value of the second parameter; the first indication information is also used to indicate the order of the multiple subspaces.
[0412] Optionally, each first data point includes N parameters; the second parameter is determined based on the priority of the N parameters, or the second parameter is determined based on the data range of the N parameters.
[0413] Optionally, the transceiver unit 1610 is further configured to send or receive second configuration information, which is used to indicate that the second parameter is determined based on the priority of the N parameters, or that the first parameter is determined based on the data range of the N parameters.
[0414] Optionally, the processing unit 1620 is further configured to perform data transformation on the M first data to be compressed based on the reference point to obtain at least one second data, each second data including at least one parameter of the first data; the processing unit 1620 is further configured to perform data compression on the second data based on the quantization bits of each second data to obtain the first compression information, the quantization bits being determined based on the maximum and minimum values of each parameter among the at least one parameter in the corresponding second data; the first indication information is further configured to indicate at least one of the following: at least one parameter corresponding to each second data, the minimum value of each parameter among the at least two parameters included in each second data, the quantization boundary or quantization bits of each second data.
[0415] Optionally, the second data includes at least two third data, each third data including a third parameter of each of the M first data, and the similarity between the at least two third data is greater than or equal to a preset value.
[0416] Optionally, the transceiver unit 1610 is further configured to send or receive third configuration information, which indicates one or more of the following: the second data includes a parameter of each of the M first data, or the second data includes at least two third data, each of the third data including a parameter of each of the M first data, and the similarity between the at least two third data is greater than or equal to a preset value; and whether to indicate the quantization bits of each second data.
[0417] One possible design is that device 1600 is used to achieve the above. Figure 3 The function of the second device in the method embodiment shown. For example, the device 1600 may correspond to... Figure 3 The second device in the system.
[0418] For example, the transceiver unit 1610 is used to receive first compression information and first indication information. The first indication information is used to indicate: the positional relationship between a reference point in the data space and each of the M first data to be compressed and the reference point in the data space, or the positional relationship between each of the first data and the reference point in the data space. The first compression information is obtained by compressing the M first data to be compressed based on the reference point. The processing unit 1620 is used to recover the M first data based on the first compression information and the first indication information.
[0419] Optionally, the first dimension of the reference point corresponds to the first parameter in the first data, and the compression information of the first parameter in each piece of first data is determined based on the difference between the value of the first dimension of the reference point and the value of the first parameter.
[0420] Optionally, the reference point is the center point of the first space, in which the M first data are collected; or, the reference point is determined based on the first parameters of the M first data.
[0421] Optionally, the dimension of the reference point is less than or equal to the number of parameters of the first data.
[0422] Optionally, the data space includes multiple subspaces, which are determined based on the reference point; the first indication information includes indication information corresponding to each of the M first data, each indication information indicating the subspace to which the corresponding first data belongs; or, the first indication information includes indication information corresponding to each of the multiple subspaces, each indication information indicating the first data included in the corresponding subspace; or, the first indication information includes the number of first data in each subspace.
[0423] Optionally, the transceiver unit 1610 is further configured to send or receive first configuration information, which indicates any one or more of the following: the dimension of the reference point; the reference point being the center point of a first space or the reference point being determined based on first parameters of M first data; and the indication form of the first indication information when the data space includes multiple subspaces.
[0424] Optionally, the M first data include the i-th first data and the (i+1)-th first data, and the compression information of the second parameter in the (i+1)-th first data is determined based on the difference between the value of the second parameter in the i-th first data and the value of the second parameter in the (i+1)-th first data; the first indication information is also used to indicate the second parameter.
[0425] Optionally, the value of the second parameter in the i-th first data is less than the value of the second parameter in the (i+1)-th first data.
[0426] Optionally, the data space includes multiple subspaces, the i-th first data is the first data in the first subspace with the smallest value of the second parameter, and the (i+1)-th first data is the first data in the second subspace with the smallest value of the second parameter; the first indication information is also used to indicate the order of the multiple subspaces.
[0427] Optionally, each first data point includes N parameters; the second parameter is determined based on the priority of the N parameters, or the second parameter is determined based on the data range of the N parameters.
[0428] Optionally, the transceiver unit 1610 is further configured to send or receive second configuration information, which is used to indicate that the second parameter is determined based on the priority of the N parameters, or that the first parameter is determined based on the data range of the N parameters.
[0429] Optionally, the processing unit 1620 is further configured to recover at least one second data based on the first compression information and the quantization bits of each second data, wherein each second data includes at least one parameter of the first data, and the quantization bits are determined based on the maximum and minimum values of each parameter in the corresponding second data; the processing unit 1620 is further configured to recover the M first data based on the second compression information and the reference point; the first indication information is further configured to indicate at least one of the following: at least one parameter corresponding to each second data, the minimum value of each of the at least two parameters included in each second data, the quantization boundary or quantization bits of each second data.
[0430] Optionally, the second data includes at least two third data, each third data including a third parameter of each of the M first data, and the similarity between the at least two third data is greater than or equal to a preset value.
[0431] Optionally, the transceiver unit 1610 is further configured to send or receive third configuration information, which indicates one or more of the following: the second data includes a parameter of each of the M first data, or the second data includes at least two third data, each of the third data including a parameter of each of the M first data, and the similarity between the at least two third data is greater than or equal to a preset value; and whether to indicate the quantization bits of each second data.
[0432] One possible design is that device 1600 is used to achieve the above. Figure 13 The method embodiment shown illustrates the function of the first device. For example, the device 1600 may correspond to... Figure 13 The first device in the process.
[0433] For example, the processing unit 1620 is used to compress M first data to obtain second compression information. The M first data include the i-th first data and the (i+1)-th first data. The compression information of the second parameter in the (i+1)-th first data is determined based on the difference between the value of the second parameter in the i-th first data and the value of the second parameter in the (i+1)-th first data. The transceiver unit 1610 is used to send the second compression information and the second indication information, which is used to indicate the second parameter.
[0434] Optionally, the value of the second parameter in the i-th first data is less than the value of the second parameter in the (i+1)-th first data.
[0435] Optionally, the data space includes multiple subspaces, the i-th first data is the first data with the smallest value of the second parameter in the first subspace, and the (i+1)-th first data is the first data with the smallest value of the second parameter in the second subspace; the second indication information is used to indicate the order of the multiple subspaces.
[0436] Optionally, each first data point includes N parameters; the second parameter is determined based on the priority of the N parameters, or the second parameter is determined based on the data range of the N parameters.
[0437] Optionally, the transceiver unit 1610 is further configured to send or receive second configuration information, which is used to indicate that the second parameter is determined based on the priority of the N parameters, or that the second parameter is determined based on the data range of the N parameters.
[0438] One possible design is that device 1600 is used to achieve the above. Figure 13 The function of the second device in the method embodiment shown. For example, the device 1600 may correspond to... Figure 13 The second device in the system.
[0439] For example, the transceiver unit 1610 is used to receive second compression information and second indication information. The second indication information is used to indicate a second parameter. The M first data include the i-th first data and the (i+1)-th first data. The compression information of the second parameter in the (i+1)-th first data is determined based on the difference between the value of the second parameter in the i-th first data and the value of the second parameter in the (i+1)-th first data. The second compression information is obtained by compressing the M first data. The processing unit 1620 is used to recover the M first data based on the second compression information and the second indication information.
[0440] Optionally, the value of the second parameter in the i-th first data is less than the value of the second parameter in the (i+1)-th first data.
[0441] Optionally, the data space includes multiple subspaces, the i-th first data is the first data with the smallest value of the second parameter in the first subspace, and the (i+1)-th first data is the first data with the smallest value of the second parameter in the second subspace; the second indication information is used to indicate the order of the multiple subspaces.
[0442] Optionally, each first data point includes N parameters; the second parameter is determined based on the priority of the N parameters, or the second parameter is determined based on the data range of the N parameters.
[0443] Optionally, the transceiver unit 1610 is further configured to send or receive second configuration information, which is used to indicate that the second parameter is determined based on the priority of the N parameters, or that the second parameter is determined based on the data range of the N parameters.
[0444] One possible design is that device 1600 is used to achieve the above. Figure 14 The method embodiment shown illustrates the function of the first device. For example, the device 1600 may correspond to... Figure 14 The first device in the process.
[0445] For example, the processing unit 1620 is used to compress the second data based on the quantization bits of each second data to obtain third compression information. The second data includes at least one parameter of each of the M first data. The quantization bits of the second data are determined based on the maximum and minimum values of the at least one parameter included in the second data. The transceiver unit 1610 is used to send the third compression information and third indication information. The third indication information is used to indicate at least one of the following: at least one parameter corresponding to each second data, the minimum value of each of the at least two parameters included in each second data, and the quantization boundary or quantization bits of each second data.
[0446] Optionally, the second data includes at least two third data, each third data including a parameter of each of the M first data, and the similarity between the at least two third data is greater than or equal to a preset value.
[0447] Optionally, the transceiver unit 1610 is further configured to send or receive third configuration information, which indicates one or more of the following: the second data includes a parameter of each of the M first data, or the second data includes at least two third data, each of the third data including a third parameter of each of the M first data, and the similarity between the at least two third data is greater than or equal to a preset value; and whether to indicate the quantization bits of each second data.
[0448] One possible design is that device 1600 is used to achieve the above. Figure 14 The function of the second device in the method embodiment shown. For example, the device 1600 may correspond to... Figure 14 The second device in the system.
[0449] For example, the transceiver unit 1610 is configured to receive third compression information and third indication information, the third indication information being configured to indicate at least one of the following: at least one parameter corresponding to each second data, the maximum and / or minimum value of each parameter among the at least one parameter included in each second data, the quantization boundary or quantization bits of each second data, the second data including at least one parameter of each of M first data, the quantization bits of the second data being determined based on the maximum and minimum values of each parameter among the at least one parameter included in the second data, and the third compression information being obtained by compressing the second data based on the quantization bits of each second data; the processing unit 1620 is configured to recover the M first data based on the third compression information and the third indication information.
[0450] Optionally, the second data includes at least two third data, each third data including a parameter of each of the M first data, and the similarity between the at least two third data is greater than or equal to a preset value.
[0451] Optionally, the transceiver unit 1610 is further configured to send or receive third configuration information, which indicates one or more of the following: the second data includes a parameter of each of the M first data, or the second data includes at least two third data, each of the third data including a third parameter of each of the M first data, and the similarity between the at least two third data is greater than or equal to a preset value; and whether to indicate the quantization bits of each second data.
[0452] For a more detailed description of the transceiver unit 1610 and the processing unit 1620 mentioned above, please refer to [link / reference needed]. Figure 3 , Figure 13 or Figure 14 The relevant descriptions in any of the embodiments shown are directly obtained and will not be repeated here.
[0453] In one possible design, when the device 1600 is a network device or a communication module within a network device, the functionality of the processing unit 1620 can be implemented by one or more processors. Specifically, the processor may include a modem chip, or a system-on-a-chip (SoC) or SIP chip containing a modem core. The functionality of the transceiver unit 1610 can be implemented by transceiver circuitry.
[0454] In one possible design, when the device 1600 is a circuit or chip responsible for communication functions in a network device, such as a modem chip or a system-on-a-chip (SoC) or SIP chip containing a modem core, the function of the processing unit 1620 can be implemented by a circuit system in the aforementioned chip that includes one or more processors or processor cores. The function of the transceiver unit 1610 can be implemented by interface circuitry or data transceiver circuitry on the aforementioned chip.
[0455] It should also be understood that the transceiver unit in the communication device 1600 can also be called a communication unit. The transceiver unit 1610 may include a transmitting unit but not a receiving unit. Alternatively, the transceiver unit 1610 may include a receiving unit but not a transmitting unit. Specifically, it depends on whether the above-described scheme performed by the device 1600 includes both transmitting and receiving actions. The receiving unit can be used to perform the receiving action in the above-described scheme, and the transmitting unit can be used to perform the transmitting action in the above-described scheme.
[0456] It is understood that the division of units in the above-described device is merely a logical functional division. Each function can correspond to a functional unit, or two or more functions can be integrated into one functional unit. In actual implementation, all or some units can be integrated into a single physical entity, or they can be distributed across different physical entities. Furthermore, the aforementioned functional units can be implemented in hardware, software, or a combination of both. Whether a function is executed in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.
[0457] Figure 17 This is another schematic block diagram of the device provided in the embodiments of this application. For example... Figure 17 As shown, device 1700 includes one or more processors 1710. The processor 1710 can be a general-purpose processor or a dedicated processor, such as a baseband processor or a central processing unit. The baseband processor can be used to process communication protocols and communication data, while the central processing unit can be used to control the device (e.g., a vehicle or a chip), execute software programs, and process data from the software programs.
[0458] Optionally, in one design, processor 1710 may include a computer program (also referred to as code or instructions) that can be executed on processor 1710, causing device 1700 to perform the method performed by the first or second device in the above method embodiments. In yet another possible design, device 1700 includes circuitry (…). Figure 17(Not shown), this circuit is used to implement the function of the first or second device in the above method embodiments.
[0459] For example, processor 1710 can be used to execute a computer program in memory to achieve Figure 3 , Figure 13 or Figure 14 The steps performed by the first or second device in the illustrated method embodiment.
[0460] Optionally, the device 1700 may include one or more memories 1720 storing computer programs (sometimes referred to as code or instructions) that can be run on the processor 1710, causing the device 1700 to perform the methods performed by the first or second device in the above embodiments.
[0461] Optionally, the processor 1710 and / or memory 1720 may also store data. The processor and memory may be configured separately or integrated together.
[0462] Optionally, the device 1700 may also include a communication interface 1730. The processor 1710, sometimes referred to as a processing unit, controls the device (e.g., a terminal or network device). The communication interface 1730, sometimes referred to as a transceiver unit, transceiver, transceiver circuit, or transceiver, is used to implement the device's transceiver functions; for example, the communication interface 1730 can be used to receive first instruction information.
[0463] Optionally, the device 1700 also includes a communication interface 1730. The processor 1710 and the communication interface 1730 are coupled to each other. It is understood that the communication interface 1730 can be a transceiver or an input / output interface.
[0464] When device 1700 is used to achieve Figure 3 , Figure 13 or Figure 14 In the method shown, processor 1710 can be used to execute the functions of processing unit 1620, and communication interface 1730 can be used to execute the functions of transceiver unit 1610. Whether communication interface 1730 is used for sending or receiving depends on whether the device 1700 is used to perform a sending or receiving operation in the execution scheme.
[0465] When the aforementioned device 1700 is a chip applied to the first device, the chip implements the functions of the first device in the above method embodiments. The chip of the first device receives signals from other modules (such as radio frequency modules or antennas) in the first device, and these signals may be sent to the first device by the second device; or, the chip of the first device sends signals to other modules (such as radio frequency modules or antennas) in the first device, and these signals may be sent to the second device by the first device.
[0466] When the aforementioned device 1700 is a chip applied to the second device, the chip implements the functions of the second device in the above method embodiments. The chip of the second device receives signals from other modules in the second device, which may be signals sent from the first device to the second device; or, the chip of the second device sends signals to other modules in the second device, which may be signals sent from the second device to the first device.
[0467] It is understood that when the device 1700 is a first device or a second device, the communication interface 1730 can be a transceiver, specifically including a transmitter and a receiver, with the transmitter used to send signals and the receiver used to receive signals. When the device 1700 is a chip applied to the first device or a receiving network device, the communication interface 1730 can be an input / output circuit, wherein the input circuit can be used for receiving and the output interface can be used for sending.
[0468] Optionally, the device 1700 also includes a power supply circuit for supplying power to the device 1700.
[0469] Figure 18 This is a schematic diagram of the structure of the terminal device provided in the embodiments of this application. For example... Figure 18 As shown, the terminal device 1800 can be applied to, for example... Figure 2 In the system shown, the following is executed: Figure 3 , Figure 13 or Figure 14 The illustrated method embodiment demonstrates the function of the first or second device. As shown, the terminal device 1800 includes a processor 1801 and a transceiver 1802. Optionally, the terminal device 1800 also includes a memory 1803. The processor 1801, transceiver 1802, and memory 1803 can communicate with each other via internal connections to transmit control and / or data signals. The memory 1803 stores computer programs, and the processor 1801 retrieves and runs these programs from the memory 1803 to control the transceiver 1802 to transmit and receive signals. Optionally, the terminal device 1800 may also include an antenna 1804 for transmitting uplink data or uplink control signaling output by the transceiver 1802 via wireless signals.
[0470] The processor 1801 and memory 1803 can be combined into a single processing device. The processor 1801 executes the program code stored in the memory 1803 to achieve the aforementioned functions. In specific implementations, the memory 1803 can be integrated into the processor 1801 or independent of it. The processor 1801 can be combined with... Figure 16 The processing unit or Figure 17 The processor corresponds to that in the system.
[0471] The transceiver 1802 described above can be used with Figure 16 The transceiver unit or Figure 17 The communication interface corresponds to that in the diagram. Transceiver 1802 may include a receiver (or receiver circuit) and a transmitter (or transmitter circuit). The receiver is used to receive signals, and the transmitter is used to transmit signals.
[0472] It should be understood that Figure 18 The terminal device 1800 shown can achieve Figure 3 , Figure 13 or Figure 14 The methods illustrated in the embodiments involve various processes of the first or second device. The operations and / or functions of the various modules in the terminal device 1800 are respectively for implementing the corresponding processes in the above method embodiments. For details, please refer to the descriptions in the above method embodiments; to avoid repetition, detailed descriptions are appropriately omitted here.
[0473] The processor 1801 described above can be used to execute the actions implemented internally by the first device or the second device as described in the preceding method embodiments, while the transceiver 1802 can be used to execute the actions described in the preceding method embodiments of sending data from the first device to the second device or receiving data from the first device. For details, please refer to the descriptions in the preceding method embodiments; they will not be repeated here.
[0474] Optionally, the terminal device 1800 may also include a power supply 1805 for providing power to various devices or circuits in the terminal.
[0475] In addition, to make the terminal device more functional, the terminal device 1800 may also include one or more of the following: an input unit 1806, a display unit 1807, an audio circuit 1808, a camera 1809, and a sensor 1810. The audio circuit may also include a speaker 1808a, a microphone 1808b, etc.
[0476] Figure 19 This is a schematic diagram of the network device provided in the embodiments of this application, for example, a schematic diagram of a base station. The base station 1900 can be applied to, for example... Figure 2 In the system shown, the following is executed: Figure 3 , Figure 13 or Figure 14 The illustrated method embodiment demonstrates the functions of the first or second device. As shown, the base station 1900 may include one or more of the following: one or more (DU+RU) 1910s and one or more CUs 1920s. CUs 1920 can communicate with the next-generation core (NG core). The DU may include at least one antenna 1911, at least one radio frequency unit 1912, at least one processor 1913, and at least one memory 1914. The DU is primarily used for transmitting and receiving radio frequency signals, converting radio frequency signals to baseband signals, and performing some baseband processing. CUs 1920 may include at least one processor 1922 and at least one memory 1921. CUs 1920 and DUs can communicate via an interface. The control plane (CP) interface can be Fs-C, such as F1-C, and the user plane (UP) interface can be Fs-U, such as F1-U. DUs and RUs can cooperate to implement the functions of the PHY layer. A DU can be connected to one or more RUs. The functions of the DUs and RUs can be configured in various ways according to the design. For example, a DU is configured to implement baseband functions, and an RU is configured to implement mid-RF functions. As another example, a DU is configured to implement higher-level functions in the PHY layer, and an RU is configured to implement lower-level and RF functions in the PHY layer. Higher-level functions in the PHY layer may include a portion of the PHY layer's functionality closer to the MAC layer, while lower-level functions in the PHY layer may include another portion of the PHY layer's functionality closer to the mid-RF side.
[0477] The CU 1920 is primarily used for baseband processing and base station control. The DU and CU 1920 can be physically installed together or separately, i.e., a distributed base station. The CU 1920 serves as the control center of the base station and can correspond to... Figure 16 The processing unit or Figure 17 The processor in the unit, also known as a processing unit, is mainly used to perform baseband processing functions. For example, the CU 1920 can be used to control the base station to execute the operation flow of the first or second device in the above method embodiments.
[0478] Specifically, baseband processing on the CU and DU can be divided according to the protocol layers of the wireless network. For example, the functions of the Packet Data Convergence Protocol (PDCP) layer and above are set in the CU, while the functions of protocol layers below PDCP, such as the Radio Link Control (RLC) layer and the MAC layer, are set in the DU. Alternatively, the CU may implement the functions of the RRC and PDCP layers, while the DU may implement the functions of the RLC, MAC, and PHY layers.
[0479] Alternatively, the base station 1900 may include one or more radio frequency units (RUs), one or more DUs, and one or more CUs. A DU may include at least one processor 1913 and at least one memory 1914, an RU may include at least one antenna 1911 and at least one radio frequency unit 1912, and a CU may include at least one processor 1922 and at least one memory 1921.
[0480] In one example, the CU 1920 can be composed of one or more boards. These boards can collectively support a single access-indicating radio access network (such as a 5G network), or they can each support radio access networks with different access standards (such as LTE, 5G, or other networks). The memory 1921 and processor 1922 can serve one or more boards. That is, each board can have its own memory and processor, or multiple boards can share the same memory and processor. Furthermore, each board can also have necessary circuitry. Similarly, the DU can be composed of one or more boards. These boards can collectively support a single access-indicating radio access network (such as a 5G network), or they can each support radio access networks with different access standards (such as LTE, 5G, or other networks). The memory 1914 and processor 1913 can serve one or more boards. That is, each board can have its own memory and processor, or multiple boards can share the same memory and processor. Furthermore, each board can also have necessary circuitry.
[0481] It should be understood that Figure 19 The base station 1900 shown can achieve Figure 3 , Figure 13 or Figure 14 The methods illustrated in the embodiments involve various processes of the first or second device. The operations and / or functions of the various modules in the base station 1900 are respectively for implementing the corresponding processes in the above method embodiments. For details, please refer to the descriptions in the above method embodiments; to avoid repetition, detailed descriptions are appropriately omitted here.
[0482] It should be understood that Figure 19The base station 1900 shown is merely one possible architecture for network devices and should not be construed as limiting this application. The method provided in this application can be applied to network devices with other architectures, such as network devices including CU, DU, and AAU. This application does not limit the specific architecture of the network device.
[0483] It should be understood that Figure 19 This is for illustrative purposes only and not a limitation; network devices may not rely on this. Figure 19 The structure shown is different. For example, a network device may also include an AAU, a CU, and / or a DU, or a BBU and an adaptive radio unit (ARU). This application does not limit this.
[0484] The aforementioned CU and / or DU can be used to perform the actions described in the preceding method embodiments, which are implemented internally by the first device or the second device, while the AAU can be used to perform the actions described in the preceding method embodiments, whereby the second device sends data to the first device or the first device receives data from the second device. For details, please refer to the descriptions in the preceding method embodiments; they will not be repeated here.
[0485] It should be noted that the above method embodiments can be applied to a processor, or implemented by a processor. A processor may be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above method embodiments can be completed by integrated logic circuits in the processor's hardware or by software instructions.
[0486] The aforementioned processor can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or any combination thereof. A general-purpose processor can be a microprocessor or any conventional processor.
[0487] The steps of the method disclosed in the embodiments of this application can be directly manifested as being executed by a hardware decoding processor, or executed by a combination of hardware and software modules in the decoding processor. The software modules can reside in mature storage media in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, or registers. This storage medium is located in memory, and the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above method.
[0488] The memory in this application embodiment can be volatile memory or non-volatile memory, or it can include both volatile and non-volatile memory. The non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. The volatile memory can be random access memory (RAM), which is used as an external cache. By way of example, but not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDRSDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous linked dynamic random access memory (SLDRAM), and direct rambus RAM (DR RAM). It should be noted that the memory used in the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.
[0489] This application also provides a chip system including at least one processor for supporting the implementation of the functions of the first or second device involved in any of the above method embodiments, such as receiving, sending, or processing information involved in the above methods.
[0490] In one possible design, the chip system also includes a memory for storing computer program instructions and data, which may be located inside or outside the processor.
[0491] The chip system can consist of chips or include chips and other discrete components.
[0492] This application also provides a computer program product comprising: a computer program (also referred to as code or instructions), which, when executed, Figure 3 , Figure 13 or Figure 14 In the illustrated embodiment, the method executed by the first device is executed, or the method executed by the second device is executed.
[0493] This application also provides a computer-readable storage medium storing a computer program (also referred to as code or instructions). When the computer program is run, Figure 3 , Figure 13 or Figure 14 In the illustrated embodiment, the method executed by the first device is executed, or the method executed by the second device is executed.
[0494] This application also provides a communication system, which includes the aforementioned first device and second device.
[0495] The methods provided in the above embodiments can be implemented, in whole or in part, by software, hardware, firmware, or any combination thereof. When implemented in software, they can be implemented, in whole or in part, in the form of a computer program product. This computer program product may include one or more computer instructions. When these computer program instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of this application are generated. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium may be any available medium accessible to a computer or a data storage device such as a server or data center that integrates one or more available media. The available medium may be a magnetic medium (e.g., floppy disk, hard disk, magnetic disk), an optical medium (e.g., DVD), or a semiconductor medium (e.g., solid-state disk (SSD)).
[0496] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.
[0497] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.
[0498] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.
[0499] The unit described as a separate component may or may not be physically separate. The component shown as a unit may or may not be a physical unit; that is, it may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.
[0500] In addition, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.
[0501] If this function is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, or part of it, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory, random access memory, magnetic disks, or optical disks.
Claims
1. A data processing method, characterized by, The method comprises: data compression on M first data to be compressed based on a reference point in a data space, to obtain first compression information; sending the first compression information and first indication information, the first indication information being used to indicate a positional relationship between the reference point and each of the first data in the data space, or a positional relationship between each of the first data and the reference point in the data space.
2. The method of claim 1, wherein, A first dimension of the reference point corresponds to a first parameter in the first data, and compression information of the first parameter in each of the first data is determined based on a difference between a value of the first dimension of the reference point and a value of the first parameter.
3. The method of claim 1, wherein, The reference point is a center point of a first space, and the M first data is obtained in the first space; or The reference point is determined based on first parameters of the M first data.
4. The method of any one of claims 1 to 3, wherein, The data space comprises a plurality of subspaces, and the plurality of subspaces is determined based on the reference point; The first indication information comprises indication information corresponding to each of the M first data, and each of the indication information is used to indicate a subspace to which the corresponding first data belongs; or The first indication information comprises indication information corresponding to each of the plurality of subspaces, and each of the indication information is used to indicate first data included in the corresponding subspace; or The first indication information comprises a quantity of first data in each of the subspaces.
5. The method of any one of claims 1 to 4, wherein, The M first data comprises an i-th first data and an i+1-th first data, compression information of a second parameter in the i+1-th first data is determined based on a difference between a value of the second parameter in the i-th first data and a value of the second parameter in the i+1-th first data, and the first indication information is further used to indicate the second parameter.
6. The method of claim 5, wherein, The value of the second parameter in the i-th first data is smaller than the value of the second parameter in the i+1-th first data.
7. The method of claim 5 or 6, wherein, The data space comprises a plurality of subspaces, the i-th first data is first data with a smallest value of the second parameter in a first subspace, and the i+1-th first data is first data with a smallest value of the second parameter in a second subspace, and the first indication information is further used to indicate an order of the plurality of subspaces.
8. The method of any one of claims 5 to 7, wherein, Each of the first data comprises N parameters; The second parameter is determined based on a priority of the N parameters, or the second parameter is determined based on a data range of the N parameters.
9. The method of any one of claims 1 to 8, wherein, The method comprises: data transformation on the M first data to be compressed based on the reference point, to obtain at least one second data, each of the second data comprising at least one parameter of the first data; data compression on the second data based on a quantization bit of each of the second data, to obtain the first compression information, the quantization bit being determined based on a maximum value and a minimum value of each of the at least one parameter in the corresponding second data; and The first indication information is further used for indicating at least one of the following: at least one parameter corresponding to each of the second data, a minimum value of each of at least two parameters included in each of the second data, a quantization boundary of each of the second data, and / or a quantization bit.
10. The method of claim 9, wherein, The second data includes at least two third data, each of the third data including a third parameter of each of the M first data, and a similarity between the at least two third data being greater than or equal to a preset value.
11. A data processing method, characterized by, The method comprises: receiving first compression information and first indication information, the first indication information being used for indicating a reference point in a data space and a positional relationship between the reference point and M first data to be compressed in the data space, or a positional relationship between each of the M first data and the reference point in the data space, the first compression information being obtained by performing data compression on the M first data to be compressed based on the reference point; based on the first compression information and the first indication information, restoring the M first data.
12. The method of claim 11, wherein, A first dimension of the reference point corresponds to a first parameter in the first data, and compression information of the first parameter in each of the first data is determined based on a difference between a value of the first dimension of the reference point and a value of the first parameter.
13. The method of claim 11, wherein, The reference point is a center point of a first space, and the M first data is obtained in the first space; or The reference point is determined based on a first parameter of the M first data.
14. The method of any one of claims 11 to 13, wherein, The data space includes a plurality of subspaces, and the plurality of subspaces is determined based on the reference point; The first indication information includes indication information corresponding to each of the M first data, and each of the indication information is used for indicating a subspace to which the corresponding first data belongs; or The first indication information includes indication information corresponding to each of the plurality of subspaces, and each of the indication information is used for indicating first data included in the corresponding subspace; or The first indication information includes a quantity of first data in each of the subspaces.
15. The method of any one of claims 11 to 14, wherein, The M first data includes an i-th first data and an i+1-th first data, compression information of a second parameter in the i+1-th first data is determined based on a difference between a value of the second parameter in the i-th first data and a value of the second parameter in the i+1-th first data, and the first indication information is further used for indicating the second parameter.
16. The method of claim 15, wherein, The value of the second parameter in the i-th first data is less than the value of the second parameter in the i+1-th first data.
17. The method of claim 15 or 16, wherein, The data space includes a plurality of subspaces, the i-th first data is first data with a minimum value of the second parameter in a first subspace, the i+1-th first data is first data with a minimum value of the second parameter in a second subspace, and the first indication information is further used for indicating an order of the plurality of subspaces.
18. The method of any one of claims 15 to 17, wherein, Each of the first data includes N parameters; The second parameter is determined based on a priority of the N parameters, or the second parameter is determined based on a data range of the N parameters.
19. The method of any one of claims 11 to 18, wherein, The recovering the M first data based on the first compression information and the first indication information comprises: recovering at least one second data based on the first compression information and a quantization bit of each second data, each second data comprising at least one parameter of the first data, the quantization bit being determined based on a maximum value and a minimum value of each parameter in the at least one parameter in the corresponding second data; recovering the M first data based on the at least one second data and a reference point; The first indication information is further used to indicate at least one of the following: the at least one parameter corresponding to each second data, a minimum value of each parameter in the at least two parameters comprised in each second data, a quantization boundary or a quantization bit of each second data.
20. The method of claim 19, wherein, The second data comprises at least two third data, each third data comprising a third parameter of each first data in the M first data, and a similarity between the at least two third data being greater than or equal to a preset value.
21. A communications device, characterized by A module for performing the method of any one of claims 1 to 10, or a module for performing the method of any one of claims 11 to 20.
22. A communications device, characterized by A communication device comprising one or more processors configured to execute a computer program or instructions in a memory, such that the communication device performs the method of any one of claims 1 to 10, or the method of any one of claims 11 to 20.
23. A computer readable storage medium having stored thereon a computer program, characterized in that, The computer program, when executed by a processor, causes the method of any one of claims 1 to 10 to be performed, or the method of any one of claims 11 to 20 to be performed.
24. A computer program product, characterised in that, A computer program which, when executed by a processor, causes the method of any one of claims 1 to 10 to be performed, or the method of any one of claims 11 to 20 to be performed.