Method and apparatus for transmitting compressed data

Abstract

Provided in the present application are a method and apparatus for transmitting compressed data. The method comprises: acquiring data to be compressed, wherein the data comprises multi-path data and / or non-multi-path data; a first apparatus compressing the data on the basis of a first mapping relationship, so as to obtain a compressed code stream; and outputting first information to a second apparatus, wherein the first information includes the compressed code stream, such that the second apparatus restores the compressed code stream on the basis of the first mapping relationship; the first mapping relationship indicates a first-priority part and a second-priority part of the data to be compressed; and the first-priority part corresponds to a first compression precision, the second-priority part corresponds to a second compression precision, and the first compression precision is higher than the second compression precision. By using the method, rational compression based on data characteristics can be implemented, thereby improving the data transmission efficiency.

Description

Method and apparatus for transmitting compressed data

[0001] The present application claims priority to the Chinese patent application No. 202410652821.7, filed on May 22, 2024, and entitled "Method and apparatus for transmitting compressed data", the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

[0002] The present application relates to the field of wireless communication, and in particular to a method and apparatus for transmitting compressed data. BACKGROUND

[0003] With the increasing richness of wireless communication application scenarios, a lot of data oriented to new scenarios will be generated in future wireless communication process, for example, data oriented to scenarios such as extreme immersive cloud VR, haptic multi-sensory communication, intelligent medical treatment, advanced automatic driving, high-precision positioning and tracking; these data have different requirements for transmission based on different scenarios. These data usually have characteristics such as large data volume, more redundancy, and existence of time / frequency / space correlation. At the same time, the data in many scenarios can accept a certain degree of lossy compression and transmission result, i.e., it is not necessary to recover the original data by 100%, so compression processing before sending the data is a conventional technical means in the field. However, considering the influence of different data on communication tasks or scenarios, for example, different multipaths in the wireless communication environment have different contributions to the task, and different streams have different importance after channel matrix transformation; how to develop a reasonable and efficient compression configuration strategy for specific data is a problem to be solved at present. SUMMARY

[0004] The present application provides a method and apparatus for transmitting compressed data, which is used to develop a reasonable and efficient compression strategy for data in different scenarios to improve the transmission efficiency of data.

[0005] In a first aspect, the present application provides a method for transmitting compressed data, which is applied to a first device and includes: obtaining to-be-compressed data, the to-be-compressed data including multipath data and / or non-multipath data; compressing the to-be-compressed data according to a first mapping relationship to obtain a compressed code stream; and outputting first information to a second device, the first information including the compressed code stream; wherein the first mapping relationship indicates a first priority part and a second priority part of the to-be-compressed data; the first priority part corresponds to a first compression accuracy, and the second priority part corresponds to a second compression accuracy; and the first compression accuracy is higher than the second compression accuracy.

[0006] By the above implementation, when the multipath and / or non-multipath data is compressed, a higher compression precision is adopted for the first priority part to ensure transmission precision, and a lower compression precision is adopted for the second priority part to ensure transmission efficiency, so that reasonable compression based on data characteristics is realized, that is, the importance of the data is taken into account while improving transmission efficiency.

[0007] In a possible implementation, the method further includes: generating the first mapping relationship; or, obtaining the first mapping relationship.

[0008] In a possible implementation, before the first mapping relationship is obtained, the method further includes: obtaining a first mapping relationship transmission configuration.

[0009] In a possible implementation, the first mapping relationship transmission configuration specifically includes: a transmission time-frequency resource configuration, a mapping table related configuration, and / or a SRC node and a DST node of data transmission.

[0010] In a possible implementation, the generating of the first mapping relationship specifically includes: generating the first mapping relationship according to data characteristics; wherein the data characteristics include at least one of the following: a path power of a reference point in an electromagnetic map area, a path delay of the reference point in the electromagnetic map area, a path angle of arrival of the reference point in the electromagnetic map area, and a path angle of departure of the reference point in the electromagnetic map area.

[0011] In a possible implementation, the first mapping relationship indicates a third priority part of the data to be compressed, and the third priority part corresponds to a third compression precision.

[0012] In a possible implementation, the number of priority parts is determined by at least one of the following: negotiation with the second device by using upper layer signaling; or, protocol agreement; or, determination by the first device.

[0013] In a possible implementation, the method further includes: after the number of priority parts is determined, the generating of the first mapping relationship specifically includes any one or more of the following: generation based on a specific threshold; or, generation based on the number of different priority parts; or, generation based on the proportion of different priority parts; or, generation based on a specific pattern; or, generation based on a reference point attribute.

[0014] In a possible implementation, the compressed code streams corresponding to different priority parts are transmitted at different times.

[0015] In a possible implementation, the compressed code streams corresponding to the different priority parts are transmitted in different time sequences, specifically including: first transmitting the compressed code streams corresponding to the high-priority parts, and then transmitting the compressed code streams corresponding to the low-priority parts; or, first transmitting the compressed code streams corresponding to the low-priority parts, and then transmitting the compressed code streams corresponding to the high-priority parts.

[0016] In a possible implementation, the compressed code streams corresponding to the different priority parts are transmitted in different time sequences, specifically including: the first information further includes a priority identifier of the compressed code stream, and the priority identifier indicates the transmission priority of the compressed code stream.

[0017] In a possible implementation, the compressed code streams corresponding to the different priority parts are transmitted in different time sequences, specifically including: the compressed code streams of the same to-be-compressed data have one or more mapping relationships.

[0018] In a possible implementation, the method further includes: when the compressed code streams of the same to-be-compressed data have multiple mapping relationships, the compressed code streams are processed in any one or more of the following manners: weighted combination, selection, or prediction of the mapping relationships.

[0019] In a possible implementation, the first information further includes the first mapping relationship.

[0020] In a possible implementation, the output of the first mapping relationship can be updated or activated via any one of RRC, MAC CE, or UCI, DCI.

[0021] In a possible implementation, the first mapping relationship is transmitted periodically or aperiodically.

[0022] In a possible implementation, when the first information further includes the first mapping relationship, specifically including: the compressed code streams corresponding to the high-priority parts are transmitted together with the first mapping relationship.

[0023] In a possible implementation, when the first information does not include the first mapping relationship, specifically including: the transmission period of the first mapping relationship is longer than the transmission period of the compressed code stream.

[0024] In a possible implementation, the first mapping relationship indicates a mapping relationship in which the different priority parts are arranged in sequence, or a mapping relationship in which the different priority parts are not arranged in sequence.

[0025] In a possible implementation, for the mapping relationship in which the different priority parts are arranged in sequence, the compression method includes: representing the mapping relationship in a quantity or index manner.

[0026] In a possible implementation, the mapping relationship includes one-to-one mapping or one-to-many mapping.

[0027] In a possible implementation, the method further includes compressing the same priority part together.

[0028] In a possible implementation, the data compression supports multiple different compression schemes, including one or more of the following: i. supporting a DFT-based codebook compression scheme; ii. supporting a prediction-based differential compression scheme; iii. supporting a data distribution-based compression scheme; iv. supporting an AI-based compression scheme.

[0029] In a possible implementation, the compressed code stream is transmitted through a PDSCH, a PDCCH, a PUSCH, or a PUCCH; and the first mapping relationship is transmitted through a PDSCH, a PDCCH, a PUSCH, a PUCCH, or a MAC CE or RRC.

[0030] The second aspect is a method corresponding to the first aspect, and the beneficial effects are described with reference to the first aspect. The present application provides a transmission method of compressed data, which is applied to a second device and includes: obtaining first information from a first device, the first information including a compressed code stream; wherein the compressed code stream is obtained by the first device from to-be-compressed data according to a first mapping relationship; wherein the to-be-compressed data includes multipath data and / or non-multipath data; the first mapping relationship indicates a first priority part and a second priority part of the to-be-compressed data; the first priority part corresponds to a first compression accuracy, and the second priority part corresponds to a second compression accuracy; and the first compression accuracy is higher than the second compression accuracy.

[0031] In a possible implementation, the first mapping relationship indicates a third priority part of the to-be-compressed data, and the third priority part corresponds to a third compression accuracy.

[0032] In a possible implementation, the number of priority parts is determined by at least one of the following: negotiation with the first device using upper layer signaling; or, protocol agreement; or, determination by the first device.

[0033] In a possible implementation, the compressed code streams corresponding to different priority parts are transmitted at different timings.

[0034] In a possible implementation, the compressed code streams corresponding to different priority parts are transmitted at different timings specifically includes that the first information further includes a priority identifier corresponding to the compressed code stream, and the priority identifier indicates a transmission priority of the compressed code stream.

[0035] In a possible implementation, the compressed code streams corresponding to different priority parts are transmitted at different timings specifically includes that the compressed code streams of the same to-be-compressed data have one or more mapping relationships.

[0036] In a possible implementation, the first information further includes the first mapping relationship.

[0037] In a possible implementation, the output of the first mapping relationship can be updated or activated via any one of RRC, MAC CE or UCI, DCI.

[0038] In a possible implementation, the first mapping relationship is acquired periodically or aperiodically.

[0039] In a possible implementation, when the first information further includes the first mapping relationship, the high-priority part corresponds to the compressed code stream and the first mapping relationship are transmitted together.

[0040] In a possible implementation, when the first information does not include the first mapping relationship, the transmission period of the first mapping relationship is longer than the transmission period of the compressed code stream.

[0041] In a possible implementation, the first mapping relationship indicates a mapping relationship in which different priority parts are arranged in sequence, or a mapping relationship in which different priority parts are not arranged in sequence.

[0042] In a possible implementation, for the mapping relationship in which different priority parts are arranged in sequence, the compression method includes: representing the mapping relationship in the form of a number or an index.

[0043] In a possible implementation, the mapping relationship includes one-to-one mapping or one-to-many mapping.

[0044] In a possible implementation, the data compression supports multiple different compression schemes, including one or more of the following: i. supporting a DFT-based codebook compression scheme; ii. supporting a prediction-based differential compression scheme; iii. supporting a data distribution-based compression scheme; iv. supporting an AI-based compression scheme.

[0045] In a possible implementation, the compressed code stream is transmitted through PDSCH, PDCCH, PUSCH or PUCCH; and the first mapping relationship is transmitted through PDSCH, PDCCH, PUSCH, PUCCH, or MAC CE, RRC.

[0046] In a third aspect, the present application provides a communication device, comprising: a processor configured to execute a computer program or instructions stored in a memory; and the memory configured to store the computer program or the instructions; when the computer program or the instructions are executed by the processor, the method in the first aspect or the second aspect is implemented.

[0047] In a fourth aspect, the present application provides a computer readable storage medium, having stored thereon a computer program or instructions, such that when executed by a computer, the method in the first aspect or the second aspect is implemented.

[0048] In a fifth aspect, the present application provides a computer program product, comprising a program for implementing the method in the first aspect or the second aspect.

[0049] In a sixth aspect, the present application provides a communication system, comprising a first device and a second device; the first device is configured to implement the method in the first aspect; and the second device is configured to implement the method in the second aspect.

[0050] On the basis of the implementation provided in the above aspects, the present application can be further combined to provide more implementations. BRIEF DESCRIPTION OF DRAWINGS

[0051] Fig. 1 shows a schematic diagram of a possible architecture of a communication system provided by the present application;

[0052] Figs. 2A-2C show schematic diagrams of possible implementation scenarios provided by the present application;

[0053] Fig. 3 shows a schematic diagram of a possible electromagnetic map provided by the present application;

[0054] Fig. 4 shows a flowchart of a data transmission method provided by the present application;

[0055] Figs. 5A-5B show flowcharts of possible processing of native data provided by the present application;

[0056] Fig. 6 shows a flowchart of possible inter-device data transmission provided by the present application;

[0057] Figs. 7A-7E show schematic diagrams of possible data transmission structures provided by the present application;

[0058] Figs. 8A-8B show schematic diagrams of possible compression of non-equally compressed multi-level mapping tables provided by the present application;

[0059] Figs. 9A-9B show schematic diagrams of possible fixed-length code stream compression of non-equally compressed multi-level mapping tables provided by the present application;

[0060] Fig. 10 shows another data compression flowchart provided by the present application.

[0061] Fig. 11 shows a possible sending / receiving end interaction flowchart provided by the present application;

[0062] FIG. 12 shows another possible sending / receiving end interaction flowchart provided by the present application;

[0063] FIG. 13 shows a possible communication device structure schematic diagram provided by the present application;

[0064] FIG. 14 shows another possible communication device structure schematic diagram provided by the present application. DETAILED DESCRIPTION

[0065] In order to make the purposes, technical solutions and advantages of the present application clearer, the present application will be further described in detail below with reference to the drawings. The specific operation methods, function descriptions, etc. in the method embodiments can also be applied to the device embodiments or system embodiments.

[0066] The embodiments of the present application can be applied to various communication systems, such as: long term evolution (LTE) system, LTE frequency division duplex (FDD) system, LTE time division duplex (TDD), universal mobile telecommunication system (UMTS), 5G system or new radio (NR), or applied to future communication systems or other similar communication systems (such as 6G, etc.), or ultra wide band (UWB) system, or wireless fidelity (WiFi) system.

[0067] Fig. 1 shows a possible, non-limiting, schematic illustration of a system. As shown in Fig. 1, the communication system 1000 includes a wireless access network 100 and a core network 200, and optionally, the communication system 1000 can also include an Internet 300. The wireless access network 100 can include at least one wireless access network device (e.g., 110a and 110b in Fig. 1) and at least one terminal (e.g., 120a-120j in Fig. 1). The terminal is connected to the wireless access network device in a wireless manner, and the wireless access network device is connected to the core network in a wireless or wired manner. The core network device and the wireless access network device can be independent and different physical devices, or the functions of the core network device and the logical functions of the wireless access network device can be integrated on the same physical device, or a physical device can integrate the functions of part of the core network device and part of the wireless access network device. The terminals can be connected to each other in a wired or wireless manner, and the wireless access network devices can be connected to each other in a wired or wireless manner. Fig. 1 is only a schematic diagram, and the communication system can also include other network devices, such as wireless relay devices and wireless backhaul devices, which are not shown in Fig. 1.

[0068] The wireless access network device can be a base station, an evolved NodeB (eNodeB), a transmission reception point (TRP), a next generation NodeB (gNB) in a 5G mobile communication system, a next generation base station in a 6th generation (6G) mobile communication system, a base station in a future mobile communication system, or an access node in a WiFi system, etc. The wireless access network device can also be an open RAN (O-RAN or ORAN), or a cloud radio access network (CRAN). The wireless access network device can also be a communication system integrating two or more of the above systems. The wireless access network device can be a macro base station (e.g., 110a in Fig. 1), a micro base station or an indoor station (e.g., 110b in Fig. 1), a relay node or a donor node, etc.

[0069] In addition, the wireless access network device can also be a module or unit that completes the function of the base station part, for example, can be a central unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU), etc. In different systems, the CU (or CU-CP and CU-UP), DU or RU can also have different names, but those skilled in the art can understand its meaning. For example, in the ORAN system, the CU can also be referred to as O-CU (open CU), the DU can also be referred to as O-DU, the CU-CP can also be referred to as O-CU-CP, the CU-UP can also be referred to as O-CU-UP, and the RU can also be referred to as O-RU. For the convenience of description, the CU, CU-CP, CU-UP, DU and RU are taken as examples for description in this application. Any one of the CU (or CU-CP, CU-UP), DU and RU in this application can be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0070] The embodiments of the present application do not limit the specific technology and specific device form adopted by the wireless access network device. For the convenience of description, the base station is taken as an example of the wireless access network device in the following description. It can be understood that the base station can be referred to as a communication device. For example, the base station can be understood as a device with the function of the base station. For example, the device for implementing the function of the base station can be the base station; or part of the elements in the base station, for example, CU, DU, etc. It can also be a device capable of supporting the base station to implement the function, for example, a chip system, a hardware circuit, a software module, or a hardware circuit plus a software module, which can be installed in the base station or can be used with the base station. In the embodiments of the present application, the chip system can be composed of a chip, or can include a chip and other discrete devices.

[0071] The terminal can also be referred to as a terminal device, user equipment (UE), mobile station, mobile terminal, etc. The terminal can be widely applied to various scenarios, such as device-to-device (D2D), vehicle to everything (V2X) communication, machine-type communication (MTC), internet of things (IOT), virtual reality, augmented reality, industrial control, automatic driving, remote medical treatment, smart power grid, smart furniture, smart office, smart wear, smart transportation, smart city, etc. The terminal can be a mobile phone, tablet computer, computer with wireless transceiver function, wearable device, vehicle, unmanned aerial vehicle, helicopter, airplane, ship, robot, mechanical arm, smart home device, etc.

[0072] Embodiments of the present application do not limit the specific technology and specific device form adopted by the terminal. It can be understood that the terminal can be referred to as a communication apparatus. For example, the terminal can be understood as an apparatus with terminal functions. For example, the apparatus for implementing the functions of the terminal can be a terminal; it can also be an apparatus capable of supporting the terminal to implement the functions, such as a chip system, a hardware circuit, a software module, or a hardware circuit plus a software module, which can be installed in the terminal or can be used in matching with the terminal.

[0073] The base station and the terminal can be fixed in position or movable. The base station and the terminal can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; can also be deployed on water surface; can also be deployed on airplanes, balloons and artificial satellites. Embodiments of the present application do not limit the application scenarios of the base station and the terminal.

[0074] The roles of the base station and the terminal can be relative, for example, the helicopter or unmanned aerial vehicle 120i in FIG. 1 can be configured as a mobile base station, and for those terminals 120j accessing the wireless access network 100 through 120i, the unmanned aerial vehicle 120i is a base station; but for the base station 110a, 120i is a terminal, that is, 110a and 120i communicate through a wireless air interface protocol. Of course, 110a and 120i can also communicate through a base station-to-base station interface protocol, at this time, relative to 110a, 120i is also a base station. Therefore, the base station and the terminal can be collectively referred to as a communication apparatus, 110a and 110b in FIG. 1 can be referred to as a communication apparatus with base station functions, and 120a-120j in FIG. 1 can be referred to as a communication apparatus with terminal functions.

[0075] The base station and the terminal, the base station and the base station, the terminal and the terminal can communicate through a licensed spectrum, or through an unlicensed spectrum, or through both the licensed spectrum and the unlicensed spectrum; can communicate through a spectrum below 6 gigahertz (GHz), or through a spectrum above 6 GHz, or through both the spectrum below 6 GHz and the spectrum above 6 GHz. Embodiments of the present application do not limit the spectrum resources used for wireless communication.

[0076] In the absence of special description in the present document, the first device and the second device are described as the execution subject.

[0077] The first device can be understood as a terminal, or a device with terminal function, or a device implementing terminal function. For example, the first device is a terminal, or the first device can be a module (for example, a chip or a circuit, etc.) in the terminal. Alternatively, the first device can be understood as a base station, or a device with base station function, or a device implementing base station function. For example, the first device is a base station, or the first device can be a module (for example, a chip or a circuit, etc.) in the base station, or a module or unit (for example, CU, DU or RU) implementing all or part of the base station function, a logic module or software, etc. Alternatively, the first device can be understood as a device or apparatus with sensing capability, or a device or apparatus capable of performing artificial intelligence tasks. The device with sensing capability can also be referred to as a sensing device, and the device capable of performing artificial intelligence tasks can also be referred to as an artificial intelligence task performing device.

[0078] The second device can be understood as a terminal, or a device with terminal function, or a device implementing terminal function. For example, the second device is a terminal, or the second device can be a module (for example, a chip or a circuit, etc.) in the terminal. Alternatively, the second device can be understood as a base station, or a device with base station function, or a device implementing base station function. For example, the second device is a base station, or the second device can be a module (for example, a chip or a circuit, etc.) in the base station, or a module or unit (for example, CU, DU or RU) implementing all or part of the base station function, a logic module or software, etc. Alternatively, the second device can be understood as a device or apparatus with sensing capability, or a device or apparatus capable of performing artificial intelligence tasks. The device with sensing capability can also be referred to as a sensing device, and the device capable of performing artificial intelligence tasks can also be referred to as an artificial intelligence task performing device.

[0079] Further, the first device can be a sending end or a receiving end, and correspondingly, the second device can be a receiving end or a sending end.

[0080] In addition, the "first device" can be replaced by "first apparatus", or "first communication device", and the "second device" can be replaced by "second apparatus", or "second communication device".

[0081] In some possible implementation scenarios, the "first device" can be a "terminal", and the "second device" can be a "base station". Alternatively, the "first device" can be a "base station", and the "second device" can be a "terminal". For example, in FIG. 2A, one or more terminals can communicate with a base station respectively. The interface between the terminal and the base station is a Uu interface.

[0082] In some possible implementation scenarios, the "first device" can be a "first terminal", and the "second device" can be a "second terminal". For example, in FIG. 2B, terminal 1 can communicate with terminal 3, and terminal 2 can communicate with terminal 3. The communication between terminal 3 and terminal 1 can be through a sidelink, and the communication between terminal 3 and terminal 2 can also be through a sidelink. In addition, if terminal 3 receives data of terminal 1 and data of terminal 2, terminal 3 can also send the received data of terminal 1 and data of terminal 2, as well as its own data (i.e., data of terminal 3) to a base station. At this time, terminal 3 can also be understood as a relay terminal. The interface between terminal 3 and the base station is a Uu interface.

[0083] In some possible implementation scenarios, the "first device" can be a "first base station", and the "second device" can be a "second base station". For example, in FIG. 2C, base station 1 and base station 2 can communicate. The interface between base station 1 and base station 2 can be an X2 interface.

[0084] In the present application, "sending" and "receiving" represent the direction of signal transmission. For example, "sending information to XX" can be understood as that the destination of the information is XX, and "sending information" can include direct sending or indirect sending through other units or modules. "Receiving information from YY" can be understood as that the source of the information is YY, and "receiving information" can include direct receiving from YY or indirect receiving from YY through other units or modules. In addition, "sending" can also be understood as the "output" of the chip interface, and "receiving" can also be understood as the "input" of the chip interface. In other words, "sending" or "receiving" can be carried out between devices, for example, between a base station and a terminal through an air interface, or can be carried out within a device, for example, between components, between modules, between chips, between software modules or between hardware modules in the device through a bus, a wire or an interface.

[0085] In this application, the Unequal Compression (UEC) multi-level mapping table or simply the mapping table, or simply the multi-level mapping table, or the UEC mapping table is just an expression form and does not affect the scope referred to. At the same time, the mapping table referred to in this application indicates the mapping relationship between the original data (or data to be compressed) and the compressed data (or compressed code stream), that is, the mapping table is actually embodied by the mapping relationship.

[0086] Wireless communication application scenarios are increasingly diverse, and many new scene-oriented data will be generated in future wireless communication systems. There are new needs for transmitting these new scene data. For example, massive data and signaling brought by new application scenarios such as ISAC, AI-enabled wireless technology, and terahertz communication. Therefore, there may be multiple data types in, for example, a future radio access network system, and different data types of data need to be transmitted under different scenarios or tasks.

[0087] A large amount of original data will be generated in future wireless communication processes. The original data can be understood as data derived from emerging new application scenarios in future wireless communication systems (such as 6G), especially Radio Access Network (RAN) data that needs to be transmitted over the air, or local data (local traffic) generated in the RAN. Among them, the original data can be referred to as data. The original data can include data of multiple data types (and possibly data subtypes), such as perception data, artificial intelligence data, or channel data, etc. Exemplarily, the original data or original data type can include at least one of the following but is not limited to the following examples:

[0088] The first is perception data, such as 2D or 3D imaging data (such as obtained environmental reflection points, environmental surface patches), environmental reconstruction data, point cloud data, electromagnetic maps, or positioning data, etc.

[0089] The second is artificial intelligence data or edge artificial intelligence data, such as AI model data, training data, gradient data, gradient update data, inference results, neural network extracted feature information, performance data, etc.

[0090] The third is channel data, such as channel matrices, channel information feedback by devices in a multi-antenna system, channel status information (CSI) data, etc.

[0091] In a communication system as shown in FIG. 1, an electromagnetic map is provided in an access network device. For example, the access network device establishes the electromagnetic map by measurement, environment modeling + ray tracing (RT), or artificial intelligence (AI), etc. The electromagnetic map is used to represent the electromagnetic signal distribution in the environment, which records the intensity and characteristics of various electromagnetic signals in a specific area. For example, the electromagnetic map can include, but is not limited to, the following information in part or in whole: multipath information, noise level, and spectrum occupation of one or more areas, etc. For example, the electromagnetic map can include information of regular areas and / or information of irregular areas, each area corresponding to one or more reference points, and each regular area can also be referred to as a grid area, and the corresponding reference point can also be referred to as a grid or a grid point, etc.

[0092] Unless otherwise specified in the embodiments of the present application, the information in different areas (e.g., reference points) of the electromagnetic map can include multipath data and / or non-multipath data.

[0093] 1. The information of multipath data in each area (e.g., reference point) can be in the following form:

[0094] The multipath information (such as main path information, secondary main path information, and average value information of each multipath, etc.) can include the amplitude, delay, and / or angle information of the multipath, etc.

[0095] 2. The information of non-multipath data in each area (e.g., reference point) can be in the following form:

[0096] The scalar strength identifier or scattering point information representing the electromagnetic characteristics in the electromagnetic map can include at least one of the following specific information: channel impulse response (CIR), channel quality indicator (CQI), power delay profile (PDP), angle delay profile (ADP), or information of virtual anchors of scattering points / virtual stations, etc.

[0097] Taking the multipath information as an example, the electromagnetic map on the access network device side corresponding to at least one reference point, each reference point corresponding to a geographical area, for representing the multipath information of the access network device to the terminal in the geographical area. As shown in FIG. 3, the electromagnetic map mainly includes:

[0098] 1. N electromagnetic map elements of reference points N is an integer greater than zero.

[0099] 2. An electromagnetic map element for each reference point including multipath information of M paths between the access network device and the reference point, M n is an integer greater than zero. n

[0100] 3. The multipath information of each path can include amplitude, delay, and angle. The amplitude can exist in the form of amplitude or power of a signal. If the access network device uses a dual-polarized antenna, the amplitude is a 2*2 matrix, and the angle includes angle of arrival (AoA) and angle of departure (AoD). Further, if the antenna array is a uniform linear array (ULA), the AoA and the AoD are scalars. Alternatively, if the antenna array is a uniform planar array (UPA), the AoA and the AoD can be represented by the elevation angle and the azimuth angle. In the following description, the amplitude is taken as an example of "power", and the angle includes the AoA and the AoD.

[0101] For the above data, there are dictionary compression, vector quantization and other data distribution-based compression frameworks in the prior art, and there are also research and design of AI models for data compression. These schemes utilize the correlation between the dimensions of the data, and achieve high-performance compression effect.

[0102] However, for end-to-end tasks, considering the influence of different data on communication tasks or scenarios (for example, different multipaths have different contributions to tasks, and different streams have different importance after channel matrix transformation). How to develop a simple compression configuration process for data in different scenarios is a problem to be solved.

[0103] To this end, an embodiment of the present application provides a transmission method and device for compressing data.

[0104] In a first aspect, the present application provides a transmission method for compressing data, which is used for a first device, as shown in FIG. 4, comprising:

[0105] Step S400: obtaining to-be-compressed data, the to-be-compressed data including multipath data and / or non-multipath data;

[0106] It can be understood that the to-be-compressed data can be any original data, for example, 6G original data; the obtained to-be-compressed data can be regular data or irregular data;

[0107] ​In a possible implementation, when the region only contains non-multipath data, or only contains multipath data with the same number of multipaths, the data in the region is regular data; for example, the data shown in FIG. 5A is regular data, which is distributed in a G region, and the six reference points (or grid points) (pos 1-pos 6) in the G region have the same number of multipaths.

[0108] As shown in FIG. 5A, an RFMAP G with the same number of multipaths for each reference point (or grid point) is taken as an example for illustration; in FIG. 5A, the first device generates a non-uniform compression UEC mapping table according to a power distribution, and the mapping table is used to indicate a first mapping relationship; and the number of multipaths of the six reference points (or grid points) is the same.

[0109] When generating the mapping table, the data to be compressed is divided into two priorities, i.e., a high priority and a low priority; and the high priority part is indicated by "1" and the low priority part is indicated by "0". In this embodiment, more bits are used to indicate the high priority part to ensure the reconstruction accuracy, i.e., a higher compression accuracy is used for the high priority part, and fewer bits are used for the low priority part to ensure the rate, i.e., a lower compression accuracy can be used for the low priority part. It can be understood that the above mapping rule is only illustrative and is not the only limitation of the present application; in the present application, a high compression accuracy can be used for the high priority part to achieve compression, and a lower compression accuracy can be used for the low priority part to achieve compression.

[0110] Subsequently, the first device compresses the multipath data according to the mapping table to obtain a compressed code stream. It should be noted that the obtained compressed code stream can be a result of processing such as quantization, VQ, matrix decomposition, etc.; and each attribute dimension of the RFMAP needs to be compressed with a corresponding configuration, for example, the power (power), delay (delay), angle of arrival (AOA), and angle of departure (AOD) are compressed from four dimensions in FIG. 5A, respectively, to obtain the corresponding compressed code streams.

[0111] It can be understood that each attribute dimension of the RFMAP can have the same compression configuration or different compression configurations; for example, each attribute dimension has a specific compression configuration, and illustratively, when the priority is 1, 10 bits are used for quantization of the power (power) and the delay (delay), and 5 bits are used for quantization of the angle of arrival (AOA) and the angle of departure (AOD).

[0112] In another possible implementation, when the region contains both non-multipath data and multipath data, or when the region contains multipath data with different multipath numbers, the data in the region is irregular data. For example, the data shown in FIG. 5B is irregular data, in which the data of the six reference points (or grid points) (pos 1-pos 6) in the G region has different multipath numbers.

[0113] FIG. 5B illustrates the RFMAP G with different multipath numbers of each reference point (or grid point) as an example. In FIG. 5B, the first device generates a non-uniform compression UEC mapping table according to the power distribution, and the mapping table is used to indicate the first mapping relationship. In the example, the multipath numbers of the six reference points (or grid points) are different, for example, the third reference point (or grid point) has the largest multipath number among the six reference points (or grid points), and the fifth reference point (or grid point) has the smallest multipath number among the six reference points (or grid points). It can be understood that the mapping table can be generated with the largest multipath number as the dimension.

[0114] When generating the mapping table, the data to be compressed is divided into two priorities, i.e., a high priority and a low priority. The high priority part is indicated by "2", the low priority part is indicated by "1", and the vacancy part, for example, the vacancy part of the fifth reference point (or grid point) compared with the third reference point (or grid point), is filled with "0", i.e., "0" represents zero padding, which corresponds to no information. In this embodiment, for the high priority part, more bits are used for indication to ensure the reconstruction accuracy, i.e., higher compression accuracy is used for the high priority part; and for the low priority part, fewer bits are used to ensure the rate, i.e., lower compression accuracy can be used for the low priority part. It can be understood that the above mapping rule is only illustrative and is not the only limitation of the present application. In the present application, high compression accuracy can be used for compression implementation for the high priority part, and lower compression accuracy can be used for compression implementation for the low priority part.

[0115] Subsequently, the first device compresses the multipath data according to the mapping table to obtain a compressed code stream. It should be noted that the obtained compressed code stream can be the result of processing such as quantization, VQ, matrix decomposition, etc. Meanwhile, each attribute dimension of the RFMAP needs to be compressed with corresponding configuration, for example, the power (power), delay, angle of arrival (AOA), and angle of departure (AOD) in FIG. 5B are compressed from four dimensions respectively to obtain the corresponding compressed code streams.

[0116] It can be understood that the RFMAP can have the same compression configuration for each attribute dimension, or different compression configurations; for example, each attribute dimension has a specific compression configuration, and exemplarily, when the priority is 1, 10 bits are quantized for power and delay, and 5 bits are quantized for AOA and AOD.

[0117] Step S410: compressing the to-be-compressed data according to the first mapping relationship to obtain a compressed code stream;

[0118] It can be understood that the data compression in the present application can support multiple different compression schemes, including but not limited to: a DFT-based codebook compression scheme; a prediction-based differential compression scheme; a data distribution-based compression scheme; an AI-based compression scheme, etc.

[0119] The first mapping relationship can be carried in any form, for example, the mapping relationship is carried in a mapping table, an array or a matrix.

[0120] Exemplarily, the mapping relationship can include one-to-one mapping, or one-to-many mapping.

[0121] In one possible implementation, the same priority part can be compressed together to improve compression efficiency.

[0122] Meanwhile, the mapping relationship can be obtained in multiple ways:

[0123] In one possible implementation, the first mapping relationship can be generated by the first device, for example, by the first device according to data characteristics; it can be understood that the data characteristics include at least one of: each path power of the reference point in the electromagnetic map area, each path delay of the reference point in the electromagnetic map area, each path AOA of the reference point in the electromagnetic map area, and each path AOD of the reference point in the electromagnetic map area.

[0124] In one possible implementation, the first mapping relationship can also be agreed upon by a protocol. For example, the mapping relationship is agreed upon in the related protocol, so that in actual communication, the sending end and the receiving end respectively perform compression and decompression according to the mapping relationship agreed upon in the protocol.

[0125] In another possible implementation, the first mapping relationship can be obtained from other devices; for example, from a second device or a third device, that is, the second device or the third device generates the first mapping relationship and transmits it to the first device; specifically, FIG. 6 shows a flowchart for obtaining the first mapping relationship from other devices, and this scenario can be that the base station issues a mapping table to instruct the UE to transmit data:

[0126] As shown in FIG. 6, in one possible scenario, for example, scenario A:

[0127] The first device is UE A, and the second device is BS; wherein the first device (UE A) receives a mapping table A from the second device (BS);

[0128] Optionally, before this step, the first device (UE A) can also receive a mapping table transmission configuration from the second device (BS) to ensure that the mapping table can be accurately obtained subsequently; it can be understood that the mapping table transmission configuration can include transmission time-frequency resource configuration, mapping table related configuration, etc.

[0129] Subsequently, the first device (UE A) obtains data according to the mapping table and compresses the obtained data; for example, the first device (UE A) obtains data according to the mapping table, specifically, the first device can collect corresponding data according to the indication of the mapping table; it can be understood that the first device (UE A) can also not obtain data based on the indication of the mapping table, i.e., in the manner mentioned above, for example, the first device (UE A) obtains data by itself in advance.

[0130] After that, the first device (UE A) sends a compressed code stream carrying a priority identifier to the second device (BS); as shown in FIG. 6, the priority A1 compressed code stream carrying the priority identifier A1 is sent, the priority A2 compressed code stream carrying the priority identifier A2 is sent, and the priority A3 compressed code stream carrying the priority identifier A3 is sent.

[0131] As shown in FIG. 6, in another possible scenario, for example, scenario B:

[0132] The first device is UE B, the second device is UE C, and the third device is BS; wherein the first device (UE B) receives a mapping table B from the third device (BS);

[0133] It can be understood that the "third device is a BS" here is only an exemplary reference, and is not the only definition in this application, that is, the "third device" can be understood as a terminal, or a device with terminal function, or a device implementing terminal function; for example, the third device is a terminal, or the third device can be a module (such as a chip or a circuit, etc.) in the terminal; or, the "third device" can be understood as a base station, or a device with base station function, or a device implementing base station function; for example, the third device is a base station, or the third device can be a module (such as a chip or a circuit, etc.) in the base station, or a module or unit (such as a CU, a DU or a RU) implementing all or part of the base station function, a logic module or software, etc.; or, the "third device" can be understood as a device or apparatus with sensing capability, or a device or apparatus capable of performing artificial intelligence tasks. Among them, the device with sensing capability can also be called a sensing device, and the device capable of performing artificial intelligence tasks can also be called an artificial intelligence task performing device.

[0134] Optionally, before this step, the first device (UE B) can also receive a mapping table transmission configuration from the third device (BS) to ensure that the mapping table can be accurately obtained subsequently; it can be understood that the mapping table transmission configuration can include transmission time-frequency resource configuration, mapping table related configuration, etc.; when Sidelink transmission is involved, the mapping table transmission configuration needs to be additionally configured, for example, the source terminal (Source UE, SRC UE) and the destination terminal (Destination UE, DST UE) for data transmission; for example, when the first device (UE B) and the second device (UE C) are involved in Sidelink transmission (such as V2X), the mapping table transmission configuration has corresponding information to indicate that the first device (UE B) is configured as the source terminal (Source UE, SRC UE) and the second device (UE C) is configured as the destination terminal (Destination UE, DST UE).

[0135] Subsequently, the first device (UE B) obtains data according to the mapping table and compresses the obtained data; for example, the first device (UE B) obtains data according to the mapping table, which can specifically be that the first device collects corresponding data according to the indication of the mapping table; it can be understood that the manner in which the first device (UE B) obtains data here can also not be based on the indication of the mapping table, that is, the manner mentioned in the foregoing, for example, the first device (UE B) obtains data by itself in advance.

[0136] After that, the first device (UE B) sends the compressed code stream carrying the priority identifier to the second device (UE C); for example, as shown in FIG. 6, the priority B1 compressed code stream carrying the priority identifier B1 is sent, and the priority B2 compressed code stream carrying the priority identifier B2 is sent.

[0137] In the above scenarios A and B, the base station sends the mapping table to the terminal side, so that the terminal does not need to obtain the mapping relationship again when reporting information subsequently, but can directly compress and report the corresponding information based on the obtained mapping relationship, thereby improving the transmission efficiency. For example, in scenario B, the BS sends the mapping table B to UE B and UE C respectively, so that in the subsequent sidelink communication of UE B and UE C, the transmission of compressed data can be directly performed without the transmission of the mapping table.

[0138] Step S420: outputting the first information to the second device, wherein the first information comprises the compressed code stream;

[0139] Exemplarily, the compressed code stream can be transmitted through channels such as PDSCH, PDCCH, PUSCH or PUCCH.

[0140] Exemplarily, the compressed code streams corresponding to different priority parts can be transmitted at different times; that is, under the support of the multi-level mapping table, the original data can be incrementally compressed and transmitted; for example, in the scenario where the base station broadcasts the RFMAP to the terminal, the coarse-grained RFMAP (e.g., high-priority part) can be broadcast first, and then the fine-grained RFMAP (e.g., low-priority part) can be broadcast.

[0141] In one possible implementation, the compressed code streams are transmitted one by one in a specified order, wherein the specified order can include: first transmitting the compressed code stream corresponding to the high-priority part, and then transmitting the compressed code stream corresponding to the low-priority part; or, first transmitting the compressed code stream corresponding to the low-priority part, and then transmitting the compressed code stream corresponding to the high-priority part. For example, as shown in FIGS. 7A-7B:

[0142] A. When the multi-level mapping table and the compressed code stream are transmitted together, they are transmitted one by one in a specified order, the mapping table is transmitted before the high-priority compressed code stream and together with the high-priority compressed code stream, and then the low-priority compressed code stream is transmitted.

[0143] B. When the multi-level mapping table and the compressed code stream are decoupled and transmitted, they are transmitted one by one in a specified order, the mapping table is transmitted before the high-priority compressed code stream, and then the compressed code streams of different priorities are transmitted one by one.

[0144] In another possible implementation, the compressed code stream can be transmitted together with a corresponding priority identifier, and the priority identifier is used to indicate the transmission priority of the compressed code stream; the specific implementation manner can be, for example, the first information further comprises a priority identifier corresponding to the compressed code stream, and the priority identifier indicates the transmission priority of the compressed code stream; as shown in FIGS. 7C-7D:

[0145] C. When the multi-level mapping table is transmitted together with the compressed code stream, the priority indication is additionally transmitted along with the incremental data, and the mapping table is transmitted before the high-priority compressed code stream or together with the high-priority compressed code stream.

[0146] D. When the multi-level mapping table is decoupled from the compressed code stream, the priority indication is additionally transmitted along with the incremental data, and the mapping table is transmitted before the high-priority compressed code stream, and the compressed code stream of each priority is transmitted subsequently, and the receiving end is indicated by the priority indication.

[0147] In another possible implementation, the compressed code stream of the same data to be compressed can have one or more mapping relationships. Further, when the compressed code stream of the same data to be compressed has multiple mapping relationships, the compressed code stream can be processed in any one or more of the following manners: weighted combination, selection, or prediction. Specifically, for example, as shown in FIG. 7E:

[0148] E. The incremental data of the same data source can have different mapping tables, and the receiving end can perform corresponding processing according to the reconstructed versions of the data in different priorities in the corresponding positions after receiving different priority versions of the same data, and the processing includes but is not limited to any one or more of the following: weighted combination, selection, or prediction.

[0149] Exemplarily, the first information can further include the first mapping relationship. It can be understood that when the first information further includes the first mapping relationship, the first device sends the first information to the second device, so that the second device can not only obtain the compressed code stream from the first information, but also obtain the first mapping relationship corresponding to the first compressed code stream, so that the second device can decompress the compressed code stream based on the first mapping relationship.

[0150] Exemplarily, the first mapping relationship can be transmitted through a channel such as PDSCH, PDCCH, PUSCH, or PUCCH, or high-layer signaling such as MAC CE or RRC.

[0151] Exemplarily, the output of the first mapping relationship can be updated or activated via any one of RRC, MAC CE, or UCI, DCI.

[0152] It can be understood that the first device can periodically or aperiodically transmit the first mapping relationship.

[0153] Exemplarily, the first device can output the first mapping relationship before outputting the compressed code stream; or the first device can output the first mapping relationship after outputting the compressed code stream; or the first device can output the first mapping relationship together with the compressed code stream, and the compressed code stream can be transmitted before the first mapping relationship or after the first mapping relationship, for example, the compressed code stream corresponding to the high-priority part can be transmitted together with the first mapping relationship.

[0154] Exemplarily, when the first information further comprises the first mapping relationship, the compressed code stream corresponding to the high-priority part can be transmitted together with the first mapping relationship.

[0155] Exemplarily, when the first information does not comprise the first mapping relationship, the transmission period of the first mapping relationship is longer than the transmission period of the compressed code stream.

[0156] In a possible implementation, the first mapping relationship needs to be sent after compression. As shown in FIGS. 8A and 8B, there are two different cases:

[0157] A. For the mapping table (mapping relationship) arranged in order according to different priorities, for example, the levels of the multi-path RFMAP in FIG. 8A are arranged according to the power size:

[0158] a) Transform into the indication of the number or index, that is, the mapping relationship can be expressed in the form of the number or index;

[0159] i. For example, the RFMAP of 40 reference points*8 maximum multi-path numbers in FIG. 8A, the multi-level mapping table is shown in the matrix on the right side of FIG. 8A, 2 represents high priority, 1 represents low priority, and 0 represents no multi-path data. Through the transformation into the indication of the number or index, the data amount of the multi-level mapping table can be reduced. As shown in the matrix in FIG. 8A, 2 in the first row and the first column indicates that the number of high-priority in the first row of the mapping table is 2, 3 in the second column indicates that the number of low-priority in the first row of the mapping table is 3, and 3 in the third column indicates that the number of no multi-path data in the first row of the mapping table is 3;

[0160] ii. In fact, the data amount of the multi-level mapping table can be further reduced. As shown in the matrix on the left side of FIG. 8A, only the numbers of high-priority and low-priority can be indicated, and the maximum multi-path number 8 is additionally sent, and the number of no multi-path data can be directly calculated;

[0161] iii. The advantage of this scheme is that the multi-level mapping table of fixed-length compression can be generated;

[0162] b) Directly use the entropy coding such as LZMA to compress to generate the compressed code stream of variable length.

[0163] B. For the mapping table (mapping relationship) not arranged in order according to different priorities, for example, the priorities in the channel matrix in FIG. 8B are not arranged in order:

[0164] a) Directly use the entropy coding such as LZMA to compress;

[0165] b) Quad number compression and the like.

[0166] Among them, the first mapping relationship indicates the first priority part and the second priority part of the data to be compressed.

[0167] The first priority part corresponds to a first compression precision, and the second priority part corresponds to a second compression precision; the first compression precision is greater than the second compression precision.

[0168] It can be understood that the first priority can be greater than or less than the second priority, and actual use can be flexibly adjusted according to the situation, and the priority standard is defined, for example, in the following two cases:

[0169] Case 1: that is, when the first priority is greater than the second priority, the first priority (high priority) part uses higher compression precision for compression, and the priority standard at this time can be data integrity or precision, so that the first priority (that is, high priority) part uses higher compression precision for compression to ensure data restoration, for example, more bits are used for compression indication; a common scenario is, for example, in an enhanced mobile broadband (eMBB) scenario, users are more sensitive to data integrity, so the integrity of the data content is regarded as the priority standard, and higher compression precision compression is used for the high priority part to ensure the restoration precision.

[0170] Case 2: that is, when the first priority is less than the second priority, the second priority (high priority) part uses lower compression precision for compression, and the priority standard at this time can be data transmission rate or latency, so that the second priority (high priority) part uses lower compression precision for compression to ensure transmission rate or latency, for example, fewer bits are used for compression indication; a common scenario is, for example, in an ultra-reliable low-latency communication (URLLC) scenario, users are more sensitive to data latency, so the data latency is regarded as the priority, and lower compression precision is used for the high priority data compression to reduce transmission delay.

[0171] It can be understood that the first mapping relationship can indicate multiple priority parts of the data to be compressed, not just the two mentioned above, and each priority part corresponds to a respective compression precision; for example, the first mapping relationship can indicate a third priority part, a fourth priority part, and even an Nth priority part of the data to be compressed, wherein the third priority part corresponds to a third compression precision, the fourth priority part corresponds to a fourth compression precision, and the Nth priority part corresponds to an Nth compression precision.

[0172] Further, the number of priority parts is determined by at least one of the following: the first device and the second device negotiate by upper layer signaling, such as MAC CE, RRC, etc. signaling synchronization confirmation; or, by protocol agreement; or, confirmed by the device, for example, the first device can generate according to the corresponding information, or obtain the number of priority parts sent by other devices.

[0173] Further, after determining the number of priority parts, the device generates the first mapping relationship, which can be generated in any one or more of the following ways:

[0174] 1. Based on a specific threshold, for example:

[0175] For each reference point in the RFMAP, the mapping table value is determined according to the size relationship between the multipath energy and the threshold value; the specific threshold value can be synchronized in advance by the transceiver at both ends using upper layer signaling (RRC, MAC CE), DCI, UCI, etc. mode, or can be agreed in advance, or can be generated by the device; for example, the multipath energy is [0.9, 0.7, 0.3, 0.1, 0.05, 0.001], the number of levels is 2, and the threshold value is 0.2. Then the mapping table is [1, 1, 1, 0, 0, 0].

[0176] 2. Based on the number of different priority parts; for example:

[0177] For each reference point in the RFMAP, take a certain number of K_1, K_2,.., K_n paths as different priorities; the number of each priority can use empirical values, or can be reasonably allocated according to the current channel state and rate combined with the compression scheme used; for irregular data, paths exceeding the sum of a certain number, such as K_1+K_2+..+K_n, can be assigned a default priority corresponding to a specific compression scheme.

[0178] 3. Based on the proportion of different priority parts; for example:

[0179] For each reference point in the RFMAP, the mapping table value is determined according to the size of the multipath energy according to different proportions.

[0180] 4. Based on a specific pattern; for example:

[0181] For each reference point in the RFMAP, select the secondary main path as high priority and other paths as low priority for compression; the transceiver can synchronize the specific pattern rule in advance, for example, the rule can include: main / secondary path priority, main scattering cluster priority; time delay minimum / maximum path priority, etc.

[0182] 5. Based on the reference point attribute; for example:

[0183] For different reference points in the RFMAP, some reference points are selected as high priority, and other reference points are selected as low priority for compression; different reference points in the RFMAP data represent different distributions in space, and according to different task requirements of the receiving end, the priority of the reference points on different spatial distributions is different, and the compression resource allocation is performed according to the difference, which can further improve the performance. For example: the BS generates the RFMAP, and preferentially selects the RFMAP reference points close to the BS as high priority for compression transmission, and the RFMAP reference points far from the BS can be transmitted with less resources.

[0184] It can be understood that the length of the compressed code stream can be guaranteed by the multi-level mapping table, which can be implemented as a fixed-length code stream or a variable-length code stream:

[0185] 1. Fixed-length code stream:

[0186] As shown in FIG. 9A, when performing priority division, the resources of the high priority path are preferentially guaranteed, and the remaining bit positions are used for the low priority path.

[0187] In FIG. 9A, each row (a certain dimension) is taken as an example to demonstrate that the total level and the same are guaranteed, assuming that priority 3 uses 10 bits for compression, priority 2 uses 6 bits for compression, and priority 1 uses 4 bits for compression, then 56 bits are used for compression in each row. The total level and the same can also be guaranteed as a fixed value in the whole (all dimensions), and the compression scheme of each level can use variable-length compression, such as entropy coding and other schemes.

[0188] As shown in FIG. 9B, a fixed number of data points are allocated to each priority, which requires that the compression scheme of each priority uses fixed-length compression.

[0189] 2. Variable-length code stream:

[0190] The compressed code stream can also be transmitted in variable length, in which case the length or the cutoff position of the code stream needs to be indicated to the receiving end.

[0191] Using the above method, when the multi-path data and / or non-multi-path data are compressed, a higher compression precision is used for the first priority part to ensure transmission accuracy, and a lower compression precision is used for the second priority part to ensure transmission efficiency; thereby realizing reasonable compression based on the characteristics of the data, that is, improving the transmission efficiency while considering the importance of the data.

[0192] The above describes the data transmission method in the application from the first device side (i.e. the sending end), and the corresponding method of the second device side (i.e. the receiving end) is described below. It can be understood that the corresponding method suitable for the sending end in the application is also suitable for the receiving end, or for those skilled in the art, only a simple adjustment of the corresponding method of the sending end can be realized in the receiving end, so the same part is not described again.

[0193] In a second aspect, the application provides a transmission method of compressed data, as shown in FIG. 10, which is applied to a second device and includes the following steps:

[0194] S1000: obtaining first information from a first device, wherein the first information includes a compressed code stream;

[0195] The compressed code stream is obtained by the first device from the to-be-compressed data according to a first mapping relationship; wherein the to-be-compressed data includes multipath data and / or non-multipath data.

[0196] The first mapping relationship indicates a first priority part and a second priority part of the to-be-compressed data.

[0197] The first priority part corresponds to a first compression accuracy, and the second priority part corresponds to a second compression accuracy.

[0198] The first compression accuracy is greater than the second compression accuracy.

[0199] S1100: decompressing the compressed code stream based on the first mapping relationship.

[0200] The above describes the data transmission method in the application from the first device side (i.e. the sending end), and the corresponding method of the second device side (i.e. the receiving end) is described below. It can be understood that the corresponding method suitable for the sending end in the application is also suitable for the receiving end, or for those skilled in the art, only a simple adjustment of the corresponding method of the sending end can be realized in the receiving end, so the same part is not described again.

[0201] In a third aspect, the application provides a possible interaction flowchart of the sending end and the receiving end, as shown in FIG. 11:

[0202] The sending end (TX) in the figure can be the first device or the second device, and correspondingly, the receiving end (RX) can be the second device or the first device.

[0203] It can be understood that before data transmission, if the sending end (TX) and the receiving end (RX) do not reach an agreement on the compression scheme or are not defined in the standard, the UEC parameter needs to be configured before data transmission; specifically, the sending end (TX) can interact with the receiving end (RX) to configure the non-equal compression UEC parameter.

[0204] It can be understood that in order to ensure the transmission of the necessary parameters for compression to ensure the normal compression and decompression, the UEC parameter must include the switch indication of the UEC and the mapping table transmission rule.

[0205] It can be understood that the switch indication is used to indicate whether to activate or turn on the non-uniform compression mode. Exemplarily, the indication can be sent by high layer signaling such as RRC, MAC CE, or DCI / UCI.

[0206] The mapping table transmission rule can be: whether the transmission is periodic, for example, periodic transmission or aperiodic transmission; or, the scheduling mode is semi-persistent scheduling (SPS) or dynamic scheduling (dynamic scheduling); or, how the mapping table is sent, for example, by high layer signaling such as RRC, MAC CE, or by a control channel (for example, PDCCH, PUCCH, specifically DCI / UCI), or a data channel (for example, PDSCH, PUSCH, etc.).

[0207] Optionally, the UEC parameter can further include a compression scheme (for example, one or more of a prediction-based differential compression method, a data distribution-based compression method, an AI-based compression method, a DFT-based codebook compression method, and a compression method such as quantization, VQ, matrix decomposition, matrix transformation, matrix approximation) and / or compression precision (for example, the number of quantization steps, the number of clustering centers of Kmeans, etc.), and / or mapping table generation rule (for example, based on data characteristics), and / or compression rule, and the like auxiliary information, to optimize the method.

[0208] Subsequently, the sending end (TX) generates a UEC mapping table according to the data characteristics and / or the above-mentioned configuration parameters, to indicate the mapping relationship between the original data and the compressed data stream;

[0209] It should be understood that the embodiment in this embodiment is only an exemplary description, and is not intended to be limiting. The actual sending end (TX) can also generate a UEC mapping table according to other parameter information; further, the sending end (TX) can also obtain the mapping table in other ways, for example, in the above-mentioned scheme, through the form of the second device or the third device.

[0210] Subsequently, the sending end (TX) generates a UEC mapping table according to the data characteristics and / or the above-mentioned configuration parameters, to indicate the mapping relationship between the original data and the compressed data stream;

[0211] It should be understood that the embodiment is only an exemplary illustration and is not intended to be limiting. As mentioned above, the transmitting end (TX) can not send the mapping table to the receiving end (RX), and the receiving end (RX) can obtain the mapping table from other sources, for example, the transmitting end and the receiving end can obtain the compressed mapping table based on the base station broadcast in advance. Similarly, the compressed mapping table can be sent directly without compression. The above embodiment of sending the mapping table after compression can improve the transmission efficiency, which is only an optimal embodiment.

[0212] In a fourth aspect, the present application provides an interactive flowchart for compressed code stream incremental transmission, as shown in FIG. 12.

[0213] The transmitting end (TX) can be the first device or the second device, and correspondingly, the receiving end (RX) can be the second device or the first device.

[0214] It should be understood that, as in the third aspect, if the transmitting end (TX) and the receiving end (RX) do not reach an agreement on the compression scheme in advance or are not defined in the standard, the UEC parameter needs to be configured before data transmission; specifically, the transmitting end (TX) and the receiving end (RX) configure the UEC parameter before data transmission.

[0215] Subsequently, the transmitting end (TX) obtains the native data, generates the UEC mapping table according to the data characteristics and / or the above-mentioned configuration parameter, and compresses the native data based on the mapping table to obtain the compressed code stream, and then sends the compressed code stream to the receiving end (RX); the above-mentioned process is the same as the scheme mentioned in the third aspect, which will not be described in detail here; this embodiment focuses on the description of the compressed code stream incremental transmission part.

[0216] For the incremental transmission part, the transmitting end (TX) and the receiving end (RX) need to interact to activate the incremental transmission mechanism; for example, the transmitting end (TX) can interact through high-layer signaling such as RRC or MAC CE, or DCI / UCI to determine to activate the incremental transmission.

[0217] Subsequently, the transmitting end (TX) obtains new native data, for example, new RFMAP, and compresses according to the priority (indicated by the first mapping relationship, for example, the first mapping relationship can indicate the priority part in the native data) to obtain the compressed code stream.

[0218] Afterwards, the sending end (RX) sends the corresponding compressed code stream based on the priority; as shown in FIG. 12, the sending end (TX) can send the compressed code stream of high priority first (together with the mapping table), then send the compressed code stream of secondary priority, and finally send the compressed code stream of low priority, without the need of priority indication in front of the compressed code stream, i.e. the priority is indicated by the sending order; correspondingly, the receiving end (RX) receives the compressed code stream and the mapping table, and reconstructs the data based on the received mapping table, and uses the reconstructed data.

[0219] It can be understood that the sending method of the incremental part compressed code stream in FIG. 12 is only one embodiment, and the specific implementation can be any one of FIGS. 7A-7E.

[0220] It can be understood that in the embodiment of FIG. 12, the sending end (TX) transmits the data as an incremental part after obtaining new native data, and in practice, other ways can also be used. For example, the sending end (TX) can also transmit the initially obtained native data according to the incremental transmission mechanism, for example, the sending end (TX) activates the incremental transmission mechanism in advance, and then transmits the first native data in the form of incremental transmission, and the specific transmission method can be any one or more of FIGS. 7A-7E.

[0221] In the above embodiments of the present application, the method provided by the embodiments of the present application is introduced from the perspective of the sending end device and the access end device. In order to realize the functions in the method provided by the embodiments of the present application, the terminal or access network device can include hardware structure and / or software module, and the above functions can be realized in the form of hardware structure, software module, or hardware structure plus software module. Whether a certain function in the above functions is executed in the form of hardware structure, software module, or hardware structure plus software module depends on the design constraints of the specific application of the technical solution.

[0222] Therefore, in a fifth aspect, the present application provides a possible structure diagram of a communication device, as shown in FIG. 13. These communication devices can realize one or more corresponding functions in the above method embodiments. For example, the functions realized by the first communication device or the second communication device, and thus the beneficial effects possessed by the above method embodiments can be realized. In the embodiments of the present application, the communication device can be a terminal or an access network device, or the communication device can be a module (such as a chip) applied to a terminal or an access network device.

[0223] As shown in FIG. 13, the communication apparatus 1300 includes a processing unit 1310 and a transceiver unit 1320. The communication apparatus 1300 is configured to implement the functions of the sending end in the above-mentioned method embodiment of FIG. 4. Optionally, the transceiver unit 1320 can also be referred to as an output unit, an interface unit, or a communication unit, etc. In a possible implementation, the transceiver unit 1320 includes at least one of a sending unit or a receiving unit. The sending unit and the receiving unit can be integrated together, or two independent units, etc.

[0224] When the communication apparatus 1300 is configured to implement the functions of the sending end (TX) of FIG. 4, specifically: the transceiver unit 1320 is configured to obtain to-be-compressed data, the to-be-compressed data including multipath data and / or non-multipath data; the processing unit 1310 is configured to compress the to-be-compressed data according to a first mapping relationship to obtain a compressed code stream; and the transceiver unit 1320 is further configured to output first information to a second device, wherein the first information includes the compressed code stream; and wherein the first mapping relationship indicates a first priority part and a second priority part of the to-be-compressed data.

[0225] The first priority part corresponds to a first compression accuracy, and the second priority part corresponds to a second compression accuracy; and the first compression accuracy is higher than the second compression accuracy.

[0226] In a possible implementation, before the compression according to the first mapping relationship, the processing unit 1310 generates the first mapping relationship; or the transceiver unit 1320 obtains the first mapping relationship.

[0227] In a possible implementation, before the transceiver unit 1320 obtains the first mapping relationship, the transceiver unit 1320 further includes: obtaining a first mapping relationship transmission configuration.

[0228] In a possible implementation, the first mapping relationship transmission configuration specifically includes: a transmission time-frequency resource configuration, a mapping table related configuration, and / or a SRC node and a DST node of data transmission.

[0229] In a possible implementation, the first device generating the first mapping relationship specifically includes: the processing unit 1310 generating the first mapping relationship according to data characteristics; wherein the data characteristics include at least one of: a path power of a reference point in an electromagnetic map area, a path delay of the reference point in the electromagnetic map area, a path angle of arrival of the reference point in the electromagnetic map area, and a path angle of departure of the reference point in the electromagnetic map area.

[0230] In a possible implementation, the first mapping relationship indicates a third priority part of the to-be-compressed data, wherein the third priority part corresponds to a third compression accuracy.

[0231] In a possible implementation, the number of priority parts is determined by at least one of the following: the processing unit 1310, negotiation with the second device using upper layer signaling, or protocol agreement, or determined by the first device.

[0232] In a possible implementation, the method further includes, after determining the number of priority parts, generating, by the processing unit 1310, the first information, specifically including any one or more of the following: generating based on a specific threshold, or generating based on different numbers of priority parts, or generating based on proportions of different priority parts, or generating based on a specific pattern, or generating based on a reference point attribute.

[0233] In a possible implementation, the compressed code streams corresponding to different priority parts are transmitted at different timings.

[0234] In a possible implementation, the compressed code streams corresponding to different priority parts are transmitted at different timings specifically includes: first transmitting the compressed code streams corresponding to high-priority parts, and subsequently transmitting the compressed code streams corresponding to low-priority parts, or first transmitting the compressed code streams corresponding to low-priority parts, and subsequently transmitting the compressed code streams corresponding to high-priority parts.

[0235] In a possible implementation, the compressed code streams corresponding to different priority parts are transmitted at different timings specifically includes: the first information further includes a priority identifier corresponding to the compressed code stream, and the priority identifier indicates the transmission priority of the compressed code stream.

[0236] In a possible implementation, the compressed code streams corresponding to different priority parts can be transmitted at different timings specifically includes: the compressed code streams of the same to-be-compressed data can have one or more mapping relationships.

[0237] In a possible implementation, the method further includes, when the compressed code streams of the same to-be-compressed data have multiple mapping relationships, processing, by the processing unit 1310, the compressed code streams according to any one or more of the following: weighted combination, selection, or prediction of the mapping relationships.

[0238] In a possible implementation, the first information further includes the first mapping relationship.

[0239] Exemplarily, the output of the first mapping relationship can be updated or activated via any one of RRC, MAC CE, or UCI, DCI.

[0240] In a possible implementation, the method further includes: periodically or aperiodically transmitting, by the transceiver 1320, the first mapping relationship.

[0241] In a possible implementation, when the first information further includes the first mapping relationship, the first mapping relationship is transmitted together with the compressed code stream corresponding to the high-priority part.

[0242] In a possible implementation, when the first information does not include the first mapping relationship, the transmission period of the first mapping relationship is longer than the transmission period of the compressed code stream.

[0243] In a possible implementation, the first mapping relationship indicates a mapping relationship in which different-priority parts are arranged in sequence, or a mapping relationship in which different-priority parts are not arranged in sequence.

[0244] In a possible implementation, for the mapping relationship in which different-priority parts are arranged in sequence, the compression method includes: representing the mapping relationship in the form of a number or an index.

[0245] In a possible implementation, the mapping relationship includes one-to-one mapping or one-to-many mapping.

[0246] In a possible implementation, the processing unit 1310 further compresses the same-priority parts together.

[0247] In a possible implementation, the data compression supports multiple different compression schemes, including one or more of the following: i. supporting a DFT-based codebook compression scheme; ii. supporting a prediction-based differential compression scheme; iii. supporting a data distribution-based compression scheme; iv. supporting an AI-based compression scheme.

[0248] In a possible implementation, the compressed code stream is transmitted through PDSCH, PDCCH, PUSCH, or PUCCH; and the first mapping relationship is transmitted through PDSCH, PDCCH, PUSCH, PUCCH, or MAC CE, or RRC.

[0249] When the communication apparatus 1300 is used to implement the functions of the receiving end (RX) in FIG. 10, specifically: the transceiver 1320 acquires first information from a first apparatus, the first information including a compressed code stream; wherein the compressed code stream is obtained by the first apparatus from compression of to-be-compressed data according to a first mapping relationship; wherein the to-be-compressed data includes multipath data and / or non-multipath data; the first mapping relationship indicates a first-priority part and a second-priority part of the to-be-compressed data; the first-priority part corresponds to a first compression precision, and the second-priority part corresponds to a second compression precision; the first compression precision is higher than the second compression precision; and the processing unit 1310 performs decompression processing on the compressed code stream based on the first mapping relationship.

[0250] In a possible implementation, the first mapping relationship indicates a third priority part of the to-be-compressed data, and the third priority part corresponds to a third compression accuracy.

[0251] In a possible implementation, the number of priority parts is determined by at least one of the following: negotiation between the processing unit 1310 and the first device by using upper-layer signaling; or, agreement by protocol; or, determination by the first device.

[0252] In a possible implementation, the compressed code streams corresponding to different priority parts can be transmitted at different timings.

[0253] In a possible implementation, the compressed code streams corresponding to different priority parts can be transmitted at different timings specifically includes that the first information further includes a priority identifier corresponding to the compressed code stream, and the priority identifier indicates a transmission priority of the compressed code stream.

[0254] In a possible implementation, the compressed code streams corresponding to different priority parts can be transmitted at different timings specifically includes that the compressed code streams of the same to-be-compressed data can have one or more mapping relationships.

[0255] In a possible implementation, the first information further includes the first mapping relationship.

[0256] Exemplarily, the output of the first mapping relationship can be updated or activated via any one of RRC, MAC CE, or UCI, DCI.

[0257] In a possible implementation, the apparatus further includes a transceiver 1320 configured to periodically or aperiodically acquire the first mapping relationship.

[0258] In a possible implementation, when the first information further includes the first mapping relationship, the compressed code stream corresponding to the high-priority part is transmitted together with the first mapping relationship.

[0259] In a possible implementation, when the first information does not include the first mapping relationship, the transmission period of the first mapping relationship is longer than the transmission period of the compressed code stream.

[0260] In a possible implementation, the first mapping relationship indicates a mapping relationship in which different priority parts are arranged in sequence, or a mapping relationship in which different priority parts are not arranged in sequence.

[0261] In a possible implementation, for the mapping relationship in which different priority parts are arranged in sequence, the compression method includes: representing the mapping relationship in a manner of quantity or index.

[0262] In a possible implementation, the mapping relationship includes one-to-one mapping, or one-to-many mapping.

[0263] In a possible implementation, the data compression supports multiple different compression schemes, including one or more of the following: i. supporting a DFT-based codebook compression scheme; ii. supporting a prediction-based differential compression scheme; iii. supporting a data distribution-based compression scheme; iv. supporting an AI-based compression scheme.

[0264] In a possible implementation, the compressed code stream is transmitted through a PDSCH, a PDCCH, a PUSCH, or a PUCCH; and the first mapping relationship is transmitted through the PDSCH, the PDCCH, the PUSCH, the PUCCH, or a MAC CE or RRC.

[0265] For more details of the processing unit 1310 and the transceiver unit 1320, refer to the description in FIG. 4 or FIG. 10 in the method embodiments above, which will not be repeated here.

[0266] It can be understood that the division of units in the embodiments of the present application is illustrative, and is only a logical function division. In actual implementation, another division manner can be used. In addition, each functional unit in the embodiments of the present application can be integrated in one physical device (for example, in a processor), or each functional unit can be a separate physical device, or two or more units can be integrated in one unit for implementation. The integrated unit can be implemented in the form of hardware, or in the form of a software functional module, etc.

[0267] As shown in FIG. 14, the communication apparatus 1400 includes processing circuitry 1410 and interface circuitry 1420. The processing circuitry 1410 and the interface circuitry 1420 are coupled to each other. It can be understood that the processing circuitry 1410 can be a processor, and the interface circuitry 1420 can be a transceiver or an input / output interface.

[0268] Optionally, the communication apparatus 1400 can further include a memory 1430, configured to store instructions executed by the processing circuitry 1410, or store input data required for the processing circuitry 1410 to execute instructions, or store data generated after the processing circuitry 1410 executes instructions.

[0269] Optionally, the memory (for example, 1430) in the embodiments of the present application can be integrated in the processing circuitry (for example, 1410), or the memory (for example, 1430) and the processing circuitry (for example, 1410) can be separately arranged.

[0270] When the communication apparatus 1400 is used to implement the method shown in FIG. 4 or FIG. 10, the processing circuitry 1410 is configured to implement the functions of the processing unit 1310, and the interface circuitry 1420 is configured to implement the functions of the transceiver unit 1320.

[0271] When the communication apparatus is a chip applied to a terminal, the chip implements the functions of the terminal in the method embodiments. The chip receives information sent by the access network device to the terminal through other modules (such as a radio frequency module or an antenna) in the terminal; or the chip sends information to other modules (such as a radio frequency module or an antenna) in the terminal, and the information is sent by the terminal to the access network device.

[0272] When the communication apparatus is a module applied to an access network device, the module implements the functions of the access network device in the method embodiments. The module receives information from other modules (such as a radio frequency module or an antenna) in the access network device, and the information is sent by the terminal to the access network device; or the module sends information to other modules (such as a radio frequency module or an antenna) in the access network device, and the information is sent by the access network device to the terminal.

[0273] It can be understood that the processor in the embodiments of the present application can be a central processing unit (CPU), and can also be other general-purpose processors, digital signal processors (DSP), application specific integrated circuits (ASIC), field programmable gate arrays (FPGA) or other programmable logic devices, transistor logic devices, hardware components or any combination thereof. The general-purpose processor can be a microprocessor or any conventional processor.

[0274] The memory in the embodiments of the present application can be a random access memory (RAM), a flash memory, a read-only memory (ROM), a programmable ROM (PROM), an erasable PROM (EPROM), an electrically EPROM (EEPROM), a register, a hard disk, a mobile hard disk, a CD-ROM or any other form of storage medium well known in the art.

[0275] The method steps in the embodiments of the present application can be implemented in hardware or in software instructions executable by a processor. The software instructions can be composed of corresponding software modules, which can be stored in a random access memory, a flash memory, a read-only memory, a programmable read-only memory, an erasable programmable read-only memory, an electrically erasable programmable read-only memory, a register, a hard disk, a mobile hard disk, a CD-ROM, or any other form of storage medium well known in the art. An exemplary storage medium is coupled to the processor, so that the processor can read information from and write information to the storage medium. The storage medium can also be an integral part of the processor. The processor and the storage medium can be located in an ASIC.

[0276] The embodiments of the present application also provide a communication device, which comprises a processor and a memory. The processor is configured to implement the functions of the sending end and the receiving end in FIG. 4 or FIG. 10. For example, the processor is configured to execute computer programs or instructions stored in the memory, and the memory is configured to store the computer programs or the instructions. When the computer programs or the instructions are executed, the method of the sending end and the receiving end in FIG. 4 or FIG. 10 is performed. Optionally, the processor and the memory are coupled.

[0277] The embodiments of the present application also provide a communication device, which comprises a processor. The processor is configured to implement the functions of the sending end and the receiving end in FIG. 4 or FIG. 10.

[0278] The embodiments of the present application also provide a computer readable storage medium, which stores instructions. The instructions can also be referred to as computer programs, computer program codes, etc. The instructions are executed on a computer, so that the computer performs the functions of the sending end and the receiving end in FIG. 4 or FIG. 10 in the above method embodiments.

[0279] The embodiments of the present application also provide a computer program product, which comprises computer programs or instructions. The computer program product comprises computer programs or instructions for performing the method of the sending end in FIG. 4 or FIG. 10, or the computer program product comprises computer programs or instructions for performing the method of the receiving end in FIG. 4 or FIG. 10.

[0280] The embodiments of the present application also provide a chip, which comprises a processor and a memory. The processor is coupled to the memory, and the processor is configured to execute computer programs or instructions stored in the memory, so that the functions of the sending end and the receiving end in FIG. 4 or FIG. 10 are implemented.

[0281] The embodiments of the present application also provide a communication system, which comprises a first communication device and a second communication device. The first communication device is configured to implement the functions of the sending end in FIG. 4 or FIG. 10, and the second communication device is configured to implement the functions of the receiving end in FIG. 4 or FIG. 10.

[0282] In the above embodiments, all or part of the embodiments can be implemented by software, hardware, firmware or any combination thereof. When implemented by software, all or part of the embodiments can be implemented in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer programs or instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments are performed. The computer can be a general purpose computer, a special purpose computer, a computer network, a network device, a user equipment or other programmable apparatus. The computer programs or instructions can be stored in a computer readable storage medium or transferred from one computer readable storage medium to another computer readable storage medium, for example, the computer programs or instructions can be transferred from one website site, computer, server or data center to another website site, computer, server or data center through wired or wireless manner. The computer readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server, data center and the like integrated with one or more available media. The available media can be a magnetic medium, such as a floppy disk, a hard disk, a magnetic tape; or an optical medium, such as a digital video disc; or a semiconductor medium, such as a solid state disk. The computer readable storage medium can be a volatile or non-volatile storage medium, or can include both volatile and non-volatile storage media.

[0283] In this application, "at least one" means one or more, and "multiple" means two or more. The association relationship between the associated objects is described by "and / or", which means that there can be three kinds of relationships, for example, A and / or B, which can represent the following cases: A exists alone, A and B exist together, B exists alone, where A and B can be singular or plural. In the textual description of this application, the character " / ", generally indicates that the associated objects before and after are in an "or" relationship. "Including at least one of A, B and C" can mean: including A; including B; including C; including A and B; including A and C; including B and C; including A, B and C.

[0284] It can be understood that the various numerical numbers involved in the embodiments of the present application are only for convenient differentiation, and do not limit the scope of the embodiments of the present application. The size of the serial number of the above processes does not mean the order of execution, and the execution order of the processes should be determined according to its function and inherent logic.

[0285] In various embodiments of the present application, the terms and / or descriptions of different embodiments are consistent and can be mutually referred to if there is no special description and logical conflict. The technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationship.

Claims

1. A method of transmitting compressed data, characterized by, The method is applied to a first device, and comprises: obtaining to-be-compressed data, the to-be-compressed data comprising multipath data and / or non-multipath data; compressing the to-be-compressed data according to a first mapping relationship to obtain a compressed code stream; outputting first information to a second device, the first information comprising the compressed code stream; wherein the first mapping relationship indicates a first priority part and a second priority part of the to-be-compressed data; the first priority part corresponds to a first compression accuracy, and the second priority part corresponds to a second compression accuracy; the first compression accuracy is higher than the second compression accuracy.

2. The method of claim 1, wherein, The method further comprises: generating the first mapping relationship; or obtaining the first mapping relationship.

3. The method of claim 2, wherein, The generation of the first mapping relationship specifically comprises: generating the first mapping relationship according to data characteristics; wherein the data characteristics comprise at least one of the following: path power of a reference point in an electromagnetic map region, path delay of the reference point in the electromagnetic map region, path angle of arrival of the reference point in the electromagnetic map region, and path angle of departure of the reference point in the electromagnetic map region.

4. The method according to any one of claims 1 to 3, characterized in that, The first mapping relationship indicates a third priority part of the to-be-compressed data, and the third priority part corresponds to a third compression accuracy.

5. The method according to any one of claims 1 to 4, wherein The number of priority parts is determined by at least one of the following: negotiation with the second device using upper-layer signaling; or, agreement by protocol; or, determination by the first device.

6. The method of claim 5, wherein, The method further comprises: after determining the number of priority parts, the generation of the first mapping relationship specifically comprises any one or more of the following: generation based on a specific threshold; or, generation based on the number of different priority parts; or, generation based on the proportion of different priority parts; or, generation based on a specific pattern; or, generation based on the attributes of the reference point.

7. The method according to any one of claims 1 to 6, wherein The compressed code streams corresponding to different priority parts are transmitted at different timings.

8. The method of claim 7, wherein, The transmission of the compressed code streams corresponding to different priority parts at different timings specifically comprises: first transmission of the compressed code stream corresponding to a high-priority part, and subsequent transmission of the compressed code stream corresponding to a lower-priority part; or, first transmission of the compressed code stream corresponding to a lower-priority part, and subsequent transmission of the compressed code stream corresponding to a high-priority part.

9. The method of claim 7, wherein, The transmission of the compressed code streams corresponding to different priority parts at different timings specifically comprises: The first information further comprises a priority identifier corresponding to the compressed code stream, and the priority identifier indicates the transmission priority of the compressed code stream.

10. The method of claim 7, wherein, The transmission of the compressed code streams corresponding to different priority parts at different timings specifically comprises: The compressed code stream of the same to-be-compressed data has one or more mapping relationships.

11. The method of claim 10, wherein, The method further comprises: When the compressed code stream of the same to-be-compressed data has multiple mapping relationships, the compressed code stream is processed in any one or more of the following ways: weighted combination of the mapping relationships, selection of one, or prediction.

12. The method of any one of claims 1-11, wherein The first information further comprises the first mapping relationship.

13. The method of claim 12, wherein, The method further comprises: periodically or aperiodically sending the first mapping relationship.

14. The method of any one of claims 12-13, wherein, When the first information further comprises the first mapping relationship, the method specifically comprises: The compressed code stream corresponding to the high-priority part is transmitted together with the first mapping relationship.

15. The method of any one of claims 1-11, wherein, When the first information does not include the first mapping relationship, the method specifically includes: The transmission period of the first mapping relationship is longer than the transmission period of the compressed code stream.

16. The method of any one of claims 1-15, wherein, The first mapping relationship indicates a mapping relationship in which different priority parts are arranged in sequence, or a mapping relationship in which different priority parts are not arranged in sequence.

17. The method of any one of claims 1-16, wherein, The data compression supports a plurality of different compression schemes, including one or more of the following: i. supporting a DFT-based codebook compression scheme; ii. supporting a prediction-based differential compression scheme; iii. supporting a data distribution-based compression scheme; iv. supporting an AI-based compression scheme.

18. A method of transmitting compressed data, characterized by The method is applied to a second device, and includes: obtaining first information from a first device, the first information including a compressed code stream; wherein the compressed code stream is obtained by the first device from to-be-compressed data according to a first mapping relationship; wherein the to-be-compressed data includes multipath data and / or non-multipath data; the first mapping relationship indicates a first priority part and a second priority part of the to-be-compressed data; the first priority part corresponds to a first compression accuracy, and the second priority part corresponds to a second compression accuracy; the first compression accuracy is higher than the second compression accuracy; based on the first mapping relationship, the compressed code stream is decompressed.

19. The method of claim 18, wherein, The first mapping relationship indicates a third priority part of the to-be-compressed data, and the third priority part corresponds to a third compression accuracy.

20. The method of any one of claims 18-19, wherein, The number of priority parts is determined by at least one of the following: negotiation with the first device using upper layer signaling, protocol agreement, or determination by the first device.

21. The method of any one of claims 18-20, wherein, The compressed code streams corresponding to different priority parts are transmitted at different timings.

22. The method of claim 21, wherein, The compressed code streams corresponding to different priority parts are transmitted at different timings, specifically including: The first information further includes a priority identifier corresponding to the compressed code stream, and the priority identifier indicates the transmission priority of the compressed code stream.

23. The method of claim 21, wherein, The compressed code streams corresponding to different priority parts are transmitted at different timings, specifically including: The compressed code streams of the same to-be-compressed data have one or more mapping relationships.

24. The method of any one of claims 18-23, wherein: The first information further includes the first mapping relationship.

25. The method of claim 24, wherein, The method further includes: periodically or aperiodically obtaining the first mapping relationship.

26. The method of any one of claims 24-25, wherein, When the first information further includes the first mapping relationship, the method specifically includes: The compressed code stream corresponding to the high-priority part is transmitted together with the first mapping relationship.

27. The method of any one of claims 18-23, wherein, The first information does not include the first mapping relationship, specifically including: The transmission period of the first mapping relationship is longer than the transmission period of the compressed code stream.

28. The method of any one of claims 18-27, wherein, The first mapping relationship indicates a mapping relationship in which different priority parts are arranged in sequence, or a mapping relationship in which different priority parts are not arranged in sequence.

29. The method of any one of claims 18-28, wherein, The data compression supports a plurality of different compression schemes, including one or more of the following: i. supporting a DFT-based codebook compression scheme; ii. supporting a prediction-based differential compression scheme; iii. supporting a data distribution-based compression scheme; iv. supporting an AI-based compression scheme.

30. A communications device, characterized by The method includes: a processor configured to execute computer programs or instructions stored in a memory; the memory configured to store the computer programs or the instructions; when the computer programs or the instructions are executed by the processor, to cause the method of any one of claims 1-17 to be implemented; or, to cause the method of any one of claims 18-29 to be implemented.

31. A computer readable storage medium, characterized in that, instructions stored on the computer readable storage medium, which, when executed on a computer, cause the method of any one of claims 1-17 to be implemented; or, the method of any one of claims 18-29 to be implemented.

32. A computer program product, characterised in that, the computer program product comprises computer programs or instructions for executing the method of any one of claims 1-17; or, comprises computer programs or instructions for executing the method of any one of claims 18-29.

Images